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 192K
-rw-r--r-- 1 mcc users 3.2K May 30 22:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 28 09:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 05:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 05:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 14K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-005006, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300657
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527822725834

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-005006 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-005006 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RefineWMG-PT-005006 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 928
lola: finding significant places
lola: 29 places, 23 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 29 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-005-006-ReachabilityFireability.task
lola: E (F ((FIREABLE(t2) AND FIREABLE(t18) AND (FIREABLE(t10) OR FIREABLE(t19)) AND FIREABLE(t5) AND (FIREABLE(t12) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t20)))))) : E (F ((NOT FIREABLE(t15) AND NOT FIREABLE(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(tsecond)) AND FIREABLE(t5) AND NOT FIREABLE(t10) AND FIREABLE(tsecond) AND (FIREABLE(t14) OR FIREABLE(t11))))) : A (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t19)) OR FIREABLE(t12)))) : E (F ((NOT FIREABLE(t20) AND FIREABLE(tsecond) AND FIREABLE(t)))) : E (F (((FIREABLE(t12) OR FIREABLE(t20)) AND FIREABLE(t)))) : E (F ((((FIREABLE(t13) AND FIREABLE(t12)) OR FIREABLE(t10)) AND (FIREABLE(t11) OR FIREABLE(t16)) AND NOT FIREABLE(t8) AND NOT FIREABLE(tprime) AND FIREABLE(t19)))) : A (G ((FIREABLE(t15) OR FIREABLE(t18) OR NOT FIREABLE(t6) OR NOT FIREABLE(t12) OR (FIREABLE(t2) AND FIREABLE(t12) AND FIREABLE(t18))))) : A (G ((NOT FIREABLE(t2) OR (FIREABLE(t11) AND FIREABLE(t17))))) : E (F ((NOT FIREABLE(t20) AND ((FIREABLE(t) AND FIREABLE(t15)) OR FIREABLE(t3))))) : A (G (((FIREABLE(t3) AND FIREABLE(t11)) OR NOT FIREABLE(t2)))) : A (G ((FIREABLE(t8) OR FIREABLE(t6) OR FIREABLE(tsecond) OR ((FIREABLE(tsecond) OR FIREABLE(t16)) AND FIREABLE(t17))))) : E (F (())) : E (F ((NOT FIREABLE(t15) AND FIREABLE(t1) AND (FIREABLE(t3) OR FIREABLE(tsecond) OR FIREABLE(t10)) AND NOT FIREABLE(tsecond)))) : E (F ((NOT FIREABLE(t8) AND FIREABLE(t6)))) : E (F (((FIREABLE(t9) OR (NOT FIREABLE(tsecond) AND NOT FIREABLE(t9))) AND NOT FIREABLE(t12)))) : E (F ((NOT FIREABLE(t13) AND NOT FIREABLE(tsecond) AND FIREABLE(t5) AND NOT FIREABLE(t16))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-11 FALSE 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 ((NOT FIREABLE(t8) AND FIREABLE(t6))))
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(t8) AND FIREABLE(t6))))
lola: processed formula length: 43
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t8) AND FIREABLE(t6))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t12) OR FIREABLE(t20)) AND FIREABLE(t))))
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(t12) OR FIREABLE(t20)) AND FIREABLE(t))))
lola: processed formula length: 59
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t12) OR FIREABLE(t20)) AND FIREABLE(t))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-2-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: 30 markings, 29 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-4 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: A (G ((NOT FIREABLE(t2) OR (FIREABLE(t11) AND FIREABLE(t17)))))
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(t2) OR (FIREABLE(t11) AND FIREABLE(t17)))))
lola: processed formula length: 64
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t2) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t17)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-7 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 (((FIREABLE(t3) AND FIREABLE(t11)) OR NOT FIREABLE(t2))))
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(t3) AND FIREABLE(t11)) OR NOT FIREABLE(t2))))
lola: processed formula length: 63
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t3) OR NOT FIREABLE(t11)) AND FIREABLE(t2))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-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: 8 markings, 7 edges

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t15) AND NOT FIREABLE(t19)) OR FIREABLE(t12))))
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(t15) AND NOT FIREABLE(t19)) OR FIREABLE(t12))))
lola: processed formula length: 69
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t15) OR FIREABLE(t19)) AND NOT FIREABLE(t12))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
sara: try reading problem file RefineWMG-PT-005-006-ReachabilityFireability-3-0.sara.
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-5-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 RefineWMG-PT-005-006-ReachabilityFireability-2 FALSE 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: E (F ((NOT FIREABLE(t20) AND FIREABLE(tsecond) AND FIREABLE(t))))
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(t20) AND FIREABLE(tsecond) AND FIREABLE(t))))
lola: processed formula length: 65
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t20) AND FIREABLE(tsecond) AND FIREABLE(t))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-6-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: 111 markings, 115 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-3 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(t9) OR (NOT FIREABLE(tsecond) AND NOT FIREABLE(t9))) AND NOT FIREABLE(t12))))
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(t9) OR (NOT FIREABLE(tsecond) AND NOT FIREABLE(t9))) AND NOT FIREABLE(t12))))
lola: processed formula length: 95
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-14 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(t20) AND ((FIREABLE(t) AND FIREABLE(t15)) OR FIREABLE(t3)))))
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(t20) AND ((FIREABLE(t) AND FIREABLE(t15)) OR FIREABLE(t3)))))
lola: processed formula length: 82
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-8 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 ((NOT FIREABLE(t13) AND NOT FIREABLE(tsecond) AND FIREABLE(t5) AND NOT FIREABLE(t16))))
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(t13) AND NOT FIREABLE(tsecond) AND FIREABLE(t5) AND NOT FIREABLE(t16))))
lola: processed formula length: 92
lola: 4 rewrites

