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 1.3M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 1.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0200, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900280
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526847765333

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0200 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ JoinFreeModules-PT-0200 @ 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: 2602/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 32032
lola: finding significant places
lola: 1001 places, 1601 transitions, 800 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1801 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0200-ReachabilityFireability.task
lola: E (F (FIREABLE(t206))) : E (F ((NOT FIREABLE(t996) OR FIREABLE(t679)))) : E (F (((FIREABLE(t37) OR FIREABLE(t279) OR (FIREABLE(t104) AND FIREABLE(t1396))) AND (FIREABLE(t642) OR NOT FIREABLE(t385)) AND NOT FIREABLE(t54)))) : A (G ((FIREABLE(t29) OR (FIREABLE(t1072) AND FIREABLE(t583)) OR NOT FIREABLE(t481) OR NOT FIREABLE(t890) OR NOT FIREABLE(t111) OR (NOT FIREABLE(t813) AND NOT FIREABLE(t1428))))) : A (G (NOT FIREABLE(t1055))) : E (F ((FIREABLE(t510) OR FIREABLE(t365) OR (FIREABLE(t1209) AND FIREABLE(t1187) AND FIREABLE(t915) AND FIREABLE(t808))))) : A (G ((NOT FIREABLE(t1537) OR (NOT FIREABLE(t1458) AND FIREABLE(t202) AND (FIREABLE(t126) OR FIREABLE(t1379)) AND FIREABLE(t602))))) : E (F (NOT FIREABLE(t426))) : A (G ((NOT FIREABLE(t109) AND (FIREABLE(t885) OR NOT FIREABLE(t1000))))) : A (G (((NOT FIREABLE(t1383) AND NOT FIREABLE(t160) AND NOT FIREABLE(t781)) OR ((FIREABLE(t249) OR FIREABLE(t305)) AND NOT FIREABLE(t1531) AND (NOT FIREABLE(t531) OR NOT FIREABLE(t1559)))))) : A (G ((FIREABLE(t1092) OR FIREABLE(t1139) OR NOT FIREABLE(t420)))) : E (F ((FIREABLE(t1041) OR ((FIREABLE(t904) OR FIREABLE(t689) OR FIREABLE(t1443)) AND FIREABLE(t397))))) : A (G (NOT FIREABLE(t269))) : E (F ((NOT FIREABLE(t1588) OR ((FIREABLE(t1481) OR FIREABLE(t697)) AND (FIREABLE(t401) OR FIREABLE(t557))) OR ((FIREABLE(t1524) OR FIREABLE(t936)) AND NOT FIREABLE(t572) AND FIREABLE(t413))))) : E (F (((NOT FIREABLE(t182) OR NOT FIREABLE(t508)) AND (FIREABLE(t150) OR FIREABLE(t1245) OR FIREABLE(t1228)) AND (FIREABLE(t1018) OR FIREABLE(t585)) AND (FIREABLE(t990) OR FIREABLE(t991)) AND (NOT FIREABLE(t1495) OR (FIREABLE(t618) AND FIREABLE(t850)))))) : A (G ((NOT FIREABLE(t1181) OR (FIREABLE(t1497) AND FIREABLE(t674)) OR FIREABLE(t1382) OR (FIREABLE(t1400) AND ((FIREABLE(t1259) AND FIREABLE(t333)) OR NOT FIREABLE(t767))))))
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(t206)))
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(t206)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t206)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

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

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-4 FALSE 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 (NOT FIREABLE(t426)))
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(t426)))
lola: processed formula length: 26
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t426)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-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: 201 markings, 201 edges
lola: ========================================

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

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-12 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 ((NOT FIREABLE(t996) OR FIREABLE(t679))))
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(t996) OR FIREABLE(t679))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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)
sara: try reading problem file JoinFreeModules-PT-0200-ReachabilityFireability-3-0.sara.
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t996) OR FIREABLE(t679))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0200-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 200 markings, 200 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-1 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(t1092) OR FIREABLE(t1139) OR NOT FIREABLE(t420))))
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(t1092) OR FIREABLE(t1139) OR NOT FIREABLE(t420))))
lola: processed formula length: 68
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t1092) AND NOT FIREABLE(t1139) AND FIREABLE(t420))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 200 markings, 200 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t109) AND (FIREABLE(t885) OR NOT FIREABLE(t1000)))))
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(t109) AND (FIREABLE(t885) OR NOT FIREABLE(t1000)))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t109) OR (NOT FIREABLE(t885) AND FIREABLE(t1000)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-6-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: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-8 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(t1041) OR ((FIREABLE(t904) OR FIREABLE(t689) OR FIREABLE(t1443)) AND FIREABLE(t397)))))
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(t1041) OR ((FIREABLE(t904) OR FIREABLE(t689) OR FIREABLE(t1443)) AND FIREABLE(t397)))))
lola: processed formula length: 106
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t1041) OR ((FIREABLE(t904) OR FIREABLE(t689) OR FIREABLE(t1443)) AND FIREABLE(t397)))
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-7-0.sara
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-11 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(t1537) OR (NOT FIREABLE(t1458) AND FIREABLE(t202) AND (FIREABLE(t126) OR FIREABLE(t1379)) AND FIREABLE(t602)))))
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(t1537) OR (NOT FIREABLE(t1458) AND FIREABLE(t202) AND (FIREABLE(t126) OR FIREABLE(t1379)) AND FIREABLE(t602)))))
lola: processed formula length: 134
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t1537) AND (FIREABLE(t1458) OR NOT FIREABLE(t202) OR (NOT FIREABLE(t126) AND NOT FIREABLE(t1379)) OR NOT FIREABLE(t602)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t510) OR FIREABLE(t365) OR (FIREABLE(t1209) AND FIREABLE(t1187) AND FIREABLE(t915) AND FIREABLE(t808)))))
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(t510) OR FIREABLE(t365) OR (FIREABLE(t1209) AND FIREABLE(t1187) AND FIREABLE(t915) AND FIREABLE(t808)))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-5 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: E (F (((FIREABLE(t37) OR FIREABLE(t279) OR (FIREABLE(t104) AND FIREABLE(t1396))) AND (FIREABLE(t642) OR NOT FIREABLE(t385)) AND NOT FIREABLE(t54))))
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(t37) OR FIREABLE(t279) OR (FIREABLE(t104) AND FIREABLE(t1396))) AND (FIREABLE(t642) OR NOT FIREABLE(t385)) AND NOT FIREABLE(t54))))
lola: processed formula length: 151
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1383) AND NOT FIREABLE(t160) AND NOT FIREABLE(t781)) OR ((FIREABLE(t249) OR FIREABLE(t305)) AND NOT FIREABLE(t1531) AND (NOT FIREABLE(t531) OR NOT FIREABLE(t1559))))))
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(t1383) AND NOT FIREABLE(t160) AND NOT FIREABLE(t781)) OR ((FIREABLE(t249) OR FIREABLE(t305)) AND NOT FIREABLE(t1531) AND (NOT FIREABLE(t531) OR NOT FIREABLE(t1559))))))
lola: processed formula length: 192
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t1383) OR FIREABLE(t160) OR FIREABLE(t781)) AND ((NOT FIREABLE(t249) AND NOT FIREABLE(t305)) OR FIREABLE(t1531) OR (FIREABLE(t531) AND FIREABLE(t1559))))
lola: state equation: Generated DNF with 24 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-9 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: A (G ((FIREABLE(t29) OR (FIREABLE(t1072) AND FIREABLE(t583)) OR NOT FIREABLE(t481) OR NOT FIREABLE(t890) OR NOT FIREABLE(t111) OR (NOT FIREABLE(t813) AND NOT FIREABLE(t1428)))))
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(t29) OR (FIREABLE(t1072) AND FIREABLE(t583)) OR NOT FIREABLE(t481) OR NOT FIREABLE(t890) OR NOT FIREABLE(t111) OR (NOT FIREABLE(t813) AND NOT FIREABLE(t1428)))))
lola: processed formula length: 182
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t29) AND (NOT FIREABLE(t1072) OR NOT FIREABLE(t583)) AND FIREABLE(t481) AND FIREABLE(t890) AND FIREABLE(t111) AND (FIREABLE(t813) OR FIREABLE(t1428)))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1181) OR (FIREABLE(t1497) AND FIREABLE(t674)) OR FIREABLE(t1382) OR (FIREABLE(t1400) AND ((FIREABLE(t1259) AND FIREABLE(t333)) OR NOT FIREABLE(t767))))))
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(t1181) OR (FIREABLE(t1497) AND FIREABLE(t674)) OR FIREABLE(t1382) OR (FIREABLE(t1400) AND ((FIREABLE(t1259) AND FIREABLE(t333)) OR NOT FIREABLE(t767))))))
lola: processed formula length: 178
lola: 2 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t1181) AND (NOT FIREABLE(t1497) OR NOT FIREABLE(t674)) AND NOT FIREABLE(t1382) AND (NOT FIREABLE(t1400) OR ((NOT FIREABLE(t1259) OR NOT FIREABLE(t333)) AND FIREABLE(t767))))
lola: state equation: Generated DNF with 28 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-15 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 ((NOT FIREABLE(t1588) OR ((FIREABLE(t1481) OR FIREABLE(t697)) AND (FIREABLE(t401) OR FIREABLE(t557))) OR ((FIREABLE(t1524) OR FIREABLE(t936)) AND NOT FIREABLE(t572) AND FIREABLE(t413)))))
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(t1588) OR ((FIREABLE(t1481) OR FIREABLE(t697)) AND (FIREABLE(t401) OR FIREABLE(t557))) OR ((FIREABLE(t1524) OR FIREABLE(t936)) AND NOT FIREABLE(t572) AND FIREABLE(t413)))))
lola: processed formula length: 197
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t1588) OR ((FIREABLE(t1481) OR FIREABLE(t697)) AND (FIREABLE(t401) OR FIREABLE(t557))) OR ((FIREABLE(t1524) OR FIREABLE(t936)) AND NOT FIREABLE(t572) AND FIREABLE(t413)))
lola: state equation: Generated DNF with 15 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 200 markings, 200 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-13 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 (((NOT FIREABLE(t182) OR NOT FIREABLE(t508)) AND (FIREABLE(t150) OR FIREABLE(t1245) OR FIREABLE(t1228)) AND (FIREABLE(t1018) OR FIREABLE(t585)) AND (FIREABLE(t990) OR FIREABLE(t991)) AND (NOT FIREABLE(t1495) OR (FIREABLE(t618) AND FIREABLE(t850))))))
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(t182) OR NOT FIREABLE(t508)) AND (FIREABLE(t150) OR FIREABLE(t1245) OR FIREABLE(t1228)) AND (FIREABLE(t1018) OR FIREABLE(t585)) AND (FIREABLE(t990) OR FIREABLE(t991)) AND (NOT FIREABLE(t1495) OR (FIREABLE(t618) AND FIREABLE(t850))))))
lola: processed formula length: 261
lola: 1 rewrites
lola: closed formula file JoinFreeModules-PT-0200-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(t182) OR NOT FIREABLE(t508)) AND (FIREABLE(t150) OR FIREABLE(t1245) OR FIREABLE(t1228)) AND (FIREABLE(t1018) OR FIREABLE(t585)) AND (FIREABLE(t990) OR FIREABLE(t991)) AND (NOT FIREABLE(t1495) OR (FIREABLE(t618) AND FIREABLE(t850))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 264 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0200-ReachabilityFireability-15-0.sara
lola: ========================================

FORMULA JoinFreeModules-PT-0200-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no yes no no no yes no yes yes no
lola:
preliminary result: yes yes yes no no yes no yes no no no yes no yes yes no
lola: memory consumption: 18584 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic


BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0200"
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-0200.tgz
mv JoinFreeModules-PT-0200 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-0200, 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-152658630900280"
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 ;