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.r110-oct2-155272242400178.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 Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242400178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 18K Feb 12 04:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 12 04:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 8 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 8 03:19 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 12K Feb 5 00:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 5 00:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 4 07:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 4 07:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 1 02:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 1 02:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 248K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1553042673535

info: Time: 3600 - MCC
===========================================================================================
prep: translating Peterson-PT-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Peterson-PT-3 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ Peterson-PT-3 @ 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: 576/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7808
lola: finding significant places
lola: 244 places, 332 transitions, 229 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from Peterson-PT-3-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (Turn_2_0 + Turn_2_1 + Turn_2_2 + Turn_1_2 + Turn_1_1 + Turn_1_0 + Turn_0_2 + Turn_0_1 + Turn_0_0 + Turn_0_3 + Turn_1_3 + Turn_2_3 <= 0)
lola: after: (3 <= 0)
lola: always false
lola: MAX(0) : MAX(BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_1_3 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_2_2 + BeginLoop_2_2_3 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_0_3 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_1_3 + BeginLoop_3_0_0 + BeginLoop_3_0_1 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_2_2 + BeginLoop_0_2_3 + BeginLoop_3_1_0 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_1_3 + BeginLoop_3_2_0 + BeginLoop_3_2_1 + BeginLoop_3_2_2 + BeginLoop_3_2_3 + BeginLoop_1_0_0 + BeginLoop_1_0_1 + BeginLoop_1_0_2 + BeginLoop_1_0_3 + BeginLoop_1_1_0 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_1_3 + BeginLoop_1_2_0 + BeginLoop_1_2_1 + BeginLoop_1_2_2 + BeginLoop_1_2_3) : MAX(EndTurn_0_1 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_3_0 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_0_0 + EndTurn_0_2) : MAX(CS_0 + CS_1 + CS_2 + CS_3) : MAX(CS_0 + CS_1 + CS_2 + CS_3) : MAX(CS_0 + CS_1 + CS_2 + CS_3) : MAX(TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_0_3 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_1_1_3 + TestIdentity_1_2_0 + TestIdentity_1_2_1 + TestIdentity_1_2_2 + TestIdentity_1_2_3 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_0_3 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2 + TestIdentity_2_1_3 + TestIdentity_2_2_0 + TestIdentity_2_2_1 + TestIdentity_2_2_2 + TestIdentity_2_2_3 + TestIdentity_0_0_0 + TestIdentity_0_0_1 + TestIdentity_0_0_2 + TestIdentity_0_0_3 + TestIdentity_0_1_0 + TestIdentity_0_1_1 + TestIdentity_0_1_2 + TestIdentity_0_1_3 + TestIdentity_3_0_0 + TestIdentity_3_0_1 + TestIdentity_3_0_2 + TestIdentity_3_0_3 + TestIdentity_0_2_0 + TestIdentity_0_2_1 + TestIdentity_0_2_2 + TestIdentity_0_2_3 + TestIdentity_3_1_0 + TestIdentity_3_1_1 + TestIdentity_3_1_2 + TestIdentity_3_1_3 + TestIdentity_3_2_3 + TestIdentity_3_2_0 + TestIdentity_3_2_1 + TestIdentity_3_2_2) : MAX(Idle_0 + Idle_1 + Idle_2 + Idle_3) : MAX(TestIdentity_1_1_0) : MAX(Idle_0) : MAX(BeginLoop_1_1_1) : MAX(BeginLoop_0_0_3) : MAX(TestAlone_1_1_2) : MAX(BeginLoop_0_0_2) : MAX(IsEndLoop_1_1_3) : MAX(IsEndLoop_0_1_3)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================

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

