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-N0200P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580920100282
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496605344737


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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0200P0: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0200P0 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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-N0200P0-CTLCardinality.task
lola: E (F (((Cb <= SG) AND (2 <= SwA) AND (2 <= SF) AND (1 <= SwA) AND (Ci + 1 <= SG) AND (SG + 1 <= MtF)))) : A (G (E (F (((3 <= CwG) OR (3 <= SwA)))))) : ((NOT(A (F ((3 <= Cb)))) AND NOT(E (X ((3 <= CwG))))) AND (SwA <= 1)) : A (G ((((3 <= StF) AND (1 <= SR)) OR A (F ((3 <= CG)))))) : A (F ((A (G ((CwA <= StF))) OR E (G ((MpG <= StF)))))) : E ((A (F ((2 <= CG))) U (1 <= StR))) : A (X ((E (F ((3 <= SA))) AND E (X ((CR <= SA)))))) : ((E (((SG <= SwA) U (SF <= MpA))) OR (((Mi <= SwA) AND (CF <= Cb) AND (SpG + 1 <= StR)) OR E (X ((3 <= Cb))))) AND (E (F ((SpG + 1 <= CA))) OR A (F (((2 <= SF) AND (CA <= SpG)))))) : NOT(NOT(NOT(E (F ((3 <= Cb)))))) : ((A (F ((CwA <= SR))) AND E (X (((CwG <= CA) OR (2 <= Si))))) AND E (G ((((SwG <= CF) AND (2 <= SF)) OR (MwU <= 1))))) : E (X ((A (F ((2 <= SR))) AND E (G (TRUE))))) : (A (F (((CwG <= StF) AND (3 <= CG) AND (SR <= 2)))) AND (A (((CR <= SR) U (CF <= CG))) OR TRUE)) : A (F (A (G ((1 <= StF))))) : (E (((SA <= SF) U ((MwU <= MpG) AND (Uf <= SwG)))) AND E (F ((Si <= MwU)))) : A (G ((E (X ((MpG <= Mi))) OR ((MwU <= CA) AND ((SG <= Uf) OR (MpA <= Mi)))))) : E (G ((E (F ((1 <= MtF))) OR ((Mi <= Uf) OR (3 <= MtF) OR (SR + 1 <= MtF)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Cb <= SG) AND (2 <= SwA) AND (2 <= SF) AND (1 <= SwA) AND (Ci + 1 <= SG) AND (SG + 1 <= MtF))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0200P0-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0200P0-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= CwG) OR (3 <= SwA))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= CwG) OR (3 <= SwA))))))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: 1396264 markings, 5340217 edges, 3689320832170983424 markings/sec, 0 secs
lola: 2613475 markings, 10481271 edges, 243442 markings/sec, 5 secs
lola: 3803625 markings, 15413205 edges, 238030 markings/sec, 10 secs
lola: 4808079 markings, 20380577 edges, 200891 markings/sec, 15 secs
lola: 5885492 markings, 25301451 edges, 215483 markings/sec, 20 secs
lola: 6998631 markings, 30249408 edges, 222628 markings/sec, 25 secs
lola: 8141758 markings, 35158858 edges, 228625 markings/sec, 30 secs
lola: 9250361 markings, 40012170 edges, 221721 markings/sec, 35 secs
lola: 10247666 markings, 44178248 edges, 199461 markings/sec, 40 secs
lola: 11204699 markings, 48404214 edges, 191407 markings/sec, 45 secs
lola: 12227649 markings, 52804525 edges, 204590 markings/sec, 50 secs
lola: 13162576 markings, 57135908 edges, 186985 markings/sec, 55 secs
lola: 14135644 markings, 61606665 edges, 194614 markings/sec, 60 secs
lola: 15097003 markings, 65867751 edges, 192272 markings/sec, 65 secs
lola: 16210427 markings, 70849559 edges, 222685 markings/sec, 70 secs
lola: 17065007 markings, 74861441 edges, 170916 markings/sec, 75 secs
lola: 17957732 markings, 79297908 edges, 178545 markings/sec, 80 secs
lola: 18870465 markings, 83203455 edges, 182547 markings/sec, 85 secs
lola: 19970255 markings, 87722618 edges, 219958 markings/sec, 90 secs
lola: 21113041 markings, 92444694 edges, 228557 markings/sec, 95 secs
lola: 22028216 markings, 96451617 edges, 183035 markings/sec, 100 secs
lola: 22911263 markings, 100363464 edges, 176609 markings/sec, 105 secs
lola: 23927351 markings, 104451741 edges, 203218 markings/sec, 110 secs
lola: 24813002 markings, 108641056 edges, 177130 markings/sec, 115 secs
lola: 25736932 markings, 112783359 edges, 184786 markings/sec, 120 secs
lola: 26769677 markings, 117314528 edges, 206549 markings/sec, 125 secs
lola: 27898470 markings, 121480277 edges, 225759 markings/sec, 130 secs
lola: 28848640 markings, 125577577 edges, 190034 markings/sec, 135 secs
lola: 29825641 markings, 129425327 edges, 195400 markings/sec, 140 secs
lola: 30774704 markings, 133287617 edges, 189813 markings/sec, 145 secs
lola: 31679478 markings, 137143559 edges, 180955 markings/sec, 150 secs
lola: 32528229 markings, 141342153 edges, 169750 markings/sec, 155 secs
lola: 33448201 markings, 145491786 edges, 183994 markings/sec, 160 secs
lola: 34404491 markings, 149758683 edges, 191258 markings/sec, 165 secs
lola: 35312633 markings, 154129813 edges, 181628 markings/sec, 170 secs
lola: 36176947 markings, 158439583 edges, 172863 markings/sec, 175 secs
lola: 37130287 markings, 162323878 edges, 190668 markings/sec, 180 secs
lola: 38107626 markings, 166733205 edges, 195468 markings/sec, 185 secs
lola: 38958310 markings, 170804199 edges, 170137 markings/sec, 190 secs
lola: 39872109 markings, 174672403 edges, 182760 markings/sec, 195 secs
lola: 40765858 markings, 178505851 edges, 178750 markings/sec, 200 secs
lola: 41624067 markings, 182479347 edges, 171642 markings/sec, 205 secs
lola: 42446858 markings, 186543565 edges, 164558 markings/sec, 210 secs
lola: 43409479 markings, 190180301 edges, 192524 markings/sec, 215 secs
lola: 44572280 markings, 194639544 edges, 232560 markings/sec, 220 secs
lola: 45577064 markings, 199054908 edges, 200957 markings/sec, 225 secs
lola: 46395661 markings, 202929092 edges, 163719 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((3 <= Cb)))) AND NOT(E (X ((3 <= CwG))))) AND (SwA <= 1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((Cb <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= Cb)))
lola: processed formula length: 24
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((CwG <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((CwG <= 2))
lola: processed formula length: 14
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (SwA <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SwA <= 1)
lola: processed formula length: 10
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: lola: SUBRESULT========================================

lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= StF) AND (1 <= SR)) OR A (F ((3 <= CG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((StF <= 2) OR (SR <= 0)) AND NOT(A(TRUE U (3 <= CG))))))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((CwA <= StF))) OR E (G ((MpG <= StF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (StF + 1 <= CwA))) OR NOT(A(TRUE U (StF + 1 <= MpG)))))
lola: processed formula length: 78
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: 3028613 markings, 3185732 edges, 3225412962034384896 markings/sec, 0 secs
lola: 4035883 markings, 5216109 edges, 201454 markings/sec, 5 secs
lola: 4942789 markings, 7291348 edges, 181381 markings/sec, 10 secs
lola: 5672748 markings, 9509365 edges, 145992 markings/sec, 15 secs
lola: 6352192 markings, 11612293 edges, 135889 markings/sec, 20 secs
lola: 7021981 markings, 13690125 edges, 133958 markings/sec, 25 secs
lola: 7682641 markings, 15741932 edges, 132132 markings/sec, 30 secs
lola: 8338394 markings, 17780336 edges, 131151 markings/sec, 35 secs
lola: 8989605 markings, 19805668 edges, 130242 markings/sec, 40 secs
lola: 9639385 markings, 21827230 edges, 129956 markings/sec, 45 secs
lola: 10289702 markings, 23851158 edges, 130063 markings/sec, 50 secs
lola: 10947305 markings, 25898854 edges, 131521 markings/sec, 55 secs
lola: 11603924 markings, 27943221 edges, 131324 markings/sec, 60 secs
lola: 12255855 markings, 29973063 edges, 130386 markings/sec, 65 secs
lola: 12900275 markings, 31980727 edges, 128884 markings/sec, 70 secs
lola: 13534993 markings, 33958099 edges, 126944 markings/sec, 75 secs
lola: 14162572 markings, 35913630 edges, 125516 markings/sec, 80 secs
lola: 14786719 markings, 37859068 edges, 124829 markings/sec, 85 secs
lola: 15407040 markings, 39792989 edges, 124064 markings/sec, 90 secs
lola: 16037243 markings, 41756556 edges, 126041 markings/sec, 95 secs
lola: 16664442 markings, 43711798 edges, 125440 markings/sec, 100 secs
lola: 17284569 markings, 45645197 edges, 124025 markings/sec, 105 secs
lola: 17902971 markings, 47574568 edges, 123680 markings/sec, 110 secs
lola: 18522994 markings, 49507522 edges, 124005 markings/sec, 115 secs
lola: 19140005 markings, 51431047 edges, 123402 markings/sec, 120 secs
lola: 19747958 markings, 53328067 edges, 121591 markings/sec, 125 secs
lola: 20373031 markings, 55276702 edges, 125015 markings/sec, 130 secs
lola: 21008334 markings, 57259289 edges, 127061 markings/sec, 135 secs
lola: 21648286 markings, 59254475 edges, 127990 markings/sec, 140 secs
lola: 22278868 markings, 61222247 edges, 126116 markings/sec, 145 secs
lola: 22887054 markings, 63118770 edges, 121637 markings/sec, 150 secs
lola: 23508911 markings, 65058677 edges, 124371 markings/sec, 155 secs
lola: 24127969 markings, 66990327 edges, 123812 markings/sec, 160 secs
lola: 24743580 markings, 68911318 edges, 123122 markings/sec, 165 secs
lola: 25347312 markings, 70795140 edges, 120746 markings/sec, 170 secs
lola: 25950522 markings, 72677308 edges, 120642 markings/sec, 175 secs
lola: 26561181 markings, 74582807 edges, 122132 markings/sec, 180 secs
lola: 27167823 markings, 76475748 edges, 121328 markings/sec, 185 secs
lola: 27766139 markings, 78342720 edges, 119663 markings/sec, 190 secs
lola: 28360545 markings, 80197660 edges, 118881 markings/sec, 195 secs
lola: 28971068 markings, 82104406 edges, 122105 markings/sec, 200 secs
lola: 29562684 markings, 83950243 edges, 118323 markings/sec, 205 secs
lola: 30152838 markings, 85791678 edges, 118031 markings/sec, 210 secs
lola: 30724386 markings, 87575703 edges, 114310 markings/sec, 215 secs
lola: 31322657 markings, 89443677 edges, 119654 markings/sec, 220 secs
lola: 31902203 markings, 91251910 edges, 115909 markings/sec, 225 secs
lola: 32470707 markings, 93027753 edges, 113701 markings/sec, 230 secs
lola: 33068409 markings, 94892513 edges, 119540 markings/sec, 235 secs
lola: 33652905 markings, 96716998 edges, 116899 markings/sec, 240 secs
lola: 34255681 markings, 98599027 edges, 120555 markings/sec, 245 secs
lola: 34855894 markings, 100472146 edges, 120043 markings/sec, 250 secs
lola: 35470915 markings, 102393095 edges, 123004 markings/sec, 255 secs
lola: 36087835 markings, 104318276 edges, 123384 markings/sec, 260 secs
lola: 36674160 markings, 106149781 edges, 117265 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((2 <= CG))) U (1 <= StR)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (2 <= CG)) U (1 <= StR))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F ((3 <= SA))) AND E (X ((CR <= SA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= SA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= SA)))
lola: processed formula length: 23
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 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 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((CR <= SA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((CR <= SA)))
lola: processed formula length: 18
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((SG <= SwA) U (SF <= MpA))) OR (((Mi <= SwA) AND (CF <= Cb) AND (SpG + 1 <= StR)) OR E (X ((3 <= Cb))))) AND (E (F ((SpG + 1 <= CA))) OR A (F (((2 <= SF) AND (CA <= SpG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((SG <= SwA) U (SF <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((SG <= SwA) U (SF <= MpA))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((SpG + 1 <= CA)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0200P0-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0200P0-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(E (F ((3 <= Cb))))))
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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to ClientsAndServers-PT-N0200P0-CTLCardinality-8.sara
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: lola: lola: ================================================================================

state equation: calling and running sara
lola: ...considering subproblem: ((A (F ((CwA <= SR))) AND E (X (((CwG <= CA) OR (2 <= Si))))) AND E (G ((((SwG <= CF) AND (2 <= SF)) OR (MwU <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CwA <= SR)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (CwA <= SR))
lola: processed formula length: 21
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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.
sara: try reading problem file ClientsAndServers-PT-N0200P0-CTLCardinality-8.sara.
lola: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((CwG <= CA) OR (2 <= Si))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((CwG <= CA) OR (2 <= Si)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((SwG <= CF) AND (2 <= SF)) OR (MwU <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((CF + 1 <= SwG) OR (SF <= 1)) AND (2 <= MwU))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((2 <= SR))) AND E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (2 <= SR)))
lola: processed formula length: 23
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 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 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((CwG <= StF) AND (3 <= CG) AND (SR <= 2)))) AND (A (((CR <= SR) U (CF <= CG))) OR TRUE))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((CwG <= StF) AND (3 <= CG) AND (SR <= 2)))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 12 will run for 756 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= StF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (StF <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 13 will run for 1009 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((SA <= SF) U ((MwU <= MpG) AND (Uf <= SwG)))) AND E (F ((Si <= MwU))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1009 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((SA <= SF) U ((MwU <= MpG) AND (Uf <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((SA <= SF) U ((MwU <= MpG) AND (Uf <= SwG)))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 14 will run for 1513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Si <= MwU)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0200P0-CTLCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((MpG <= Mi))) OR ((MwU <= CA) AND ((SG <= Uf) OR (MpA <= Mi))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(EX((MpG <= Mi))) AND ((CA + 1 <= MwU) OR ((Uf + 1 <= SG) AND (Mi + 1 <= MpA))))))
lola: processed formula length: 100
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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 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 15 will run for 3027 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((1 <= MtF))) OR ((Mi <= Uf) OR (3 <= MtF) OR (SR + 1 <= MtF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (1 <= MtF))) AND ((Uf + 1 <= Mi) AND (MtF <= 2) AND (MtF <= SR)))))
lola: processed formula length: 94
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0200P0-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: RESULT
lola:
SUMMARY: yes unknown yes no unknown no yes yes no yes no no no yes no yes
lola: ========================================
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0200P0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496605858577

--------------------
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-N0200P0"
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-N0200P0.tgz
mv ClientsAndServers-PT-N0200P0 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-N0200P0, 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-149580920100282"
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 ;