fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r040-smll-152646357200087
Last Updated
June 26, 2018

About the Execution of LoLA for ClientsAndServers-PT-N0010P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.020 1392545.00 1370984.00 12309.10 TFTT?TFTFTFTTTFT 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 184K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N0010P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357200087
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526510110338

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0010P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0010P0 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N0010P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0010P0-CTLCardinality.task
lola: LP says that atomic proposition is always true: (2 <= Mi)
lola: LP says that atomic proposition is always true: (SF <= SwA)
lola: LP says that atomic proposition is always true: (MwU <= CwG)
lola: LP says that atomic proposition is always false: (Mi <= SpA)
lola: LP says that atomic proposition is always true: (MpG <= SwG)
lola: always true
lola: (((MtF <= 1) OR (SF <= 2) OR (Si <= 0) OR (Ci <= 0) OR (MtF + 1 <= CF)) AND E (F (E (G ((2 <= SG)))))) : NOT(E (F (E (F ((2 <= MtF)))))) : E (F (E (G (((2 <= CwA) OR (SwA <= SpA)))))) : A ((A (G ((2 <= SwA))) U E (G ((MtF <= SA))))) : E (F ((((MtF <= 1) OR (Uf <= 0)) AND A (G ((2 <= StF)))))) : A (F (E (G (((MpG <= Ci) AND (SwA <= SwG)))))) : A (G ((E (X ((SwA <= CwG))) AND A (G (TRUE))))) : E ((((2 <= MwU) OR (3 <= Uf) OR (Si <= SwA)) U (((MpA <= MpG) AND (2 <= CF)) OR ((Si <= StF) AND (CR <= SwG))))) : A (G ((SpA <= Uf))) : (E (G (())) AND (E (G ((SA <= 0))) OR (2 <= MpG))) : (E (G (A (G ((1 <= Ci))))) AND (SF <= MpG)) : A (F (((Ci <= 1) OR (SwG + 1 <= Cb) OR ((1 <= SG))))) : E (F ((Ci <= 0))) : E (G (E (((3 <= CF) U (SA <= StF))))) : (((E (G ((1 <= SG))) OR E (F (FALSE))) OR ((1 <= MpA) AND A (F ((SR <= MpG))))) OR ((((Si <= 2) OR (CG + 1 <= SG)) AND ((SwG <= 1))) OR ((1 <= MpG) AND (3 <= CR)))) : E ((() U (2 <= MpA)))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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:479
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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 (G (E (X ((SwA <= CwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((SwA <= CwG)))))
lola: processed formula length: 36
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 501 markings, 500 edges

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MtF <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((MtF <= 1)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (2 <= MtF)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0010P0-CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Ci <= 0)))
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 ((Ci <= 0)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: (Ci <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= MpA)))
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 <= MpA)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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 <= MpA)
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: 29 markings, 28 edges

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-3-0.sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)sara:
try reading problem file ClientsAndServers-PT-N0010P0-CTLCardinality-2-0.sara.
lola: ========================================
lola: ...considering subproblem: A (G ((SpA <= Uf)))
lola: ========================================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 ((SpA <= Uf)))
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Uf + 1 <= SpA)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-4-0.sara
sara: try reading problem file ClientsAndServers-PT-N0010P0-CTLCardinality-3-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0010P0-CTLCardinality-4-0.sara.



lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((2 <= CwA) OR (SwA <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: ((2 <= CwA) OR (SwA <= SpA))
lola: processed formula length: 29
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 393 markings, 393 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((Ci <= 1) OR (SwG + 1 <= Cb) OR ((1 <= SG)))))
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: ((2 <= Ci) AND (Cb <= SwG) AND ((SG <= 0)))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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 eventually occurs.
lola: 38425 markings, 62915 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((3 <= CF) U (SA <= StF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((3 <= CF) U (SA <= StF)))))
lola: processed formula length: 46
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 501 markings, 1001 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((MtF <= 1) OR (Uf <= 0)) AND A (G ((2 <= StF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (((MtF <= 1) OR (Uf <= 0)) AND NOT(E(TRUE U (StF <= 1)))))
lola: processed formula length: 68
lola: 24 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 1423055 markings, 5122140 edges, 284611 markings/sec, 0 secs
lola: 2699635 markings, 9879095 edges, 255316 markings/sec, 5 secs
lola: 3896759 markings, 14388197 edges, 239425 markings/sec, 10 secs
lola: 5043051 markings, 18731488 edges, 229258 markings/sec, 15 secs
lola: 6148957 markings, 22947467 edges, 221181 markings/sec, 20 secs
lola: 7206788 markings, 26999817 edges, 211566 markings/sec, 25 secs
lola: 8244030 markings, 30976770 edges, 207448 markings/sec, 30 secs
lola: 9249499 markings, 34840090 edges, 201094 markings/sec, 35 secs
lola: 10250172 markings, 38701586 edges, 200135 markings/sec, 40 secs
lola: 11238050 markings, 42521683 edges, 197576 markings/sec, 45 secs
lola: 12097194 markings, 45847349 edges, 171829 markings/sec, 50 secs
lola: 12958602 markings, 49181447 edges, 172282 markings/sec, 55 secs
lola: 13813115 markings, 52501000 edges, 170903 markings/sec, 60 secs
lola: 14663782 markings, 55801622 edges, 170133 markings/sec, 65 secs
lola: 15511906 markings, 59101657 edges, 169625 markings/sec, 70 secs
lola: 16354019 markings, 62386286 edges, 168423 markings/sec, 75 secs
lola: 17201271 markings, 65677308 edges, 169450 markings/sec, 80 secs
lola: 18044094 markings, 68961626 edges, 168565 markings/sec, 85 secs
lola: 18878169 markings, 72207244 edges, 166815 markings/sec, 90 secs
lola: 19703040 markings, 75426911 edges, 164974 markings/sec, 95 secs
lola: 20523946 markings, 78638859 edges, 164181 markings/sec, 100 secs
lola: 21346229 markings, 81855724 edges, 164457 markings/sec, 105 secs
lola: 22159953 markings, 85044212 edges, 162745 markings/sec, 110 secs
lola: 22976163 markings, 88235164 edges, 163242 markings/sec, 115 secs
lola: 23780245 markings, 91386867 edges, 160816 markings/sec, 120 secs
lola: 24582966 markings, 94528492 edges, 160544 markings/sec, 125 secs
lola: 25389214 markings, 97691404 edges, 161250 markings/sec, 130 secs
lola: 26190113 markings, 100835945 edges, 160180 markings/sec, 135 secs
lola: 26981773 markings, 103949994 edges, 158332 markings/sec, 140 secs
lola: 27782580 markings, 107090640 edges, 160161 markings/sec, 145 secs
lola: 28604801 markings, 110325651 edges, 164444 markings/sec, 150 secs
lola: 29425571 markings, 113547125 edges, 164154 markings/sec, 155 secs
lola: 30245186 markings, 116768368 edges, 163923 markings/sec, 160 secs
lola: 31055154 markings, 119957721 edges, 161994 markings/sec, 165 secs
lola: 31866805 markings, 123154306 edges, 162330 markings/sec, 170 secs
lola: 32672546 markings, 126329781 edges, 161148 markings/sec, 175 secs
lola: 33484706 markings, 129521924 edges, 162432 markings/sec, 180 secs
lola: 34277855 markings, 132658141 edges, 158630 markings/sec, 185 secs
lola: 35072656 markings, 135800772 edges, 158960 markings/sec, 190 secs
lola: 35873840 markings, 138956116 edges, 160237 markings/sec, 195 secs
lola: 36668832 markings, 142095561 edges, 158998 markings/sec, 200 secs
lola: 37446152 markings, 145176826 edges, 155464 markings/sec, 205 secs
lola: 38240486 markings, 148311668 edges, 158867 markings/sec, 210 secs
lola: 39026284 markings, 151416368 edges, 157160 markings/sec, 215 secs
lola: 39811300 markings, 154521527 edges, 157003 markings/sec, 220 secs
lola: 40596959 markings, 157625222 edges, 157132 markings/sec, 225 secs
lola: 41385728 markings, 160743994 edges, 157754 markings/sec, 230 secs
lola: 42169921 markings, 163847973 edges, 156839 markings/sec, 235 secs
lola: 42939152 markings, 166896012 edges, 153846 markings/sec, 240 secs
lola: 43715840 markings, 169975244 edges, 155338 markings/sec, 245 secs
lola: 44487096 markings, 173029096 edges, 154251 markings/sec, 250 secs
lola: 45260153 markings, 176087861 edges, 154611 markings/sec, 255 secs
lola: 46031883 markings, 179143620 edges, 154346 markings/sec, 260 secs
lola: 46799789 markings, 182184920 edges, 153581 markings/sec, 265 secs
lola: 47571067 markings, 185239365 edges, 154256 markings/sec, 270 secs
lola: 48331114 markings, 188261146 edges, 152009 markings/sec, 275 secs
lola: 49092025 markings, 191278766 edges, 152182 markings/sec, 280 secs
lola: 49856776 markings, 194308871 edges, 152950 markings/sec, 285 secs
lola: 50616477 markings, 197327742 edges, 151940 markings/sec, 290 secs
lola: 51375131 markings, 200336615 edges, 151731 markings/sec, 295 secs
lola: 52130784 markings, 203344163 edges, 151131 markings/sec, 300 secs
lola: 52881821 markings, 206332096 edges, 150207 markings/sec, 305 secs
lola: 53604981 markings, 209197534 edges, 144632 markings/sec, 310 secs
lola: 54349194 markings, 212152558 edges, 148843 markings/sec, 315 secs
lola: 55093262 markings, 215114548 edges, 148814 markings/sec, 320 secs
lola: 55842866 markings, 218092393 edges, 149921 markings/sec, 325 secs
lola: 56587553 markings, 221055906 edges, 148937 markings/sec, 330 secs
lola: 57331004 markings, 224013114 edges, 148690 markings/sec, 335 secs
lola: 58072836 markings, 226965326 edges, 148366 markings/sec, 340 secs
lola: 58817191 markings, 229925569 edges, 148871 markings/sec, 345 secs
lola: 59555843 markings, 232868428 edges, 147730 markings/sec, 350 secs
lola: 60306865 markings, 235857245 edges, 150204 markings/sec, 355 secs
lola: 61044685 markings, 238796416 edges, 147564 markings/sec, 360 secs
lola: 61778188 markings, 241725570 edges, 146701 markings/sec, 365 secs
lola: 62521102 markings, 244676600 edges, 148583 markings/sec, 370 secs
lola: 63258628 markings, 247618025 edges, 147505 markings/sec, 375 secs
lola: 63994707 markings, 250546956 edges, 147216 markings/sec, 380 secs
lola: 64721767 markings, 253447388 edges, 145412 markings/sec, 385 secs
lola: 65453758 markings, 256369418 edges, 146398 markings/sec, 390 secs
lola: 66186557 markings, 259298608 edges, 146560 markings/sec, 395 secs
lola: 66926045 markings, 262250335 edges, 147898 markings/sec, 400 secs
lola: 67653173 markings, 265159496 edges, 145426 markings/sec, 405 secs
lola: 68386759 markings, 268087145 edges, 146717 markings/sec, 410 secs
lola: 69112152 markings, 270989651 edges, 145079 markings/sec, 415 secs
lola: 69838226 markings, 273888592 edges, 145215 markings/sec, 420 secs
lola: 70576094 markings, 276820603 edges, 147574 markings/sec, 425 secs
lola: 71309215 markings, 279744647 edges, 146624 markings/sec, 430 secs
lola: 72039476 markings, 282660095 edges, 146052 markings/sec, 435 secs
lola: 72766915 markings, 285572226 edges, 145488 markings/sec, 440 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no yes unknown unknown unknown no unknown no unknown unknown yes yes yes unknown yes
lola: memory consumption: 9533432 KB
lola: time consumption: 447 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((MpG <= Ci) AND (SwA <= SwG))))))
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 ((Ci + 1 <= MpG) OR (SwG + 1 <= SwA)))))
lola: processed formula length: 63
lola: 24 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4124 markings, 6975 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((SA <= 0))) OR (2 <= MpG))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= MpG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MpG)
lola: processed formula length: 10
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((SA <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((SA <= 0)))
lola: processed formula length: 17
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 170059 markings, 199831 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= Ci))) AND (SF <= MpG))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SF <= MpG)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SF <= MpG)
lola: processed formula length: 11
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Ci)))
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 ((1 <= Ci)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Ci <= 0)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: calling and running sara

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=0)
lola: lola: ========================================
========================================
lola: ...considering subproblem: (((MtF <= 1) OR (SF <= 2) OR (Si <= 0) OR (Ci <= 0) OR (MtF + 1 <= CF)) AND E (F (E (G ((2 <= SG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((MtF <= 1) OR (SF <= 2) OR (Si <= 0) OR (Ci <= 0) OR (MtF + 1 <= CF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((MtF <= 1) OR (SF <= 2) OR (Si <= 0) OR (Ci <= 0) OR (MtF + 1 <= CF))
lola: processed formula length: 74
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-CTLCardinality.task
lola: processed formula with 5 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: ========================================
sara: try reading problem file ClientsAndServers-PT-N0010P0-CTLCardinality-12-0.sara.
lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= SG)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (2 <= SG)
lola: processed formula length: 9
lola: 22 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 193 markings, 193 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 13 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= MwU) OR (3 <= Uf) OR (Si <= SwA)) U (((MpA <= MpG) AND (2 <= CF)) OR ((Si <= StF) AND (CR <= SwG)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((2 <= MwU) OR (3 <= Uf) OR (Si <= SwA)) U (((MpA <= MpG) AND (2 <= CF)) OR ((Si <= StF) AND (CR <= SwG)))))
lola: processed formula length: 115
lola: 24 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: (((MpA <= MpG) AND (2 <= CF)) OR ((Si <= StF) AND (CR <= SwG)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 193 markings, 192 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-13-0.sara

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= SG))) OR (((1 <= MpA) AND A (F ((SR <= MpG)))) OR ((((Si <= 2) OR (CG + 1 <= SG)) AND ((SwG <= 1))) OR ((1 <= MpG) AND (3 <= CR)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= MpA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= MpA)
lola: processed formula length: 10
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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 3122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= SG)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= SG)))
lola: processed formula length: 17
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 1 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 3122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((MtF <= SA))) OR (A (G ((2 <= SwA))) AND A (F (E (G ((MtF <= SA)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= SwA)))
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 ((2 <= SwA)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (SwA <= 1)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P0-CTLCardinality-15-0.sara
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: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: E (F ((((MtF <= 1) OR (Uf <= 0)) AND A (G ((2 <= StF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (((MtF <= 1) OR (Uf <= 0)) AND NOT(E(TRUE U (StF <= 1)))))
lola: processed formula length: 68
lola: 24 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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).
sara: try reading problem file ClientsAndServers-PT-N0010P0-CTLCardinality-15-0.sara.

lola: 1458773 markings, 5370633 edges, 291755 markings/sec, 0 secs
lola: 2652364 markings, 9997832 edges, 238718 markings/sec, 5 secs
lola: 3745981 markings, 14300160 edges, 218723 markings/sec, 10 secs
lola: 4777124 markings, 18406536 edges, 206229 markings/sec, 15 secs
lola: 5765197 markings, 22364826 edges, 197615 markings/sec, 20 secs
lola: 6716068 markings, 26199379 edges, 190174 markings/sec, 25 secs
lola: 7645414 markings, 29962417 edges, 185869 markings/sec, 30 secs
lola: 8560547 markings, 33673040 edges, 183027 markings/sec, 35 secs
lola: 9440447 markings, 37273218 edges, 175980 markings/sec, 40 secs
lola: 10323266 markings, 40874094 edges, 176564 markings/sec, 45 secs
lola: 11180582 markings, 44392423 edges, 171463 markings/sec, 50 secs
lola: 12023721 markings, 47857332 edges, 168628 markings/sec, 55 secs
lola: 12853859 markings, 51275704 edges, 166028 markings/sec, 60 secs
lola: 13679057 markings, 54681404 edges, 165040 markings/sec, 65 secs
lola: 14485821 markings, 58022345 edges, 161353 markings/sec, 70 secs
lola: 15295808 markings, 61367173 edges, 161997 markings/sec, 75 secs
lola: 16089576 markings, 64661215 edges, 158754 markings/sec, 80 secs
lola: 16874429 markings, 67921237 edges, 156971 markings/sec, 85 secs
lola: 17656624 markings, 71179830 edges, 156439 markings/sec, 90 secs
lola: 18435834 markings, 74426991 edges, 155842 markings/sec, 95 secs
lola: 19210199 markings, 77652002 edges, 154873 markings/sec, 100 secs
lola: 19969580 markings, 80831401 edges, 151876 markings/sec, 105 secs
lola: 20734081 markings, 84030432 edges, 152900 markings/sec, 110 secs
lola: 21501167 markings, 87241345 edges, 153417 markings/sec, 115 secs
lola: 22261840 markings, 90431495 edges, 152135 markings/sec, 120 secs
lola: 23010518 markings, 93577488 edges, 149736 markings/sec, 125 secs
lola: 23758792 markings, 96717774 edges, 149655 markings/sec, 130 secs
lola: 24507422 markings, 99864713 edges, 149726 markings/sec, 135 secs
lola: 25248286 markings, 102984469 edges, 148173 markings/sec, 140 secs
lola: 25993519 markings, 106121541 edges, 149047 markings/sec, 145 secs
lola: 26736398 markings, 109250213 edges, 148576 markings/sec, 150 secs
lola: 27465894 markings, 112334614 edges, 145899 markings/sec, 155 secs
lola: 28197055 markings, 115423214 edges, 146232 markings/sec, 160 secs
lola: 28931485 markings, 118518992 edges, 146886 markings/sec, 165 secs
lola: 29659532 markings, 121603880 edges, 145609 markings/sec, 170 secs
lola: 30395549 markings, 124709920 edges, 147203 markings/sec, 175 secs
lola: 31110219 markings, 127742676 edges, 142934 markings/sec, 180 secs
lola: 31841818 markings, 130830306 edges, 146320 markings/sec, 185 secs
lola: 32559841 markings, 133871160 edges, 143605 markings/sec, 190 secs
lola: 33284634 markings, 136936450 edges, 144959 markings/sec, 195 secs
lola: 33996878 markings, 139957463 edges, 142449 markings/sec, 200 secs
lola: 34714310 markings, 142996460 edges, 143486 markings/sec, 205 secs
lola: 35405015 markings, 145931427 edges, 138141 markings/sec, 210 secs
lola: 36082184 markings, 148805210 edges, 135434 markings/sec, 215 secs
lola: 36795794 markings, 151838182 edges, 142722 markings/sec, 220 secs
lola: 37504431 markings, 154854050 edges, 141727 markings/sec, 225 secs
lola: 38206606 markings, 157849095 edges, 140435 markings/sec, 230 secs
lola: 38922332 markings, 160883456 edges, 143145 markings/sec, 235 secs
lola: 39620882 markings, 163863800 edges, 139710 markings/sec, 240 secs
lola: 40318598 markings, 166841048 edges, 139543 markings/sec, 245 secs
lola: 41010189 markings, 169807185 edges, 138318 markings/sec, 250 secs
lola: 41710256 markings, 172790675 edges, 140013 markings/sec, 255 secs
lola: 42407683 markings, 175772895 edges, 139485 markings/sec, 260 secs
lola: 43101882 markings, 178736059 edges, 138840 markings/sec, 265 secs
lola: 43794417 markings, 181694328 edges, 138507 markings/sec, 270 secs
lola: 44478189 markings, 184624265 edges, 136754 markings/sec, 275 secs
lola: 45167675 markings, 187566137 edges, 137897 markings/sec, 280 secs
lola: 45846040 markings, 190484814 edges, 135673 markings/sec, 285 secs
lola: 46538977 markings, 193440872 edges, 138587 markings/sec, 290 secs
lola: 47191987 markings, 196237141 edges, 130602 markings/sec, 295 secs
lola: 47877006 markings, 199172551 edges, 137004 markings/sec, 300 secs
lola: 48563608 markings, 202110177 edges, 137320 markings/sec, 305 secs
lola: 49253288 markings, 205060027 edges, 137936 markings/sec, 310 secs
lola: 49924785 markings, 207956675 edges, 134299 markings/sec, 315 secs
lola: 50605818 markings, 210882636 edges, 136207 markings/sec, 320 secs
lola: 51279626 markings, 213784989 edges, 134762 markings/sec, 325 secs
lola: 51959212 markings, 216696458 edges, 135917 markings/sec, 330 secs
lola: 52629143 markings, 219581382 edges, 133986 markings/sec, 335 secs
lola: 53300808 markings, 222472539 edges, 134333 markings/sec, 340 secs
lola: 53973426 markings, 225361113 edges, 134524 markings/sec, 345 secs
lola: 54645786 markings, 228257567 edges, 134472 markings/sec, 350 secs
lola: 55314292 markings, 231134015 edges, 133701 markings/sec, 355 secs
lola: 55979337 markings, 233997533 edges, 133009 markings/sec, 360 secs
lola: 56644327 markings, 236863881 edges, 132998 markings/sec, 365 secs
lola: 57307018 markings, 239723716 edges, 132538 markings/sec, 370 secs
lola: 57966525 markings, 242568857 edges, 131901 markings/sec, 375 secs
lola: 58628423 markings, 245422048 edges, 132380 markings/sec, 380 secs
lola: 59292017 markings, 248277559 edges, 132719 markings/sec, 385 secs
lola: 59955611 markings, 251136567 edges, 132719 markings/sec, 390 secs
lola: 60614846 markings, 253982778 edges, 131847 markings/sec, 395 secs
lola: 61267407 markings, 256806591 edges, 130512 markings/sec, 400 secs
lola: 61916153 markings, 259618091 edges, 129749 markings/sec, 405 secs
lola: 62572348 markings, 262448555 edges, 131239 markings/sec, 410 secs
lola: 63230705 markings, 265293853 edges, 131671 markings/sec, 415 secs
lola: 63887756 markings, 268132484 edges, 131410 markings/sec, 420 secs
lola: 64541187 markings, 270957768 edges, 130686 markings/sec, 425 secs
lola: 65195039 markings, 273786510 edges, 130770 markings/sec, 430 secs
lola: 65843963 markings, 276596508 edges, 129785 markings/sec, 435 secs
lola: 66492489 markings, 279405996 edges, 129705 markings/sec, 440 secs
lola: 67142868 markings, 282219557 edges, 130076 markings/sec, 445 secs
lola: 67794096 markings, 285032109 edges, 130246 markings/sec, 450 secs
lola: 68446143 markings, 287848627 edges, 130409 markings/sec, 455 secs
lola: 69097201 markings, 290665687 edges, 130212 markings/sec, 460 secs
lola: 69740366 markings, 293454295 edges, 128633 markings/sec, 465 secs
lola: 70383290 markings, 296247835 edges, 128585 markings/sec, 470 secs
lola: 71022840 markings, 299025240 edges, 127910 markings/sec, 475 secs
lola: 71662295 markings, 301799813 edges, 127891 markings/sec, 480 secs
lola: 72303997 markings, 304585592 edges, 128340 markings/sec, 485 secs
lola: 72948171 markings, 307389506 edges, 128835 markings/sec, 490 secs
lola: 73591103 markings, 310180312 edges, 128586 markings/sec, 495 secs
lola: 74236276 markings, 312978687 edges, 129035 markings/sec, 500 secs
lola: 74878246 markings, 315767828 edges, 128394 markings/sec, 505 secs
lola: 75516544 markings, 318540006 edges, 127660 markings/sec, 510 secs
lola: 76156765 markings, 321321239 edges, 128044 markings/sec, 515 secs
lola: 76798448 markings, 324104673 edges, 128337 markings/sec, 520 secs
lola: 77433858 markings, 326872817 edges, 127082 markings/sec, 525 secs
lola: 78062134 markings, 329623475 edges, 125655 markings/sec, 530 secs
lola: 78702019 markings, 332400592 edges, 127977 markings/sec, 535 secs
lola: 79338027 markings, 335165482 edges, 127202 markings/sec, 540 secs
lola: 79974442 markings, 337931814 edges, 127283 markings/sec, 545 secs
lola: 80615206 markings, 340704610 edges, 128153 markings/sec, 550 secs
lola: 81244296 markings, 343450007 edges, 125818 markings/sec, 555 secs
lola: 81888280 markings, 346245969 edges, 128797 markings/sec, 560 secs
lola: 82522311 markings, 349007945 edges, 126806 markings/sec, 565 secs
lola: 83162424 markings, 351781587 edges, 128023 markings/sec, 570 secs
lola: 83788314 markings, 354508442 edges, 125178 markings/sec, 575 secs
lola: 84383307 markings, 357091934 edges, 118999 markings/sec, 580 secs
lola: 84966739 markings, 359631214 edges, 116686 markings/sec, 585 secs
lola: 85551815 markings, 362183618 edges, 117015 markings/sec, 590 secs
lola: 86113445 markings, 364619017 edges, 112326 markings/sec, 595 secs
lola: 86702094 markings, 367180644 edges, 117730 markings/sec, 600 secs
lola: 87289071 markings, 369752137 edges, 117395 markings/sec, 605 secs
lola: 87899425 markings, 372406072 edges, 122071 markings/sec, 610 secs
lola: 88509919 markings, 375067663 edges, 122099 markings/sec, 615 secs
lola: 89112142 markings, 377694715 edges, 120445 markings/sec, 620 secs
lola: 89715395 markings, 380321910 edges, 120651 markings/sec, 625 secs
lola: 90315693 markings, 382936311 edges, 120060 markings/sec, 630 secs
lola: 90884777 markings, 385409117 edges, 113817 markings/sec, 635 secs
lola: 91472348 markings, 387971270 edges, 117514 markings/sec, 640 secs
lola: 92018932 markings, 390339311 edges, 109317 markings/sec, 645 secs
lola: 92583252 markings, 392804812 edges, 112864 markings/sec, 650 secs
lola: 93167680 markings, 395355664 edges, 116886 markings/sec, 655 secs
lola: 93701072 markings, 397682212 edges, 106678 markings/sec, 660 secs
lola: 94278603 markings, 400210373 edges, 115506 markings/sec, 665 secs
lola: 94880667 markings, 402838189 edges, 120413 markings/sec, 670 secs
lola: 95480031 markings, 405458154 edges, 119873 markings/sec, 675 secs
lola: 96036638 markings, 407883490 edges, 111321 markings/sec, 680 secs
lola: 96631858 markings, 410489015 edges, 119044 markings/sec, 685 secs
lola: 97156452 markings, 412798631 edges, 104919 markings/sec, 690 secs
lola: 97698965 markings, 415166439 edges, 108503 markings/sec, 695 secs
lola: 98294181 markings, 417766114 edges, 119043 markings/sec, 700 secs
lola: 98903816 markings, 420422518 edges, 121927 markings/sec, 705 secs
lola: 99514476 markings, 423095922 edges, 122132 markings/sec, 710 secs
lola: 100128856 markings, 425784090 edges, 122876 markings/sec, 715 secs
lola: 100732297 markings, 428433940 edges, 120688 markings/sec, 720 secs
lola: 101335060 markings, 431075472 edges, 120553 markings/sec, 725 secs
lola: 101948029 markings, 433763426 edges, 122594 markings/sec, 730 secs
lola: 102556640 markings, 436424845 edges, 121722 markings/sec, 735 secs
lola: 103156313 markings, 439061436 edges, 119935 markings/sec, 740 secs
lola: 103756412 markings, 441699463 edges, 120020 markings/sec, 745 secs
lola: 104352094 markings, 444306787 edges, 119136 markings/sec, 750 secs
lola: 104955461 markings, 446943886 edges, 120673 markings/sec, 755 secs
lola: 105549750 markings, 449546543 edges, 118858 markings/sec, 760 secs
lola: 106145235 markings, 452157053 edges, 119097 markings/sec, 765 secs
lola: 106746429 markings, 454784824 edges, 120239 markings/sec, 770 secs
lola: 107341388 markings, 457388216 edges, 118992 markings/sec, 775 secs
lola: 107925763 markings, 459963690 edges, 116875 markings/sec, 780 secs
lola: 108516077 markings, 462551630 edges, 118063 markings/sec, 785 secs
lola: 109105027 markings, 465135119 edges, 117790 markings/sec, 790 secs
lola: 109699579 markings, 467742290 edges, 118910 markings/sec, 795 secs
lola: 110285553 markings, 470316001 edges, 117195 markings/sec, 800 secs
lola: 110876031 markings, 472906625 edges, 118096 markings/sec, 805 secs
lola: 111462637 markings, 475480728 edges, 117321 markings/sec, 810 secs
lola: 112051813 markings, 478065294 edges, 117835 markings/sec, 815 secs
lola: 112633480 markings, 480623020 edges, 116333 markings/sec, 820 secs
lola: 113220576 markings, 483199220 edges, 117419 markings/sec, 825 secs
lola: 113801467 markings, 485752274 edges, 116178 markings/sec, 830 secs
lola: 114394776 markings, 488347185 edges, 118662 markings/sec, 835 secs
lola: 114988088 markings, 490950471 edges, 118662 markings/sec, 840 secs
lola: 115583389 markings, 493562367 edges, 119060 markings/sec, 845 secs
lola: 116172291 markings, 496155959 edges, 117780 markings/sec, 850 secs
lola: 116770800 markings, 498781398 edges, 119702 markings/sec, 855 secs
lola: 117040173 markings, 499966720 edges, 53875 markings/sec, 860 secs
lola: 117057837 markings, 500046462 edges, 3533 markings/sec, 865 secs
lola: 117062904 markings, 500069301 edges, 1013 markings/sec, 870 secs
lola: 117069162 markings, 500096967 edges, 1252 markings/sec, 875 secs
lola: 117083124 markings, 500158616 edges, 2792 markings/sec, 880 secs
lola: 117090718 markings, 500191473 edges, 1519 markings/sec, 885 secs
lola: 117094984 markings, 500211208 edges, 853 markings/sec, 890 secs
lola: 117104019 markings, 500251625 edges, 1807 markings/sec, 895 secs
lola: 117109259 markings, 500274581 edges, 1048 markings/sec, 900 secs
lola: 117117875 markings, 500313267 edges, 1723 markings/sec, 905 secs
lola: 117122860 markings, 500334723 edges, 997 markings/sec, 910 secs
lola: 117137707 markings, 500399327 edges, 2969 markings/sec, 915 secs
lola: 117160984 markings, 500504844 edges, 4655 markings/sec, 920 secs
lola: 117164667 markings, 500520804 edges, 737 markings/sec, 925 secs
lola: 117179102 markings, 500583299 edges, 2887 markings/sec, 930 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= SG))) OR (((1 <= MpA) AND A (F ((SR <= MpG)))) OR ((((Si <= 2) OR (CG + 1 <= SG)) AND ((SwG <= 1))) OR ((1 <= MpG) AND (3 <= CR)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= MpA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= MpA)
lola: processed formula length: 10
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: E (G ((1 <= SG)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= SG)))
lola: processed formula length: 17
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((Si <= 2) OR (CG + 1 <= SG)) AND ((SwG <= 1))) OR ((1 <= MpG) AND (3 <= CR)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((Si <= 2) OR (CG + 1 <= SG)) AND ((SwG <= 1))) OR ((1 <= MpG) AND (3 <= CR)))
lola: processed formula length: 82
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-CTLCardinality.task
lola: processed formula with 5 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:
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G ((MtF <= SA))) OR (A (G ((2 <= SwA))) AND A (F (E (G ((MtF <= SA)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= SwA)))
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 ((2 <= SwA)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (SwA <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((MtF <= SA)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((MtF <= SA)))
lola: processed formula length: 19
lola: 21 rewrites
lola: closed formula file ClientsAndServers-PT-N0010P0-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: 8351 markings, 9223 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0010P0-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes unknown yes no yes no yes no yes yes yes no yes
lola:
preliminary result: yes no yes yes unknown yes no yes no yes no yes yes yes no yes
lola: memory consumption: 22928 KB
lola: time consumption: 1392 seconds

BK_STOP 1526511502883

--------------------
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="ClientsAndServers-PT-N0010P0"
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/ClientsAndServers-PT-N0010P0.tgz
mv ClientsAndServers-PT-N0010P0 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 ClientsAndServers-PT-N0010P0, 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 r040-smll-152646357200087"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;