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

About the Execution of 2018-Gold for SafeBus-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
454.860 624046.00 634567.00 72.50 5 6 1 5 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 '/local/x2003239/mcc2019-input.r165-csrt-155286441900025.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 SafeBus-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-csrt-155286441900025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 5.3K Feb 12 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 12 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 8 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 8 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.8K Feb 5 01:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 5 01:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 4 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 4 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 1 13:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 1 13:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col

-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 448K 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 SafeBus-PT-06-UpperBounds-00
FORMULA_NAME SafeBus-PT-06-UpperBounds-01
FORMULA_NAME SafeBus-PT-06-UpperBounds-02
FORMULA_NAME SafeBus-PT-06-UpperBounds-03
FORMULA_NAME SafeBus-PT-06-UpperBounds-04
FORMULA_NAME SafeBus-PT-06-UpperBounds-05
FORMULA_NAME SafeBus-PT-06-UpperBounds-06
FORMULA_NAME SafeBus-PT-06-UpperBounds-07
FORMULA_NAME SafeBus-PT-06-UpperBounds-08
FORMULA_NAME SafeBus-PT-06-UpperBounds-09
FORMULA_NAME SafeBus-PT-06-UpperBounds-10
FORMULA_NAME SafeBus-PT-06-UpperBounds-11
FORMULA_NAME SafeBus-PT-06-UpperBounds-12
FORMULA_NAME SafeBus-PT-06-UpperBounds-13
FORMULA_NAME SafeBus-PT-06-UpperBounds-14
FORMULA_NAME SafeBus-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1553105280332

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-06 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ SafeBus-PT-06 @ 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: 595/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: Size of bit vector: 4608
lola: finding significant places
lola: 144 places, 451 transitions, 109 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 375 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-06-UpperBounds.task
lola: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6) : MAX(AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6) : MAX(ACK) : MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6) : MAX(R_tout) : MAX(cable_free) : MAX(FMCb) : MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6) : MAX(AMC_5_2) : MAX(wait_ack_5_3) : MAX(cable_used_3) : MAX(FMC_5) : MAX(FMC_3) : MAX(cable_used_1) : MAX(AMC_5_1) : MAX(wait_ack_3_2)
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(ACK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ACK)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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: 7 markings, 6 edges
lola: ========================================

FORMULA SafeBus-PT-06-UpperBounds-2 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(R_tout)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(R_tout)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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

FORMULA SafeBus-PT-06-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_free)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_free)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-5 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(FMCb)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FMCb)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-6 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_5_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_5_2)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-8 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(wait_ack_5_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_5_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_used_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_used_3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FMC_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FMC_5)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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: 6 markings, 5 edges
lola: ========================================

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

