About the Execution of LoLA for JoinFreeModules-PT-1000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
254.180 | 16712.00 | 18406.00 | 117.70 | FTTFTTTTTFTFTTTT | normal |
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 5.8M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-1000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900294
=====================================================================
--------------------
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 JoinFreeModules-PT-1000-ReachabilityFireability-00
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-01
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-02
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-03
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-04
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-05
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-06
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-07
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-08
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-09
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-10
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-11
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-12
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-13
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-14
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526863267752
info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-1000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-1000 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ JoinFreeModules-PT-1000 @ 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: 13002/65536 symbol table entries, 4014 collisions
lola: preprocessing...
lola: Size of bit vector: 160032
lola: finding significant places
lola: 5001 places, 8001 transitions, 4000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9001 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-1000-ReachabilityFireability.task
lola: A (G ((FIREABLE(t6930) AND (NOT FIREABLE(t593) OR NOT FIREABLE(t3313)) AND FIREABLE(t3858)))) : E (F (FIREABLE(t6293))) : E (F ((NOT FIREABLE(t6085) AND NOT FIREABLE(t6565) AND ((FIREABLE(t1453) AND FIREABLE(t4564)) OR FIREABLE(t413)) AND (FIREABLE(t6427) OR FIREABLE(t645) OR NOT FIREABLE(t1166)) AND (FIREABLE(t6709) OR (FIREABLE(t5361) AND FIREABLE(t3263)))))) : A (G ((FIREABLE(t4335) OR NOT FIREABLE(t7614) OR (NOT FIREABLE(t5314) AND NOT FIREABLE(t285) AND NOT FIREABLE(t4851))))) : E (F ((NOT FIREABLE(t6989) AND NOT FIREABLE(t7788) AND NOT FIREABLE(t3393) AND FIREABLE(t881)))) : E (F (FIREABLE(t5224))) : E (F ((((FIREABLE(t417) OR FIREABLE(t5415)) AND (NOT FIREABLE(t5568) OR NOT FIREABLE(t3982))) OR FIREABLE(t2253)))) : E (F ((FIREABLE(t2703) AND (FIREABLE(t1413) OR FIREABLE(t3796) OR FIREABLE(t3535)) AND (FIREABLE(t7048) OR FIREABLE(t2981) OR FIREABLE(t5730) OR FIREABLE(t332))))) : E (F (FIREABLE(t5926))) : A (G (((FIREABLE(t1870) AND FIREABLE(t1202)) OR (FIREABLE(t148) AND FIREABLE(t5160)) OR NOT FIREABLE(t3734) OR NOT FIREABLE(t6056) OR FIREABLE(t6071)))) : E (F ((FIREABLE(t7983) AND (NOT FIREABLE(t2579) OR NOT FIREABLE(t4434)) AND (FIREABLE(t816) OR FIREABLE(t5331)) AND FIREABLE(t1483) AND FIREABLE(t3252)))) : A (G (FIREABLE(t4042))) : E (F (FIREABLE(t6141))) : E (F ((FIREABLE(t2737) AND (NOT FIREABLE(t7961) OR (FIREABLE(t5352) AND FIREABLE(t772))) AND (FIREABLE(t428) OR FIREABLE(t5474) OR (FIREABLE(t3300) AND FIREABLE(t4966)) OR FIREABLE(t3501))))) : E (F ((((NOT FIREABLE(t784) OR FIREABLE(t216)) AND NOT FIREABLE(t2572)) OR ((FIREABLE(t893) OR (FIREABLE(t2299) AND FIREABLE(t5983))) AND NOT FIREABLE(t4341))))) : E (F ((NOT FIREABLE(t6393) AND NOT FIREABLE(t2047) AND (FIREABLE(t5943) OR FIREABLE(t937) OR FIREABLE(t6550)) AND FIREABLE(t2598))))
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(t6293)))
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(t6293)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t6293)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-1 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(t5224)))
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(t5224)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t5224)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file JoinFreeModules-PT-1000-ReachabilityFireability-0.sara.
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5926)))
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(t5926)))
lola: processed formula length: 23
lola: 1 rewrites
sara: 4: error near '': syntax error, unexpected $end, expecting SEMICOLON
lola: closed formula file JoinFreeModules-PT-1000-ReachabilityFireability.task
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
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(t5926)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t4042)))
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(t4042)))
lola: processed formula length: 23
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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)
sara: try reading problem file JoinFreeModules-PT-1000-ReachabilityFireability-2-0.sara.
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(t4042)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-1000-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1001 markings, 1001 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-11 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(t6141)))
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(t6141)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t6141)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-12 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 ((FIREABLE(t6930) AND (NOT FIREABLE(t593) OR NOT FIREABLE(t3313)) AND FIREABLE(t3858))))
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(t6930) AND (NOT FIREABLE(t593) OR NOT FIREABLE(t3313)) AND FIREABLE(t3858))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t6930) OR (FIREABLE(t593) AND FIREABLE(t3313)) OR NOT FIREABLE(t3858))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-1000-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1001 markings, 1001 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-0 FALSE 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 ((NOT FIREABLE(t6989) AND NOT FIREABLE(t7788) AND NOT FIREABLE(t3393) AND FIREABLE(t881))))
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(t6989) AND NOT FIREABLE(t7788) AND NOT FIREABLE(t3393) AND FIREABLE(t881))))
lola: processed formula length: 96
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t6989) AND NOT FIREABLE(t7788) AND NOT FIREABLE(t3393) AND FIREABLE(t881))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-1000-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1008 markings, 1008 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-4 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(t417) OR FIREABLE(t5415)) AND (NOT FIREABLE(t5568) OR NOT FIREABLE(t3982))) OR FIREABLE(t2253))))
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(t417) OR FIREABLE(t5415)) AND (NOT FIREABLE(t5568) OR NOT FIREABLE(t3982))) OR FIREABLE(t2253))))
lola: processed formula length: 118
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t417) OR FIREABLE(t5415)) AND (NOT FIREABLE(t5568) OR NOT FIREABLE(t3982))) OR FIREABLE(t2253))
lola: state equation: Generated DNF with 9 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4335) OR NOT FIREABLE(t7614) OR (NOT FIREABLE(t5314) AND NOT FIREABLE(t285) AND NOT FIREABLE(t4851)))))
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(t4335) OR NOT FIREABLE(t7614) OR (NOT FIREABLE(t5314) AND NOT FIREABLE(t285) AND NOT FIREABLE(t4851)))))
lola: processed formula length: 122
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t4335) AND FIREABLE(t7614) AND (FIREABLE(t5314) OR FIREABLE(t285) OR FIREABLE(t4851)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-3 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 ((NOT FIREABLE(t6393) AND NOT FIREABLE(t2047) AND (FIREABLE(t5943) OR FIREABLE(t937) OR FIREABLE(t6550)) AND FIREABLE(t2598))))
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(t6393) AND NOT FIREABLE(t2047) AND (FIREABLE(t5943) OR FIREABLE(t937) OR FIREABLE(t6550)) AND FIREABLE(t2598))))
lola: processed formula length: 134
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t6393) AND NOT FIREABLE(t2047) AND (FIREABLE(t5943) OR FIREABLE(t937) OR FIREABLE(t6550)) AND FIREABLE(t2598))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-15 TRUE 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(t7983) AND (NOT FIREABLE(t2579) OR NOT FIREABLE(t4434)) AND (FIREABLE(t816) OR FIREABLE(t5331)) AND FIREABLE(t1483) AND FIREABLE(t3252))))
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(t7983) AND (NOT FIREABLE(t2579) OR NOT FIREABLE(t4434)) AND (FIREABLE(t816) OR FIREABLE(t5331)) AND FIREABLE(t1483) AND FIREABLE(t3252))))
lola: processed formula length: 156
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t7983) AND (NOT FIREABLE(t2579) OR NOT FIREABLE(t4434)) AND (FIREABLE(t816) OR FIREABLE(t5331)) AND FIREABLE(t1483) AND FIREABLE(t3252))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-10 TRUE 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 ((((NOT FIREABLE(t784) OR FIREABLE(t216)) AND NOT FIREABLE(t2572)) OR ((FIREABLE(t893) OR (FIREABLE(t2299) AND FIREABLE(t5983))) AND NOT FIREABLE(t4341)))))
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(t784) OR FIREABLE(t216)) AND NOT FIREABLE(t2572)) OR ((FIREABLE(t893) OR (FIREABLE(t2299) AND FIREABLE(t5983))) AND NOT FIREABLE(t4341)))))
lola: processed formula length: 164
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t784) OR FIREABLE(t216)) AND NOT FIREABLE(t2572)) OR ((FIREABLE(t893) OR (FIREABLE(t2299) AND FIREABLE(t5983))) AND NOT FIREABLE(t4341)))
lola: state equation: Generated DNF with 9 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-1000-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1000 markings, 1000 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-14 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: A (G (((FIREABLE(t1870) AND FIREABLE(t1202)) OR (FIREABLE(t148) AND FIREABLE(t5160)) OR NOT FIREABLE(t3734) OR NOT FIREABLE(t6056) OR FIREABLE(t6071))))
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(t1870) AND FIREABLE(t1202)) OR (FIREABLE(t148) AND FIREABLE(t5160)) OR NOT FIREABLE(t3734) OR NOT FIREABLE(t6056) OR FIREABLE(t6071))))
lola: processed formula length: 156
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t1870) OR NOT FIREABLE(t1202)) AND (NOT FIREABLE(t148) OR NOT FIREABLE(t5160)) AND FIREABLE(t3734) AND FIREABLE(t6056) AND NOT FIREABLE(t6071))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-9 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: E (F ((FIREABLE(t2703) AND (FIREABLE(t1413) OR FIREABLE(t3796) OR FIREABLE(t3535)) AND (FIREABLE(t7048) OR FIREABLE(t2981) OR FIREABLE(t5730) OR FIREABLE(t332)))))
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(t2703) AND (FIREABLE(t1413) OR FIREABLE(t3796) OR FIREABLE(t3535)) AND (FIREABLE(t7048) OR FIREABLE(t2981) OR FIREABLE(t5730) OR FIREABLE(t332)))))
lola: processed formula length: 168
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t2703) AND (FIREABLE(t1413) OR FIREABLE(t3796) OR FIREABLE(t3535)) AND (FIREABLE(t7048) OR FIREABLE(t2981) OR FIREABLE(t5730) OR FIREABLE(t332)))
lola: state equation: Generated DNF with 36 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-7 TRUE 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: E (F ((FIREABLE(t2737) AND (NOT FIREABLE(t7961) OR (FIREABLE(t5352) AND FIREABLE(t772))) AND (FIREABLE(t428) OR FIREABLE(t5474) OR (FIREABLE(t3300) AND FIREABLE(t4966)) OR FIREABLE(t3501)))))
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(t2737) AND (NOT FIREABLE(t7961) OR (FIREABLE(t5352) AND FIREABLE(t772))) AND (FIREABLE(t428) OR FIREABLE(t5474) OR (FIREABLE(t3300) AND FIREABLE(t4966)) OR FIREABLE(t3501)))))
lola: processed formula length: 195
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t2737) AND (NOT FIREABLE(t7961) OR (FIREABLE(t5352) AND FIREABLE(t772))) AND (FIREABLE(t428) OR FIREABLE(t5474) OR (FIREABLE(t3300) AND FIREABLE(t4966)) OR FIREABLE(t3501)))
lola: state equation: Generated DNF with 30 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-13 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 ((NOT FIREABLE(t6085) AND NOT FIREABLE(t6565) AND ((FIREABLE(t1453) AND FIREABLE(t4564)) OR FIREABLE(t413)) AND (FIREABLE(t6427) OR FIREABLE(t645) OR NOT FIREABLE(t1166)) AND (FIREABLE(t6709) OR (FIREABLE(t5361) AND FIREABLE(t3263))))))
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(t6085) AND NOT FIREABLE(t6565) AND ((FIREABLE(t1453) AND FIREABLE(t4564)) OR FIREABLE(t413)) AND (FIREABLE(t6427) OR FIREABLE(t645) OR NOT FIREABLE(t1166)) AND (FIREABLE(t6709) OR (FIREABLE(t5361) AND FIREABLE(t3263))))))
lola: processed formula length: 245
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-1000-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(t6085) AND NOT FIREABLE(t6565) AND ((FIREABLE(t1453) AND FIREABLE(t4564)) OR FIREABLE(t413)) AND (FIREABLE(t6427) OR FIREABLE(t645) OR NOT FIREABLE(t1166)) AND (FIREABLE(t6709) OR (FIREABLE(t5361) AND FIREABLE(t3263))))
lola: state equation: Generated DNF with 72 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-1000-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
FORMULA JoinFreeModules-PT-1000-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes yes yes no yes no yes yes yes yes
lola:
preliminary result: no yes yes no yes yes yes yes yes no yes no yes yes yes yes
lola: memory consumption: 84600 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic
BK_STOP 1526863284464
--------------------
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="JoinFreeModules-PT-1000"
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/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 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 JoinFreeModules-PT-1000, 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 r100-smll-152658630900294"
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 '
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 ;