lola: closed formula file RefineWMG-PT-005-006-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(t13) AND NOT FIREABLE(tsecond) AND FIREABLE(t5) AND NOT FIREABLE(t16))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: Generated DNF with 36 literals and 6 conjunctive subformulas
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-15 TRUE 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: A (G ((FIREABLE(t8) OR FIREABLE(t6) OR FIREABLE(tsecond) OR ((FIREABLE(tsecond) OR FIREABLE(t16)) AND FIREABLE(t17)))))
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(t8) OR FIREABLE(t6) OR FIREABLE(tsecond) OR ((FIREABLE(tsecond) OR FIREABLE(t16)) AND FIREABLE(t17)))))
lola: processed formula length: 123
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t8) AND NOT FIREABLE(t6) AND NOT FIREABLE(tsecond) AND ((NOT FIREABLE(tsecond) AND NOT FIREABLE(t16)) OR NOT FIREABLE(t17)))
lola: state equation: Generated DNF with 44 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-10-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: 13 markings, 12 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-10 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: A (G ((FIREABLE(t15) OR FIREABLE(t18) OR NOT FIREABLE(t6) OR NOT FIREABLE(t12) OR (FIREABLE(t2) AND FIREABLE(t12) AND FIREABLE(t18)))))
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(t15) OR FIREABLE(t18) OR NOT FIREABLE(t6) OR NOT FIREABLE(t12) OR (FIREABLE(t2) AND FIREABLE(t12) AND FIREABLE(t18)))))
lola: processed formula length: 139
lola: 5 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: formula 0: (NOT FIREABLE(t15) AND NOT FIREABLE(t18) AND FIREABLE(t6) AND FIREABLE(t12) AND (NOT FIREABLE(t2) OR NOT FIREABLE(t12) OR NOT FIREABLE(t18)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
FORMULA RefineWMG-PT-005-006-ReachabilityFireability-6 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(t15) AND FIREABLE(t1) AND (FIREABLE(t3) OR FIREABLE(tsecond) OR FIREABLE(t10)) AND NOT FIREABLE(tsecond))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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(t15) AND FIREABLE(t1) AND (FIREABLE(t3) OR FIREABLE(tsecond) OR FIREABLE(t10)) AND NOT FIREABLE(tsecond))))
lola: processed formula length: 129
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t15) AND FIREABLE(t1) AND (FIREABLE(t3) OR FIREABLE(tsecond) OR FIREABLE(t10)) AND NOT FIREABLE(tsecond))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: Generated DNF with 38 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-12-0.sara
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-12 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(t2) AND FIREABLE(t18) AND (FIREABLE(t10) OR FIREABLE(t19)) AND FIREABLE(t5) AND (FIREABLE(t12) OR (NOT FIREABLE(t11) AND NOT 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(t2) AND FIREABLE(t18) AND (FIREABLE(t10) OR FIREABLE(t19)) AND FIREABLE(t5) AND (FIREABLE(t12) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t20))))))
lola: processed formula length: 161
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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) AND FIREABLE(t18) AND (FIREABLE(t10) OR FIREABLE(t19)) AND FIREABLE(t5) AND (FIREABLE(t12) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t20))))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: state equation: calling and running sara
10 markings, 9 edges
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-0 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(t13) AND FIREABLE(t12)) OR FIREABLE(t10)) AND (FIREABLE(t11) OR FIREABLE(t16)) AND NOT FIREABLE(t8) AND NOT FIREABLE(tprime) AND FIREABLE(t19))))
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(t13) AND FIREABLE(t12)) OR FIREABLE(t10)) AND (FIREABLE(t11) OR FIREABLE(t16)) AND NOT FIREABLE(t8) AND NOT FIREABLE(tprime) AND FIREABLE(t19))))
lola: processed formula length: 165
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: formula 0: (((FIREABLE(t13) AND FIREABLE(t12)) OR FIREABLE(t10)) AND (FIREABLE(t11) OR FIREABLE(t16)) AND NOT FIREABLE(t8) AND NOT FIREABLE(tprime) AND FIREABLE(t19))
lola: ========================================

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-5 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(t15) AND NOT FIREABLE(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(tsecond)) AND FIREABLE(t5) AND NOT FIREABLE(t10) AND FIREABLE(tsecond) AND (FIREABLE(t14) OR FIREABLE(t11)))))
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(t15) AND NOT FIREABLE(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(tsecond)) AND FIREABLE(t5) AND NOT FIREABLE(t10) AND FIREABLE(tsecond) AND (FIREABLE(t14) OR FIREABLE(t11)))))
lola: processed formula length: 197
lola: 4 rewrites
lola: closed formula file RefineWMG-PT-005-006-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(t15) AND NOT FIREABLE(t18) AND (NOT FIREABLE(t8) OR NOT FIREABLE(tsecond)) AND FIREABLE(t5) AND NOT FIREABLE(t10) AND FIREABLE(tsecond) AND (FIREABLE(t14) OR FIREABLE(t11)))
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-005-006-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-005-006-ReachabilityFireability-15-0.sara.

sara: try reading problem file RefineWMG-PT-005-006-ReachabilityFireability-13-0.sara.

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

FORMULA RefineWMG-PT-005-006-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no no yes no no no yes yes yes yes
lola:
preliminary result: yes no no yes yes yes no no yes no no no yes yes yes yes
lola: memory consumption: 14696 KB
lola: time consumption: 0 seconds

BK_STOP 1527822726171

--------------------
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="RefineWMG-PT-005006"
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/RefineWMG-PT-005006.tgz
mv RefineWMG-PT-005006 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 RefineWMG-PT-005006, 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 r280-csrt-152749170300657"
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 ;