Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........................................
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 56K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 92K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 178K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 493K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 56K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 214K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 607K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 4.1M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeoElection-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469300310
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527027402135

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-5 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NeoElection-PT-5 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ NeoElection-PT-5 @ 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: 7764/65536 symbol table entries, 409 collisions
lola: preprocessing...
lola: Size of bit vector: 3090
lola: finding significant places
lola: 3090 places, 4674 transitions, 810 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1524 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-5-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (P-masterState_1_T_4 + P-masterState_1_T_3 + P-masterState_1_T_2 + P-masterState_1_T_1 + P-masterState_1_T_0 + P-masterState_3_F_4 + P-masterState_3_F_3 + P-masterState_3_F_2 + P-masterState_3_F_1 + P-masterState_3_F_0 + P-masterState_4_T_0 + P-masterState_4_T_1 + P-masterState_4_T_2 + P-masterState_4_T_3 + P-masterState_4_T_4 + P-masterState_4_T_5 + P-masterState_0_F_4 + P-masterState_0_F_3 + P-masterState_0_F_2 + P-masterState_0_F_1 + P-masterState_0_F_0 + P-masterState_1_F_0 + P-masterState_1_F_1 + P-masterState_1_F_2 + P-masterState_1_F_3 + P-masterState_1_F_4 + P-masterState_1_F_5 + P-masterState_3_T_5 + P-masterState_3_T_4 + P-masterState_3_T_3 + P-masterState_3_T_2 + P-masterState_3_T_1 + P-masterState_3_T_0 + P-masterState_5_F_4 + P-masterState_5_F_3 + P-masterState_5_F_2 + P-masterState_5_F_1 + P-masterState_5_F_0 + P-masterState_0_T_5 + P-masterState_0_T_4 + P-masterState_0_T_3 + P-masterState_0_T_2 + P-masterState_0_T_1 + P-masterState_0_T_0 + P-masterState_2_F_4 + P-masterState_2_F_3 + P-masterState_2_F_2 + P-masterState_2_F_1 + P-masterState_2_F_0 + P-masterState_5_T_5 + P-masterState_5_T_4 + P-masterState_5_T_3 + P-masterState_5_T_2 + P-masterState_5_T_1 + P-masterState_5_T_0 + P-masterState_4_F_0 + P-masterState_4_F_1 + P-masterState_4_F_2 + P-masterState_4_F_3 + P-masterState_4_F_4 + P-masterState_2_T_5 + P-masterState_2_T_4 + P-masterState_2_T_3 + P-masterState_2_T_2 + P-masterState_2_T_1 + P-masterState_2_T_0 + P-masterState_4_F_5 + P-masterState_2_F_5 + P-masterState_5_F_5 + P-masterState_0_F_5 + P-masterState_3_F_5 + P-masterState_1_T_5 <= 0)
lola: after: (5 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_3_2_DONE + P-negotiation_1_0_NONE + P-negotiation_5_1_DONE + P-negotiation_1_3_CO + P-negotiation_3_1_CO + P-negotiation_5_0_NONE + P-negotiation_4_3_CO + P-negotiation_0_5_DONE + P-negotiation_5_3_DONE + P-negotiation_3_4_DONE + P-negotiation_1_5_DONE + P-negotiation_5_5_CO + P-negotiation_2_4_DONE + P-negotiation_0_2_CO + P-negotiation_0_2_NONE + P-negotiation_4_3_DONE + P-negotiation_2_1_NONE + P-negotiation_2_0_NONE + P-negotiation_4_2_DONE + P-negotiation_0_1_NONE + P-negotiation_2_3_DONE + P-negotiation_4_5_CO + P-negotiation_0_0_CO + P-negotiation_4_0_NONE + P-negotiation_0_4_DONE + P-negotiation_2_1_CO + P-negotiation_1_2_CO + P-negotiation_2_4_CO + P-negotiation_5_0_DONE + P-negotiation_3_1_DONE + P-negotiation_1_2_DONE + P-negotiation_4_4_NONE + P-negotiation_4_0_CO + P-negotiation_2_5_NONE + P-negotiation_3_5_DONE + P-negotiation_1_3_NONE + P-negotiation_2_0_DONE + P-negotiation_1_5_CO + P-negotiation_5_4_DONE + P-negotiation_5_2_NONE + P-negotiation_0_1_DONE + P-negotiation_3_3_NONE + P-negotiation_3_2_NONE + P-negotiation_5_5_DONE + P-negotiation_1_4_NONE + P-negotiation_0_0_DONE + P-negotiation_5_1_NONE + P-negotiation_0_5_CO + P-negotiation_3_4_CO + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_4_4_DONE + P-negotiation_0_3_NONE + P-negotiation_2_5_DONE + P-negotiation_5_3_CO + P-negotiation_4_1_CO + P-negotiation_5_2_DONE + P-negotiation_3_3_DONE + P-negotiation_1_4_DONE + P-negotiation_0_4_CO + P-negotiation_3_0_CO + P-negotiation_4_1_DONE + P-negotiation_2_2_DONE + P-negotiation_1_1_DONE + P-negotiation_0_3_DONE + P-negotiation_2_3_CO + P-negotiation_3_5_NONE + P-negotiation_4_2_CO + P-negotiation_1_1_CO + P-negotiation_3_0_DONE + P-negotiation_5_4_CO + P-negotiation_5_4_NONE + P-negotiation_3_5_CO + P-negotiation_0_0_NONE + P-negotiation_4_3_NONE + P-negotiation_2_4_NONE + P-negotiation_0_5_NONE + P-negotiation_1_1_NONE + P-negotiation_3_0_NONE + P-negotiation_4_1_NONE + P-negotiation_2_2_CO + P-negotiation_0_3_CO + P-negotiation_5_2_CO + P-negotiation_3_3_CO + P-negotiation_5_5_NONE + P-negotiation_1_4_CO + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_5_1_CO + P-negotiation_0_4_NONE + P-negotiation_4_5_DONE + P-negotiation_2_3_NONE + P-negotiation_2_0_CO + P-negotiation_4_2_NONE + P-negotiation_1_0_DONE + P-negotiation_3_2_CO + P-negotiation_4_4_CO + P-negotiation_0_1_CO + P-negotiation_1_5_NONE + P-negotiation_3_4_NONE + P-negotiation_0_2_DONE + P-negotiation_5_3_NONE + P-negotiation_2_5_CO + P-negotiation_2_1_DONE + P-negotiation_4_0_DONE + P-negotiation_5_0_CO + P-negotiation_4_5_NONE + P-negotiation_1_3_DONE <= 0)
lola: after: (25 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-negotiation_3_2_DONE + P-negotiation_1_0_NONE + P-negotiation_5_1_DONE + P-negotiation_1_3_CO + P-negotiation_3_1_CO + P-negotiation_5_0_NONE + P-negotiation_4_3_CO + P-negotiation_0_5_DONE + P-negotiation_5_3_DONE + P-negotiation_3_4_DONE + P-negotiation_1_5_DONE + P-negotiation_5_5_CO + P-negotiation_2_4_DONE + P-negotiation_0_2_CO + P-negotiation_0_2_NONE + P-negotiation_4_3_DONE + P-negotiation_2_1_NONE + P-negotiation_2_0_NONE + P-negotiation_4_2_DONE + P-negotiation_0_1_NONE + P-negotiation_2_3_DONE + P-negotiation_4_5_CO + P-negotiation_0_0_CO + P-negotiation_4_0_NONE + P-negotiation_0_4_DONE + P-negotiation_2_1_CO + P-negotiation_1_2_CO + P-negotiation_2_4_CO + P-negotiation_5_0_DONE + P-negotiation_3_1_DONE + P-negotiation_1_2_DONE + P-negotiation_4_4_NONE + P-negotiation_4_0_CO + P-negotiation_2_5_NONE + P-negotiation_3_5_DONE + P-negotiation_1_3_NONE + P-negotiation_2_0_DONE + P-negotiation_1_5_CO + P-negotiation_5_4_DONE + P-negotiation_5_2_NONE + P-negotiation_0_1_DONE + P-negotiation_3_3_NONE + P-negotiation_3_2_NONE + P-negotiation_5_5_DONE + P-negotiation_1_4_NONE + P-negotiation_0_0_DONE + P-negotiation_5_1_NONE + P-negotiation_0_5_CO + P-negotiation_3_4_CO + P-negotiation_1_0_CO + P-negotiation_2_2_NONE + P-negotiation_4_4_DONE + P-negotiation_0_3_NONE + P-negotiation_2_5_DONE + P-negotiation_5_3_CO + P-negotiation_4_1_CO + P-negotiation_5_2_DONE + P-negotiation_3_3_DONE + P-negotiation_1_4_DONE + P-negotiation_0_4_CO + P-negotiation_3_0_CO + P-negotiation_4_1_DONE + P-negotiation_2_2_DONE + P-negotiation_1_1_DONE + P-negotiation_0_3_DONE + P-negotiation_2_3_CO + P-negotiation_3_5_NONE + P-negotiation_4_2_CO + P-negotiation_1_1_CO + P-negotiation_3_0_DONE + P-negotiation_5_4_CO + P-negotiation_5_4_NONE + P-negotiation_3_5_CO + P-negotiation_0_0_NONE + P-negotiation_4_3_NONE + P-negotiation_2_4_NONE + P-negotiation_0_5_NONE + P-negotiation_1_1_NONE + P-negotiation_3_0_NONE + P-negotiation_4_1_NONE + P-negotiation_2_2_CO + P-negotiation_0_3_CO + P-negotiation_5_2_CO + P-negotiation_3_3_CO + P-negotiation_5_5_NONE + P-negotiation_1_4_CO + P-negotiation_1_2_NONE + P-negotiation_3_1_NONE + P-negotiation_5_1_CO + P-negotiation_0_4_NONE + P-negotiation_4_5_DONE + P-negotiation_2_3_NONE + P-negotiation_2_0_CO + P-negotiation_4_2_NONE + P-negotiation_1_0_DONE + P-negotiation_3_2_CO + P-negotiation_4_4_CO + P-negotiation_0_1_CO + P-negotiation_1_5_NONE + P-negotiation_3_4_NONE + P-negotiation_0_2_DONE + P-negotiation_5_3_NONE + P-negotiation_2_5_CO + P-negotiation_2_1_DONE + P-negotiation_4_0_DONE + P-negotiation_5_0_CO + P-negotiation_4_5_NONE + P-negotiation_1_3_DONE <= 0)
lola: after: (25 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 <= 0)
lola: LP says that atomic proposition is always true: (P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_5_5_AnnP_3 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_1_0_AskP_2 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always true: (P-network_0_4_AnsP_1 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_2_4_AnnP_1 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_4_2_AnnP_4 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_3_0_RI_4 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_0_5_AI_2 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: MAX(0) : MAX(0) : MAX(0) : MAX(P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5) : MAX(P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5) : MAX(P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5) : MAX(P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0) : MAX(P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0) : MAX(0) : MAX(0) : MAX(P-network_0_4_AnsP_1) : MAX(0) : MAX(0) : MAX(0) : MAX(P-negotiation_1_3_NONE) : MAX(0)
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 NeoElection-PT-5-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-0 5 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(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 NeoElection-PT-5-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-1 25 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(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 NeoElection-PT-5-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: 25
lola: SUBRESULT
lola: result: 25
lola: produced by: state space
lola: The maximum value of the given expression is 25
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-2 25 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(P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: processed formula length: 128
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-6 0 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(P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-electedPrimary_5 + P-electedPrimary_4 + P-electedPrimary_3 + P-electedPrimary_2 + P-electedPrimary_1 + P-electedPrimary_0)
lola: processed formula length: 128
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-7 0 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(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 NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-8 0 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(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 NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-9 0 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(P-network_0_4_AnsP_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-network_0_4_AnsP_1)
lola: processed formula length: 25
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-10 0 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(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 NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-11 0 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(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 NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-12 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 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 NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges

FORMULA NeoElection-PT-5-UpperBounds-13 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
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 NeoElection-PT-5-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: 0
lola: SUBRESULT
lola: result: 0
lola: produced by: state space
lola: The maximum value of the given expression is 0
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-15 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-negotiation_1_3_NONE)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-negotiation_1_3_NONE)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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 NeoElection-PT-5-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-poll__handlingMessage_1 + P-poll__handlingMessage_0 + P-poll__handlingMessage_2 + P-poll__handlingMessage_3 + P-poll__handlingMessage_4 + P-poll__handlingMessage_5)
lola: processed formula length: 170
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 189 markings, 188 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-4 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5)
lola: processed formula length: 86
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 14365 markings, 55283 edges
lola: ========================================

FORMULA NeoElection-PT-5-UpperBounds-5 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-polling_0 + P-polling_1 + P-polling_2 + P-polling_3 + P-polling_4 + P-polling_5)
lola: processed formula length: 86
lola: 0 rewrites
lola: closed formula file NeoElection-PT-5-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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 14365 markings, 55283 edges

FORMULA NeoElection-PT-5-UpperBounds-3 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 5 25 25 5 5 5 0 0 0 0 0 0 0 0 1 0
lola:
preliminary result: 5 25 25 5 5 5 0 0 0 0 0 0 0 0 1 0
lola: ========================================
lola: memory consumption: 25120 KB
lola: time consumption: 12 seconds

BK_STOP 1527027414756

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

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="NeoElection-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-PT-5.tgz
mv NeoElection-PT-5 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is NeoElection-PT-5, 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 r112-csrt-152666469300310"
echo "====================================================================="
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 ;