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 424K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 259K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCround-PT-05a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735100035
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526597719847

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCround-PT-05a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DLCround-PT-05a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCround-PT-05a @ 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: 1222/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 167
lola: finding significant places
lola: 167 places, 1055 transitions, 79 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 906 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-05a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t41) OR NOT FIREABLE(t736) OR NOT FIREABLE(t701) OR NOT FIREABLE(t428) OR NOT FIREABLE(t69) OR (NOT FIREABLE(t1013) AND NOT FIREABLE(t447))))) : E (F (FIREABLE(t201))) : E (F ((FIREABLE(t345) AND ((FIREABLE(t96) AND FIREABLE(t672) AND NOT FIREABLE(t437)) OR FIREABLE(t955))))) : A (G ((NOT FIREABLE(t344) OR NOT FIREABLE(t557)))) : E (F ((NOT FIREABLE(t993) AND NOT FIREABLE(t857) AND FIREABLE(t321) AND NOT FIREABLE(t701)))) : A (G ((NOT FIREABLE(t163) OR NOT FIREABLE(t997)))) : E (F ((FIREABLE(t992) AND FIREABLE(t949) AND ((FIREABLE(t1035) AND FIREABLE(t177) AND NOT FIREABLE(t668)) OR FIREABLE(t47))))) : E (F ((NOT FIREABLE(t21) AND FIREABLE(t277) AND NOT FIREABLE(t583) AND NOT FIREABLE(t750) AND FIREABLE(t474)))) : E (F ((FIREABLE(t640) AND FIREABLE(t1012) AND FIREABLE(t11) AND FIREABLE(t925) AND FIREABLE(t334)))) : E (F (((FIREABLE(t922) OR FIREABLE(t1043) OR FIREABLE(t99)) AND FIREABLE(t41) AND FIREABLE(t393) AND (FIREABLE(t753) OR FIREABLE(t879) OR FIREABLE(t460))))) : A (G ((NOT FIREABLE(t6) OR (FIREABLE(t1035) AND FIREABLE(t824))))) : E (F (((FIREABLE(t2) OR FIREABLE(t603)) AND FIREABLE(t917) AND FIREABLE(t23) AND (FIREABLE(t335) OR FIREABLE(t934))))) : E (F (((FIREABLE(t294) OR FIREABLE(t710)) AND FIREABLE(t588) AND (FIREABLE(t342) OR FIREABLE(t931) OR FIREABLE(t883)) AND (FIREABLE(t410) OR FIREABLE(t198))))) : E (F (FIREABLE(t20))) : E (F ((NOT FIREABLE(t849) AND FIREABLE(t152) AND ((FIREABLE(t686) AND FIREABLE(t561)) OR FIREABLE(t496)) AND (FIREABLE(t602) OR FIREABLE(t1010) OR NOT FIREABLE(t1025) OR FIREABLE(t938))))) : A (G (((NOT FIREABLE(t284) AND NOT FIREABLE(t168)) OR FIREABLE(t647) OR NOT FIREABLE(t306))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t201)))
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(t201)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t201)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-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: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-1 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: E (F (FIREABLE(t20)))
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(t20)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t20)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-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: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-13 TRUE 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: A (G ((NOT FIREABLE(t163) OR NOT FIREABLE(t997))))
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(t163) OR NOT FIREABLE(t997))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file DLCround-PT-05a-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(t163) AND FIREABLE(t997))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-5 FALSE 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: A (G ((NOT FIREABLE(t344) OR NOT FIREABLE(t557))))
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(t344) OR NOT FIREABLE(t557))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file DLCround-PT-05a-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(t344) AND FIREABLE(t557))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-3 FALSE 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: A (G ((NOT FIREABLE(t6) OR (FIREABLE(t1035) AND FIREABLE(t824)))))
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(t6) OR (FIREABLE(t1035) AND FIREABLE(t824)))))
lola: processed formula length: 67
lola: 2 rewrites
lola: closed formula file DLCround-PT-05a-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(t6) AND (NOT FIREABLE(t1035) OR NOT FIREABLE(t824)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-10 FALSE 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 ((NOT FIREABLE(t993) AND NOT FIREABLE(t857) AND FIREABLE(t321) AND NOT FIREABLE(t701))))
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(t993) AND NOT FIREABLE(t857) AND FIREABLE(t321) AND NOT FIREABLE(t701))))
lola: processed formula length: 93
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t993) AND NOT FIREABLE(t857) AND FIREABLE(t321) AND NOT FIREABLE(t701))
lola: state equation: Generated DNF with 40 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-5-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t284) AND NOT FIREABLE(t168)) OR FIREABLE(t647) OR NOT FIREABLE(t306))))
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(t284) AND NOT FIREABLE(t168)) OR FIREABLE(t647) OR NOT FIREABLE(t306))))
lola: processed formula length: 95
lola: 2 rewrites
lola: closed formula file DLCround-PT-05a-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(t284) OR FIREABLE(t168)) AND NOT FIREABLE(t647) AND FIREABLE(t306))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 7 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-15 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: E (F ((FIREABLE(t345) AND ((FIREABLE(t96) AND FIREABLE(t672) AND NOT FIREABLE(t437)) OR FIREABLE(t955)))))
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(t345) AND ((FIREABLE(t96) AND FIREABLE(t672) AND NOT FIREABLE(t437)) OR FIREABLE(t955)))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t345) AND ((FIREABLE(t96) AND FIREABLE(t672) AND NOT FIREABLE(t437)) OR FIREABLE(t955)))
lola: state equation: Generated DNF with 16 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-7-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: 17 markings, 39 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-2 TRUE 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: E (F ((NOT FIREABLE(t21) AND FIREABLE(t277) AND NOT FIREABLE(t583) AND NOT FIREABLE(t750) AND FIREABLE(t474))))
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(t21) AND FIREABLE(t277) AND NOT FIREABLE(t583) AND NOT FIREABLE(t750) AND FIREABLE(t474))))
lola: processed formula length: 111
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t21) AND FIREABLE(t277) AND NOT FIREABLE(t583) AND NOT FIREABLE(t750) AND FIREABLE(t474))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-8-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: 13 markings, 30 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-7 TRUE 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(t640) AND FIREABLE(t1012) AND FIREABLE(t11) AND FIREABLE(t925) AND FIREABLE(t334))))
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(t640) AND FIREABLE(t1012) AND FIREABLE(t11) AND FIREABLE(t925) AND FIREABLE(t334))))
lola: processed formula length: 100
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t640) AND FIREABLE(t1012) AND FIREABLE(t11) AND FIREABLE(t925) AND FIREABLE(t334))
lola: state equation: Generated DNF with 9 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-05a-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-8 FALSE 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: E (F ((FIREABLE(t992) AND FIREABLE(t949) AND ((FIREABLE(t1035) AND FIREABLE(t177) AND NOT FIREABLE(t668)) OR FIREABLE(t47)))))
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(t992) AND FIREABLE(t949) AND ((FIREABLE(t1035) AND FIREABLE(t177) AND NOT FIREABLE(t668)) OR FIREABLE(t47)))))
lola: processed formula length: 127
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t992) AND FIREABLE(t949) AND ((FIREABLE(t1035) AND FIREABLE(t177) AND NOT FIREABLE(t668)) OR FIREABLE(t47)))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-05a-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-6 FALSE 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 (((FIREABLE(t2) OR FIREABLE(t603)) AND FIREABLE(t917) AND FIREABLE(t23) AND (FIREABLE(t335) OR FIREABLE(t934)))))
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(t2) OR FIREABLE(t603)) AND FIREABLE(t917) AND FIREABLE(t23) AND (FIREABLE(t335) OR FIREABLE(t934)))))
lola: processed formula length: 120
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t2) OR FIREABLE(t603)) AND FIREABLE(t917) AND FIREABLE(t23) AND (FIREABLE(t335) OR FIREABLE(t934)))
lola: state equation: Generated DNF with 26 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-11-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: 8 markings, 7 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-11 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(t41) OR NOT FIREABLE(t736) OR NOT FIREABLE(t701) OR NOT FIREABLE(t428) OR NOT FIREABLE(t69) OR (NOT FIREABLE(t1013) AND NOT FIREABLE(t447)))))
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(t41) OR NOT FIREABLE(t736) OR NOT FIREABLE(t701) OR NOT FIREABLE(t428) OR NOT FIREABLE(t69) OR (NOT FIREABLE(t1013) AND NOT FIREABLE(t447)))))
lola: processed formula length: 167
lola: 2 rewrites
lola: closed formula file DLCround-PT-05a-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(t41) AND FIREABLE(t736) AND FIREABLE(t701) AND FIREABLE(t428) AND FIREABLE(t69) AND (FIREABLE(t1013) OR FIREABLE(t447)))
lola: state equation: Generated DNF with 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-05a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-0 TRUE 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: E (F (((FIREABLE(t922) OR FIREABLE(t1043) OR FIREABLE(t99)) AND FIREABLE(t41) AND FIREABLE(t393) AND (FIREABLE(t753) OR FIREABLE(t879) OR FIREABLE(t460)))))
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(t922) OR FIREABLE(t1043) OR FIREABLE(t99)) AND FIREABLE(t41) AND FIREABLE(t393) AND (FIREABLE(t753) OR FIREABLE(t879) OR FIREABLE(t460)))))
lola: processed formula length: 160
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t922) OR FIREABLE(t1043) OR FIREABLE(t99)) AND FIREABLE(t41) AND FIREABLE(t393) AND (FIREABLE(t753) OR FIREABLE(t879) OR FIREABLE(t460)))
lola: state equation: Generated DNF with 57 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-13-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: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-9 TRUE 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: E (F (((FIREABLE(t294) OR FIREABLE(t710)) AND FIREABLE(t588) AND (FIREABLE(t342) OR FIREABLE(t931) OR FIREABLE(t883)) AND (FIREABLE(t410) OR FIREABLE(t198)))))
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(t294) OR FIREABLE(t710)) AND FIREABLE(t588) AND (FIREABLE(t342) OR FIREABLE(t931) OR FIREABLE(t883)) AND (FIREABLE(t410) OR FIREABLE(t198)))))
lola: processed formula length: 163
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t294) OR FIREABLE(t710)) AND FIREABLE(t588) AND (FIREABLE(t342) OR FIREABLE(t931) OR FIREABLE(t883)) AND (FIREABLE(t410) OR FIREABLE(t198)))
lola: state equation: Generated DNF with 96 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-12 TRUE 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: E (F ((NOT FIREABLE(t849) AND FIREABLE(t152) AND ((FIREABLE(t686) AND FIREABLE(t561)) OR FIREABLE(t496)) AND (FIREABLE(t602) OR FIREABLE(t1010) OR NOT FIREABLE(t1025) OR FIREABLE(t938)))))
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(t849) AND FIREABLE(t152) AND ((FIREABLE(t686) AND FIREABLE(t561)) OR FIREABLE(t496)) AND (FIREABLE(t602) OR FIREABLE(t1010) OR NOT FIREABLE(t1025) OR FIREABLE(t938)))))
lola: processed formula length: 192
lola: 1 rewrites
lola: closed formula file DLCround-PT-05a-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(t849) AND FIREABLE(t152) AND ((FIREABLE(t686) AND FIREABLE(t561)) OR FIREABLE(t496)) AND (FIREABLE(t602) OR FIREABLE(t1010) OR NOT FIREABLE(t1025) OR FIREABLE(t938)))
lola: state equation: Generated DNF with 152 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCround-PT-05a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no no yes no yes no yes yes yes yes no
lola:
preliminary result: yes yes yes no yes no no yes no yes no yes yes yes yes no
lola: memory consumption: 16240 KB
lola: time consumption: 0 seconds

BK_STOP 1526597720510

--------------------
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="DLCround-PT-05a"
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/DLCround-PT-05a.tgz
mv DLCround-PT-05a 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 DLCround-PT-05a, 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 r064-smll-152649735100035"
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 ;