FORMULA Peterson-PT-3-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Idle_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Idle_0)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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 Peterson-PT-3-UpperBounds-9 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(BeginLoop_1_1_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(BeginLoop_1_1_1)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 14 markings, 13 edges
lola: ========================================
FORMULA Peterson-PT-3-UpperBounds-10 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(BeginLoop_0_0_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(BeginLoop_0_0_3)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 16 markings, 15 edges
lola: ========================================

FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TestAlone_1_1_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TestAlone_1_1_2)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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 Peterson-PT-3-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(BeginLoop_0_0_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(BeginLoop_0_0_2)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 13 markings, 12 edges
lola: ========================================

FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(IsEndLoop_1_1_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(IsEndLoop_1_1_3)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 189636 markings, 544229 edges
lola: ========================================

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

FORMULA Peterson-PT-3-UpperBounds-15 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(CS_0 + CS_1 + CS_2 + CS_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CS_0 + CS_1 + CS_2 + CS_3)
lola: processed formula length: 30
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 548111 markings, 1863874 edges, 109622 markings/sec, 0 secs
lola: 1041537 markings, 3575056 edges, 98685 markings/sec, 5 secs
lola: 1525388 markings, 5245583 edges, 96770 markings/sec, 10 secs
lola: 2004146 markings, 6896361 edges, 95752 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2302877 markings, 7945548 edges
lola: ========================================

FORMULA Peterson-PT-3-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CS_0 + CS_1 + CS_2 + CS_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CS_0 + CS_1 + CS_2 + CS_3)
lola: processed formula length: 30
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 549946 markings, 1870465 edges, 109989 markings/sec, 0 secs
lola: 1045429 markings, 3586727 edges, 99097 markings/sec, 5 secs
lola: 1532608 markings, 5271489 edges, 97436 markings/sec, 10 secs
lola: 1995589 markings, 6869322 edges, 92596 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2302877 markings, 7945548 edges

FORMULA Peterson-PT-3-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CS_0 + CS_1 + CS_2 + CS_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CS_0 + CS_1 + CS_2 + CS_3)
lola: processed formula length: 30
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 536986 markings, 1825187 edges, 107397 markings/sec, 0 secs
lola: 1045788 markings, 3587960 edges, 101760 markings/sec, 5 secs
lola: 1541094 markings, 5299246 edges, 99061 markings/sec, 10 secs
lola: 2040246 markings, 7023567 edges, 99830 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2302877 markings, 7945548 edges

FORMULA Peterson-PT-3-UpperBounds-5 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Idle_0 + Idle_1 + Idle_2 + Idle_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Idle_0 + Idle_1 + Idle_2 + Idle_3)
lola: processed formula length: 38
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola:
FORMULA Peterson-PT-3-UpperBounds-7 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(EndTurn_0_1 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_3_0 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_0_0 + EndTurn_0_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(EndTurn_0_1 + EndTurn_1_0 + EndTurn_1_1 + EndTurn_1_2 + EndTurn_2_0 + EndTurn_2_1 + EndTurn_2_2 + EndTurn_3_0 + EndTurn_3_1 + EndTurn_3_2 + EndTurn_0_0 + EndTurn_0_2)
lola: processed formula length: 170
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: 539228 markings, 1861939 edges, 107846 markings/sec, 0 secs
lola: 1047806 markings, 3667227 edges, 101716 markings/sec, 5 secs
lola: 1550218 markings, 5439973 edges, 100482 markings/sec, 10 secs
lola: 2036205 markings, 7165858 edges, 97197 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 2362043 markings, 8317104 edges

FORMULA Peterson-PT-3-UpperBounds-2 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_0_3 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_1_1_3 + TestIdentity_1_2_0 + TestIdentity_1_2_1 + TestIdentity_1_2_2 + TestIdentity_1_2_3 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_0_3 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TestIdentity_1_0_0 + TestIdentity_1_0_1 + TestIdentity_1_0_2 + TestIdentity_1_0_3 + TestIdentity_1_1_0 + TestIdentity_1_1_1 + TestIdentity_1_1_2 + TestIdentity_1_1_3 + TestIdentity_1_2_0 + TestIdentity_1_2_1 + TestIdentity_1_2_2 + TestIdentity_1_2_3 + TestIdentity_2_0_0 + TestIdentity_2_0_1 + TestIdentity_2_0_2 + TestIdentity_2_0_3 + TestIdentity_2_1_0 + TestIdentity_2_1_1 + TestIdentity_2_1_2... (shortened)
lola: processed formula length: 1010
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 27 markings, 27 edges
lola: ========================================

FORMULA Peterson-PT-3-UpperBounds-6 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_1_3 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_2_2 + BeginLoop_2_2_3 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_0_3 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_1_3 + BeginLoop_3_0_0 + BeginLoop_3_0_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(BeginLoop_2_0_0 + BeginLoop_2_0_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_0 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_1_3 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_2_2 + BeginLoop_2_2_3 + BeginLoop_0_0_0 + BeginLoop_0_0_1 + BeginLoop_0_0_2 + BeginLoop_0_0_3 + BeginLoop_0_1_0 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_1_3 + BeginLoop_3_0_0 + BeginLoop_3_0_1 + ... (shortened)
lola: processed formula length: 866
lola: 0 rewrites
lola: closed formula file Peterson-PT-3-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: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 13 markings, 12 edges
lola: ========================================

FORMULA Peterson-PT-3-UpperBounds-1 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 3 4 3 1 1 1 4 4 1 1 1 1 1 1 1 1
lola:
preliminary result: 3 4 3 1 1 1 4 4 1 1 1 1 1 1 1 1
lola: memory consumption: 18604 KB
lola: time consumption: 97 seconds

BK_STOP 1553042770473

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r110-oct2-155272242400178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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