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 228K
-rw-r--r-- 1 mcc users 4.0K May 30 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 30 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 28 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 28 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 27 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 50K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DoubleExponent-PT-003, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169600207
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527782721655

info: Time: 3600 - MCC
===========================================================================================
prep: translating DoubleExponent-PT-003 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DoubleExponent-PT-003 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DoubleExponent-PT-003 @ 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: 311/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 148 transitions, 144 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 200 transition conflict sets
lola: TASK
lola: reading formula from DoubleExponent-PT-003-ReachabilityFireability.task
lola: E (F ((FIREABLE(t36) AND FIREABLE(t102) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t17) OR (NOT FIREABLE(t91) AND NOT FIREABLE(t38)))))) : E (F ((FIREABLE(t22) AND (FIREABLE(t47) OR FIREABLE(t97)) AND FIREABLE(t8) AND (FIREABLE(t139) OR (FIREABLE(t37) AND FIREABLE(t107) AND FIREABLE(t127)))))) : A (G ((NOT FIREABLE(t112) OR FIREABLE(t6) OR (NOT FIREABLE(t102) AND (NOT FIREABLE(t97) OR NOT FIREABLE(t79)))))) : E (F ((FIREABLE(t130) AND (FIREABLE(t49) OR FIREABLE(t14) OR (FIREABLE(t26) AND FIREABLE(t34) AND (FIREABLE(t110) OR FIREABLE(t115))))))) : E (F ((FIREABLE(t88) AND NOT FIREABLE(t3) AND (FIREABLE(t33) OR FIREABLE(t133) OR FIREABLE(t66)) AND NOT FIREABLE(t122)))) : A (G ((FIREABLE(t113) OR FIREABLE(t4) OR NOT FIREABLE(t105)))) : A (G ((NOT FIREABLE(t92) OR NOT FIREABLE(t123) OR (FIREABLE(t9) AND FIREABLE(t21) AND (FIREABLE(t19) OR FIREABLE(t110))) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t141) AND NOT FIREABLE(t70) AND NOT FIREABLE(t68))))) : E (F (((FIREABLE(t113) OR (FIREABLE(t141) AND FIREABLE(t81))) AND FIREABLE(t93) AND NOT FIREABLE(t83)))) : E (F ((FIREABLE(t44) AND FIREABLE(t127) AND (FIREABLE(t103) OR FIREABLE(t126) OR FIREABLE(t26) OR (FIREABLE(t7) AND NOT FIREABLE(t3)))))) : E (F ((NOT FIREABLE(t1) AND FIREABLE(t129)))) : E (F ((((FIREABLE(t53) OR FIREABLE(t92)) AND FIREABLE(t133) AND FIREABLE(t83)) OR ((FIREABLE(t142) OR FIREABLE(t45)) AND FIREABLE(t50) AND FIREABLE(t137) AND FIREABLE(t47) AND FIREABLE(t42) AND FIREABLE(t76))))) : A (G (((NOT FIREABLE(t57) OR NOT FIREABLE(t50) OR NOT FIREABLE(t16)) AND (FIREABLE(t18) OR FIREABLE(t33) OR FIREABLE(t37) OR (NOT FIREABLE(t143) AND NOT FIREABLE(t119)))))) : E (F ((FIREABLE(t130) AND FIREABLE(t13) AND FIREABLE(t147)))) : E (F (FIREABLE(t146))) : A (G ((NOT FIREABLE(t135) OR NOT FIREABLE(t111) OR FIREABLE(t81)))) : E (F ((FIREABLE(t54) AND FIREABLE(t73) AND (FIREABLE(t137) OR FIREABLE(t71)) AND FIREABLE(t11) AND FIREABLE(t9))))
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(t146)))
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(t146)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t146)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-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: 5256 markings, 5255 edges
lola: ========================================

FORMULA DoubleExponent-PT-003-ReachabilityFireability-13 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: E (F ((NOT FIREABLE(t1) AND FIREABLE(t129))))
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) AND FIREABLE(t129))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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) AND FIREABLE(t129))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 27)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 136498 markings, 136497 edges
lola: ========================================

FORMULA DoubleExponent-PT-003-ReachabilityFireability-9 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(t130) AND FIREABLE(t13) AND 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(t130) AND FIREABLE(t13) AND FIREABLE(t147))))
lola: processed formula length: 61
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t130) AND FIREABLE(t13) AND FIREABLE(t147))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-2-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 DoubleExponent-PT-003-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t113) OR FIREABLE(t4) OR NOT FIREABLE(t105))))
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(t113) OR FIREABLE(t4) OR NOT FIREABLE(t105))))
lola: processed formula length: 64
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t113) AND NOT FIREABLE(t4) AND FIREABLE(t105))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3503 markings, 3502 edges
lola: ========================================

