About the Execution of LoLA for ResAllocation-PT-R020C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1069.920 | 418283.00 | 415756.00 | 7614.00 | ?FFFFTFFFTFTFTFT | 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 256K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 6.3K 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 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 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.8K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R020C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579200403
=====================================================================
--------------------
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 ResAllocation-PT-R020C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527015188659
info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R020C002 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ResAllocation-PT-R020C002 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ ResAllocation-PT-R020C002 @ 3563 seconds
lola: LoLA will run for 3563 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 122/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 42 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 62 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R020C002-CTLFireability.task
lola: NOT(A (F (A (F (FIREABLE(t_1_16)))))) : ((E (X (A (G (FIREABLE(t_0_15))))) AND E (G ((FIREABLE(t_0_1) OR (FIREABLE(t_1_11) AND FIREABLE(t_0_5)))))) OR A (F ((E (G (FIREABLE(t_1_7))) AND NOT FIREABLE(t_0_3))))) : (A (F (A (X ((FIREABLE(t_0_11) OR FIREABLE(t_0_10)))))) OR ((A (G (FIREABLE(t_1_2))) OR (FIREABLE(t_0_13) OR FIREABLE(t_1_15))) OR E (G ((FIREABLE(t_0_5) AND FIREABLE(t_0_20) AND FIREABLE(t_0_16) AND FIREABLE(t_0_20)))))) : (E (F (A (G (FIREABLE(t_1_7))))) OR FIREABLE(t_0_6)) : (E (((NOT FIREABLE(t_1_9) OR (FIREABLE(t_0_12) AND FIREABLE(t_1_5))) U E (G (FIREABLE(t_0_6))))) AND NOT(A (G (A (G (FIREABLE(t_0_14))))))) : A (G (E (F ((NOT FIREABLE(t_1_9) OR (FIREABLE(t_1_0) AND FIREABLE(t_1_16))))))) : NOT(NOT(E (F (E (G (FIREABLE(t_0_4))))))) : (E (X (((FIREABLE(t_0_19) OR NOT FIREABLE(t_1_18)) AND A (F (FIREABLE(t_0_13)))))) AND (FIREABLE(t_0_1) OR E (F ((FIREABLE(t_0_4) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_14))))))) : (A (X (A (X ((FIREABLE(t_0_18) AND FIREABLE(t_1_5)))))) OR A (F ((A (X (FIREABLE(t_1_6))) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_3) AND NOT FIREABLE(t_0_3)))))) : (E (F ((E (G (FIREABLE(t_1_8))) OR E (G (FIREABLE(t_0_6)))))) OR (E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10)))) AND E (F ((FIREABLE(t_1_5) AND FIREABLE(t_0_0) AND NOT FIREABLE(t_1_20)))))) : (E (((NOT FIREABLE(t_0_13) OR NOT FIREABLE(t_1_10)) U E (G (FIREABLE(t_1_0))))) OR E (X ((A (G (FIREABLE(t_1_12))) AND (FIREABLE(t_1_15) AND FIREABLE(t_0_5) AND FIREABLE(t_1_20)))))) : E (F (FIREABLE(t_0_19))) : A (G ((FIREABLE(t_1_20) OR NOT FIREABLE(t_0_18) OR FIREABLE(t_0_14)))) : (FIREABLE(t_1_3) OR ((A (X ((FIREABLE(t_0_13) AND FIREABLE(t_0_9)))) OR E (G (NOT FIREABLE(t_1_3)))) AND NOT(E ((FIREABLE(t_0_16) U FIREABLE(t_1_6)))))) : (A ((E (F (FIREABLE(t_1_5))) U A (G (FIREABLE(t_0_10))))) OR (((E (G (FIREABLE(t_1_10))) AND (FIREABLE(t_1_0) AND FIREABLE(t_0_20) AND (FIREABLE(t_1_15) OR FIREABLE(t_0_13)))) OR FIREABLE(t_1_12)) AND ((E (F (FIREABLE(t_1_16))) OR A (G (FIREABLE(t_0_13)))) AND (FIREABLE(t_0_18) AND NOT FIREABLE(t_1_0) AND (FIREABLE(t_1_12) OR FIREABLE(t_0_4) OR NOT FIREABLE(t_1_20)))))) : NOT((E (X (FIREABLE(t_0_12))) OR A ((NOT FIREABLE(t_0_12) U (FIREABLE(t_0_18) OR FIREABLE(t_0_12))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:548
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (A (G (FIREABLE(t_0_15))))) AND E (G ((FIREABLE(t_0_1) OR (FIREABLE(t_1_11) AND FIREABLE(t_0_5)))))) OR A (F ((E (G (FIREABLE(t_1_7))) AND NOT FIREABLE(t_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t_0_1) OR (FIREABLE(t_1_11) AND FIREABLE(t_0_5)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(t_0_1) OR (FIREABLE(t_1_11) AND FIREABLE(t_0_5)))))
lola: processed formula length: 68
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G (FIREABLE(t_1_7))) AND NOT FIREABLE(t_0_3))))
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:297
lola: processed formula: A(TRUE U (NOT(A(TRUE U NOT FIREABLE(t_1_7))) AND NOT FIREABLE(t_0_3)))
lola: processed formula length: 70
lola: 36 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 76 markings, 152 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola:
========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-1 FALSE 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: (A (F (A (X ((FIREABLE(t_0_11) OR FIREABLE(t_0_10)))))) OR (A (G (FIREABLE(t_1_2))) OR ((FIREABLE(t_0_13) OR FIREABLE(t_1_15)) OR E (G ((FIREABLE(t_0_5) AND FIREABLE(t_0_20) AND FIREABLE(t_0_16) AND FIREABLE(t_0_20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t_0_13) OR FIREABLE(t_1_15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t_0_13) OR FIREABLE(t_1_15))
lola: processed formula length: 39
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t_1_2)))
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(t_1_2)))
lola: processed formula length: 23
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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:694
lola: formula 0: NOT FIREABLE(t_1_2)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-CTLFireability-2-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t_0_5) AND FIREABLE(t_0_20) AND FIREABLE(t_0_16) AND FIREABLE(t_0_20))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(t_0_5) AND FIREABLE(t_0_20) AND FIREABLE(t_0_16) AND FIREABLE(t_0_20))))
lola: processed formula length: 88
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((FIREABLE(t_0_11) OR FIREABLE(t_0_10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((FIREABLE(t_0_11) OR FIREABLE(t_0_10))))
lola: processed formula length: 53
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 872960 markings, 4517748 edges, 174592 markings/sec, 0 secs
lola: 1662754 markings, 8921543 edges, 157959 markings/sec, 5 secs
lola: 2424298 markings, 13235639 edges, 152309 markings/sec, 10 secs
lola: 3150442 markings, 17426315 edges, 145229 markings/sec, 15 secs
lola: 3851451 markings, 21505701 edges, 140202 markings/sec, 20 secs
lola: 4566567 markings, 25521944 edges, 143023 markings/sec, 25 secs
lola: 5317016 markings, 29829534 edges, 150090 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5439554 markings, 30507130 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((FIREABLE(t_0_19) OR NOT FIREABLE(t_1_18)) AND A (F (FIREABLE(t_0_13)))))) AND (FIREABLE(t_0_1) OR E (F ((FIREABLE(t_0_4) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_14)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_0_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_0_1)
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_0_4) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_14)))))
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(t_0_4) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_14)))))
lola: processed formula length: 69
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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(t_0_4) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_14)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((FIREABLE(t_0_19) OR NOT FIREABLE(t_1_18)) AND A (F (FIREABLE(t_0_13))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((FIREABLE(t_0_19) OR NOT FIREABLE(t_1_18)) AND A(TRUE U FIREABLE(t_0_13))))
lola: processed formula length: 80
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 221 markings, 221 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (X ((FIREABLE(t_0_18) AND FIREABLE(t_1_5)))))) OR A (F ((A (X (FIREABLE(t_1_6))) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_3) AND NOT FIREABLE(t_0_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X (FIREABLE(t_1_6))) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_3) AND NOT FIREABLE(t_0_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (AX(FIREABLE(t_1_6)) OR (FIREABLE(t_1_20) AND FIREABLE(t_1_3) AND NOT FIREABLE(t_0_3))))
lola: processed formula length: 97
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 76 markings, 76 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X ((FIREABLE(t_0_18) AND FIREABLE(t_1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(AX((FIREABLE(t_0_18) AND FIREABLE(t_1_5))))
lola: processed formula length: 46
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(t_0_13) OR NOT FIREABLE(t_1_10)) U E (G (FIREABLE(t_1_0))))) OR E (X ((A (G (FIREABLE(t_1_12))) AND (FIREABLE(t_1_15) AND FIREABLE(t_0_5) AND FIREABLE(t_1_20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
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: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E((NOT FIREABLE(t_0_13) OR NOT FIREABLE(t_1_10)) U NOT(A(TRUE U NOT FIREABLE(t_1_0)))) OR EX((NOT(E(TRUE U NOT FIREABLE(t_1_12))) AND (FIREABLE(t_1_15) AND FIREABLE(t_0_5) AND FIREABLE(t_1_20)))))
lola: processed formula length: 198
lola: 39 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 821460 markings, 5127206 edges, 164292 markings/sec, 0 secs
lola: 1596418 markings, 10191117 edges, 154992 markings/sec, 5 secs
lola: 2343699 markings, 15184627 edges, 149456 markings/sec, 10 secs
lola: 3065282 markings, 20155973 edges, 144317 markings/sec, 15 secs
lola: 3831115 markings, 25082813 edges, 153167 markings/sec, 20 secs
lola: 4579967 markings, 29829326 edges, 149770 markings/sec, 25 secs
lola: 5320001 markings, 34424050 edges, 148007 markings/sec, 30 secs
lola: 6036210 markings, 39000376 edges, 143242 markings/sec, 35 secs
lola: 6755983 markings, 43580593 edges, 143955 markings/sec, 40 secs
lola: 7456395 markings, 48275010 edges, 140082 markings/sec, 45 secs
lola: 8138776 markings, 52688394 edges, 136476 markings/sec, 50 secs
lola: 8803572 markings, 57174937 edges, 132959 markings/sec, 55 secs
lola: 9434861 markings, 61373661 edges, 126258 markings/sec, 60 secs
lola: 9587238 markings, 64666471 edges, 30475 markings/sec, 65 secs
lola: 10287090 markings, 69459920 edges, 139970 markings/sec, 70 secs
lola: 11532842 markings, 73950631 edges, 249150 markings/sec, 75 secs
lola: 11534336 markings, 77895135 edges, 299 markings/sec, 80 secs
lola: 11534336 markings, 81417043 edges, 0 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11534336 markings, 81526786 edges
lola:
FORMULA ResAllocation-PT-R020C002-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t_1_3) OR ((A (X ((FIREABLE(t_0_13) AND FIREABLE(t_0_9)))) OR E (G (NOT FIREABLE(t_1_3)))) AND A ((NOT FIREABLE(t_0_16) R NOT FIREABLE(t_1_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(t_1_3)))
lola: processed formula length: 27
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 21 markings, 21 edges
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_1_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_1_3)
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t_0_16) R NOT FIREABLE(t_1_6)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A ((NOT FIREABLE(t_0_16) R NOT FIREABLE(t_1_6)))
lola: processed formula length: 48
lola: 39 rewrites
lola: closed formula file ResAllocation-PT-R020C002-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: formula 0: FIREABLE(t_1_6)
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (NOT FIREABLE(t_0_12))) AND E ((FIREABLE(t_0_12) R (NOT FIREABLE(t_0_18) AND NOT FIREABLE(t_0_12)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t_0_12) R (NOT FIREABLE(t_0_18) AND NOT FIREABLE(t_0_12))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E ((FIREABLE(t_0_12) R (NOT FIREABLE(t_0_18) AND NOT FIREABLE(t_0_12))))
lola: processed formula length: 72
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 114 markings, 113 edges
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(t_0_12)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(NOT FIREABLE(t_0_12))
lola: processed formula length: 24
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t_0_19)))
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(t_0_19)))
lola: processed formula length: 24
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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(t_0_19)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t_1_20) OR NOT FIREABLE(t_0_18) OR FIREABLE(t_0_14))))
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(t_1_20) OR NOT FIREABLE(t_0_18) OR FIREABLE(t_0_14))))
lola: processed formula length: 72
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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:694
lola: formula 0: (NOT FIREABLE(t_1_20) AND FIREABLE(t_0_18) AND NOT FIREABLE(t_0_14))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-CTLFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t_0_4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t_0_4)
lola: processed formula length: 15
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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 is not possibly preserved from any reachable marking.
lola: 1054763 markings, 2696255 edges
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t_1_16)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(t_1_16)))
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 90 markings, 90 edges
lola: FORMULA ResAllocation-PT-R020C002-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(t_1_9) OR (FIREABLE(t_1_0) AND FIREABLE(t_1_16)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (NOT FIREABLE(t_1_9) OR (FIREABLE(t_1_0) AND FIREABLE(t_1_16)))
lola: processed formula length: 64
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 1036021 markings, 5438824 edges, 207204 markings/sec, 0 secs
lola: 1943246 markings, 10672213 edges, 181445 markings/sec, 5 secs
lola: 2850514 markings, 15846415 edges, 181454 markings/sec, 10 secs
lola: 3783114 markings, 20967151 edges, 186520 markings/sec, 15 secs
lola: 4715936 markings, 25888313 edges, 186564 markings/sec, 20 secs
lola: 5645321 markings, 30693647 edges, 185877 markings/sec, 25 secs
lola: 6592202 markings, 35369077 edges, 189376 markings/sec, 30 secs
lola: 7524432 markings, 40106247 edges, 186446 markings/sec, 35 secs
lola: 8448891 markings, 44608166 edges, 184892 markings/sec, 40 secs
lola: 9317729 markings, 48975923 edges, 173768 markings/sec, 45 secs
lola: 9617034 markings, 52955716 edges, 59861 markings/sec, 50 secs
lola: 10641446 markings, 57771048 edges, 204882 markings/sec, 55 secs
lola: 11414726 markings, 61886945 edges, 154656 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 11417752 markings, 62917635 edges
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(t_1_9) OR (FIREABLE(t_0_12) AND FIREABLE(t_1_5))) U E (G (FIREABLE(t_0_6))))) AND E (F (NOT FIREABLE(t_0_14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E((NOT FIREABLE(t_1_9) OR (FIREABLE(t_0_12) AND FIREABLE(t_1_5))) U NOT(A(TRUE U NOT FIREABLE(t_0_6)))) AND E(TRUE U NOT FIREABLE(t_0_14)))
lola: processed formula length: 141
lola: 37 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 1659901 markings, 4630972 edges, 331980 markings/sec, 0 secs
lola: 2859128 markings, 9316466 edges, 239845 markings/sec, 5 secs
lola: 3450402 markings, 14164103 edges, 118255 markings/sec, 10 secs
lola: 3981163 markings, 19002107 edges, 106152 markings/sec, 15 secs
lola: 4548953 markings, 23801056 edges, 113558 markings/sec, 20 secs
lola: 5148000 markings, 28584910 edges, 119809 markings/sec, 25 secs
lola: 5618520 markings, 33440787 edges, 94104 markings/sec, 30 secs
lola: 6063606 markings, 38275570 edges, 89017 markings/sec, 35 secs
lola: 6426913 markings, 42999069 edges, 72661 markings/sec, 40 secs
lola: 6772964 markings, 47595754 edges, 69210 markings/sec, 45 secs
lola: 7179370 markings, 52058402 edges, 81281 markings/sec, 50 secs
lola: 7391226 markings, 55529009 edges, 42371 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7405568 markings, 56557568 edges
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (F (FIREABLE(t_1_5))) U A (G (FIREABLE(t_0_10))))) OR (((E (G (FIREABLE(t_1_10))) AND (FIREABLE(t_1_0) AND FIREABLE(t_0_20) AND (FIREABLE(t_1_15) OR FIREABLE(t_0_13)))) OR FIREABLE(t_1_12)) AND ((E (F (FIREABLE(t_1_16))) OR A (G (FIREABLE(t_0_13)))) AND (FIREABLE(t_0_18) AND NOT FIREABLE(t_1_0) AND (FIREABLE(t_1_12) OR FIREABLE(t_0_4) OR NOT FIREABLE(t_1_20))))))
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:739
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (A(E(TRUE U FIREABLE(t_1_5)) U NOT(E(TRUE U NOT FIREABLE(t_0_10)))) OR (((NOT(A(TRUE U NOT FIREABLE(t_1_10))) AND (FIREABLE(t_1_0) AND FIREABLE(t_0_20) AND (FIREABLE(t_1_15) OR FIREABLE(t_0_13)))) OR FIREABLE(t_1_12)) AND ((E(TRUE U FIREABLE(t_1_16)) OR NOT(E(TRUE U NOT FIREABLE(t_0_13)))) AND (FIREABLE(t_0_18) AND NOT FIREABLE(t_1_0) AND (FIREABLE(t_1_12) OR FIREABLE(t_0_4) OR NOT FIREABLE(t_1... (shortened)
lola: processed formula length: 409
lola: 42 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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 6 significant temporal operators and needs 26 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 944575 markings, 4919615 edges, 188915 markings/sec, 0 secs
lola: 1778852 markings, 9718325 edges, 166855 markings/sec, 5 secs
lola: 2611354 markings, 14459442 edges, 166500 markings/sec, 10 secs
lola: 3435365 markings, 19170176 edges, 164802 markings/sec, 15 secs
lola: 4294217 markings, 23691370 edges, 171770 markings/sec, 20 secs
lola: 5116208 markings, 28130848 edges, 164398 markings/sec, 25 secs
lola: 5928357 markings, 32377131 edges, 162430 markings/sec, 30 secs
lola: 6741314 markings, 36738648 edges, 162591 markings/sec, 35 secs
lola: 7533715 markings, 41246768 edges, 158480 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7915036 markings, 43344769 edges
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (FIREABLE(t_1_7))))) OR FIREABLE(t_0_6))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_0_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_0_6)
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(t_1_7)))))
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(t_1_7)
lola: processed formula length: 19
lola: 35 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: 1028049 markings, 5398079 edges, 205610 markings/sec, 0 secs
lola: 1935964 markings, 10629818 edges, 181583 markings/sec, 5 secs
lola: 2824494 markings, 15689827 edges, 177706 markings/sec, 10 secs
lola: 3742229 markings, 20755160 edges, 183547 markings/sec, 15 secs
lola: 4675527 markings, 25736117 edges, 186660 markings/sec, 20 secs
lola: 5586527 markings, 30591419 edges, 182200 markings/sec, 25 secs
lola: 6501238 markings, 35401664 edges, 182942 markings/sec, 30 secs
lola: 7416371 markings, 40238863 edges, 183027 markings/sec, 35 secs
lola: 8374876 markings, 44775084 edges, 191701 markings/sec, 40 secs
lola: 9304837 markings, 49204381 edges, 185992 markings/sec, 45 secs
lola: 9607216 markings, 53155409 edges, 60476 markings/sec, 50 secs
lola: 10679876 markings, 57935321 edges, 214532 markings/sec, 55 secs
lola: 11417446 markings, 62155709 edges, 147514 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 11417600 markings, 62550016 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (FIREABLE(t_1_8))))) OR (E (F (E (G (FIREABLE(t_0_6))))) OR (E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10)))) AND E (F ((FIREABLE(t_1_5) AND FIREABLE(t_0_0) AND NOT FIREABLE(t_1_20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10))))
lola: processed formula length: 55
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 76 markings, 76 edges
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 (E (G (FIREABLE(t_0_6)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t_0_6)
lola: processed formula length: 15
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: local time limit reached - aborting
lola:
preliminary result: yes no no no no yes no no no unknown no yes no yes no yes
lola: memory consumption: 27908 KB
lola: time consumption: 373 seconds
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 1063855 markings, 2710399 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t_1_8)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(t_1_8)
lola: processed formula length: 15
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: local time limit reached - aborting
lola:
preliminary result: yes no no no no yes no no no unknown no yes no yes no yes
lola: memory consumption: 28892 KB
lola: time consumption: 376 seconds
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 1240063 markings, 3051519 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (FIREABLE(t_1_8))))) OR (E (F (E (G (FIREABLE(t_0_6))))) OR (E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10)))) AND E (F ((FIREABLE(t_1_5) AND FIREABLE(t_0_0) AND NOT FIREABLE(t_1_20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(t_0_20) OR NOT FIREABLE(t_1_10))))
lola: processed formula length: 55
lola: 33 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 76 markings, 76 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_1_5) AND FIREABLE(t_0_0) AND NOT FIREABLE(t_1_20))))
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(t_1_5) AND FIREABLE(t_0_0) AND NOT FIREABLE(t_1_20))))
lola: processed formula length: 70
lola: 34 rewrites
lola: closed formula file ResAllocation-PT-R020C002-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(t_1_5) AND FIREABLE(t_0_0) AND NOT FIREABLE(t_1_20))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: state equation: write sara problem file to ResAllocation-PT-R020C002-CTLFireability-17-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA ResAllocation-PT-R020C002-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no yes no yes no yes no yes
lola:
preliminary result: yes no no no no yes no no no yes no yes no yes no yes
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R020C002-CTLFireability-17-0.sara.
lola: memory consumption: 14936 KB
lola: time consumption: 379 seconds
sara: place or transition ordering is non-deterministic
BK_STOP 1527015606942
--------------------
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="ResAllocation-PT-R020C002"
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/ResAllocation-PT-R020C002.tgz
mv ResAllocation-PT-R020C002 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 ResAllocation-PT-R020C002, 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 r136-qhx2-152673579200403"
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 '
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 ;