FORMULA SafeBus-PT-06-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(cable_used_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(cable_used_1)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_5_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_5_1)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(wait_ack_3_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(wait_ack_3_2)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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 SafeBus-PT-06-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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: 168583 markings, 293575 edges, 33717 markings/sec, 30 secs
lola: 332846 markings, 618921 edges, 32853 markings/sec, 35 secs
lola: 494412 markings, 960895 edges, 32313 markings/sec, 40 secs
lola: 659416 markings, 1330461 edges, 33001 markings/sec, 45 secs
lola: 820990 markings, 1702142 edges, 32315 markings/sec, 50 secs
lola: 978911 markings, 2076157 edges, 31584 markings/sec, 55 secs
lola: 1137024 markings, 2463874 edges, 31623 markings/sec, 60 secs
lola: 1293687 markings, 2859275 edges, 31333 markings/sec, 65 secs
lola: 1457686 markings, 3283170 edges, 32800 markings/sec, 70 secs
lola: 1615680 markings, 3694671 edges, 31599 markings/sec, 75 secs
lola: 1773420 markings, 4102732 edges, 31548 markings/sec, 80 secs
lola: 1930697 markings, 4514857 edges, 31455 markings/sec, 85 secs
lola: 2088918 markings, 4938030 edges, 31644 markings/sec, 90 secs
lola: 2251021 markings, 5392637 edges, 32421 markings/sec, 95 secs
lola: 2412604 markings, 5863517 edges, 32317 markings/sec, 100 secs
lola: 2575061 markings, 6356341 edges, 32491 markings/sec, 105 secs
lola: 2738821 markings, 6882678 edges, 32752 markings/sec, 110 secs
lola: 2902797 markings, 7436596 edges, 32795 markings/sec, 115 secs
lola: 3064311 markings, 8018263 edges, 32303 markings/sec, 120 secs
lola: 3226499 markings, 8626146 edges, 32438 markings/sec, 125 secs
lola: 3391635 markings, 9268420 edges, 33027 markings/sec, 130 secs
lola: 3562910 markings, 9962375 edges, 34255 markings/sec, 135 secs
lola: 3734437 markings, 10681328 edges, 34305 markings/sec, 140 secs
lola: 3906423 markings, 11435247 edges, 34397 markings/sec, 145 secs
lola: 4077238 markings, 12174138 edges, 34163 markings/sec, 150 secs
lola: 4249840 markings, 12977613 edges, 34520 markings/sec, 155 secs
lola: 4423777 markings, 13803317 edges, 34787 markings/sec, 160 secs
lola: 4588343 markings, 14619949 edges, 32913 markings/sec, 165 secs
lola: 4737270 markings, 15428952 edges, 29785 markings/sec, 170 secs
lola: 4877338 markings, 16267578 edges, 28014 markings/sec, 175 secs
lola: 5014964 markings, 17119477 edges, 27525 markings/sec, 180 secs
lola: 5143515 markings, 17998736 edges, 25710 markings/sec, 185 secs
lola: 5262654 markings, 18899423 edges, 23828 markings/sec, 190 secs
lola: 5374628 markings, 19839132 edges, 22395 markings/sec, 195 secs
lola: 5475171 markings, 20812176 edges, 20109 markings/sec, 200 secs
lola: 5568144 markings, 21802591 edges, 18595 markings/sec, 205 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 5632788 markings, 22692048 edges
lola: ========================================

FORMULA SafeBus-PT-06-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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: 6
lola: 168346 markings, 339881 edges, 33669 markings/sec, 0 secs
lola: 329918 markings, 717114 edges, 32314 markings/sec, 5 secs
lola: 492737 markings, 1122332 edges, 32564 markings/sec, 10 secs
lola: 655497 markings, 1548600 edges, 32552 markings/sec, 15 secs
lola: 816298 markings, 1980344 edges, 32160 markings/sec, 20 secs
lola: 971827 markings, 2406671 edges, 31106 markings/sec, 25 secs
lola: 1128329 markings, 2844844 edges, 31300 markings/sec, 30 secs
lola: 1285156 markings, 3298990 edges, 31365 markings/sec, 35 secs
lola: 1443827 markings, 3766721 edges, 31734 markings/sec, 40 secs
lola: 1598204 markings, 4232227 edges, 30875 markings/sec, 45 secs
lola: 1748709 markings, 4691934 edges, 30101 markings/sec, 50 secs
lola: 1896949 markings, 5143116 edges, 29648 markings/sec, 55 secs
lola: 2045097 markings, 5595996 edges, 29630 markings/sec, 60 secs
lola: 2192508 markings, 6043673 edges, 29482 markings/sec, 65 secs
lola: 2348374 markings, 6521153 edges, 31173 markings/sec, 70 secs
lola: 2503577 markings, 6997997 edges, 31041 markings/sec, 75 secs
lola: 2652482 markings, 7452064 edges, 29781 markings/sec, 80 secs
lola: 2803351 markings, 7920319 edges, 30174 markings/sec, 85 secs
lola: 2955788 markings, 8403819 edges, 30487 markings/sec, 90 secs
lola: 3108600 markings, 8901266 edges, 30562 markings/sec, 95 secs
lola: 3265455 markings, 9427830 edges, 31371 markings/sec, 100 secs
lola: 3422640 markings, 9973926 edges, 31437 markings/sec, 105 secs
lola: 3577850 markings, 10527435 edges, 31042 markings/sec, 110 secs
lola: 3740001 markings, 11124727 edges, 32430 markings/sec, 115 secs
lola: 3901044 markings, 11739306 edges, 32209 markings/sec, 120 secs
lola: 4062859 markings, 12386799 edges, 32363 markings/sec, 125 secs
lola: 4226753 markings, 13071745 edges, 32779 markings/sec, 130 secs
lola: 4381042 markings, 13732168 edges, 30858 markings/sec, 135 secs
lola: 4531185 markings, 14399182 edges, 30029 markings/sec, 140 secs
lola: 4686582 markings, 15060977 edges, 31079 markings/sec, 145 secs
lola: 4844037 markings, 15665220 edges, 31491 markings/sec, 150 secs
lola: 5011654 markings, 16321266 edges, 33523 markings/sec, 155 secs
lola: 5160341 markings, 17030018 edges, 29737 markings/sec, 160 secs
lola: 5305316 markings, 17761652 edges, 28995 markings/sec, 165 secs
lola: 5453516 markings, 18493584 edges, 29640 markings/sec, 170 secs
lola: 5580067 markings, 19315448 edges, 25310 markings/sec, 175 secs
lola: 5691369 markings, 20147450 edges, 22260 markings/sec, 180 secs
lola: 5761807 markings, 21178223 edges, 14088 markings/sec, 185 secs
lola: 5778285 markings, 22527822 edges, 3296 markings/sec, 190 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 5781108 markings, 24006942 edges

FORMULA SafeBus-PT-06-UpperBounds-3 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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: 6
lola: 163619 markings, 329316 edges, 32724 markings/sec, 0 secs
lola: 323943 markings, 702402 edges, 32065 markings/sec, 5 secs
lola: 479845 markings, 1090480 edges, 31180 markings/sec, 10 secs
lola: 634379 markings, 1492533 edges, 30907 markings/sec, 15 secs
lola: 787340 markings, 1901655 edges, 30592 markings/sec, 20 secs
lola: 937635 markings, 2313814 edges, 30059 markings/sec, 25 secs
lola: 1087726 markings, 2731213 edges, 30018 markings/sec, 30 secs
lola: 1238989 markings, 3164255 edges, 30253 markings/sec, 35 secs
lola: 1388388 markings, 3602454 edges, 29880 markings/sec, 40 secs
lola: 1538903 markings, 4053435 edges, 30103 markings/sec, 45 secs
lola: 1690570 markings, 4515248 edges, 30333 markings/sec, 50 secs
lola: 1837847 markings, 4963894 edges, 29455 markings/sec, 55 secs
lola: 1990677 markings, 5427960 edges, 30566 markings/sec, 60 secs
lola: 2140573 markings, 5886551 edges, 29979 markings/sec, 65 secs
lola: 2292282 markings, 6349403 edges, 30342 markings/sec, 70 secs
lola: 2441074 markings, 6805627 edges, 29758 markings/sec, 75 secs
lola: 2592081 markings, 7268691 edges, 30201 markings/sec, 80 secs
lola: 2743169 markings, 7731012 edges, 30218 markings/sec, 85 secs
lola: 2894971 markings, 8209490 edges, 30360 markings/sec, 90 secs
lola: 3049199 markings, 8706031 edges, 30846 markings/sec, 95 secs
lola: 3204408 markings, 9222803 edges, 31042 markings/sec, 100 secs
lola: 3362641 markings, 9763714 edges, 31647 markings/sec, 105 secs
lola: 3522470 markings, 10330085 edges, 31966 markings/sec, 110 secs
lola: 3680989 markings, 10902445 edges, 31704 markings/sec, 115 secs
lola: 3840709 markings, 11508360 edges, 31944 markings/sec, 120 secs
lola: 4001719 markings, 12140802 edges, 32202 markings/sec, 125 secs
lola: 4164800 markings, 12805027 edges, 32616 markings/sec, 130 secs
lola: 4317758 markings, 13460765 edges, 30592 markings/sec, 135 secs
lola: 4471626 markings, 14129552 edges, 30774 markings/sec, 140 secs
lola: 4621998 markings, 14788693 edges, 30074 markings/sec, 145 secs
lola: 4774398 markings, 15401964 edges, 30480 markings/sec, 150 secs
lola: 4943878 markings, 16042177 edges, 33896 markings/sec, 155 secs
lola: 5097789 markings, 16722283 edges, 30782 markings/sec, 160 secs
lola: 5245847 markings, 17459484 edges, 29612 markings/sec, 165 secs
lola: 5390256 markings, 18182455 edges, 28882 markings/sec, 170 secs
lola: 5527397 markings, 18946225 edges, 27428 markings/sec, 175 secs
lola: 5640804 markings, 19787462 edges, 22681 markings/sec, 180 secs
lola: 5740925 markings, 20663159 edges, 20024 markings/sec, 185 secs
lola: 5773263 markings, 21901102 edges, 6468 markings/sec, 190 secs
lola: 5780538 markings, 23309627 edges, 1455 markings/sec, 195 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 5781108 markings, 24006942 edges
lola: ========================================

FORMULA SafeBus-PT-06-UpperBounds-0 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6)
lola: processed formula length: 362
lola: 0 rewrites
lola: closed formula file SafeBus-PT-06-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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: ========================================

FORMULA SafeBus-PT-06-UpperBounds-1 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 5 6 1 5 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 5 6 1 5 1 1 1 1 1 1 1 1 1 1 1 1
lola: memory consumption: 19344 KB
lola: time consumption: 624 seconds

BK_STOP 1553105904378

--------------------
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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r165-csrt-155286441900025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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