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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N2000P0, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357300182
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526573306308

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N2000P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N2000P0 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ ClientsAndServers-PT-N2000P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: A (G ((FIREABLE(csR) OR (FIREABLE(srR) AND (FIREABLE(srG) OR FIREABLE(srR)) AND FIREABLE(srF))))) : E (F ((NOT FIREABLE(msG) AND NOT FIREABLE(csR)))) : E (F ((FIREABLE(mrF) AND FIREABLE(crA)))) : E (F ((NOT FIREABLE(srR) AND NOT FIREABLE(msG) AND FIREABLE(mfU) AND (NOT FIREABLE(srR) OR NOT FIREABLE(crA)) AND (FIREABLE(srR) OR (FIREABLE(mrF) AND FIREABLE(csR)))))) : E (F ((FIREABLE(mrF) AND FIREABLE(crA) AND FIREABLE(msG) AND FIREABLE(ssG) AND (FIREABLE(csR) OR FIREABLE(mrF)) AND (NOT FIREABLE(msA) OR NOT FIREABLE(ssA))))) : A (G ((FIREABLE(ssG) OR NOT FIREABLE(mrF) OR NOT FIREABLE(ssF) OR NOT FIREABLE(srR) OR (FIREABLE(srF) AND FIREABLE(maU) AND FIREABLE(crG))))) : E (F ((FIREABLE(ssA) AND FIREABLE(ssR) AND FIREABLE(srR) AND FIREABLE(mfU) AND FIREABLE(srA) AND (FIREABLE(srF) OR FIREABLE(srR))))) : A (G (())) : E (F ((FIREABLE(msA) AND FIREABLE(crG) AND NOT FIREABLE(ssR) AND FIREABLE(ssA) AND (FIREABLE(msA) OR FIREABLE(csF) OR (FIREABLE(ssF) AND FIREABLE(crG)) OR (NOT FIREABLE(srR) AND FIREABLE(mrR)))))) : A (G ((((NOT FIREABLE(msA) OR NOT FIREABLE(mfU)) AND (NOT FIREABLE(mfU) OR NOT FIREABLE(csR))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(ssA) AND NOT FIREABLE(ssG))))) : E (F (())) : E (F ((FIREABLE(mfU) AND FIREABLE(mrR) AND FIREABLE(srF)))) : A (G ((FIREABLE(ssF) OR FIREABLE(csR) OR (NOT FIREABLE(csF) AND NOT FIREABLE(msA) AND (NOT FIREABLE(ssA) OR NOT FIREABLE(csR)))))) : E (F (((FIREABLE(mrF) OR FIREABLE(msA)) AND FIREABLE(mfU)))) : A (G (((NOT FIREABLE(ssA) OR NOT FIREABLE(msA) OR NOT FIREABLE(mrF))))) : E (F (((FIREABLE(srR) OR FIREABLE(msA)) AND NOT FIREABLE(srA) AND FIREABLE(srR) AND FIREABLE(mrF) AND FIREABLE(msA) AND FIREABLE(crG))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-7 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-10 FALSE 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: E (F ((NOT FIREABLE(msG) AND NOT FIREABLE(csR))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(msG) AND NOT FIREABLE(csR))))
lola: processed formula length: 49
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(msG) AND NOT FIREABLE(csR))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16001 markings, 16000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-1 TRUE 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: E (F ((FIREABLE(mrF) AND FIREABLE(crA))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(mrF) AND FIREABLE(crA))))
lola: processed formula length: 41
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(mrF) AND FIREABLE(crA))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(mfU) AND FIREABLE(mrR) AND FIREABLE(srF))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(mfU) AND FIREABLE(mrR) AND FIREABLE(srF))))
lola: processed formula length: 59
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-11 TRUE 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: E (F (((FIREABLE(mrF) OR FIREABLE(msA)) AND FIREABLE(mfU))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(mrF) OR FIREABLE(msA)) AND FIREABLE(mfU))))
lola: processed formula length: 61
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-3-0.sara.
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(mrF) OR FIREABLE(msA)) AND FIREABLE(mfU))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-13 TRUE 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: A (G (((NOT FIREABLE(ssA) OR NOT FIREABLE(msA) OR NOT FIREABLE(mrF)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(ssA) OR NOT FIREABLE(msA) OR NOT FIREABLE(mrF)))))
lola: processed formula length: 73
lola: 8 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(ssA) AND FIREABLE(msA) AND FIREABLE(mrF)))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43 markings, 42 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-14 FALSE 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: A (G ((FIREABLE(csR) OR (FIREABLE(srR) AND (FIREABLE(srG) OR FIREABLE(srR)) AND FIREABLE(srF)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(csR) OR (FIREABLE(srR) AND (FIREABLE(srG) OR FIREABLE(srR)) AND FIREABLE(srF)))))
lola: processed formula length: 99
lola: 8 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(csR) AND (NOT FIREABLE(srR) OR (NOT FIREABLE(srG) AND NOT FIREABLE(srR)) OR NOT FIREABLE(srF)))
lola: state equation: Generated DNF with 20 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16001 markings, 16000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-0 FALSE 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: A (G ((FIREABLE(ssF) OR FIREABLE(csR) OR (NOT FIREABLE(csF) AND NOT FIREABLE(msA) AND (NOT FIREABLE(ssA) OR NOT FIREABLE(csR))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(ssF) OR FIREABLE(csR) OR (NOT FIREABLE(csF) AND NOT FIREABLE(msA) AND (NOT FIREABLE(ssA) OR NOT FIREABLE(csR))))))
lola: processed formula length: 133
lola: 8 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(ssF) AND NOT FIREABLE(csR) AND (FIREABLE(csF) OR FIREABLE(msA) OR (FIREABLE(ssA) AND FIREABLE(csR))))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16009 markings, 16008 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-12 FALSE 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: E (F (((FIREABLE(srR) OR FIREABLE(msA)) AND NOT FIREABLE(srA) AND FIREABLE(srR) AND FIREABLE(mrF) AND FIREABLE(msA) AND FIREABLE(crG))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(srR) OR FIREABLE(msA)) AND NOT FIREABLE(srA) AND FIREABLE(srR) AND FIREABLE(mrF) AND FIREABLE(msA) AND FIREABLE(crG))))
lola: processed formula length: 137
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(srR) OR FIREABLE(msA)) AND NOT FIREABLE(srA) AND FIREABLE(srR) AND FIREABLE(mrF) AND FIREABLE(msA) AND FIREABLE(crG))
lola: state equation: Generated DNF with 38 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-9-0.sara
lola: The predicate is reachable.
lola: 36 markings, 35 edges

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ssA) AND FIREABLE(ssR) AND FIREABLE(srR) AND FIREABLE(mfU) AND FIREABLE(srA) AND (FIREABLE(srF) OR FIREABLE(srR)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(ssA) AND FIREABLE(ssR) AND FIREABLE(srR) AND FIREABLE(mfU) AND FIREABLE(srA) AND (FIREABLE(srF) OR FIREABLE(srR)))))
lola: processed formula length: 133
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(ssA) AND FIREABLE(ssR) AND FIREABLE(srR) AND FIREABLE(mfU) AND FIREABLE(srA) AND (FIREABLE(srF) OR FIREABLE(srR)))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-6 TRUE 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: ...considering subproblem: E (F ((NOT FIREABLE(srR) AND NOT FIREABLE(msG) AND FIREABLE(mfU) AND (NOT FIREABLE(srR) OR NOT FIREABLE(crA)) AND (FIREABLE(srR) OR (FIREABLE(mrF) AND FIREABLE(csR))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(srR) AND NOT FIREABLE(msG) AND FIREABLE(mfU) AND (NOT FIREABLE(srR) OR NOT FIREABLE(crA)) AND (FIREABLE(srR) OR (FIREABLE(mrF) AND FIREABLE(csR))))))
lola: processed formula length: 171
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(srR) AND NOT FIREABLE(msG) AND FIREABLE(mfU) AND (NOT FIREABLE(srR) OR NOT FIREABLE(crA)) AND (FIREABLE(srR) OR (FIREABLE(mrF) AND FIREABLE(csR))))
lola: state equation: Generated DNF with 56 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 500369 markings, 572493 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-3 TRUE 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: A (G ((((NOT FIREABLE(msA) OR NOT FIREABLE(mfU)) AND (NOT FIREABLE(mfU) OR NOT FIREABLE(csR))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(ssA) AND NOT FIREABLE(ssG)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((NOT FIREABLE(msA) OR NOT FIREABLE(mfU)) AND (NOT FIREABLE(mfU) OR NOT FIREABLE(csR))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(ssA) AND NOT FIREABLE(ssG)))))
lola: processed formula length: 167
lola: 8 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((FIREABLE(msA) AND FIREABLE(mfU)) OR (FIREABLE(mfU) AND FIREABLE(csR))) AND (FIREABLE(crA) OR FIREABLE(ssA) OR FIREABLE(ssG)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-12-0.sara
lola:
FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(ssG) OR NOT FIREABLE(mrF) OR NOT FIREABLE(ssF) OR NOT FIREABLE(srR) OR (FIREABLE(srF) AND FIREABLE(maU) AND FIREABLE(crG)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(ssG) OR NOT FIREABLE(mrF) OR NOT FIREABLE(ssF) OR NOT FIREABLE(srR) OR (FIREABLE(srF) AND FIREABLE(maU) AND FIREABLE(crG)))))
lola: processed formula length: 145
lola: 8 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(ssG) AND FIREABLE(mrF) AND FIREABLE(ssF) AND FIREABLE(srR) AND (NOT FIREABLE(srF) OR NOT FIREABLE(maU) OR NOT FIREABLE(crG)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 35 literals and 5 conjunctive subformulas
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(mrF) AND FIREABLE(crA) AND FIREABLE(msG) AND FIREABLE(ssG) AND (FIREABLE(csR) OR FIREABLE(mrF)) AND (NOT FIREABLE(msA) OR NOT FIREABLE(ssA)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(mrF) AND FIREABLE(crA) AND FIREABLE(msG) AND FIREABLE(ssG) AND (FIREABLE(csR) OR FIREABLE(mrF)) AND (NOT FIREABLE(msA) OR NOT FIREABLE(ssA)))))
lola: processed formula length: 161
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(mrF) AND FIREABLE(crA) AND FIREABLE(msG) AND FIREABLE(ssG) AND (FIREABLE(csR) OR FIREABLE(mrF)) AND (NOT FIREABLE(msA) OR NOT FIREABLE(ssA)))
lola: state equation: Generated DNF with 34 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(msA) AND FIREABLE(crG) AND NOT FIREABLE(ssR) AND FIREABLE(ssA) AND (FIREABLE(msA) OR FIREABLE(csF) OR (FIREABLE(ssF) AND FIREABLE(crG)) OR (NOT FIREABLE(srR) AND FIREABLE(mrR))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(msA) AND FIREABLE(crG) AND NOT FIREABLE(ssR) AND FIREABLE(ssA) AND (FIREABLE(msA) OR FIREABLE(csF) OR (FIREABLE(ssF) AND FIREABLE(crG)) OR (NOT FIREABLE(srR) AND FIREABLE(mrR))))))
lola: processed formula length: 199
lola: 7 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(msA) AND FIREABLE(crG) AND NOT FIREABLE(ssR) AND FIREABLE(ssA) AND (FIREABLE(msA) OR FIREABLE(csF) OR (FIREABLE(ssF) AND FIREABLE(crG)) OR (NOT FIREABLE(srR) AND FIREABLE(mrR))))
lola: state equation: Generated DNF with 36 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-14-0.sara.

FORMULA ClientsAndServers-PT-N2000P0-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes yes no no yes no yes no yes
lola:
preliminary result: no yes yes yes yes no yes yes yes no no yes no yes no yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-ReachabilityFireability-15-0.sara.

lola: memory consumption: 14660 KB
lola: time consumption: 1 seconds

BK_STOP 1526573310020

--------------------
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="ClientsAndServers-PT-N2000P0"
export BK_EXAMINATION="ReachabilityFireability"
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/ClientsAndServers-PT-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 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 ClientsAndServers-PT-N2000P0, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r040-smll-152646357300182"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;