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 820K
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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 14K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K 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 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K 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 320K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeoElection-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469300289
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527026694065

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeoElection-PT-2 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-2 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ NeoElection-PT-2 @ 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: 795/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 438
lola: finding significant places
lola: 438 places, 357 transitions, 153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-PT-2-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (P-masterList_1_1_0 + P-masterList_1_1_1 + P-masterList_1_1_2 + P-masterList_1_2_0 + P-masterList_1_2_1 + P-masterList_1_2_2 + P-masterList_0_2_2 + P-masterList_0_2_1 + P-masterList_0_2_0 + P-masterList_0_1_2 + P-masterList_0_1_1 + P-masterList_0_1_0 + P-masterList_2_1_0 + P-masterList_2_1_1 + P-masterList_2_1_2 + P-masterList_2_2_0 + P-masterList_2_2_1 + P-masterList_2_2_2 <= 0)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-stage_2_SEC + P-stage_1_SEC + P-stage_0_SEC + P-stage_1_NEG + P-stage_2_PRIM + P-stage_0_PRIM + P-stage_2_NEG + P-stage_0_NEG + P-stage_1_PRIM <= 0)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-electionFailed_0 + P-electionFailed_1 + P-electionFailed_2 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 + P-network_0_0_RP_1 + P-network_0_0_RP_2 + P-network_2_1_AnnP_2 + P-network_2_1_AnnP_1 + P-network_1_2_RI_1 + P-network_1_2_RI_2 + P-network_2_0_RI_2 + P-network_2_0_RI_1 + P-network_0_1_RI_2 + P-network_0_1_RI_1 + P-network_1_1_RP_1 + P-network_1_1_RP_2 + P-network_2_2_AskP_1 + P-network_2_2_AskP_2 + P-network_1_0_AskP_2 + P-network_0_1_AI_1 + P-network_0_1_AI_2 + P-network_1_0_AskP_1 + P-network_2_0_AI_1 + P-network_2_0_AI_2 + P-network_1_2_AnnP_2 + P-network_1_2_AnnP_1 + P-network_0_2_AnnP_1 + P-network_0_2_AnnP_2 + P-network_2_2_RP_1 + P-network_2_2_RP_2 + P-network_1_2_AI_1 + P-network_1_2_AI_2 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_1_1_AnnP_1 + P-network_1_1_AnnP_2 + P-network_0_1_AskP_2 + P-network_0_1_AskP_1 + P-network_2_2_AI_2 + P-network_2_2_AI_1 + P-network_1_0_RI_1 + P-network_1_0_RI_2 + P-network_2_0_AnnP_1 + P-network_2_0_AnnP_2 + P-network_1_2_AskP_1 + P-network_1_2_AskP_2 + P-network_0_2_RI_1 + P-network_0_2_RI_2 + P-network_2_1_RI_1 + P-network_2_1_RI_2 + P-network_1_1_AI_2 + P-network_0_1_RP_1 + P-network_0_1_RP_2 + P-network_1_1_AI_1 + P-network_2_1_AskP_1 + P-network_2_1_AskP_2 + P-network_2_0_RP_1 + P-network_2_0_RP_2 + P-network_2_1_RP_2 + P-network_2_1_RP_1 + P-network_1_0_AI_1 + P-network_1_0_AI_2 + P-network_0_1_AnnP_1 + P-network_0_1_AnnP_2 + P-network_0_2_RP_2 + P-network_1_2_RP_1 + P-network_1_2_RP_2 + P-network_0_2_RP_1 + P-network_0_0_AnnP_2 + P-network_0_0_AnnP_1 + P-network_0_2_AI_1 + P-network_0_2_AI_2 + P-network_2_1_AI_1 + P-network_2_1_AI_2 + P-network_2_2_RI_2 + P-network_1_0_AnnP_1 + P-network_1_0_AnnP_2 + P-network_2_2_RI_1 + P-network_0_0_AI_2 + P-network_0_0_AI_1 + P-network_0_2_AskP_1 + P-network_0_2_AskP_2 + P-network_1_0_RP_2 + P-network_1_0_RP_1 + P-network_0_0_RI_1 + P-network_0_0_RI_2 + P-network_2_0_AskP_2 + P-network_2_0_AskP_1 + P-network_2_2_AnnP_2 + P-network_1_1_AskP_1 + P-network_1_1_AskP_2 + P-network_2_2_AnnP_1 + P-network_1_1_RI_1 + P-network_1_1_RI_2 <= 0)
lola: after: (P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0 <= 0)
lola: LP says that atomic proposition is always true: (P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_0_AnnP_2 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always true: (P-polling_0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-network_2_1_AskP_1 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_2_RI_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_2_1_AnnP_1 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always true: (P-sendAnnPs__broadcasting_2_2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_1_2_RI_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-poll__networl_1_1_RI_0 <= 0)
lola: after: (0 <= 0)
lola: always true
lola: MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_AnsP_1 + P-network_2_2_AnsP_2 + P-network_2_1_AI_0 + P-network_0_0_AnnP_0 + P-network_0_2_AI_0 + P-network_0_2_RP_0 + P-network_1_2_RP_0 + P-network_0_1_AnnP_0 + P-network_1_0_AI_0 + P-network_2_1_RP_0 + P-network_2_0_RP_0 + P-network_1_1_AI_0 + P-network_2_1_AskP_0 + P-network_0_1_RP_0 + P-network_2_0_AnsP_2 + P-network_2_0_AnsP_1 + P-network_2_0_AnsP_0 + P-network_2_1_RI_0 + P-network_0_2_RI_0 + P-network_1_2_AskP_0 + P-network_1_1_AnsP_2 + P-network_1_1_AnsP_1 + P-network_1_1_AnsP_0 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_2_0_AnnP_0 + P-network_1_0_RI_0 + P-network_2_2_AI_0 + P-network_0_1_AskP_0 + P-network_0_2_AnsP_2 + P-network_0_2_AnsP_1 + P-network_0_2_AnsP_0 + P-network_1_1_AnnP_0 + P-network_0_0_AskP_0 + P-network_1_2_AI_0 + P-network_2_2_RP_0 + P-network_0_2_AnnP_0 + P-network_1_2_AnnP_0 + P-network_1_0_AskP_0 + P-network_2_0_AI_0 + P-network_0_1_AI_0 + P-network_2_2_AskP_0 + P-network_0_1_RI_0 + P-network_1_1_RP_0 + P-network_2_0_RI_0 + P-network_2_1_AnsP_2 + P-network_2_1_AnsP_1 + P-network_2_1_AnsP_0 + P-network_1_2_RI_0 + P-network_2_1_AnnP_0 + P-network_1_2_AnsP_0 + P-network_1_2_AnsP_1 + P-network_1_2_AnsP_2 + P-network_0_0_RP_0) : MAX(P-electionInit_1 + P-electionInit_0 + P-electionInit_2) : MAX(P-electionInit_1 + P-electionInit_0 + P-electionInit_2) : MAX(P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2) : MAX(0) : MAX(P-polling_0) : MAX(0) : MAX(0) : MAX(0) : MAX(P-sendAnnPs__broadcasting_2_2) : MAX(0) : 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-2-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-2-UpperBounds-0 2 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(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-2-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-2-UpperBounds-1 0 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(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-2-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-2-UpperBounds-2 2 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(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-2-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-2-UpperBounds-3 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_0 + P-electedPrimary_1 + P-electedPrimary_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-electedPrimary_0 + P-electedPrimary_1 + P-electedPrimary_2)
lola: processed formula length: 65
lola: 0 rewrites
lola: closed formula file NeoElection-PT-2-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-2-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-2-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-2-UpperBounds-8 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-polling_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-polling_0)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file NeoElection-PT-2-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: 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-2-UpperBounds-9 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 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-2-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-2-UpperBounds-10 0 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(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-2-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-2-UpperBounds-11 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 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-2-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-2-UpperBounds-12 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-sendAnnPs__broadcasting_2_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-sendAnnPs__broadcasting_2_2)
lola: processed formula length: 34
lola: 0 rewrites
lola: closed formula file NeoElection-PT-2-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-2-UpperBounds-13 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 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-2-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-2-UpperBounds-14 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 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-2-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-2-UpperBounds-15 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-electionInit_1 + P-electionInit_0 + P-electionInit_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-electionInit_1 + P-electionInit_0 + P-electionInit_2)
lola: processed formula length: 59
lola: 0 rewrites
lola: closed formula file NeoElection-PT-2-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NeoElection-PT-2-UpperBounds-6 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-electionInit_1 + P-electionInit_0 + P-electionInit_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-electionInit_1 + P-electionInit_0 + P-electionInit_2)
lola: processed formula length: 59
lola: 0 rewrites
lola: closed formula file NeoElection-PT-2-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges

