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)
..................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is ClientsAndServers-PT-N0100P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580920100273
=====================================================================

--------------------
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-N0100P0-CTLCardinality-0
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-1
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-15
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-2
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-3
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-4
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-5
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-6
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-7
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-8
FORMULA_NAME ClientsAndServers-PT-N0100P0-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496604645893


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
ClientsAndServers-PT-N0100P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0100P0: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0100P0 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 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: 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-N0100P0-CTLCardinality.task
lola: (((((Cb <= CA) AND (3 <= SG)) OR ((SpG <= SwG) AND (StR <= SwG)) OR ((SpG <= CA) AND (MpA <= SF)) OR ((Si <= SpG) AND (2 <= CwA))) AND A (F ((Ci <= 2)))) OR E (X ((2 <= CwG)))) : A (G (((CA <= MtF) OR ((3 <= SA) AND (2 <= MtF) AND (2 <= Mi) AND (2 <= MpG))))) : E (G ((E (F ((CR <= SR))) AND (CR <= Uf)))) : NOT(E ((((SR <= Cb) AND (SA <= CwG)) U ((1 <= SG) AND (3 <= Mi))))) : A (F ((((SF <= 2) AND (MpA + 1 <= MtF)) OR ((Cb + 1 <= SR) AND (Mi <= 0))))) : (A (G (((SA + 1 <= Uf) OR ((Cb <= MpA) AND (SG <= Uf))))) AND (SA <= 1)) : E (G ((MwU <= SwA))) : E (G ((((1 <= SR) AND (SwA <= CwG)) OR (MpG <= SR) OR ((Si <= CA) AND ((2 <= Ci) OR (1 <= StR)))))) : A (F (A (G ((3 <= CwG))))) : A (F (E (F (((2 <= SF) AND (1 <= CR)))))) : E (G ((StR <= SpA))) : E ((E (F ((2 <= StF))) U A (X ((2 <= CG))))) : E (G ((CwG <= 2))) : E (G (E (F (((CwA <= SR) OR (3 <= SwA)))))) : A ((((CwA + 1 <= Cb) AND (2 <= Cb)) U A (F ((2 <= SF))))) : A ((E (G ((SA <= Mi))) U E (G ((Mi <= StF)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((Cb <= CA) AND (3 <= SG)) OR ((SpG <= SwG) AND (StR <= SwG)) OR ((SpG <= CA) AND (MpA <= SF)) OR ((Si <= SpG) AND (2 <= CwA))) AND A (F ((Ci <= 2)))) OR E (X ((2 <= CwG))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Cb <= CA) AND (3 <= SG)) OR ((SpG <= SwG) AND (StR <= SwG)) OR ((SpG <= CA) AND (MpA <= SF)) OR ((Si <= SpG) AND (2 <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((Cb <= CA) AND (3 <= SG)) OR ((SpG <= SwG) AND (StR <= SwG)) OR ((SpG <= CA) AND (MpA <= SF)) OR ((Si <= SpG) AND (2 <= CwA)))
lola: processed formula length: 131
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: processed formula with 8 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Ci <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Ci <= 2))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= CwG)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= CwG))
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CA <= MtF) OR ((3 <= SA) AND (2 <= MtF) AND (2 <= Mi) AND (2 <= MpG)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0100P0-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((CR <= SR))) AND (CR <= Uf))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (CR <= SR))) OR (Uf + 1 <= CR))))
lola: processed formula length: 60
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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-N0100P0-CTLCardinality.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((SR <= Cb) AND (SA <= CwG)) U ((1 <= SG) AND (3 <= Mi)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((SR <= Cb) AND (SA <= CwG)) U ((1 <= SG) AND (3 <= Mi))))
lola: processed formula length: 64
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((SF <= 2) AND (MpA + 1 <= MtF)) OR ((Cb + 1 <= SR) AND (Mi <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((SF <= 2) AND (MpA + 1 <= MtF)) OR ((Cb + 1 <= SR) AND (Mi <= 0))))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((SA + 1 <= Uf) OR ((Cb <= MpA) AND (SG <= Uf))))) AND (SA <= 1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SA + 1 <= Uf) OR ((Cb <= MpA) AND (SG <= Uf)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0100P0-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0100P0-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((MwU <= SwA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (SwA + 1 <= MwU)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= SR) AND (SwA <= CwG)) OR (MpG <= SR) OR ((Si <= CA) AND ((2 <= Ci) OR (1 <= StR))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((SR <= 0) OR (CwG + 1 <= SwA)) AND (SR + 1 <= MpG) AND ((CA + 1 <= Si) OR ((Ci <= 1) AND (StR <= 0))))))
lola: processed formula length: 121
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= CwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (CwG <= 2))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: 1581572 markings, 4868278 edges, 3224733188970512384 markings/sec, 0 secs
lola: 2868090 markings, 9299937 edges, 257304 markings/sec, 5 secs
lola: 4295775 markings, 13573235 edges, 285537 markings/sec, 10 secs
lola: 5704026 markings, 17799226 edges, 281650 markings/sec, 15 secs
lola: 6770074 markings, 22119545 edges, 213210 markings/sec, 20 secs
lola: 7721018 markings, 26259159 edges, 190189 markings/sec, 25 secs
lola: 8974898 markings, 30373906 edges, 250776 markings/sec, 30 secs
lola: 10251266 markings, 34299674 edges, 255274 markings/sec, 35 secs
lola: 11519174 markings, 38219271 edges, 253582 markings/sec, 40 secs
lola: 12748590 markings, 42523488 edges, 245883 markings/sec, 45 secs
lola: 14065373 markings, 46571788 edges, 263357 markings/sec, 50 secs
lola: 15228428 markings, 50650987 edges, 232611 markings/sec, 55 secs
lola: 16491582 markings, 54429938 edges, 252631 markings/sec, 60 secs
lola: 17826601 markings, 58467201 edges, 267004 markings/sec, 65 secs
lola: 19115380 markings, 62320939 edges, 257756 markings/sec, 70 secs
lola: 20539552 markings, 66339438 edges, 284834 markings/sec, 75 secs
lola: 21454474 markings, 70448181 edges, 182984 markings/sec, 80 secs
lola: 22285084 markings, 74460457 edges, 166122 markings/sec, 85 secs
lola: 23093828 markings, 78369399 edges, 161749 markings/sec, 90 secs
lola: 23899764 markings, 82266091 edges, 161187 markings/sec, 95 secs
lola: 24743523 markings, 86119165 edges, 168752 markings/sec, 100 secs
lola: 26069910 markings, 89839597 edges, 265277 markings/sec, 105 secs
lola: 27652996 markings, 93018325 edges, 316617 markings/sec, 110 secs
lola: 29002953 markings, 96815269 edges, 269991 markings/sec, 115 secs
lola: 30437730 markings, 100310602 edges, 286955 markings/sec, 120 secs
lola: 31334436 markings, 104371846 edges, 179341 markings/sec, 125 secs
lola: 32122441 markings, 108306554 edges, 157601 markings/sec, 130 secs
lola: 33089902 markings, 112256082 edges, 193492 markings/sec, 135 secs
lola: 34543794 markings, 115345267 edges, 290778 markings/sec, 140 secs
lola: 35933649 markings, 118795327 edges, 277971 markings/sec, 145 secs
lola: 36977264 markings, 122268626 edges, 208723 markings/sec, 150 secs
lola: 37559898 markings, 125175471 edges, 116527 markings/sec, 155 secs
lola: 38651679 markings, 128853848 edges, 218356 markings/sec, 160 secs
lola: 40228900 markings, 131623905 edges, 315444 markings/sec, 165 secs
lola: 41642876 markings, 134835450 edges, 282795 markings/sec, 170 secs
lola: 42274988 markings, 137762993 edges, 126422 markings/sec, 175 secs
lola: 42917399 markings, 140970548 edges, 128482 markings/sec, 180 secs
lola: 43594568 markings, 144351546 edges, 135434 markings/sec, 185 secs
lola: 44266849 markings, 147708776 edges, 134456 markings/sec, 190 secs
lola: 45253301 markings, 151529412 edges, 197290 markings/sec, 195 secs
lola: 46324955 markings, 155012284 edges, 214331 markings/sec, 200 secs
lola: 47092092 markings, 158749186 edges, 153427 markings/sec, 205 secs
lola: 48235627 markings, 162158930 edges, 228707 markings/sec, 210 secs
lola: 49899984 markings, 165011624 edges, 332871 markings/sec, 215 secs
lola: 51086628 markings, 168543877 edges, 237329 markings/sec, 220 secs
lola: 52754769 markings, 171286127 edges, 333628 markings/sec, 225 secs
lola: 54099380 markings, 175025199 edges, 268922 markings/sec, 230 secs
lola: 55489959 markings, 178450859 edges, 278116 markings/sec, 235 secs
lola: 56927395 markings, 181636703 edges, 287487 markings/sec, 240 secs
lola: 58364046 markings, 184825894 edges, 287330 markings/sec, 245 secs
lola: 59871979 markings, 188174629 edges, 301587 markings/sec, 250 secs
lola: 61557359 markings, 190853674 edges, 337076 markings/sec, 255 secs
lola: 62937479 markings, 193943187 edges, 276024 markings/sec, 260 secs
lola: 64541308 markings, 197095103 edges, 320766 markings/sec, 265 secs
lola: 66028935 markings, 200227997 edges, 297525 markings/sec, 270 secs
lola: 67381137 markings, 203639880 edges, 270440 markings/sec, 275 secs
lola: 69064454 markings, 206256517 edges, 336663 markings/sec, 280 secs
lola: 70372648 markings, 209587458 edges, 261639 markings/sec, 285 secs
lola: 71912569 markings, 212523019 edges, 307984 markings/sec, 290 secs
lola: 73332195 markings, 216094868 edges, 283925 markings/sec, 295 secs
lola: 74647062 markings, 219646736 edges, 262973 markings/sec, 300 secs
lola: 76234600 markings, 222526761 edges, 317508 markings/sec, 305 secs
lola: 77939412 markings, 225150065 edges, 340962 markings/sec, 310 secs
lola: 79671233 markings, 227692448 edges, 346364 markings/sec, 315 secs
lola: 81294222 markings, 230418924 edges, 324598 markings/sec, 320 secs
lola: 82866616 markings, 233374837 edges, 314479 markings/sec, 325 secs
lola: 83886844 markings, 237062559 edges, 204046 markings/sec, 330 secs
lola: 84688819 markings, 241016687 edges, 160395 markings/sec, 335 secs
lola: 85462720 markings, 244836836 edges, 154780 markings/sec, 340 secs
lola: 86239176 markings, 248670586 edges, 155291 markings/sec, 345 secs
lola: 87284978 markings, 251942473 edges, 209160 markings/sec, 350 secs
lola: 88628073 markings, 254509685 edges, 268619 markings/sec, 355 secs
lola: 90031583 markings, 257005083 edges, 280702 markings/sec, 360 secs
lola: 91310689 markings, 260316984 edges, 255821 markings/sec, 365 secs
lola: 92585099 markings, 263878981 edges, 254882 markings/sec, 370 secs
lola: 93810541 markings, 267176668 edges, 245088 markings/sec, 375 secs
lola: 95261152 markings, 269653397 edges, 290122 markings/sec, 380 secs
lola: 96227282 markings, 273398582 edges, 193226 markings/sec, 385 secs
lola: 97530339 markings, 276515984 edges, 260611 markings/sec, 390 secs
lola: 98980598 markings, 279425584 edges, 290052 markings/sec, 395 secs
lola: 100654447 markings, 281825636 edges, 334770 markings/sec, 400 secs
lola: 102265103 markings, 284343181 edges, 322131 markings/sec, 405 secs
lola: 103827422 markings, 286986580 edges, 312464 markings/sec, 410 secs
lola: 105493886 markings, 289505585 edges, 333293 markings/sec, 415 secs
lola: 107026090 markings, 292177555 edges, 306441 markings/sec, 420 secs
lola: 108690497 markings, 294684261 edges, 332881 markings/sec, 425 secs
lola: 109625956 markings, 296282417 edges, 187092 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((2 <= SF) AND (1 <= CR))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((2 <= SF) AND (1 <= CR))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((StR <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (SpA + 1 <= StR)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= StF))) U A (X ((2 <= CG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (2 <= StF)) U AX((2 <= CG)))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1402237 markings, 4006862 edges, 3110617900780617728 markings/sec, 0 secs
lola: 2564994 markings, 7663402 edges, 232551 markings/sec, 5 secs
lola: 3685700 markings, 11170913 edges, 224141 markings/sec, 10 secs
lola: 4716039 markings, 14510757 edges, 206068 markings/sec, 15 secs
lola: 5710696 markings, 17807317 edges, 198931 markings/sec, 20 secs
lola: 6531399 markings, 20531292 edges, 164141 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CwG <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= CwG)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1022 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((CwA <= SR) OR (3 <= SwA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((CwA <= SR) OR (3 <= SwA))))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 14 will run for 1533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((CwA + 1 <= Cb) AND (2 <= Cb)) U A (F ((2 <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((CwA + 1 <= Cb) AND (2 <= Cb)) U A(TRUE U (2 <= SF)))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 15 will run for 3067 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((SA <= Mi))) U E (G ((Mi <= StF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (Mi + 1 <= SA))) U NOT(A(TRUE U (StF + 1 <= Mi))))
lola: processed formula length: 65
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0100P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no no yes yes no no no yes unknown yes no yes yes yes no no
lola: ========================================
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0100P0-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496605118374

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-N0100P0"
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-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is ClientsAndServers-PT-N0100P0, 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 r168-ebro-149580920100273"
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 ;