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 212K
-rw-r--r-- 1 mcc users 3.2K May 30 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:30 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.4K May 28 09:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 28 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 06:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:13 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:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:37 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 39K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-11a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169500099
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527778679915

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-11a 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-11a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DiscoveryGPU-PT-11a @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 268/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 113
lola: finding significant places
lola: 113 places, 155 transitions, 111 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 191 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-11a-ReachabilityFireability.task
lola: E (F (FIREABLE(t41))) : A (G ((FIREABLE(t19) OR FIREABLE(t105) OR FIREABLE(t86) OR FIREABLE(t104) OR NOT FIREABLE(t141) OR ((FIREABLE(t4) OR FIREABLE(t87) OR (FIREABLE(t71) AND FIREABLE(t27))) AND FIREABLE(t53))))) : E (F (((NOT FIREABLE(t1) OR NOT FIREABLE(t57)) AND FIREABLE(t53) AND FIREABLE(t143)))) : A (G (((NOT FIREABLE(t131) AND NOT FIREABLE(t105)) OR (FIREABLE(t72) AND NOT FIREABLE(t149)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t85) AND (NOT FIREABLE(t88) OR NOT FIREABLE(t152)))))) : E (F (FIREABLE(t147))) : E (F ((FIREABLE(t23) AND FIREABLE(t89) AND NOT FIREABLE(t16) AND NOT FIREABLE(t152) AND (NOT FIREABLE(t35) OR NOT FIREABLE(t132) OR FIREABLE(t12))))) : E (F (FIREABLE(t22))) : A (G (NOT FIREABLE(t59))) : A (G ((FIREABLE(t64) OR (FIREABLE(t81)) OR FIREABLE(t33) OR FIREABLE(t88) OR FIREABLE(t93) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t60))))) : A (G (((NOT FIREABLE(t67) AND NOT FIREABLE(t129)) OR FIREABLE(t5) OR NOT FIREABLE(t120)))) : A (G (((((FIREABLE(t0) AND FIREABLE(t25)) OR NOT FIREABLE(t61)) AND FIREABLE(t100)) OR ((NOT FIREABLE(t38) OR NOT FIREABLE(t76)) AND NOT FIREABLE(t136))))) : A (G ((NOT FIREABLE(t34) OR NOT FIREABLE(t146) OR FIREABLE(t57) OR ((FIREABLE(t15) OR FIREABLE(t131)) AND FIREABLE(t74) AND ((FIREABLE(t152) AND FIREABLE(t103)) OR FIREABLE(t139)))))) : E (F ((((FIREABLE(t124) OR FIREABLE(t30)) AND FIREABLE(t66) AND (FIREABLE(t1) OR FIREABLE(t58) OR (FIREABLE(t41) AND FIREABLE(t44)))) OR FIREABLE(t7)))) : E (F (((FIREABLE(t5) OR FIREABLE(t30)) AND (FIREABLE(t32) OR FIREABLE(t58) OR NOT FIREABLE(t69)) AND FIREABLE(t52) AND FIREABLE(t53)))) : E (F (FIREABLE(t109))) : A (G ((NOT FIREABLE(t147) OR NOT FIREABLE(t35) OR FIREABLE(t133) OR FIREABLE(t154))))
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(t41)))
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(t41)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t41)
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: 8 markings, 7 edges
lola: ========================================

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

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

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-6 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(t59)))
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(t59)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t59)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-3-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-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: E (F (FIREABLE(t109)))
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(t109)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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
sara: try reading problem file DiscoveryGPU-PT-11a-ReachabilityFireability-2-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t109)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-4-0.sara
lola: 7 markings, 6 edges

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t67) AND NOT FIREABLE(t129)) OR FIREABLE(t5) OR NOT FIREABLE(t120))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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(t67) AND NOT FIREABLE(t129)) OR FIREABLE(t5) OR NOT FIREABLE(t120))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t67) OR FIREABLE(t129)) AND NOT FIREABLE(t5) AND FIREABLE(t120))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-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: 10 markings, 9 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file DiscoveryGPU-PT-11a-ReachabilityFireability-4-0.sara.
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: ...considering subproblem: E (F (((NOT FIREABLE(t1) OR NOT FIREABLE(t57)) AND FIREABLE(t53) AND FIREABLE(t143))))
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(t1) OR NOT FIREABLE(t57)) AND FIREABLE(t53) AND FIREABLE(t143))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t1) OR NOT FIREABLE(t57)) AND FIREABLE(t53) AND FIREABLE(t143))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t147) OR NOT FIREABLE(t35) OR FIREABLE(t133) OR FIREABLE(t154))))
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(t147) OR NOT FIREABLE(t35) OR FIREABLE(t133) OR FIREABLE(t154))))
lola: processed formula length: 88
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t147) AND FIREABLE(t35) AND NOT FIREABLE(t133) AND NOT FIREABLE(t154))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-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: 17 markings, 16 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-15 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: A (G (((((FIREABLE(t0) AND FIREABLE(t25)) OR NOT FIREABLE(t61)) AND FIREABLE(t100)) OR ((NOT FIREABLE(t38) OR NOT FIREABLE(t76)) AND NOT FIREABLE(t136)))))
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(t0) AND FIREABLE(t25)) OR NOT FIREABLE(t61)) AND FIREABLE(t100)) OR ((NOT FIREABLE(t38) OR NOT FIREABLE(t76)) AND NOT FIREABLE(t136)))))
lola: processed formula length: 158
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t0) OR NOT FIREABLE(t25)) AND FIREABLE(t61)) OR NOT FIREABLE(t100)) AND ((FIREABLE(t38) AND FIREABLE(t76)) OR FIREABLE(t136)))
lola: state equation: Generated DNF with 31 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
state equation: calling and running sara
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file DiscoveryGPU-PT-11a-ReachabilityFireability-8-0.sara.
lola: ...considering subproblem: E (F (((FIREABLE(t5) OR FIREABLE(t30)) AND (FIREABLE(t32) OR FIREABLE(t58) OR NOT FIREABLE(t69)) AND FIREABLE(t52) AND FIREABLE(t53))))
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(t5) OR FIREABLE(t30)) AND (FIREABLE(t32) OR FIREABLE(t58) OR NOT FIREABLE(t69)) AND FIREABLE(t52) AND FIREABLE(t53))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t5) OR FIREABLE(t30)) AND (FIREABLE(t32) OR FIREABLE(t58) OR NOT FIREABLE(t69)) AND FIREABLE(t52) AND FIREABLE(t53))
lola: state equation: Generated DNF with 50 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-11a-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
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-11a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t64) OR (FIREABLE(t81)) OR FIREABLE(t33) OR FIREABLE(t88) OR FIREABLE(t93) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t60)))))
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(t64) OR (FIREABLE(t81)) OR FIREABLE(t33) OR FIREABLE(t88) OR FIREABLE(t93) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t60)))))
lola: processed formula length: 144
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t64) AND (NOT FIREABLE(t81)) AND NOT FIREABLE(t33) AND NOT FIREABLE(t88) AND NOT FIREABLE(t93) AND (FIREABLE(t140) OR FIREABLE(t60)))
lola: state equation: Generated DNF with 152 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t23) AND FIREABLE(t89) AND NOT FIREABLE(t16) AND NOT FIREABLE(t152) AND (NOT FIREABLE(t35) OR NOT FIREABLE(t132) OR 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(t23) AND FIREABLE(t89) AND NOT FIREABLE(t16) AND NOT FIREABLE(t152) AND (NOT FIREABLE(t35) OR NOT FIREABLE(t132) OR FIREABLE(t12)))))
lola: processed formula length: 151
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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
sara: try reading problem file DiscoveryGPU-PT-11a-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t23) AND FIREABLE(t89) AND NOT FIREABLE(t16) AND NOT FIREABLE(t152) AND (NOT FIREABLE(t35) OR NOT FIREABLE(t132) OR FIREABLE(t12)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-5 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(t124) OR FIREABLE(t30)) AND FIREABLE(t66) AND (FIREABLE(t1) OR FIREABLE(t58) OR (FIREABLE(t41) AND FIREABLE(t44)))) OR FIREABLE(t7))))
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(t124) OR FIREABLE(t30)) AND FIREABLE(t66) AND (FIREABLE(t1) OR FIREABLE(t58) OR (FIREABLE(t41) AND FIREABLE(t44)))) OR FIREABLE(t7))))
lola: processed formula length: 156
lola: 1 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t124) OR FIREABLE(t30)) AND FIREABLE(t66) AND (FIREABLE(t1) OR FIREABLE(t58) OR (FIREABLE(t41) AND FIREABLE(t44)))) OR FIREABLE(t7))
lola: state equation: Generated DNF with 36 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-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: 23 markings, 22 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t131) AND NOT FIREABLE(t105)) OR (FIREABLE(t72) AND NOT FIREABLE(t149)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t85) AND (NOT FIREABLE(t88) OR NOT FIREABLE(t152))))))
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(t131) AND NOT FIREABLE(t105)) OR (FIREABLE(t72) AND NOT FIREABLE(t149)) OR (NOT FIREABLE(t132) AND NOT FIREABLE(t85) AND (NOT FIREABLE(t88) OR NOT FIREABLE(t152))))))
lola: processed formula length: 190
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t131) OR FIREABLE(t105)) AND (NOT FIREABLE(t72) OR FIREABLE(t149)) AND (FIREABLE(t132) OR FIREABLE(t85) OR (FIREABLE(t88) AND FIREABLE(t152))))
lola: state equation: Generated DNF with 64 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-13-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: 10 markings, 9 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t34) OR NOT FIREABLE(t146) OR FIREABLE(t57) OR ((FIREABLE(t15) OR FIREABLE(t131)) AND FIREABLE(t74) AND ((FIREABLE(t152) AND FIREABLE(t103)) OR FIREABLE(t139))))))
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(t34) OR NOT FIREABLE(t146) OR FIREABLE(t57) OR ((FIREABLE(t15) OR FIREABLE(t131)) AND FIREABLE(t74) AND ((FIREABLE(t152) AND FIREABLE(t103)) OR FIREABLE(t139))))))
lola: processed formula length: 188
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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(t34) AND FIREABLE(t146) AND NOT FIREABLE(t57) AND ((NOT FIREABLE(t15) AND NOT FIREABLE(t131)) OR NOT FIREABLE(t74) OR ((NOT FIREABLE(t152) OR NOT FIREABLE(t103)) AND NOT FIREABLE(t139))))
lola: state equation: Generated DNF with 40 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-11a-ReachabilityFireability-14-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 DiscoveryGPU-PT-11a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t19) OR FIREABLE(t105) OR FIREABLE(t86) OR FIREABLE(t104) OR NOT FIREABLE(t141) OR ((FIREABLE(t4) OR FIREABLE(t87) OR (FIREABLE(t71) AND FIREABLE(t27))) AND FIREABLE(t53)))))
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(t19) OR FIREABLE(t105) OR FIREABLE(t86) OR FIREABLE(t104) OR NOT FIREABLE(t141) OR ((FIREABLE(t4) OR FIREABLE(t87) OR (FIREABLE(t71) AND FIREABLE(t27))) AND FIREABLE(t53)))))
lola: processed formula length: 197
lola: 2 rewrites
lola: closed formula file DiscoveryGPU-PT-11a-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: 23 markings, 22 edges
lola: formula 0: (NOT FIREABLE(t19) AND NOT FIREABLE(t105) AND NOT FIREABLE(t86) AND NOT FIREABLE(t104) AND FIREABLE(t141) AND ((NOT FIREABLE(t4) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t71) OR NOT FIREABLE(t27))) OR NOT FIREABLE(t53)))
lola: ========================================

FORMULA DiscoveryGPU-PT-11a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes no no no no no yes no yes no
lola:
preliminary result: yes no yes no yes yes yes no no no no no yes no yes no
lola: memory consumption: 14732 KB
lola: time consumption: 0 seconds


BK_STOP 1527778680335

--------------------
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-11a"
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-11a.tgz
mv DiscoveryGPU-PT-11a 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-11a, 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-152749169500099"
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 ;