About the Execution of LoLA for HouseConstruction-PT-050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15917.770 | 3600000.00 | 1289270.00 | 13755.50 | FTFTFTT?TTTTTFFT | 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 188K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 17K 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.0K 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 11K 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.4K 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 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 13K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HouseConstruction-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630700080
=====================================================================
--------------------
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 HouseConstruction-PT-050-CTLCardinality-00
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-01
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-02
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-03
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-04
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-05
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-06
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-07
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-08
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-09
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-050-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526710918173
info: Time: 3600 - MCC
===========================================================================================
prep: translating HouseConstruction-PT-050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HouseConstruction-PT-050 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ HouseConstruction-PT-050 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 832
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-050-CTLCardinality.task
lola: E (G ((p18 <= p3))) : (E (G (((p10 <= p8) OR (3 <= p22) OR (p3 <= p2)))) AND (p17 <= p23)) : A (G (A (((2 <= p1) U (1 <= p22))))) : NOT(E (((p3 <= p13) U ((3 <= p1) AND (2 <= p8))))) : A (G (A (G ((p19 <= 2))))) : NOT(A (F (A (F ((2 <= p27)))))) : E (F ((2 <= p17))) : NOT(E (G (E (X ((p22 <= p2)))))) : E (F (A (F (((3 <= p5) AND (2 <= p18)))))) : (((p15 <= p22) OR (((p17 <= p19) OR (2 <= p22)) AND ((1 <= p11) OR (p8 <= p16))) OR (1 <= p17)) AND E (X (E (F ((3 <= p10)))))) : A (F (NOT(E (F ((3 <= p7)))))) : E (G ((p3 <= 2))) : NOT((((p3 <= p13) AND (2 <= p20)) OR (A (F ((2 <= p20))) AND (p21 <= p9)))) : A (F (A (F (((1 <= p11) AND (p17 <= p13)))))) : (E (G ((p15 <= 0))) AND (p16 <= p10)) : (A (X (((p27 <= p13) OR (p13 <= p1) OR (3 <= p25) OR (p2 <= p19)))) AND E (F (E (G ((p26 <= p19))))))
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:389
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:455
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p2 + 1 <= p22)))))
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((p2 + 1 <= p22)))
lola: processed formula length: 29
lola: 28 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 1148855 markings, 5112988 edges, 229771 markings/sec, 0 secs
lola: 2071436 markings, 9782492 edges, 184516 markings/sec, 5 secs
lola: 3156081 markings, 14490160 edges, 216929 markings/sec, 10 secs
lola: 4046343 markings, 19078448 edges, 178052 markings/sec, 15 secs
lola: 4927039 markings, 23264397 edges, 176139 markings/sec, 20 secs
lola: 5712921 markings, 27673544 edges, 157176 markings/sec, 25 secs
lola: 6801248 markings, 31901891 edges, 217665 markings/sec, 30 secs
lola: 7757230 markings, 36321511 edges, 191196 markings/sec, 35 secs
lola: 8679290 markings, 41056754 edges, 184412 markings/sec, 40 secs
lola: 9436459 markings, 45149287 edges, 151434 markings/sec, 45 secs
lola: 10239654 markings, 49224889 edges, 160639 markings/sec, 50 secs
lola: 10944038 markings, 53129764 edges, 140877 markings/sec, 55 secs
lola: 11767183 markings, 56887639 edges, 164629 markings/sec, 60 secs
lola: 12535314 markings, 60645630 edges, 153626 markings/sec, 65 secs
lola: 13145945 markings, 64728575 edges, 122126 markings/sec, 70 secs
lola: 13927929 markings, 68571419 edges, 156397 markings/sec, 75 secs
lola: 14720239 markings, 72537594 edges, 158462 markings/sec, 80 secs
lola: 15855621 markings, 76248033 edges, 227076 markings/sec, 85 secs
lola: 16808469 markings, 80012422 edges, 190570 markings/sec, 90 secs
lola: 17569976 markings, 84307025 edges, 152301 markings/sec, 95 secs
lola: 18396270 markings, 88821004 edges, 165259 markings/sec, 100 secs
lola: 19158744 markings, 92834324 edges, 152495 markings/sec, 105 secs
lola: 19930145 markings, 96447715 edges, 154280 markings/sec, 110 secs
lola: 20578247 markings, 100284515 edges, 129620 markings/sec, 115 secs
lola: 21167566 markings, 103791326 edges, 117864 markings/sec, 120 secs
lola: 22013376 markings, 107151018 edges, 169162 markings/sec, 125 secs
lola: 22664632 markings, 110616840 edges, 130251 markings/sec, 130 secs
lola: 23291158 markings, 114649117 edges, 125305 markings/sec, 135 secs
lola: 23930282 markings, 118322186 edges, 127825 markings/sec, 140 secs
lola: 24566020 markings, 121896122 edges, 127148 markings/sec, 145 secs
lola: 25441609 markings, 125577421 edges, 175118 markings/sec, 150 secs
lola: 26227311 markings, 128913967 edges, 157140 markings/sec, 155 secs
lola: 26953834 markings, 132473343 edges, 145305 markings/sec, 160 secs
lola: 27524156 markings, 136323177 edges, 114064 markings/sec, 165 secs
lola: 28178182 markings, 140570651 edges, 130805 markings/sec, 170 secs
lola: 28970729 markings, 144412939 edges, 158509 markings/sec, 175 secs
lola: 29769240 markings, 148255147 edges, 159702 markings/sec, 180 secs
lola: 30528254 markings, 152039926 edges, 151803 markings/sec, 185 secs
lola: 31558360 markings, 155834564 edges, 206021 markings/sec, 190 secs
lola: 32567574 markings, 159241090 edges, 201843 markings/sec, 195 secs
lola: 33508086 markings, 162879673 edges, 188102 markings/sec, 200 secs
lola: 34343214 markings, 166777841 edges, 167026 markings/sec, 205 secs
lola: 35040740 markings, 170830493 edges, 139505 markings/sec, 210 secs
lola: 35731571 markings, 175038241 edges, 138166 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4043076 KB
lola: time consumption: 223 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p15 <= p22) OR (((p17 <= p19) OR (2 <= p22)) AND ((1 <= p11) OR (p8 <= p16))) OR (1 <= p17)) AND E (X (E (F ((3 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p15 <= p22) OR (((p17 <= p19) OR (2 <= p22)) AND ((1 <= p11) OR (p8 <= p16))) OR (1 <= p17))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p15 <= p22) OR (((p17 <= p19) OR (2 <= p22)) AND ((1 <= p11) OR (p8 <= p16))) OR (1 <= p17))
lola: processed formula length: 98
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 6 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 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (3 <= p10)
lola: processed formula length: 10
lola: 27 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef 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 /EXEF
lola: The predicate is reachable from some successor.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((p27 <= p13) OR (p13 <= p1) OR (3 <= p25) OR (p2 <= p19)))) AND E (F (E (G ((p26 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p26 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (p26 <= p19)
lola: processed formula length: 12
lola: 27 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 901 markings, 900 edges
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p27 <= p13) OR (p13 <= p1) OR (3 <= p25) OR (p2 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((p27 <= p13) OR (p13 <= p1) OR (3 <= p25) OR (p2 <= p19)))
lola: processed formula length: 65
lola: 27 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: ========================================lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
FORMULA HouseConstruction-PT-050-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p17)))
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 ((2 <= p17)))
lola: processed formula length: 18
lola: 27 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: (2 <= p17)
lola: state equation: Generated DNF with 1 literals and 1 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 HouseConstruction-PT-050-CTLCardinality-3-0.sara
FORMULA HouseConstruction-PT-050-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: A (G ((p19 <= 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 ((p19 <= 2)))
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: sara: try reading problem file HouseConstruction-PT-050-CTLCardinality-3-0.sara.
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: (3 <= p19)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to HouseConstruction-PT-050-CTLCardinality-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p5) AND (2 <= p18))))
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 (((3 <= p5) AND (2 <= p18))))
lola: processed formula length: 34
lola: 27 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: ((3 <= p5) AND (2 <= p18))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p3 <= 2)))
lola: processed formula length: 17
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 901 markings, 900 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p27 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p27 <= 1)))
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 901 markings, 900 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p18 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p18 <= p3)))
lola: processed formula length: 19
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 19025 markings, 20200 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p11) AND (p17 <= p13))))
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: ((p11 <= 0) OR (p13 + 1 <= p17))
lola: processed formula length: 33
lola: 28 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 901 markings, 900 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= p1) U (1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((2 <= p1) U (1 <= p22)))))
lola: processed formula length: 45
lola: 28 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 434 markings, 434 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p15 <= 0))) AND (p16 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p16 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= p10)
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 1 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 12 will run for 836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p15 <= 0)))
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 701 markings, 700 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p7 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (3 <= p7)
lola: processed formula length: 9
lola: 28 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: The predicate is eventually invariant.
lola: 901 markings, 900 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p13 + 1 <= p3) R ((p1 <= 2) OR (p8 <= 1))))
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 (((p13 + 1 <= p3) R ((p1 <= 2) OR (p8 <= 1))))
lola: processed formula length: 49
lola: 32 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: formula 0: ((3 <= p1) AND (2 <= p8))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-050-CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 51 markings, 50 edges
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 + 1 <= p3) OR (p20 <= 1)) AND (E (G ((p20 <= 1))) OR (p9 + 1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 + 1 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 + 1 <= p21)
lola: processed formula length: 15
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 1 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 3347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p13 + 1 <= p3) OR (p20 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p13 + 1 <= p3) OR (p20 <= 1))
lola: processed formula length: 32
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 2 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 3347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p10 <= p8) OR (3 <= p22) OR (p3 <= p2)))) AND (p17 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p17 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 <= p23)
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: A (F (A (X ((p2 + 1 <= p22)))))
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((p2 + 1 <= p22)))
lola: processed formula length: 29
lola: 28 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 1176963 markings, 5248509 edges, 235393 markings/sec, 0 secs
lola: 2074466 markings, 9800224 edges, 179501 markings/sec, 5 secs
lola: 3123403 markings, 14331939 edges, 209787 markings/sec, 10 secs
lola: 4022055 markings, 18936803 edges, 179730 markings/sec, 15 secs
lola: 4902858 markings, 23117946 edges, 176161 markings/sec, 20 secs
lola: 5687805 markings, 27529191 edges, 156989 markings/sec, 25 secs
lola: 6759630 markings, 31759776 edges, 214365 markings/sec, 30 secs
lola: 7733690 markings, 36168134 edges, 194812 markings/sec, 35 secs
lola: 8631728 markings, 40820700 edges, 179608 markings/sec, 40 secs
lola: 9355280 markings, 44887888 edges, 144710 markings/sec, 45 secs
lola: 10190246 markings, 48903252 edges, 166993 markings/sec, 50 secs
lola: 10906373 markings, 52864458 edges, 143225 markings/sec, 55 secs
lola: 11756205 markings, 56844391 edges, 169966 markings/sec, 60 secs
lola: 12549556 markings, 60732842 edges, 158670 markings/sec, 65 secs
lola: 13169694 markings, 64859520 edges, 124028 markings/sec, 70 secs
lola: 13988850 markings, 68903567 edges, 163831 markings/sec, 75 secs
lola: 14858837 markings, 73032135 edges, 173997 markings/sec, 80 secs
lola: 15972031 markings, 76669342 edges, 222639 markings/sec, 85 secs
lola: 16922154 markings, 80643152 edges, 190025 markings/sec, 90 secs
lola: 17706999 markings, 85043325 edges, 156969 markings/sec, 95 secs
lola: 18574051 markings, 89622855 edges, 173410 markings/sec, 100 secs
lola: 19296572 markings, 93713293 edges, 144504 markings/sec, 105 secs
lola: 20106124 markings, 97522463 edges, 161910 markings/sec, 110 secs
lola: 20759851 markings, 101352513 edges, 130745 markings/sec, 115 secs
lola: 21490939 markings, 104929369 edges, 146218 markings/sec, 120 secs
lola: 22296705 markings, 108266672 edges, 161153 markings/sec, 125 secs
lola: 22906802 markings, 112224139 edges, 122019 markings/sec, 130 secs
lola: 23530950 markings, 116048442 edges, 124830 markings/sec, 135 secs
lola: 24185254 markings, 119480621 edges, 130861 markings/sec, 140 secs
lola: 24809663 markings, 123225046 edges, 124882 markings/sec, 145 secs
lola: 25716056 markings, 126582057 edges, 181279 markings/sec, 150 secs
lola: 26495906 markings, 129999824 edges, 155970 markings/sec, 155 secs
lola: 27168850 markings, 133884560 edges, 134589 markings/sec, 160 secs
lola: 27756324 markings, 137854538 edges, 117495 markings/sec, 165 secs
lola: 28453428 markings, 141915722 edges, 139421 markings/sec, 170 secs
lola: 29258235 markings, 145545094 edges, 160961 markings/sec, 175 secs
lola: 30067989 markings, 149341137 edges, 161951 markings/sec, 180 secs
lola: 30836503 markings, 153503380 edges, 153703 markings/sec, 185 secs
lola: 31896289 markings, 156963531 edges, 211957 markings/sec, 190 secs
lola: 32902013 markings, 160457203 edges, 201145 markings/sec, 195 secs
lola: 33856794 markings, 164184564 edges, 190956 markings/sec, 200 secs
lola: 34623316 markings, 168376236 edges, 153304 markings/sec, 205 secs
lola: 35317006 markings, 172526573 edges, 138738 markings/sec, 210 secs
lola: 36105893 markings, 177010818 edges, 157777 markings/sec, 215 secs
lola: 36928402 markings, 181285500 edges, 164502 markings/sec, 220 secs
lola: 37714094 markings, 184966782 edges, 157138 markings/sec, 225 secs
lola: 38383111 markings, 188914508 edges, 133803 markings/sec, 230 secs
lola: 38973954 markings, 192449755 edges, 118169 markings/sec, 235 secs
lola: 39828243 markings, 195864627 edges, 170858 markings/sec, 240 secs
lola: 40487025 markings, 199371821 edges, 131756 markings/sec, 245 secs
lola: 41073171 markings, 203172109 edges, 117229 markings/sec, 250 secs
lola: 41667282 markings, 206493694 edges, 118822 markings/sec, 255 secs
lola: 42258865 markings, 209718755 edges, 118317 markings/sec, 260 secs
lola: 42968613 markings, 213206088 edges, 141950 markings/sec, 265 secs
lola: 43756408 markings, 216220854 edges, 157559 markings/sec, 270 secs
lola: 44459664 markings, 219347858 edges, 140651 markings/sec, 275 secs
lola: 45048939 markings, 223031699 edges, 117855 markings/sec, 280 secs
lola: 45583387 markings, 226659765 edges, 106890 markings/sec, 285 secs
lola: 46185430 markings, 230385749 edges, 120409 markings/sec, 290 secs
lola: 46782279 markings, 233849510 edges, 119370 markings/sec, 295 secs
lola: 47349228 markings, 237106030 edges, 113390 markings/sec, 300 secs
lola: 48015331 markings, 240345748 edges, 133221 markings/sec, 305 secs
lola: 48540104 markings, 244029227 edges, 104955 markings/sec, 310 secs
lola: 49415226 markings, 247261789 edges, 175024 markings/sec, 315 secs
lola: 50224319 markings, 250386260 edges, 161819 markings/sec, 320 secs
lola: 50940053 markings, 253470484 edges, 143147 markings/sec, 325 secs
lola: 51682604 markings, 256712583 edges, 148510 markings/sec, 330 secs
lola: 52288718 markings, 260619147 edges, 121223 markings/sec, 335 secs
lola: 52837026 markings, 264342293 edges, 109662 markings/sec, 340 secs
lola: 53385118 markings, 268203164 edges, 109618 markings/sec, 345 secs
lola: 54070547 markings, 272293046 edges, 137086 markings/sec, 350 secs
lola: 54877133 markings, 275937666 edges, 161317 markings/sec, 355 secs
lola: 55611241 markings, 279563672 edges, 146822 markings/sec, 360 secs
lola: 56281125 markings, 283222244 edges, 133977 markings/sec, 365 secs
lola: 57161397 markings, 286764552 edges, 176054 markings/sec, 370 secs
lola: 57812268 markings, 290817213 edges, 130174 markings/sec, 375 secs
lola: 58875794 markings, 294409010 edges, 212705 markings/sec, 380 secs
lola: 59836592 markings, 297707604 edges, 192160 markings/sec, 385 secs
lola: 60800730 markings, 301071580 edges, 192828 markings/sec, 390 secs
lola: 61687409 markings, 304647813 edges, 177336 markings/sec, 395 secs
lola: 62640733 markings, 308125230 edges, 190665 markings/sec, 400 secs
lola: 63379208 markings, 312284980 edges, 147695 markings/sec, 405 secs
lola: 64035905 markings, 316223020 edges, 131339 markings/sec, 410 secs
lola: 64698174 markings, 320249227 edges, 132454 markings/sec, 415 secs
lola: 65368327 markings, 324427639 edges, 134031 markings/sec, 420 secs
lola: 66259815 markings, 328902512 edges, 178298 markings/sec, 425 secs
lola: 67049680 markings, 332737702 edges, 157973 markings/sec, 430 secs
lola: 67704576 markings, 336551797 edges, 130979 markings/sec, 435 secs
lola: 68375545 markings, 340205316 edges, 134194 markings/sec, 440 secs
lola: 69165963 markings, 343696865 edges, 158084 markings/sec, 445 secs
lola: 69867610 markings, 347105748 edges, 140329 markings/sec, 450 secs
lola: 70431039 markings, 350806876 edges, 112686 markings/sec, 455 secs
lola: 71086327 markings, 354440848 edges, 131058 markings/sec, 460 secs
lola: 71685865 markings, 357649449 edges, 119908 markings/sec, 465 secs
lola: 72278491 markings, 361213988 edges, 118525 markings/sec, 470 secs
lola: 73115430 markings, 364329983 edges, 167388 markings/sec, 475 secs
lola: 73814150 markings, 367405328 edges, 139744 markings/sec, 480 secs
lola: 74437105 markings, 370752128 edges, 124591 markings/sec, 485 secs
lola: 74973066 markings, 374367418 edges, 107192 markings/sec, 490 secs
lola: 75515021 markings, 378025444 edges, 108391 markings/sec, 495 secs
lola: 76139759 markings, 381445384 edges, 124948 markings/sec, 500 secs
lola: 76723908 markings, 384625538 edges, 116830 markings/sec, 505 secs
lola: 77290337 markings, 387826865 edges, 113286 markings/sec, 510 secs
lola: 77826804 markings, 390962963 edges, 107293 markings/sec, 515 secs
lola: 78520414 markings, 394434444 edges, 138722 markings/sec, 520 secs
lola: 79294912 markings, 397397671 edges, 154900 markings/sec, 525 secs
lola: 80047477 markings, 400344792 edges, 150513 markings/sec, 530 secs
lola: 80731268 markings, 403477536 edges, 136758 markings/sec, 535 secs
lola: 81369160 markings, 406376789 edges, 127578 markings/sec, 540 secs
lola: 81948472 markings, 410122933 edges, 115862 markings/sec, 545 secs
lola: 82453877 markings, 413637791 edges, 101081 markings/sec, 550 secs
lola: 82959432 markings, 417169404 edges, 101111 markings/sec, 555 secs
lola: 83547095 markings, 420873160 edges, 117533 markings/sec, 560 secs
lola: 84125867 markings, 424292249 edges, 115754 markings/sec, 565 secs
lola: 84705609 markings, 427460945 edges, 115948 markings/sec, 570 secs
lola: 85331066 markings, 430549623 edges, 125091 markings/sec, 575 secs
lola: 85811967 markings, 433888441 edges, 96180 markings/sec, 580 secs
lola: 86478269 markings, 436995988 edges, 133260 markings/sec, 585 secs
lola: 87020367 markings, 440311927 edges, 108420 markings/sec, 590 secs
lola: 87600039 markings, 443939106 edges, 115934 markings/sec, 595 secs
lola: 88446099 markings, 447085973 edges, 169212 markings/sec, 600 secs
lola: 89218633 markings, 450108274 edges, 154507 markings/sec, 605 secs
lola: 89945559 markings, 453071692 edges, 145385 markings/sec, 610 secs
lola: 90690441 markings, 456059672 edges, 148976 markings/sec, 615 secs
lola: 91403554 markings, 459374118 edges, 142623 markings/sec, 620 secs
lola: 92110854 markings, 462353893 edges, 141460 markings/sec, 625 secs
lola: 92714245 markings, 466157526 edges, 120678 markings/sec, 630 secs
lola: 93272739 markings, 469905528 edges, 111699 markings/sec, 635 secs
lola: 93792018 markings, 473546058 edges, 103856 markings/sec, 640 secs
lola: 94283625 markings, 477091452 edges, 98321 markings/sec, 645 secs
lola: 94795134 markings, 480772684 edges, 102302 markings/sec, 650 secs
lola: 95493444 markings, 484771100 edges, 139662 markings/sec, 655 secs
lola: 96268556 markings, 488221951 edges, 155022 markings/sec, 660 secs
lola: 96977127 markings, 491669471 edges, 141714 markings/sec, 665 secs
lola: 97601089 markings, 495137649 edges, 124792 markings/sec, 670 secs
lola: 98422717 markings, 498374902 edges, 164326 markings/sec, 675 secs
lola: 99015756 markings, 502032124 edges, 118608 markings/sec, 680 secs
lola: 99843494 markings, 505491041 edges, 165548 markings/sec, 685 secs
lola: 100577672 markings, 509126717 edges, 146836 markings/sec, 690 secs
lola: 101217944 markings, 513115661 edges, 128054 markings/sec, 695 secs
lola: 102284612 markings, 516510284 edges, 213334 markings/sec, 700 secs
lola: 103204981 markings, 519689675 edges, 184074 markings/sec, 705 secs
lola: 104116219 markings, 522860414 edges, 182248 markings/sec, 710 secs
lola: 105002802 markings, 526075557 edges, 177317 markings/sec, 715 secs
lola: 105960074 markings, 529477091 edges, 191454 markings/sec, 720 secs
lola: 106872794 markings, 533170618 edges, 182544 markings/sec, 725 secs
lola: 107792818 markings, 536592532 edges, 184005 markings/sec, 730 secs
lola: 108556006 markings, 540677668 edges, 152638 markings/sec, 735 secs
lola: 109226802 markings, 544646214 edges, 134159 markings/sec, 740 secs
lola: 109863953 markings, 548533774 edges, 127430 markings/sec, 745 secs
lola: 110516128 markings, 552500195 edges, 130435 markings/sec, 750 secs
lola: 111201075 markings, 556667015 edges, 136989 markings/sec, 755 secs
lola: 111875273 markings, 560851103 edges, 134840 markings/sec, 760 secs
lola: 112754679 markings, 565322335 edges, 175881 markings/sec, 765 secs
lola: 113560095 markings, 569101645 edges, 161083 markings/sec, 770 secs
lola: 114228349 markings, 573096411 edges, 133651 markings/sec, 775 secs
lola: 114851942 markings, 576679761 edges, 124719 markings/sec, 780 secs
lola: 115719023 markings, 580178025 edges, 173416 markings/sec, 785 secs
lola: 116393591 markings, 583803421 edges, 134914 markings/sec, 790 secs
lola: 116980477 markings, 587633056 edges, 117377 markings/sec, 795 secs
lola: 117606502 markings, 591136658 edges, 125205 markings/sec, 800 secs
lola: 118217323 markings, 594496435 edges, 122164 markings/sec, 805 secs
lola: 118936862 markings, 597922467 edges, 143908 markings/sec, 810 secs
lola: 119727159 markings, 600966816 edges, 158059 markings/sec, 815 secs
lola: 120435954 markings, 604128205 edges, 141759 markings/sec, 820 secs
lola: 120990711 markings, 607717434 edges, 110951 markings/sec, 825 secs
lola: 121446234 markings, 610782950 edges, 91105 markings/sec, 830 secs
lola: 122006206 markings, 614376261 edges, 111994 markings/sec, 835 secs
lola: 122521499 markings, 617285126 edges, 103059 markings/sec, 840 secs
lola: 123037027 markings, 620017051 edges, 103106 markings/sec, 845 secs
lola: 123516017 markings, 622893651 edges, 95798 markings/sec, 850 secs
lola: 124014883 markings, 625435020 edges, 99773 markings/sec, 855 secs
lola: 124448772 markings, 628501780 edges, 86778 markings/sec, 860 secs
lola: 125179980 markings, 631197373 edges, 146242 markings/sec, 865 secs
lola: 125803004 markings, 633635590 edges, 124605 markings/sec, 870 secs
lola: 126505917 markings, 636390445 edges, 140583 markings/sec, 875 secs
lola: 127097002 markings, 639112490 edges, 118217 markings/sec, 880 secs
lola: 127628460 markings, 641352893 edges, 106292 markings/sec, 885 secs
lola: 128152649 markings, 644822808 edges, 104838 markings/sec, 890 secs
lola: 128592280 markings, 647782426 edges, 87926 markings/sec, 895 secs
lola: 129085196 markings, 651216005 edges, 98583 markings/sec, 900 secs
lola: 129559335 markings, 654671934 edges, 94828 markings/sec, 905 secs
lola: 130169264 markings, 657945738 edges, 121986 markings/sec, 910 secs
lola: 130663475 markings, 660716786 edges, 98842 markings/sec, 915 secs
lola: 131146399 markings, 663754570 edges, 96585 markings/sec, 920 secs
lola: 131681053 markings, 666107548 edges, 106931 markings/sec, 925 secs
lola: 132092026 markings, 669026098 edges, 82195 markings/sec, 930 secs
lola: 132686895 markings, 671981993 edges, 118974 markings/sec, 935 secs
lola: 133248772 markings, 675098425 edges, 112375 markings/sec, 940 secs
lola: 133618830 markings, 677838352 edges, 74012 markings/sec, 945 secs
lola: 134376512 markings, 681036695 edges, 151536 markings/sec, 950 secs
lola: 134998082 markings, 683447737 edges, 124314 markings/sec, 955 secs
lola: 135641842 markings, 685966795 edges, 128752 markings/sec, 960 secs
lola: 136399688 markings, 689002417 edges, 151569 markings/sec, 965 secs
lola: 137079892 markings, 691787326 edges, 136041 markings/sec, 970 secs
lola: 137748006 markings, 694917444 edges, 133623 markings/sec, 975 secs
lola: 138402169 markings, 697667080 edges, 130833 markings/sec, 980 secs
lola: 138990984 markings, 701318753 edges, 117763 markings/sec, 985 secs
lola: 139532075 markings, 704969153 edges, 108218 markings/sec, 990 secs
lola: 140041526 markings, 708520448 edges, 101890 markings/sec, 995 secs
lola: 140515395 markings, 711966989 edges, 94774 markings/sec, 1000 secs
lola: 141007826 markings, 715435973 edges, 98486 markings/sec, 1005 secs
lola: 141592711 markings, 719209128 edges, 116977 markings/sec, 1010 secs
lola: 142066768 markings, 721839304 edges, 94811 markings/sec, 1015 secs
lola: 142082523 markings, 721946454 edges, 3151 markings/sec, 1020 secs
lola: 142109697 markings, 722132266 edges, 5435 markings/sec, 1025 secs
lola: 142124610 markings, 722245177 edges, 2983 markings/sec, 1030 secs
lola: 142143335 markings, 722384929 edges, 3745 markings/sec, 1035 secs
lola: 142158496 markings, 722489161 edges, 3032 markings/sec, 1040 secs
lola: 142180257 markings, 722617350 edges, 4352 markings/sec, 1045 secs
lola: 142192940 markings, 722700610 edges, 2537 markings/sec, 1050 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA HouseConstruction-PT-050-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (((p13 + 1 <= p3) OR (p20 <= 1)) AND (E (G ((p20 <= 1))) OR (p9 + 1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p9 + 1 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 + 1 <= p21)
lola: processed formula length: 15
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: ((p13 + 1 <= p3) OR (p20 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p13 + 1 <= p3) OR (p20 <= 1))
lola: processed formula length: 32
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 2 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: E (G ((p20 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p20 <= 1)))
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 901 markings, 900 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G (((p10 <= p8) OR (3 <= p22) OR (p3 <= p2)))) AND (p17 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p17 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 <= p23)
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.task
lola: processed formula with 1 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: E (G (((p10 <= p8) OR (3 <= p22) OR (p3 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p10 <= p8) OR (3 <= p22) OR (p3 <= p2))))
lola: processed formula length: 51
lola: 26 rewrites
lola: closed formula file HouseConstruction-PT-050-CTLCardinality.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: 901 markings, 900 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
FORMULA HouseConstruction-PT-050-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes unknown yes yes yes yes yes no no yes
lola:
preliminary result: no yes no yes no yes yes unknown yes yes yes yes yes no no yes
lola: memory consumption: 20156 KB
lola: time consumption: 1282 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HouseConstruction-PT-050"
export BK_EXAMINATION="CTLCardinality"
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/HouseConstruction-PT-050.tgz
mv HouseConstruction-PT-050 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 HouseConstruction-PT-050, examination is CTLCardinality"
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-152658630700080"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;