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 196K
-rw-r--r-- 1 mcc users 3.2K 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.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.5K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 2.8K 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.7K 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 23K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900235
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526810835690

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0004 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0004 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0004 @ 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: 54/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 672
lola: finding significant places
lola: 21 places, 33 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 37 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0004-CTLFireability.task
lola: A (G (((A (F (FIREABLE(t7))) OR E (F (FIREABLE(t29)))) OR A ((FIREABLE(t5) U FIREABLE(t24)))))) : E (X ((A (G (NOT FIREABLE(t15))) AND FIREABLE(t19)))) : A (G (E (F (A (G (FIREABLE(t13))))))) : (NOT(E ((FIREABLE(t17) U (FIREABLE(t20) OR FIREABLE(t32))))) OR ((FIREABLE(t19) OR (NOT FIREABLE(t6) AND NOT FIREABLE(t31)) OR NOT FIREABLE(t4)) AND E (F (FIREABLE(t25))))) : A (F (E (F (E (G (FIREABLE(t32))))))) : E (F (FIREABLE(t17))) : A (G (((E (G (FIREABLE(t25))) AND FIREABLE(t31)) OR NOT(E (G (FIREABLE(t24))))))) : NOT(((E (F (FIREABLE(t25))) OR (FIREABLE(t16) AND A (F (FIREABLE(t17))))) OR ((FIREABLE(t7) AND FIREABLE(t9) AND (FIREABLE(t21) OR FIREABLE(t12)) AND FIREABLE(t12)) AND (FIREABLE(t5) AND A (F (FIREABLE(t14))))))) : (A ((A (F (FIREABLE(t31))) U A (F (FIREABLE(t21))))) OR (E (F (FIREABLE(t12))) AND E (F (A (G (FIREABLE(t22))))))) : E ((E (F (NOT FIREABLE(t18))) U A (X ((FIREABLE(t5) OR FIREABLE(t23)))))) : A (G ((A (F (FIREABLE(t4))) OR A (G (FIREABLE(t20)))))) : A (G ((A (X (NOT FIREABLE(t4))) OR E (F (FIREABLE(t27)))))) : A (G (A (F ((NOT FIREABLE(t17) OR (FIREABLE(t10) AND FIREABLE(t30))))))) : (E ((E (X (FIREABLE(t25))) U ((FIREABLE(t8) AND FIREABLE(t9)) OR (FIREABLE(t8) AND FIREABLE(t27))))) OR (E ((NOT FIREABLE(t27) U (FIREABLE(t32) AND FIREABLE(t10)))) AND E (((FIREABLE(t18) OR FIREABLE(t3)) U (FIREABLE(t11) OR FIREABLE(t18)))))) : A (G (A (X (E (F (FIREABLE(t14))))))) : E ((NOT(E (G (FIREABLE(t31)))) U (A (G (FIREABLE(t17))) AND (FIREABLE(t10) AND FIREABLE(t4) AND FIREABLE(t5)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 (X ((A (G (NOT FIREABLE(t15))) AND FIREABLE(t19))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(E(TRUE U FIREABLE(t15))) AND FIREABLE(t19)))
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 53 markings, 60 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (NOT FIREABLE(t18))) U A (X ((FIREABLE(t5) OR FIREABLE(t23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U NOT FIREABLE(t18)) U AX((FIREABLE(t5) OR FIREABLE(t23))))
lola: processed formula length: 69
lola: 35 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 22 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X (NOT FIREABLE(t4))) OR E (F (FIREABLE(t27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(AX(NOT FIREABLE(t4))) AND NOT(E(TRUE U FIREABLE(t27))))))
lola: processed formula length: 75
lola: 36 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 464458 markings, 2942732 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-11 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: (E ((E (X (FIREABLE(t25))) U ((FIREABLE(t8) AND FIREABLE(t9)) OR (FIREABLE(t8) AND FIREABLE(t27))))) OR (E ((NOT FIREABLE(t27) U (FIREABLE(t32) AND FIREABLE(t10)))) AND E (((FIREABLE(t18) OR FIREABLE(t3)) U (FIREABLE(t11) OR FIREABLE(t18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: (E(EX(FIREABLE(t25)) U ((FIREABLE(t8) AND FIREABLE(t9)) OR (FIREABLE(t8) AND FIREABLE(t27)))) OR (E(NOT FIREABLE(t27) U (FIREABLE(t32) AND FIREABLE(t10))) AND E((FIREABLE(t18) OR FIREABLE(t3)) U (FIREABLE(t11) OR FIREABLE(t18)))))
lola: processed formula length: 233
lola: 36 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1137824 markings, 5426888 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (E (F (FIREABLE(t14)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(NOT(E(TRUE U NOT(E(TRUE U FIREABLE(t14))))))
lola: processed formula length: 47
lola: 35 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10 markings, 24 edges

FORMULA JoinFreeModules-PT-0004-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t17)))
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(t17)))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.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(t17)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to JoinFreeModules-PT-0004-CTLFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: calling and running sara
sara: try reading problem file JoinFreeModules-PT-0004-CTLFireability-5-0.sara.
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-5 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 (E (G (FIREABLE(t32)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t32)
lola: processed formula length: 13
lola: sara: place or transition ordering is non-deterministic
33 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 18 markings, 18 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (G (FIREABLE(t13)))))))
lola: ========================================
lola: SUBTASK
lola: checking globally possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:656
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t13)
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not always possibly invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((NOT FIREABLE(t17) OR (FIREABLE(t10) AND FIREABLE(t30)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (FIREABLE(t17) AND (NOT FIREABLE(t10) OR NOT FIREABLE(t30)))
lola: processed formula length: 61
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 22 markings, 22 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-12 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: A (G ((A (F (FIREABLE(t4))) OR A (G (FIREABLE(t20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U FIREABLE(t4))) AND E(TRUE U NOT FIREABLE(t20)))))
lola: processed formula length: 76
lola: 38 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9 markings, 16 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((E (G (FIREABLE(t25))) AND FIREABLE(t31)) OR A (F (NOT FIREABLE(t24))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U ((A(TRUE U NOT FIREABLE(t25)) OR NOT FIREABLE(t31)) AND NOT(A(TRUE U NOT FIREABLE(t24))))))
lola: processed formula length: 104
lola: 40 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 91 markings, 313 edges

FORMULA JoinFreeModules-PT-0004-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (NOT FIREABLE(t31))) U (A (G (FIREABLE(t17))) AND (FIREABLE(t10) AND FIREABLE(t4) AND FIREABLE(t5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(A(TRUE U NOT FIREABLE(t31)) U (NOT(E(TRUE U NOT FIREABLE(t17))) AND (FIREABLE(t10) AND FIREABLE(t4) AND FIREABLE(t5))))
lola: processed formula length: 121
lola: 36 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: 1040620 markings, 6860883 edges, 208124 markings/sec, 0 secs
lola: 1800150 markings, 13101524 edges, 151906 markings/sec, 5 secs
lola: 2518552 markings, 19268926 edges, 143680 markings/sec, 10 secs
lola: 3214880 markings, 25292361 edges, 139266 markings/sec, 15 secs
lola: 3905149 markings, 31191228 edges, 138054 markings/sec, 20 secs
lola: 4560031 markings, 37117344 edges, 130976 markings/sec, 25 secs
lola: 4945258 markings, 43153932 edges, 77045 markings/sec, 30 secs
lola: 5594641 markings, 49515183 edges, 129877 markings/sec, 35 secs
lola: 6137825 markings, 54641162 edges, 108637 markings/sec, 40 secs
lola: 6797109 markings, 60600730 edges, 131857 markings/sec, 45 secs
lola: 7606219 markings, 66310153 edges, 161822 markings/sec, 50 secs
lola: 8875344 markings, 71848668 edges, 253825 markings/sec, 55 secs
lola: 9811473 markings, 77110639 edges, 187226 markings/sec, 60 secs
lola: 10926231 markings, 82200483 edges, 222952 markings/sec, 65 secs
lola: 11953045 markings, 87432989 edges, 205363 markings/sec, 70 secs
lola: 12813199 markings, 92589060 edges, 172031 markings/sec, 75 secs
lola: 13506314 markings, 98084169 edges, 138623 markings/sec, 80 secs
lola: 13707871 markings, 102817016 edges, 40311 markings/sec, 85 secs
lola: 13808068 markings, 107291331 edges, 20039 markings/sec, 90 secs
lola: 13818278 markings, 111272107 edges, 2042 markings/sec, 95 secs
lola: 13823063 markings, 115246169 edges, 957 markings/sec, 100 secs
lola: 13828228 markings, 119480667 edges, 1033 markings/sec, 105 secs
lola: 13833809 markings, 123567836 edges, 1116 markings/sec, 110 secs
lola: 13838548 markings, 127768014 edges, 948 markings/sec, 115 secs
lola: 13841000 markings, 132246116 edges, 490 markings/sec, 120 secs
lola: 13842040 markings, 136208470 edges, 208 markings/sec, 125 secs
lola: 13843529 markings, 141008247 edges, 298 markings/sec, 130 secs
lola: 13972058 markings, 146256583 edges, 25706 markings/sec, 135 secs
lola: 14467647 markings, 151985188 edges, 99118 markings/sec, 140 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14776336 markings, 156580853 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F (FIREABLE(t7))) OR (E (F (FIREABLE(t29))) OR A ((FIREABLE(t5) U FIREABLE(t24)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U FIREABLE(t7))) AND (NOT(E(TRUE U FIREABLE(t29))) AND NOT(A(FIREABLE(t5) U FIREABLE(t24)))))))
lola: processed formula length: 120
lola: 38 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3802 markings, 15430 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((NOT FIREABLE(t17) R (NOT FIREABLE(t20) AND NOT FIREABLE(t32)))) OR ((FIREABLE(t19) OR (NOT FIREABLE(t6) AND NOT FIREABLE(t31)) OR NOT FIREABLE(t4)) AND E (F (FIREABLE(t25)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t19) OR (NOT FIREABLE(t6) AND NOT FIREABLE(t31)) OR NOT FIREABLE(t4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t19) OR (NOT FIREABLE(t6) AND NOT FIREABLE(t31)) OR NOT FIREABLE(t4))
lola: processed formula length: 81
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t25)))
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(t25)))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.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: 9 markings, 8 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(t25))) AND ((NOT FIREABLE(t16) OR E (G (NOT FIREABLE(t17)))) AND ((NOT FIREABLE(t7) OR NOT FIREABLE(t9) OR (NOT FIREABLE(t21) AND NOT FIREABLE(t12)) OR NOT FIREABLE(t12)) OR (NOT FIREABLE(t5) OR E (G (NOT FIREABLE(t14)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t5)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t16)
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(t21))) OR (E (F (FIREABLE(t12))) AND E (F (A (G (FIREABLE(t22)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t12)))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t22)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t22)
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no no yes yes yes no unknown unknown yes no no no no no no
lola: memory consumption: 30300 KB
lola: time consumption: 157 seconds
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(t25))) AND ((NOT FIREABLE(t16) OR E (G (NOT FIREABLE(t17)))) AND ((NOT FIREABLE(t7) OR NOT FIREABLE(t9) OR (NOT FIREABLE(t21) AND NOT FIREABLE(t12)) OR NOT FIREABLE(t12)) OR (NOT FIREABLE(t5) OR E (G (NOT FIREABLE(t14)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t5)
lola: processed formula length: 16
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t16)
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t25)))
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:695
lola: processed formula: A (G (NOT FIREABLE(t25)))
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.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:695
lola: formula 0: FIREABLE(t25)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to JoinFreeModules-PT-0004-CTLFireability-18-0.sara
lola: ========================================lola:
state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(t21))) OR (E (F (FIREABLE(t12))) AND E (F (A (G (FIREABLE(t22)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t12)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t12)))
lola: processed formula length: 21
lola: 33 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.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: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
sara: try reading problem file JoinFreeModules-PT-0004-CTLFireability-18-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t21)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t21)
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 28 markings, 27 edges
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t22)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t22)
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file JoinFreeModules-PT-0004-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING

lola: 1526756 markings, 6871931 edges, 305351 markings/sec, 0 secs
lola: 2853948 markings, 13660912 edges, 265438 markings/sec, 5 secs
lola: 5019688 markings, 19727736 edges, 433148 markings/sec, 10 secs
lola: 7371186 markings, 25061071 edges, 470300 markings/sec, 15 secs
lola: 9176723 markings, 30082489 edges, 361107 markings/sec, 20 secs
lola: 10782444 markings, 35461945 edges, 321144 markings/sec, 25 secs
lola: 12010553 markings, 41241605 edges, 245622 markings/sec, 30 secs
lola: 12562342 markings, 47003674 edges, 110358 markings/sec, 35 secs
lola: 13183902 markings, 52472981 edges, 124312 markings/sec, 40 secs
lola: 13609932 markings, 57533842 edges, 85206 markings/sec, 45 secs
lola: 13876756 markings, 62327548 edges, 53365 markings/sec, 50 secs
lola: 14016662 markings, 66889842 edges, 27981 markings/sec, 55 secs
lola: 14133790 markings, 71524383 edges, 23426 markings/sec, 60 secs
lola: 14274091 markings, 76140381 edges, 28060 markings/sec, 65 secs
lola: 14427439 markings, 80779908 edges, 30670 markings/sec, 70 secs
lola: 14576023 markings, 85630081 edges, 29717 markings/sec, 75 secs
lola: 14689428 markings, 90665201 edges, 22681 markings/sec, 80 secs
lola: 14771699 markings, 96556583 edges, 16454 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 14776336 markings, 98632076 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0004-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no no yes no no no no no no
lola:
preliminary result: no no no yes yes yes no no no yes no no no no no no
lola: memory consumption: 14776 KB
lola: time consumption: 249 seconds

BK_STOP 1526811084658

--------------------
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-0004"
export BK_EXAMINATION="CTLFireability"
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-0004.tgz
mv JoinFreeModules-PT-0004 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-0004, examination is CTLFireability"
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-152658630900235"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;