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 220K
-rw-r--r-- 1 mcc users 3.2K May 30 20:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 20:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 13:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 13:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 28 09:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 28 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.4K May 28 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 27 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 27 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 54K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169400036
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527775386422

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-07b 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 DiscoveryGPU-PT-07b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DiscoveryGPU-PT-07b @ 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: 436/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 212
lola: finding significant places
lola: 212 places, 224 transitions, 203 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 263 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-07b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t158) AND FIREABLE(t133) AND FIREABLE(t156) AND NOT FIREABLE(t110) AND NOT FIREABLE(t81) AND NOT FIREABLE(t189)))) : E (F (FIREABLE(t132))) : E (F (((FIREABLE(t118) AND (FIREABLE(t51) OR FIREABLE(t189))) OR ((FIREABLE(t3) OR FIREABLE(t150)) AND FIREABLE(t132)) OR FIREABLE(t193) OR FIREABLE(t106)))) : E (F (((FIREABLE(t62) AND (NOT FIREABLE(t12) OR NOT FIREABLE(t106))) OR (FIREABLE(t216) AND FIREABLE(t223))))) : A (G (NOT FIREABLE(t186))) : A (G (NOT FIREABLE(t4))) : A (G ((NOT FIREABLE(t19) OR NOT FIREABLE(t4)))) : A (G (NOT FIREABLE(t24))) : E (F ((FIREABLE(t82) OR (FIREABLE(t189) AND FIREABLE(t221) AND FIREABLE(t194))))) : A (G (NOT FIREABLE(t216))) : E (F (FIREABLE(t66))) : A (G ((NOT FIREABLE(t69) OR (NOT FIREABLE(t69) AND NOT FIREABLE(t9)) OR FIREABLE(t158)))) : E (F ((NOT FIREABLE(t109) AND FIREABLE(t42) AND FIREABLE(t122) AND FIREABLE(t74) AND FIREABLE(t7) AND (FIREABLE(t214) OR NOT FIREABLE(t126) OR (FIREABLE(t161) AND FIREABLE(t112)) OR FIREABLE(t189))))) : A (G (NOT FIREABLE(t208))) : E (F ((FIREABLE(t187) AND FIREABLE(t148)))) : A (G ((NOT FIREABLE(t155) OR NOT FIREABLE(t95))))
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(t132)))
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(t132)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t132)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t186)))
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(t186)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t186)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t4)))
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(t4)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-2-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: 18 markings, 17 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t24)))
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(t24)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t24)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t216)))
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(t216)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t216)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: calling and running sara
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-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: 42 markings, 41 edges
lola: ========================================
sara: try reading problem file DiscoveryGPU-PT-07b-ReachabilityFireability-3-0.sara.

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t66)))
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(t66)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t66)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t208)))
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(t208)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t208)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-6-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t19) OR NOT FIREABLE(t4))))
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(t19) OR NOT FIREABLE(t4))))
lola: processed formula length: 48
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t19) AND FIREABLE(t4))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-7-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: 39 markings, 41 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t187) AND FIREABLE(t148))))
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(t187) AND FIREABLE(t148))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t187) AND FIREABLE(t148))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-07b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 57 markings, 56 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-14 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: A (G ((NOT FIREABLE(t155) OR NOT FIREABLE(t95))))
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(t155) OR NOT FIREABLE(t95))))
lola: processed formula length: 50
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t155) AND FIREABLE(t95))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t69) OR (NOT FIREABLE(t69) AND NOT FIREABLE(t9)) OR FIREABLE(t158))))
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(t69) OR (NOT FIREABLE(t69) AND NOT FIREABLE(t9)) OR FIREABLE(t158))))
lola: processed formula length: 91
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t69) AND (FIREABLE(t69) OR FIREABLE(t9)) AND NOT FIREABLE(t158))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t82) OR (FIREABLE(t189) AND FIREABLE(t221) AND FIREABLE(t194)))))
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(t82) OR (FIREABLE(t189) AND FIREABLE(t221) AND FIREABLE(t194)))))
lola: processed formula length: 82
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t82) OR (FIREABLE(t189) AND FIREABLE(t221) AND FIREABLE(t194)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t62) AND (NOT FIREABLE(t12) OR NOT FIREABLE(t106))) OR (FIREABLE(t216) AND FIREABLE(t223)))))
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(t62) AND (NOT FIREABLE(t12) OR NOT FIREABLE(t106))) OR (FIREABLE(t216) AND FIREABLE(t223)))))
lola: processed formula length: 112
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t62) AND (NOT FIREABLE(t12) OR NOT FIREABLE(t106))) OR (FIREABLE(t216) AND FIREABLE(t223)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-12-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: 31 markings, 30 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-3 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(t158) AND FIREABLE(t133) AND FIREABLE(t156) AND NOT FIREABLE(t110) AND NOT FIREABLE(t81) AND NOT FIREABLE(t189))))
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(t158) AND FIREABLE(t133) AND FIREABLE(t156) AND NOT FIREABLE(t110) AND NOT FIREABLE(t81) AND NOT FIREABLE(t189))))
lola: processed formula length: 130
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t158) AND FIREABLE(t133) AND FIREABLE(t156) AND NOT FIREABLE(t110) AND NOT FIREABLE(t81) AND NOT FIREABLE(t189))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-07b-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-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(t118) AND (FIREABLE(t51) OR FIREABLE(t189))) OR ((FIREABLE(t3) OR FIREABLE(t150)) AND FIREABLE(t132)) OR FIREABLE(t193) OR FIREABLE(t106))))
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(t118) AND (FIREABLE(t51) OR FIREABLE(t189))) OR ((FIREABLE(t3) OR FIREABLE(t150)) AND FIREABLE(t132)) OR FIREABLE(t193) OR FIREABLE(t106))))
lola: processed formula length: 162
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t118) AND (FIREABLE(t51) OR FIREABLE(t189))) OR ((FIREABLE(t3) OR FIREABLE(t150)) AND FIREABLE(t132)) OR FIREABLE(t193) OR FIREABLE(t106))
lola: state equation: Generated DNF with 13 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-07b-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-2 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(t109) AND FIREABLE(t42) AND FIREABLE(t122) AND FIREABLE(t74) AND FIREABLE(t7) AND (FIREABLE(t214) OR NOT FIREABLE(t126) OR (FIREABLE(t161) AND FIREABLE(t112)) OR FIREABLE(t189)))))
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(t109) AND FIREABLE(t42) AND FIREABLE(t122) AND FIREABLE(t74) AND FIREABLE(t7) AND (FIREABLE(t214) OR NOT FIREABLE(t126) OR (FIREABLE(t161) AND FIREABLE(t112)) OR FIREABLE(t189)))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-07b-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(t109) AND FIREABLE(t42) AND FIREABLE(t122) AND FIREABLE(t74) AND FIREABLE(t7) AND (FIREABLE(t214) OR NOT FIREABLE(t126) OR (FIREABLE(t161) AND FIREABLE(t112)) OR FIREABLE(t189)))
lola: state equation: Generated DNF with 27 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-07b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-07b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes no yes no no no yes no
lola:
preliminary result: yes yes yes yes no no no no yes no yes no no no yes no
lola: memory consumption: 14880 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DiscoveryGPU-PT-07b"
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/DiscoveryGPU-PT-07b.tgz
mv DiscoveryGPU-PT-07b 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 DiscoveryGPU-PT-07b, 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-152749169400036"
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 ;