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 4.4M
-rw-r--r-- 1 mcc users 3.6K May 30 00:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 30 00:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 28 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 28 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 28 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 27 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 27 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 26 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 4.2M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-6a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145700441
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528132316419

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-6a 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 DLCflexbar-PT-6a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCflexbar-PT-6a @ 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: 18146/65536 symbol table entries, 6487 collisions
lola: preprocessing...
lola: Size of bit vector: 2069
lola: finding significant places
lola: 2069 places, 16077 transitions, 577 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14110 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-6a-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t3002) AND (FIREABLE(t922) OR FIREABLE(t6908)) AND FIREABLE(t13694) AND FIREABLE(t9041) AND NOT FIREABLE(t7688) AND NOT FIREABLE(t2798)))) : A (G (NOT FIREABLE(t8841))) : E (F (((FIREABLE(t8850) OR FIREABLE(t2299)) AND FIREABLE(t6474)))) : E (F (FIREABLE(t2629))) : E (F ((NOT FIREABLE(t11990) AND (FIREABLE(t4654) OR FIREABLE(t10329)) AND (NOT FIREABLE(t3902) OR FIREABLE(t6043)) AND ((FIREABLE(t5795) AND (FIREABLE(t1196) OR FIREABLE(t6826))) OR (NOT FIREABLE(t10292) AND NOT FIREABLE(t6743)))))) : E (F (FIREABLE(t7720))) : E (F ((FIREABLE(t1580) AND FIREABLE(t8855) AND (FIREABLE(t11176) OR FIREABLE(t10692) OR NOT FIREABLE(t11483) OR NOT FIREABLE(t13731) OR (FIREABLE(t340) AND FIREABLE(t10971)))))) : E (F (FIREABLE(t9614))) : A (G ((FIREABLE(t3982) OR NOT FIREABLE(t481) OR FIREABLE(t4085) OR FIREABLE(t5028) OR (FIREABLE(t15365) AND FIREABLE(t5262)) OR FIREABLE(t13630) OR FIREABLE(t8850)))) : A (G (((FIREABLE(t2615) AND FIREABLE(t12144)) OR NOT FIREABLE(t1406)))) : E (F (FIREABLE(t36))) : E (F ((FIREABLE(t2818) AND FIREABLE(t15805) AND NOT FIREABLE(t15569) AND NOT FIREABLE(t14204) AND FIREABLE(t7910)))) : E (F ((FIREABLE(t4251) AND FIREABLE(t6175) AND FIREABLE(t7266)))) : E (F ((FIREABLE(t10689) AND NOT FIREABLE(t7717)))) : E (F ((FIREABLE(t774) AND FIREABLE(t13123)))) : A (G ((FIREABLE(t5867) OR FIREABLE(t11315) OR NOT FIREABLE(t281) OR FIREABLE(t12858) OR FIREABLE(t9982))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t8841)))
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(t8841)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t8841)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2629)))
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(t2629)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t2629)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7720)))
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(t7720)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t7720)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-5 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(t9614)))
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(t9614)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t9614)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-7 TRUE 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: E (F (FIREABLE(t36)))
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(t36)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t36)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-10 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(t10689) AND NOT FIREABLE(t7717))))
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(t10689) AND NOT FIREABLE(t7717))))
lola: processed formula length: 50
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t10689) AND NOT FIREABLE(t7717))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t774) AND FIREABLE(t13123))))
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(t774) AND FIREABLE(t13123))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t774) AND FIREABLE(t13123))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-14 TRUE 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(t4251) AND FIREABLE(t6175) AND FIREABLE(t7266))))
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(t4251) AND FIREABLE(t6175) AND FIREABLE(t7266))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t4251) AND FIREABLE(t6175) AND FIREABLE(t7266))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-12 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: A (G (((FIREABLE(t2615) AND FIREABLE(t12144)) OR NOT FIREABLE(t1406))))
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(t2615) AND FIREABLE(t12144)) OR NOT FIREABLE(t1406))))
lola: processed formula length: 72
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t2615) OR NOT FIREABLE(t12144)) AND FIREABLE(t1406))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t8850) OR FIREABLE(t2299)) AND FIREABLE(t6474))))
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(t8850) OR FIREABLE(t2299)) AND FIREABLE(t6474))))
lola: processed formula length: 67
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t8850) OR FIREABLE(t2299)) AND FIREABLE(t6474))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2818) AND FIREABLE(t15805) AND NOT FIREABLE(t15569) AND NOT FIREABLE(t14204) AND FIREABLE(t7910))))
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(t2818) AND FIREABLE(t15805) AND NOT FIREABLE(t15569) AND NOT FIREABLE(t14204) AND FIREABLE(t7910))))
lola: processed formula length: 116
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t2818) AND FIREABLE(t15805) AND NOT FIREABLE(t15569) AND NOT FIREABLE(t14204) AND FIREABLE(t7910))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 9 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t5867) OR FIREABLE(t11315) OR NOT FIREABLE(t281) OR FIREABLE(t12858) OR FIREABLE(t9982))))
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(t5867) OR FIREABLE(t11315) OR NOT FIREABLE(t281) OR FIREABLE(t12858) OR FIREABLE(t9982))))
lola: processed formula length: 110
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t5867) AND NOT FIREABLE(t11315) AND FIREABLE(t281) AND NOT FIREABLE(t12858) AND NOT FIREABLE(t9982))
lola: state equation: Generated DNF with 80 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 13 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-15 FALSE 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: E (F ((NOT FIREABLE(t3002) AND (FIREABLE(t922) OR FIREABLE(t6908)) AND FIREABLE(t13694) AND FIREABLE(t9041) AND NOT FIREABLE(t7688) AND NOT FIREABLE(t2798))))
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(t3002) AND (FIREABLE(t922) OR FIREABLE(t6908)) AND FIREABLE(t13694) AND FIREABLE(t9041) AND NOT FIREABLE(t7688) AND NOT FIREABLE(t2798))))
lola: processed formula length: 159
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t3002) AND (FIREABLE(t922) OR FIREABLE(t6908)) AND FIREABLE(t13694) AND FIREABLE(t9041) AND NOT FIREABLE(t7688) AND NOT FIREABLE(t2798))
lola: state equation: Generated DNF with 144 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 9 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-0 TRUE 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(t3982) OR NOT FIREABLE(t481) OR FIREABLE(t4085) OR FIREABLE(t5028) OR (FIREABLE(t15365) AND FIREABLE(t5262)) OR FIREABLE(t13630) OR FIREABLE(t8850))))
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(t3982) OR NOT FIREABLE(t481) OR FIREABLE(t4085) OR FIREABLE(t5028) OR (FIREABLE(t15365) AND FIREABLE(t5262)) OR FIREABLE(t13630) OR FIREABLE(t8850))))
lola: processed formula length: 172
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t3982) AND FIREABLE(t481) AND NOT FIREABLE(t4085) AND NOT FIREABLE(t5028) AND (NOT FIREABLE(t15365) OR NOT FIREABLE(t5262)) AND NOT FIREABLE(t13630) AND NOT FIREABLE(t8850))
lola: state equation: Generated DNF with 896 literals and 128 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 18 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-8 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(t1580) AND FIREABLE(t8855) AND (FIREABLE(t11176) OR FIREABLE(t10692) OR NOT FIREABLE(t11483) OR NOT FIREABLE(t13731) OR (FIREABLE(t340) AND FIREABLE(t10971))))))
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(t1580) AND FIREABLE(t8855) AND (FIREABLE(t11176) OR FIREABLE(t10692) OR NOT FIREABLE(t11483) OR NOT FIREABLE(t13731) OR (FIREABLE(t340) AND FIREABLE(t10971))))))
lola: processed formula length: 181
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t1580) AND FIREABLE(t8855) AND (FIREABLE(t11176) OR FIREABLE(t10692) OR NOT FIREABLE(t11483) OR NOT FIREABLE(t13731) OR (FIREABLE(t340) AND FIREABLE(t10971))))
lola: state equation: Generated DNF with 39 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA DLCflexbar-PT-6a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t11990) AND (FIREABLE(t4654) OR FIREABLE(t10329)) AND (NOT FIREABLE(t3902) OR FIREABLE(t6043)) AND ((FIREABLE(t5795) AND (FIREABLE(t1196) OR FIREABLE(t6826))) OR (NOT FIREABLE(t10292) AND NOT FIREABLE(t6743))))))
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(t11990) AND (FIREABLE(t4654) OR FIREABLE(t10329)) AND (NOT FIREABLE(t3902) OR FIREABLE(t6043)) AND ((FIREABLE(t5795) AND (FIREABLE(t1196) OR FIREABLE(t6826))) OR (NOT FIREABLE(t10292) AND NOT FIREABLE(t6743))))))
lola: processed formula length: 236
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-6a-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(t11990) AND (FIREABLE(t4654) OR FIREABLE(t10329)) AND (NOT FIREABLE(t3902) OR FIREABLE(t6043)) AND ((FIREABLE(t5795) AND (FIREABLE(t1196) OR FIREABLE(t6826))) OR (NOT FIREABLE(t10292) AND NOT FIREABLE(t6743))))
lola: state equation: Generated DNF with 448 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-6a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-6a-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 7 edges
lola: ========================================

FORMULA DLCflexbar-PT-6a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes yes no no yes yes yes yes yes no
lola:
preliminary result: yes no yes yes yes yes yes yes no no yes yes yes yes yes no
lola: memory consumption: 220448 KB
lola: time consumption: 1 seconds

BK_STOP 1528132317720

--------------------
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="DLCflexbar-PT-6a"
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/DLCflexbar-PT-6a.tgz
mv DLCflexbar-PT-6a 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 DLCflexbar-PT-6a, 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 r268-smll-152749145700441"
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 ;