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 196K
-rw-r--r-- 1 mcc users 3.3K May 30 20:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 20:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 13:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 13:51 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.5K May 28 09:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.0K May 28 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.8K May 27 03:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:32 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 22K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-06a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169400009
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527775357134

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-06a 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-06a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DiscoveryGPU-PT-06a @ 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: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 63
lola: finding significant places
lola: 63 places, 85 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 106 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-06a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t2) AND FIREABLE(t72) AND NOT FIREABLE(t15)))) : A (G ((FIREABLE(t3) OR NOT FIREABLE(t66) OR (((FIREABLE(t5) AND FIREABLE(t7)) OR (FIREABLE(t14) AND FIREABLE(t8))) AND (FIREABLE(t27) OR FIREABLE(t56) OR FIREABLE(t75)))))) : A (G ((NOT FIREABLE(t63) OR NOT FIREABLE(t10)))) : E (F ((NOT FIREABLE(t67) AND FIREABLE(t5) AND FIREABLE(t80) AND (FIREABLE(t64) OR FIREABLE(t40) OR (FIREABLE(t4)))))) : E (F (((FIREABLE(t34) OR FIREABLE(t4)) AND FIREABLE(t3) AND FIREABLE(t31) AND FIREABLE(t77) AND FIREABLE(t31)))) : E (F ((FIREABLE(t20) AND FIREABLE(t68) AND (FIREABLE(t2) OR FIREABLE(t73) OR FIREABLE(t56) OR FIREABLE(t43))))) : E (F ((FIREABLE(t9) AND FIREABLE(t32) AND (FIREABLE(t10) OR FIREABLE(t73)) AND NOT FIREABLE(t61) AND (FIREABLE(t69) OR FIREABLE(t66))))) : A (G ((NOT FIREABLE(t22) OR NOT FIREABLE(t75)))) : E (F ((FIREABLE(t75) AND FIREABLE(t77) AND NOT FIREABLE(t20)))) : E (F (((FIREABLE(t68) OR FIREABLE(t75)) AND (FIREABLE(t2) OR FIREABLE(t34))))) : A (G ((NOT FIREABLE(t75) OR (NOT FIREABLE(t21) AND NOT FIREABLE(t27))))) : E (F (((FIREABLE(t53) AND FIREABLE(t64) AND FIREABLE(t17) AND FIREABLE(t63)) OR (FIREABLE(t4) AND FIREABLE(t74) AND FIREABLE(t81) AND NOT FIREABLE(t48) AND NOT FIREABLE(t58))))) : E (F ((FIREABLE(t13) AND (FIREABLE(t29) OR FIREABLE(t52))))) : A (G ((FIREABLE(t8) OR FIREABLE(t57) OR NOT FIREABLE(t37) OR NOT FIREABLE(t64) OR NOT FIREABLE(t4)))) : E (F (FIREABLE(t68))) : E (F ((FIREABLE(t49) AND (NOT FIREABLE(t62) OR NOT FIREABLE(t34)) AND FIREABLE(t7) AND NOT FIREABLE(t79) AND (FIREABLE(t2) OR FIREABLE(t59)) AND NOT FIREABLE(t27))))
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(t68)))
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(t68)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t68)
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: 10 markings, 9 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-14 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(t22) OR NOT FIREABLE(t75))))
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(t22) OR NOT FIREABLE(t75))))
lola: processed formula length: 49
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t22) AND FIREABLE(t75))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-06a-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

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

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

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-2 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: E (F ((FIREABLE(t75) AND FIREABLE(t77) 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(t75) AND FIREABLE(t77) AND NOT FIREABLE(t20))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t75) AND FIREABLE(t77) AND NOT FIREABLE(t20))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-06a-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-8 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: A (G ((NOT FIREABLE(t75) OR (NOT FIREABLE(t21) AND NOT FIREABLE(t27)))))
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(t75) OR (NOT FIREABLE(t21) AND NOT FIREABLE(t27)))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t75) AND (FIREABLE(t21) OR FIREABLE(t27)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola:
FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t13) AND (FIREABLE(t29) OR FIREABLE(t52)))))
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(t29) OR FIREABLE(t52)))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t13) AND (FIREABLE(t29) OR FIREABLE(t52)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-12 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: E (F ((FIREABLE(t2) AND FIREABLE(t72) AND NOT FIREABLE(t15))))
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(t72) AND NOT FIREABLE(t15))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t72) AND NOT FIREABLE(t15))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-6-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: sara: try reading problem file DiscoveryGPU-PT-06a-ReachabilityFireability-6-0.sara.
result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola:
FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-0 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(t68) OR FIREABLE(t75)) AND (FIREABLE(t2) OR FIREABLE(t34)))))
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(t68) OR FIREABLE(t75)) AND (FIREABLE(t2) OR FIREABLE(t34)))))
lola: processed formula length: 80
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t68) OR FIREABLE(t75)) AND (FIREABLE(t2) OR FIREABLE(t34)))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
sara: place or transition ordering is non-deterministic


FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t8) OR FIREABLE(t57) OR NOT FIREABLE(t37) OR NOT FIREABLE(t64) 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 ((FIREABLE(t8) OR FIREABLE(t57) OR NOT FIREABLE(t37) OR NOT FIREABLE(t64) OR NOT FIREABLE(t4))))
lola: processed formula length: 105
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t57) AND FIREABLE(t37) AND FIREABLE(t64) AND FIREABLE(t4))
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t34) OR FIREABLE(t4)) AND FIREABLE(t3) AND FIREABLE(t31) AND FIREABLE(t77) AND FIREABLE(t31))))
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(t34) OR FIREABLE(t4)) AND FIREABLE(t3) AND FIREABLE(t31) AND FIREABLE(t77) AND FIREABLE(t31))))
lola: processed formula length: 113
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t34) OR FIREABLE(t4)) AND FIREABLE(t3) AND FIREABLE(t31) AND FIREABLE(t77) AND FIREABLE(t31))
lola: state equation: Generated DNF with 15 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-06a-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t20) AND FIREABLE(t68) AND (FIREABLE(t2) OR FIREABLE(t73) OR FIREABLE(t56) OR FIREABLE(t43)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t20) AND FIREABLE(t68) AND (FIREABLE(t2) OR FIREABLE(t73) OR FIREABLE(t56) OR FIREABLE(t43)))))
lola: processed formula length: 114
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: 16 markings, 15 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-5 TRUE 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 ((NOT FIREABLE(t67) AND FIREABLE(t5) AND FIREABLE(t80) AND (FIREABLE(t64) OR FIREABLE(t40) OR (FIREABLE(t4))))))
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(t67) AND FIREABLE(t5) AND FIREABLE(t80) AND (FIREABLE(t64) OR FIREABLE(t40) OR (FIREABLE(t4))))))
lola: processed formula length: 119
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t67) AND FIREABLE(t5) AND FIREABLE(t80) AND (FIREABLE(t64) OR FIREABLE(t40) OR (FIREABLE(t4))))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-06a-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-3 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(t9) AND FIREABLE(t32) AND (FIREABLE(t10) OR FIREABLE(t73)) AND NOT FIREABLE(t61) AND (FIREABLE(t69) OR 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(t9) AND FIREABLE(t32) AND (FIREABLE(t10) OR FIREABLE(t73)) AND NOT FIREABLE(t61) AND (FIREABLE(t69) OR FIREABLE(t66)))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: state equation 0: solution produced
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t9) AND FIREABLE(t32) AND (FIREABLE(t10) OR FIREABLE(t73)) AND NOT FIREABLE(t61) AND (FIREABLE(t69) OR FIREABLE(t66)))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-06a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-6 FALSE 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(t49) AND (NOT FIREABLE(t62) OR NOT FIREABLE(t34)) AND FIREABLE(t7) AND NOT FIREABLE(t79) AND (FIREABLE(t2) OR FIREABLE(t59)) AND NOT FIREABLE(t27))))
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(t49) AND (NOT FIREABLE(t62) OR NOT FIREABLE(t34)) AND FIREABLE(t7) AND NOT FIREABLE(t79) AND (FIREABLE(t2) OR FIREABLE(t59)) AND NOT FIREABLE(t27))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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(t49) AND (NOT FIREABLE(t62) OR NOT FIREABLE(t34)) AND FIREABLE(t7) AND NOT FIREABLE(t79) AND (FIREABLE(t2) OR FIREABLE(t59)) AND NOT FIREABLE(t27))
lola: state equation: Generated DNF with 90 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-06a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-15 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: A (G ((FIREABLE(t3) OR NOT FIREABLE(t66) OR (((FIREABLE(t5) AND FIREABLE(t7)) OR (FIREABLE(t14) AND FIREABLE(t8))) AND (FIREABLE(t27) OR FIREABLE(t56) OR FIREABLE(t75))))))
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) OR NOT FIREABLE(t66) OR (((FIREABLE(t5) AND FIREABLE(t7)) OR (FIREABLE(t14) AND FIREABLE(t8))) AND (FIREABLE(t27) OR FIREABLE(t56) OR FIREABLE(t75))))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: 10 markings, 9 edges
lola: formula 0: (NOT FIREABLE(t3) AND FIREABLE(t66) AND (((NOT FIREABLE(t5) OR NOT FIREABLE(t7)) AND (NOT FIREABLE(t14) OR NOT FIREABLE(t8))) OR (NOT FIREABLE(t27) AND NOT FIREABLE(t56) AND NOT FIREABLE(t75))))
lola: ========================================
lola: state equation: Generated DNF with 32 literals and 6 conjunctive subformulas

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-1 FALSE 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 (((FIREABLE(t53) AND FIREABLE(t64) AND FIREABLE(t17) AND FIREABLE(t63)) OR (FIREABLE(t4) AND FIREABLE(t74) AND FIREABLE(t81) AND NOT FIREABLE(t48) AND NOT FIREABLE(t58)))))
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(t53) AND FIREABLE(t64) AND FIREABLE(t17) AND FIREABLE(t63)) OR (FIREABLE(t4) AND FIREABLE(t74) AND FIREABLE(t81) AND NOT FIREABLE(t48) AND NOT FIREABLE(t58)))))
lola: processed formula length: 178
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-06a-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: 40 markings, 39 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-06a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes no yes yes yes no yes yes no yes yes
lola:
preliminary result: yes no no yes no yes no yes yes yes no yes yes no yes yes
lola: memory consumption: 14604 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-06a"
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-06a.tgz
mv DiscoveryGPU-PT-06a 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-06a, 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-152749169400009"
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 ;