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 200K
-rw-r--r-- 1 mcc users 3.4K May 30 20:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 30 20:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:12 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.2K May 28 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 28 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 28 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.0K May 28 06:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 28 06:10 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.7K May 27 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 03:35 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 32K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169400063
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527775416052

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-09a 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-09a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DiscoveryGPU-PT-09a @ 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: 220/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 93
lola: finding significant places
lola: 93 places, 127 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 157 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-09a-ReachabilityFireability.task
lola: E (F ((FIREABLE(t107) AND FIREABLE(t102)))) : E (F ((FIREABLE(t38) AND FIREABLE(t84) AND NOT FIREABLE(t65) AND NOT FIREABLE(t115) AND NOT FIREABLE(t72) AND NOT FIREABLE(t77) AND NOT FIREABLE(t70) AND FIREABLE(t84)))) : E (F ((FIREABLE(t31) AND FIREABLE(t93) AND (NOT FIREABLE(t109) OR NOT FIREABLE(t78) OR FIREABLE(t15) OR FIREABLE(t17) OR NOT FIREABLE(t11))))) : A (G ((NOT FIREABLE(t49) OR (NOT FIREABLE(t45) AND NOT FIREABLE(t3) AND NOT FIREABLE(t101))))) : A (G ((NOT FIREABLE(t115) OR NOT FIREABLE(t119) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t55)) OR NOT FIREABLE(t126)))) : A (G ((NOT FIREABLE(t26) OR FIREABLE(t64) OR FIREABLE(t14)))) : E (F (((FIREABLE(t34) OR FIREABLE(t44)) AND NOT FIREABLE(t12) AND FIREABLE(t107) AND (NOT FIREABLE(t126) OR NOT FIREABLE(t59) OR NOT FIREABLE(t69) OR (FIREABLE(t82) AND FIREABLE(t94)))))) : E (F (FIREABLE(t42))) : E (F (((((FIREABLE(t27) OR FIREABLE(t102)) AND FIREABLE(t62)) OR NOT FIREABLE(t73)) AND (FIREABLE(t52) OR FIREABLE(t17) OR ((FIREABLE(t126) OR FIREABLE(t110)) AND FIREABLE(t33)))))) : E (F ((FIREABLE(t112) AND FIREABLE(t126)))) : E (F (((FIREABLE(t90) AND FIREABLE(t92)) OR FIREABLE(t48)))) : E (F ((FIREABLE(t96) AND FIREABLE(t121) AND FIREABLE(t98) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t108) AND FIREABLE(t75)) OR FIREABLE(t9))))) : A (G ((NOT FIREABLE(t51) OR NOT FIREABLE(t82) OR (NOT FIREABLE(t20) AND NOT FIREABLE(t121)) OR NOT FIREABLE(t81)))) : E (F (())) : E (F (FIREABLE(t119))) : E (F ((FIREABLE(t123) AND FIREABLE(t14) AND FIREABLE(t66))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

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

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

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t112) AND FIREABLE(t126))))
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(t112) AND FIREABLE(t126))))
lola: processed formula length: 43
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t112) AND FIREABLE(t126))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-4-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-09a-ReachabilityFireability-9 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(t26) OR FIREABLE(t64) OR FIREABLE(t14))))
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(t26) OR FIREABLE(t64) OR FIREABLE(t14))))
lola: processed formula length: 63
lola: 5 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t26) AND NOT FIREABLE(t64) AND NOT FIREABLE(t14))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-5-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file DiscoveryGPU-PT-09a-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t90) AND FIREABLE(t92)) OR FIREABLE(t48))))
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(t90) AND FIREABLE(t92)) OR FIREABLE(t48))))
lola: processed formula length: 61
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: formula 0: ((FIREABLE(t90) AND FIREABLE(t92)) OR FIREABLE(t48))
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-10 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(t123) AND FIREABLE(t14) AND 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(t123) AND FIREABLE(t14) AND FIREABLE(t66))))
lola: processed formula length: 60
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t123) AND FIREABLE(t14) AND FIREABLE(t66))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-7-0.sara

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

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-15 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 ((NOT FIREABLE(t49) OR (NOT FIREABLE(t45) AND NOT FIREABLE(t3) AND NOT FIREABLE(t101)))))
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(t49) OR (NOT FIREABLE(t45) AND NOT FIREABLE(t3) AND NOT FIREABLE(t101)))))
lola: processed formula length: 95
lola: 5 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t49) AND (FIREABLE(t45) OR FIREABLE(t3) OR FIREABLE(t101)))
lola: state equation: Generated DNF with 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-8-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: 11 markings, 10 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-3 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: A (G ((NOT FIREABLE(t51) OR NOT FIREABLE(t82) OR (NOT FIREABLE(t20) AND NOT FIREABLE(t121)) OR NOT FIREABLE(t81))))
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(t51) OR NOT FIREABLE(t82) OR (NOT FIREABLE(t20) AND NOT FIREABLE(t121)) OR NOT FIREABLE(t81))))
lola: processed formula length: 118
lola: 5 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t51) AND FIREABLE(t82) AND (FIREABLE(t20) OR FIREABLE(t121)) AND FIREABLE(t81))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-09a-ReachabilityFireability-9-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-09a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t115) OR NOT FIREABLE(t119) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t55)) OR NOT FIREABLE(t126))))
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(t115) OR NOT FIREABLE(t119) OR (NOT FIREABLE(t0) AND NOT FIREABLE(t55)) OR NOT FIREABLE(t126))))
lola: processed formula length: 119
lola: 5 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t115) AND FIREABLE(t119) AND (FIREABLE(t0) OR FIREABLE(t55)) AND FIREABLE(t126))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-4 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 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t31) AND FIREABLE(t93) AND (NOT FIREABLE(t109) OR NOT FIREABLE(t78) OR FIREABLE(t15) OR FIREABLE(t17) OR NOT FIREABLE(t11)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t31) AND FIREABLE(t93) AND (NOT FIREABLE(t109) OR NOT FIREABLE(t78) OR FIREABLE(t15) OR FIREABLE(t17) OR NOT FIREABLE(t11)))))
lola: processed formula length: 146
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t31) AND FIREABLE(t93) AND (NOT FIREABLE(t109) OR NOT FIREABLE(t78) OR FIREABLE(t15) OR FIREABLE(t17) OR NOT FIREABLE(t11)))
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-09a-ReachabilityFireability-10-0.sara.
sara: try reading problem file DiscoveryGPU-PT-09a-ReachabilityFireability-11-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.

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t96) AND FIREABLE(t121) AND FIREABLE(t98) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t108) AND FIREABLE(t75)) OR FIREABLE(t9)))))
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(t96) AND FIREABLE(t121) AND FIREABLE(t98) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t108) AND FIREABLE(t75)) OR FIREABLE(t9)))))
lola: processed formula length: 144
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t96) AND FIREABLE(t121) AND FIREABLE(t98) AND NOT FIREABLE(t48) AND ((NOT FIREABLE(t108) AND FIREABLE(t75)) OR FIREABLE(t9)))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-09a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-11 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(t38) AND FIREABLE(t84) AND NOT FIREABLE(t65) AND NOT FIREABLE(t115) AND NOT FIREABLE(t72) AND NOT FIREABLE(t77) AND NOT FIREABLE(t70) AND FIREABLE(t84))))
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(t38) AND FIREABLE(t84) AND NOT FIREABLE(t65) AND NOT FIREABLE(t115) AND NOT FIREABLE(t72) AND NOT FIREABLE(t77) AND NOT FIREABLE(t70) AND FIREABLE(t84))))
lola: processed formula length: 170
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t38) AND FIREABLE(t84) AND NOT FIREABLE(t65) AND NOT FIREABLE(t115) AND NOT FIREABLE(t72) AND NOT FIREABLE(t77) AND NOT FIREABLE(t70) AND FIREABLE(t84))
lola: state equation: Generated DNF with 11 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DiscoveryGPU-PT-09a-ReachabilityFireability-13-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-09a-ReachabilityFireability-1 FALSE 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(t27) OR FIREABLE(t102)) AND FIREABLE(t62)) OR NOT FIREABLE(t73)) AND (FIREABLE(t52) OR FIREABLE(t17) OR ((FIREABLE(t126) OR FIREABLE(t110)) AND FIREABLE(t33))))))
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(t27) OR FIREABLE(t102)) AND FIREABLE(t62)) OR NOT FIREABLE(t73)) AND (FIREABLE(t52) OR FIREABLE(t17) OR ((FIREABLE(t126) OR FIREABLE(t110)) AND FIREABLE(t33))))))
lola: processed formula length: 186
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t27) OR FIREABLE(t102)) AND FIREABLE(t62)) OR NOT FIREABLE(t73)) AND (FIREABLE(t52) OR FIREABLE(t17) OR ((FIREABLE(t126) OR FIREABLE(t110)) AND FIREABLE(t33))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 72 literals and 16 conjunctive subformulas
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to DiscoveryGPU-PT-09a-ReachabilityFireability-14-0.sara
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-8 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 (((FIREABLE(t34) OR FIREABLE(t44)) AND NOT FIREABLE(t12) AND FIREABLE(t107) AND (NOT FIREABLE(t126) OR NOT FIREABLE(t59) OR NOT FIREABLE(t69) OR (FIREABLE(t82) AND FIREABLE(t94))))))
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(t44)) AND NOT FIREABLE(t12) AND FIREABLE(t107) AND (NOT FIREABLE(t126) OR NOT FIREABLE(t59) OR NOT FIREABLE(t69) OR (FIREABLE(t82) AND FIREABLE(t94))))))
lola: processed formula length: 191
lola: 4 rewrites
lola: closed formula file DiscoveryGPU-PT-09a-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(t44)) AND NOT FIREABLE(t12) AND FIREABLE(t107) AND (NOT FIREABLE(t126) OR NOT FIREABLE(t59) OR NOT FIREABLE(t69) OR (FIREABLE(t82) AND FIREABLE(t94))))
lola: state equation: Generated DNF with 54 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-09a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no no yes yes yes yes yes yes yes no yes yes
lola:
preliminary result: yes no no no no no yes yes yes yes yes yes yes no yes yes
lola: memory consumption: 14604 KB
lola: time consumption: 0 seconds

BK_STOP 1527775416508

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