FORMULA NeoElection-PT-2-UpperBounds-5 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P-network_2_2_AnnP_0 + P-network_1_1_RI_0 + P-network_1_1_AskP_0 + P-network_1_0_AnsP_2 + P-network_2_0_AskP_0 + P-network_1_0_AnsP_1 + P-network_1_0_AnsP_0 + P-network_1_0_RP_0 + P-network_0_0_RI_0 + P-network_0_2_AskP_0 + P-network_0_1_AnsP_2 + P-network_0_0_AI_0 + P-network_0_1_AnsP_1 + P-network_0_1_AnsP_0 + P-network_2_2_RI_0 + P-network_1_0_AnnP_0 + P-network_2_2_AnsP_0 + P-network_2_2_A... (shortened)
lola: processed formula length: 1604
lola: 0 rewrites
lola: closed formula file NeoElection-PT-2-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 5 markings, 4 edges
lola: ========================================

FORMULA NeoElection-PT-2-UpperBounds-4 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 2 0 2 0 2 2 2 0 0 0 0 0 0 0 0 0
lola:
preliminary result: 2 0 2 0 2 2 2 0 0 0 0 0 0 0 0 0
lola: memory consumption: 17252 KB
lola: time consumption: 0 seconds

BK_STOP 1527026694545

--------------------
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-2"
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-2.tgz
mv NeoElection-PT-2 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-2, 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-152666469300289"
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 ;