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 5.3M
-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 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.1M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCshifumi-PT-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735300196
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526719853864

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCshifumi-PT-4b 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 DLCshifumi-PT-4b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCshifumi-PT-4b @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 36356/65536 symbol table entries, 13849 collisions
lola: preprocessing...
lola: Size of bit vector: 15015
lola: finding significant places
lola: 15015 places, 21341 transitions, 14324 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28617 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-4b-ReachabilityFireability.task
lola: E (F (FIREABLE(t12864))) : E (F ((FIREABLE(t216) OR FIREABLE(t5904) OR FIREABLE(t17244) OR FIREABLE(t11754) OR (FIREABLE(t17686) AND FIREABLE(t13621) AND FIREABLE(t15079) AND FIREABLE(t6979) AND FIREABLE(t19153))))) : E (F (FIREABLE(t4724))) : E (F (FIREABLE(t8978))) : E (F (FIREABLE(t13917))) : A (G (((NOT FIREABLE(t11024) OR NOT FIREABLE(t18476) OR FIREABLE(t3682)) AND NOT FIREABLE(t16055)))) : E (F ((NOT FIREABLE(t15272) AND NOT FIREABLE(t12748) AND FIREABLE(t8900) AND NOT FIREABLE(t9229)))) : A (G ((NOT FIREABLE(t20156) OR NOT FIREABLE(t6155)))) : A (G ((NOT FIREABLE(t6033) OR ((FIREABLE(t13509) OR NOT FIREABLE(t19565)) AND (NOT FIREABLE(t14538) OR NOT FIREABLE(t17185)))))) : A (G ((FIREABLE(t18997) OR FIREABLE(t11637) OR (FIREABLE(t9929) AND FIREABLE(t18937)) OR FIREABLE(t19056) OR FIREABLE(t18611) OR NOT FIREABLE(t3855) OR FIREABLE(t15403)))) : A (G (((NOT FIREABLE(t1964) OR NOT FIREABLE(t10591)) AND (FIREABLE(t4615) OR NOT FIREABLE(t12312) OR FIREABLE(t7676))))) : E (F ((NOT FIREABLE(t3101) AND NOT FIREABLE(t20655) AND NOT FIREABLE(t3383) AND FIREABLE(t11934)))) : E (F (((NOT FIREABLE(t10153) AND FIREABLE(t6595)) OR (NOT FIREABLE(t640) AND NOT FIREABLE(t12879) AND FIREABLE(t10425))))) : A (G ((((NOT FIREABLE(t857) OR NOT FIREABLE(t2015)) AND (NOT FIREABLE(t17413) OR NOT FIREABLE(t5655))) OR (FIREABLE(t10343) AND NOT FIREABLE(t16165))))) : E (F (FIREABLE(t5968))) : A (G ((((NOT FIREABLE(t5305) AND NOT FIREABLE(t17203)) OR NOT FIREABLE(t2048)) AND NOT FIREABLE(t8689))))
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(t12864)))
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(t12864)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t12864)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2792 markings, 3131 edges
lola: ========================================

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

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

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

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-4 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(t5968)))
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(t5968)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t5968)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-4-0.sara.
lola: sara is running 0 secs || 11744 markings, 13381 edges, 2349 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17050 markings, 19431 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t20156) OR NOT FIREABLE(t6155))))
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(t20156) OR NOT FIREABLE(t6155))))
lola: processed formula length: 54
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t20156) AND FIREABLE(t6155))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 348 markings, 347 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t11024) OR NOT FIREABLE(t18476) OR FIREABLE(t3682)) AND NOT FIREABLE(t16055))))
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(t11024) OR NOT FIREABLE(t18476) OR FIREABLE(t3682)) AND NOT FIREABLE(t16055))))
lola: processed formula length: 102
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t11024) AND FIREABLE(t18476) AND NOT FIREABLE(t3682)) OR FIREABLE(t16055))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5066 markings, 5741 edges

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3101) AND NOT FIREABLE(t20655) AND NOT FIREABLE(t3383) AND FIREABLE(t11934))))
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(t3101) AND NOT FIREABLE(t20655) AND NOT FIREABLE(t3383) AND FIREABLE(t11934))))
lola: processed formula length: 99
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t3101) AND NOT FIREABLE(t20655) AND NOT FIREABLE(t3383) AND FIREABLE(t11934))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t15272) AND NOT FIREABLE(t12748) AND FIREABLE(t8900) AND NOT FIREABLE(t9229))))
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(t15272) AND NOT FIREABLE(t12748) AND FIREABLE(t8900) AND NOT FIREABLE(t9229))))
lola: processed formula length: 99
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t15272) AND NOT FIREABLE(t12748) AND FIREABLE(t8900) AND NOT FIREABLE(t9229))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 70 markings, 69 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t5305) AND NOT FIREABLE(t17203)) OR NOT FIREABLE(t2048)) AND NOT FIREABLE(t8689))))
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(t5305) AND NOT FIREABLE(t17203)) OR NOT FIREABLE(t2048)) AND NOT FIREABLE(t8689))))
lola: processed formula length: 106
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t5305) OR FIREABLE(t17203)) AND FIREABLE(t2048)) OR FIREABLE(t8689))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1076 markings, 1209 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t10153) AND FIREABLE(t6595)) OR (NOT FIREABLE(t640) AND NOT FIREABLE(t12879) AND FIREABLE(t10425)))))
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(t10153) AND FIREABLE(t6595)) OR (NOT FIREABLE(t640) AND NOT FIREABLE(t12879) AND FIREABLE(t10425)))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t10153) AND FIREABLE(t6595)) OR (NOT FIREABLE(t640) AND NOT FIREABLE(t12879) AND FIREABLE(t10425)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1964) OR NOT FIREABLE(t10591)) AND (FIREABLE(t4615) OR NOT FIREABLE(t12312) OR FIREABLE(t7676)))))
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(t1964) OR NOT FIREABLE(t10591)) AND (FIREABLE(t4615) OR NOT FIREABLE(t12312) OR FIREABLE(t7676)))))
lola: processed formula length: 123
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t1964) AND FIREABLE(t10591)) OR (NOT FIREABLE(t4615) AND FIREABLE(t12312) AND NOT FIREABLE(t7676)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2463 markings, 2761 edges
lola:
FORMULA DLCshifumi-PT-4b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t6033) OR ((FIREABLE(t13509) OR NOT FIREABLE(t19565)) AND (NOT FIREABLE(t14538) OR NOT FIREABLE(t17185))))))
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(t6033) OR ((FIREABLE(t13509) OR NOT FIREABLE(t19565)) AND (NOT FIREABLE(t14538) OR NOT FIREABLE(t17185))))))
lola: processed formula length: 131
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t6033) AND ((NOT FIREABLE(t13509) AND FIREABLE(t19565)) OR (FIREABLE(t14538) AND FIREABLE(t17185))))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 700 markings, 699 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t857) OR NOT FIREABLE(t2015)) AND (NOT FIREABLE(t17413) OR NOT FIREABLE(t5655))) OR (FIREABLE(t10343) AND NOT FIREABLE(t16165)))))
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(t857) OR NOT FIREABLE(t2015)) AND (NOT FIREABLE(t17413) OR NOT FIREABLE(t5655))) OR (FIREABLE(t10343) AND NOT FIREABLE(t16165)))))
lola: processed formula length: 155
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t857) AND FIREABLE(t2015)) OR (FIREABLE(t17413) AND FIREABLE(t5655))) AND (NOT FIREABLE(t10343) OR FIREABLE(t16165)))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1599 markings, 1762 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t18997) OR FIREABLE(t11637) OR (FIREABLE(t9929) AND FIREABLE(t18937)) OR FIREABLE(t19056) OR FIREABLE(t18611) OR NOT FIREABLE(t3855) OR FIREABLE(t15403))))
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(t18997) OR FIREABLE(t11637) OR (FIREABLE(t9929) AND FIREABLE(t18937)) OR FIREABLE(t19056) OR FIREABLE(t18611) OR NOT FIREABLE(t3855) OR FIREABLE(t15403))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t18997) AND NOT FIREABLE(t11637) AND (NOT FIREABLE(t9929) OR NOT FIREABLE(t18937)) AND NOT FIREABLE(t19056) AND NOT FIREABLE(t18611) AND FIREABLE(t3855) AND NOT FIREABLE(t15403))
lola: state equation: Generated DNF with 336 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6673 markings, 7478 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t216) OR FIREABLE(t5904) OR FIREABLE(t17244) OR FIREABLE(t11754) OR (FIREABLE(t17686) AND FIREABLE(t13621) AND FIREABLE(t15079) AND FIREABLE(t6979) AND FIREABLE(t19153)))))
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(t216) OR FIREABLE(t5904) OR FIREABLE(t17244) OR FIREABLE(t11754) OR (FIREABLE(t17686) AND FIREABLE(t13621) AND FIREABLE(t15079) AND FIREABLE(t6979) AND FIREABLE(t19153)))))
lola: processed formula length: 192
lola: 1 rewrites
lola: closed formula file DLCshifumi-PT-4b-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(t216) OR FIREABLE(t5904) OR FIREABLE(t17244) OR FIREABLE(t11754) OR (FIREABLE(t17686) AND FIREABLE(t13621) AND FIREABLE(t15079) AND FIREABLE(t6979) AND FIREABLE(t19153)))
lola: state equation: Generated DNF with 13 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 63 markings, 62 edges
lola: ========================================

FORMULA DLCshifumi-PT-4b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no no no no yes yes no yes no
lola:
preliminary result: yes yes yes yes yes no yes no no no no yes yes no yes no
lola: memory consumption: 43656 KB
lola: time consumption: 17 seconds

BK_STOP 1526719871615

--------------------
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="DLCshifumi-PT-4b"
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/DLCshifumi-PT-4b.tgz
mv DLCshifumi-PT-4b 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 DLCshifumi-PT-4b, 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-152649735300196"
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 ;