FORMULA DoubleExponent-PT-003-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t135) OR NOT FIREABLE(t111) OR 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(t135) OR NOT FIREABLE(t111) OR FIREABLE(t81))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t135) AND FIREABLE(t111) AND NOT FIREABLE(t81))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-4-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.

FORMULA DoubleExponent-PT-003-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t112) OR FIREABLE(t6) OR (NOT FIREABLE(t102) AND (NOT FIREABLE(t97) OR NOT FIREABLE(t79))))))
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(t112) OR FIREABLE(t6) OR (NOT FIREABLE(t102) AND (NOT FIREABLE(t97) OR NOT FIREABLE(t79))))))
lola: processed formula length: 116
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t112) AND NOT FIREABLE(t6) AND (FIREABLE(t102) OR (FIREABLE(t97) AND FIREABLE(t79))))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-5-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 DoubleExponent-PT-003-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t113) OR (FIREABLE(t141) AND FIREABLE(t81))) AND FIREABLE(t93) AND NOT FIREABLE(t83))))
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(t113) OR (FIREABLE(t141) AND FIREABLE(t81))) AND FIREABLE(t93) AND NOT FIREABLE(t83))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t113) OR (FIREABLE(t141) AND FIREABLE(t81))) AND FIREABLE(t93) AND NOT FIREABLE(t83))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-6-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 DoubleExponent-PT-003-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t36) AND FIREABLE(t102) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t17) OR (NOT FIREABLE(t91) AND NOT FIREABLE(t38))))))
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(t36) AND FIREABLE(t102) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t17) OR (NOT FIREABLE(t91) AND NOT FIREABLE(t38))))))
lola: processed formula length: 135
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t36) AND FIREABLE(t102) AND (NOT FIREABLE(t113) OR NOT FIREABLE(t17) OR (NOT FIREABLE(t91) AND NOT FIREABLE(t38))))
lola: state equation: Generated DNF with 32 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-7-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 DoubleExponent-PT-003-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t88) AND NOT FIREABLE(t3) AND (FIREABLE(t33) OR FIREABLE(t133) OR FIREABLE(t66)) AND NOT FIREABLE(t122))))
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(t88) AND NOT FIREABLE(t3) AND (FIREABLE(t33) OR FIREABLE(t133) OR FIREABLE(t66)) AND NOT FIREABLE(t122))))
lola: processed formula length: 124
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t88) AND NOT FIREABLE(t3) AND (FIREABLE(t33) OR FIREABLE(t133) OR FIREABLE(t66)) AND NOT FIREABLE(t122))
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-8-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 DoubleExponent-PT-003-ReachabilityFireability-4 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: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t54) AND FIREABLE(t73) AND (FIREABLE(t137) OR FIREABLE(t71)) AND FIREABLE(t11) AND 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(t54) AND FIREABLE(t73) AND (FIREABLE(t137) OR FIREABLE(t71)) AND FIREABLE(t11) AND FIREABLE(t9))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t54) AND FIREABLE(t73) AND (FIREABLE(t137) OR FIREABLE(t71)) AND FIREABLE(t11) AND FIREABLE(t9))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-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 DoubleExponent-PT-003-ReachabilityFireability-15 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: E (F ((FIREABLE(t44) AND FIREABLE(t127) AND (FIREABLE(t103) OR FIREABLE(t126) OR FIREABLE(t26) OR (FIREABLE(t7) AND NOT FIREABLE(t3))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t44) AND FIREABLE(t127) AND (FIREABLE(t103) OR FIREABLE(t126) OR FIREABLE(t26) OR (FIREABLE(t7) AND NOT FIREABLE(t3))))))
lola: processed formula length: 140
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t44) AND FIREABLE(t127) AND (FIREABLE(t103) OR FIREABLE(t126) OR FIREABLE(t26) OR (FIREABLE(t7) AND NOT FIREABLE(t3))))
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-10-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 DoubleExponent-PT-003-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t130) AND (FIREABLE(t49) OR FIREABLE(t14) OR (FIREABLE(t26) AND FIREABLE(t34) AND (FIREABLE(t110) OR FIREABLE(t115)))))))
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(t130) AND (FIREABLE(t49) OR FIREABLE(t14) OR (FIREABLE(t26) AND FIREABLE(t34) AND (FIREABLE(t110) OR FIREABLE(t115)))))))
lola: processed formula length: 140
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t130) AND (FIREABLE(t49) OR FIREABLE(t14) OR (FIREABLE(t26) AND FIREABLE(t34) AND (FIREABLE(t110) OR FIREABLE(t115)))))
lola: state equation: Generated DNF with 19 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-11-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 DoubleExponent-PT-003-ReachabilityFireability-3 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(t22) AND (FIREABLE(t47) OR FIREABLE(t97)) AND FIREABLE(t8) AND (FIREABLE(t139) OR (FIREABLE(t37) AND FIREABLE(t107) AND FIREABLE(t127))))))
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) AND (FIREABLE(t47) OR FIREABLE(t97)) AND FIREABLE(t8) AND (FIREABLE(t139) OR (FIREABLE(t37) AND FIREABLE(t107) AND FIREABLE(t127))))))
lola: processed formula length: 157
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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) AND (FIREABLE(t47) OR FIREABLE(t97)) AND FIREABLE(t8) AND (FIREABLE(t139) OR (FIREABLE(t37) AND FIREABLE(t107) AND FIREABLE(t127))))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-12-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 DoubleExponent-PT-003-ReachabilityFireability-1 FALSE 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(t57) OR NOT FIREABLE(t50) OR NOT FIREABLE(t16)) AND (FIREABLE(t18) OR FIREABLE(t33) OR FIREABLE(t37) OR (NOT FIREABLE(t143) AND NOT FIREABLE(t119))))))
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(t57) OR NOT FIREABLE(t50) OR NOT FIREABLE(t16)) AND (FIREABLE(t18) OR FIREABLE(t33) OR FIREABLE(t37) OR (NOT FIREABLE(t143) AND NOT FIREABLE(t119))))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t57) AND FIREABLE(t50) AND FIREABLE(t16)) OR (NOT FIREABLE(t18) AND NOT FIREABLE(t33) AND NOT FIREABLE(t37) AND (FIREABLE(t143) OR FIREABLE(t119))))
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1893 markings, 1892 edges
lola: ========================================

FORMULA DoubleExponent-PT-003-ReachabilityFireability-11 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(t92) OR NOT FIREABLE(t123) OR (FIREABLE(t9) AND FIREABLE(t21) AND (FIREABLE(t19) OR FIREABLE(t110))) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t141) AND NOT FIREABLE(t70) AND NOT FIREABLE(t68)))))
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(t92) OR NOT FIREABLE(t123) OR (FIREABLE(t9) AND FIREABLE(t21) AND (FIREABLE(t19) OR FIREABLE(t110))) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t141) AND NOT FIREABLE(t70) AND NOT FIREABLE(t68)))))
lola: processed formula length: 217
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t92) AND FIREABLE(t123) AND (NOT FIREABLE(t9) OR NOT FIREABLE(t21) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t110))) AND (FIREABLE(t19) OR FIREABLE(t141) OR FIREABLE(t70) OR FIREABLE(t68)))
lola: state equation: Generated DNF with 72 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-14-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 DoubleExponent-PT-003-ReachabilityFireability-6 TRUE 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: E (F ((((FIREABLE(t53) OR FIREABLE(t92)) AND FIREABLE(t133) AND FIREABLE(t83)) OR ((FIREABLE(t142) OR FIREABLE(t45)) AND FIREABLE(t50) AND FIREABLE(t137) AND FIREABLE(t47) AND FIREABLE(t42) AND FIREABLE(t76)))))
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) OR FIREABLE(t92)) AND FIREABLE(t133) AND FIREABLE(t83)) OR ((FIREABLE(t142) OR FIREABLE(t45)) AND FIREABLE(t50) AND FIREABLE(t137) AND FIREABLE(t47) AND FIREABLE(t42) AND FIREABLE(t76)))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-003-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(t53) OR FIREABLE(t92)) AND FIREABLE(t133) AND FIREABLE(t83)) OR ((FIREABLE(t142) OR FIREABLE(t45)) AND FIREABLE(t50) AND FIREABLE(t137) AND FIREABLE(t47) AND FIREABLE(t42) AND FIREABLE(t76)))
lola: state equation: Generated DNF with 29 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-003-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-003-ReachabilityFireability-15-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 DoubleExponent-PT-003-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no no yes no no no yes yes no
lola:
preliminary result: no no yes no no no yes no no yes no no no yes yes no
lola: memory consumption: 14896 KB
lola: time consumption: 1 seconds

BK_STOP 1527782722915

--------------------
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="DoubleExponent-PT-003"
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/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 DoubleExponent-PT-003, 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-152749169600207"
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 ;