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-3254
Executing tool lola
Input is S_HouseConstruction-PT-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612600615
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-0
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-1
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-15
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-2
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-3
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-4
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-5
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-6
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-7
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-8
FORMULA_NAME HouseConstruction-PT-100-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496401731341


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


checking for too many tokens
===========================================================================================
S_HouseConstruction-PT-100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_HouseConstruction-PT-100 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-100-CTLCardinality.task
lola: (NOT(A (F ((3 <= p8)))) OR NOT(E (X (((p27 <= p3) OR (2 <= p2)))))) : NOT(A (F (A (G ((p14 <= p15)))))) : E (G (E (((2 <= p25) U (p17 <= p15))))) : (NOT(E (F (((p2 <= p16) AND (p25 <= p11))))) OR E (F (A (F ((2 <= p20)))))) : ((((p3 <= p6) OR (3 <= p9)) OR E (G (((2 <= p2) AND (p2 <= p5))))) AND NOT(E (F (((2 <= p21) AND (p21 <= p23)))))) : (NOT(E (G (((p7 <= p3) OR (p1 <= p16))))) OR (((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1))) AND A (F (((p17 <= p6) OR (p21 <= p3)))))) : E (G (((p17 <= 1) OR ((p18 <= 1) AND (p10 <= 2))))) : (A ((((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15)))) AND (E (F ((3 <= p11))) AND A (F (((1 <= p16) AND (p19 <= p20)))))) : NOT((A (F (((2 <= p22) AND (1 <= p25)))) AND (p8 <= p10))) : A (G ((E (F ((p1 <= p15))) AND E (F ((p1 <= p15)))))) : E (X ((((p18 <= 2) AND (1 <= p5)) OR A (F ((3 <= p5)))))) : A (F ((A (G ((3 <= p20))) AND E (X ((3 <= p11)))))) : ((((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26)) AND NOT(E (G ((p8 <= p20))))) OR ((p7 <= 2) AND (p8 <= p4) AND ((p16 + 1 <= p9) OR (p8 <= p12)) AND (p25 + 1 <= p23) AND ((p13 <= 0) OR (p18 <= 2)))) : E ((A (X ((p8 <= p2))) U ((p13 <= 2) AND (3 <= p26)))) : E (F (((p7 + 1 <= p8) AND (3 <= p27)))) : (NOT(E (((p26 <= p7) U (2 <= p19)))) OR NOT((E (G ((p8 <= p16))) AND ((1 <= p25) OR (p15 <= p9) OR (p4 + 1 <= p25)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F ((3 <= p8)))) OR NOT(E (X (((p27 <= p3) OR (2 <= p2))))))
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: E (G ((p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p8)))
lola: processed formula length: 24
lola: 8 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p14 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p15 + 1 <= p14)))))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 1325807 markings, 4206083 edges, 265161 markings/sec, 0 secs
lola: 2404078 markings, 7973970 edges, 215654 markings/sec, 5 secs
lola: 3291882 markings, 11530714 edges, 177561 markings/sec, 10 secs
lola: 4297692 markings, 15198995 edges, 201162 markings/sec, 15 secs
lola: 5164122 markings, 18757092 edges, 173286 markings/sec, 20 secs
lola: 6009053 markings, 22124572 edges, 168986 markings/sec, 25 secs
lola: 6885440 markings, 25529449 edges, 175277 markings/sec, 30 secs
lola: 7765079 markings, 28887567 edges, 175928 markings/sec, 35 secs
lola: 8498595 markings, 31984520 edges, 146703 markings/sec, 40 secs
lola: 9251586 markings, 35274054 edges, 150598 markings/sec, 45 secs
lola: 10050913 markings, 38772254 edges, 159865 markings/sec, 50 secs
lola: 10751417 markings, 41898674 edges, 140101 markings/sec, 55 secs
lola: 11640541 markings, 45419206 edges, 177825 markings/sec, 60 secs
lola: 12538766 markings, 49132858 edges, 179645 markings/sec, 65 secs
lola: 13314035 markings, 52436780 edges, 155054 markings/sec, 70 secs
lola: 13991026 markings, 55317005 edges, 135398 markings/sec, 75 secs
lola: 14616882 markings, 58450125 edges, 125171 markings/sec, 80 secs
lola: 15436663 markings, 61898919 edges, 163956 markings/sec, 85 secs
lola: 16181189 markings, 65158248 edges, 148905 markings/sec, 90 secs
lola: 16853976 markings, 67954683 edges, 134557 markings/sec, 95 secs
lola: 17655892 markings, 71308607 edges, 160383 markings/sec, 100 secs
lola: 18386804 markings, 74349398 edges, 146182 markings/sec, 105 secs
lola: 19088539 markings, 77257236 edges, 140347 markings/sec, 110 secs
lola: 19852417 markings, 80592063 edges, 152776 markings/sec, 115 secs
lola: 20679938 markings, 83748334 edges, 165504 markings/sec, 120 secs
lola: 21305503 markings, 86704111 edges, 125113 markings/sec, 125 secs
lola: 21991996 markings, 89700281 edges, 137299 markings/sec, 130 secs
lola: 22691454 markings, 92780949 edges, 139892 markings/sec, 135 secs
lola: 23348289 markings, 95851572 edges, 131367 markings/sec, 140 secs
lola: 23899809 markings, 98545603 edges, 110304 markings/sec, 145 secs
lola: 24477614 markings, 101233556 edges, 115561 markings/sec, 150 secs
lola: 25004488 markings, 103981115 edges, 105375 markings/sec, 155 secs
lola: 25774470 markings, 107245328 edges, 153996 markings/sec, 160 secs
lola: 26490099 markings, 110401972 edges, 143126 markings/sec, 165 secs
lola: 27154033 markings, 113602318 edges, 132787 markings/sec, 170 secs
lola: 27783606 markings, 116663119 edges, 125915 markings/sec, 175 secs
lola: 28419285 markings, 119599259 edges, 127136 markings/sec, 180 secs
lola: 28978245 markings, 122280813 edges, 111792 markings/sec, 185 secs
lola: 29648110 markings, 125482102 edges, 133973 markings/sec, 190 secs
lola: 30570959 markings, 129195815 edges, 184570 markings/sec, 195 secs
lola: 31316105 markings, 132467271 edges, 149029 markings/sec, 200 secs
lola: 32085900 markings, 136044889 edges, 153959 markings/sec, 205 secs
lola: 32885271 markings, 139617004 edges, 159874 markings/sec, 210 secs
lola: 33517889 markings, 142564927 edges, 126524 markings/sec, 215 secs
lola: 34082820 markings, 145546353 edges, 112986 markings/sec, 220 secs
lola: 34725120 markings, 148639650 edges, 128460 markings/sec, 225 secs
lola: 35330467 markings, 151332438 edges, 121069 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: E (G (E (((2 <= p25) U (p17 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((2 <= p25) U (p17 <= p15)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((p2 <= p16) AND (p25 <= p11))))) OR E (F (A (F ((2 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p16 + 1 <= p2) OR (p11 + 1 <= p25))))
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 72 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 2 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 HouseConstruction-PT-100-CTLCardinality-3.sara
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((2 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (2 <= p20)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p3 <= p6) OR (3 <= p9)) OR E (G (((2 <= p2) AND (p2 <= p5))))) AND NOT(E (F (((2 <= p21) AND (p21 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p3 <= p6) OR (3 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 <= p6) OR (3 <= p9))
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p21 <= 1) OR (p23 + 1 <= p21))))
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 72 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HouseConstruction-PT-100-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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((p7 <= p3) OR (p1 <= p16))))) OR (((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1))) AND A (F (((p17 <= p6) OR (p21 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p3 + 1 <= p7) AND (p16 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p3 + 1 <= p7) AND (p16 + 1 <= p1)))
lola: processed formula length: 46
lola: 4 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p21) AND (3 <= p11) AND ((2 <= p11) OR (3 <= p2) OR (3 <= p1)))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p17 <= 1) OR ((p18 <= 1) AND (p10 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p17) AND ((2 <= p18) OR (3 <= p10)))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15)))) AND (E (F ((3 <= p11))) AND A (F (((1 <= p16) AND (p19 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p26) AND (p14 <= p12)) U ((2 <= p23) OR (p8 <= p15)))
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p11)))
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 72 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HouseConstruction-PT-100-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p16) AND (p19 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((1 <= p16) AND (p19 <= p20)))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 1726086 markings, 3740747 edges, 3096159597753270272 markings/sec, 0 secs
lola: 3327881 markings, 7244728 edges, 320359 markings/sec, 5 secs
lola: 4827423 markings, 10544649 edges, 299908 markings/sec, 10 secs
lola: 6239394 markings, 13681639 edges, 282394 markings/sec, 15 secs
lola: 7736910 markings, 16960389 edges, 299503 markings/sec, 20 secs
lola: 9164711 markings, 20144665 edges, 285560 markings/sec, 25 secs
lola: 10629207 markings, 23348444 edges, 292899 markings/sec, 30 secs
lola: 12052093 markings, 26507296 edges, 284577 markings/sec, 35 secs
lola: 13461597 markings, 29623192 edges, 281901 markings/sec, 40 secs
lola: 14883126 markings, 32754549 edges, 284306 markings/sec, 45 secs
lola: 16214085 markings, 35752941 edges, 266192 markings/sec, 50 secs
lola: 17613043 markings, 38817004 edges, 279792 markings/sec, 55 secs
lola: 18937820 markings, 41793006 edges, 264955 markings/sec, 60 secs
lola: 20338906 markings, 44838128 edges, 280217 markings/sec, 65 secs
lola: 21657575 markings, 47791969 edges, 263734 markings/sec, 70 secs
lola: 22970540 markings, 50726365 edges, 262593 markings/sec, 75 secs
lola: 24284756 markings, 53657432 edges, 262843 markings/sec, 80 secs
lola: 25629760 markings, 56604168 edges, 269001 markings/sec, 85 secs
lola: 26643821 markings, 58892472 edges, 202812 markings/sec, 90 secs
lola: 27953352 markings, 61801124 edges, 261906 markings/sec, 95 secs
lola: 29243264 markings, 64666541 edges, 257982 markings/sec, 100 secs
lola: 30540012 markings, 67540672 edges, 259350 markings/sec, 105 secs
lola: 31838994 markings, 70415900 edges, 259796 markings/sec, 110 secs
lola: 33114142 markings, 73233055 edges, 255030 markings/sec, 115 secs
lola: 34402273 markings, 76072226 edges, 257626 markings/sec, 120 secs
lola: 35670730 markings, 78861274 edges, 253691 markings/sec, 125 secs
lola: 36916046 markings, 81634707 edges, 249063 markings/sec, 130 secs
lola: 38101254 markings, 84346360 edges, 237042 markings/sec, 135 secs
lola: 39370727 markings, 87132344 edges, 253895 markings/sec, 140 secs
lola: 40656735 markings, 89946875 edges, 257202 markings/sec, 145 secs
lola: 41935229 markings, 92784752 edges, 255699 markings/sec, 150 secs
lola: 43124532 markings, 95503885 edges, 237861 markings/sec, 155 secs
lola: 44410408 markings, 98311168 edges, 257175 markings/sec, 160 secs
lola: 45725055 markings, 101176216 edges, 262929 markings/sec, 165 secs
lola: 46874119 markings, 103847630 edges, 229813 markings/sec, 170 secs
lola: 48161225 markings, 106647335 edges, 257421 markings/sec, 175 secs
lola: 49466407 markings, 109507717 edges, 261036 markings/sec, 180 secs
lola: 50636046 markings, 112199942 edges, 233928 markings/sec, 185 secs
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 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((2 <= p22) AND (1 <= p25)))) AND (p8 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p22 <= 1) OR (p25 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p22) AND (1 <= p25))))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 9 will run for 444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p1 <= p15))) AND E (F ((p1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: ========================================
subprocess 9 will run for 444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p1 <= p15)))))
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 (p1 <= p15)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 1737926 markings, 6807350 edges, 2561584191154159616 markings/sec, 0 secs
lola: 2954337 markings, 12579210 edges, 243282 markings/sec, 5 secs
lola: 3877276 markings, 17946556 edges, 184588 markings/sec, 10 secs
lola: 4777767 markings, 23403371 edges, 180098 markings/sec, 15 secs
lola: 5573739 markings, 28463042 edges, 159194 markings/sec, 20 secs
lola: 6341145 markings, 33534660 edges, 153481 markings/sec, 25 secs
lola: 7212128 markings, 38694576 edges, 174197 markings/sec, 30 secs
lola: 7966000 markings, 43516508 edges, 150774 markings/sec, 35 secs
lola: 8785368 markings, 48628009 edges, 163874 markings/sec, 40 secs
lola: 9700751 markings, 54060120 edges, 183077 markings/sec, 45 secs
lola: 10406031 markings, 59037098 edges, 141056 markings/sec, 50 secs
lola: 11167749 markings, 64158689 edges, 152344 markings/sec, 55 secs
lola: 11888772 markings, 68966079 edges, 144205 markings/sec, 60 secs
lola: 12439517 markings, 73396946 edges, 110149 markings/sec, 65 secs
lola: 13175310 markings, 78376808 edges, 147159 markings/sec, 70 secs
lola: 14039797 markings, 83441918 edges, 172897 markings/sec, 75 secs
lola: 14707859 markings, 88035352 edges, 133612 markings/sec, 80 secs
lola: 15396768 markings, 92605815 edges, 137782 markings/sec, 85 secs
lola: 16169283 markings, 97498696 edges, 154503 markings/sec, 90 secs
lola: 16833475 markings, 102147023 edges, 132838 markings/sec, 95 secs
lola: 17393117 markings, 106552066 edges, 111928 markings/sec, 100 secs
lola: 18231840 markings, 111170231 edges, 167745 markings/sec, 105 secs
lola: 18870607 markings, 115235571 edges, 127753 markings/sec, 110 secs
lola: 19598913 markings, 119572212 edges, 145661 markings/sec, 115 secs
lola: 20075758 markings, 123007720 edges, 95369 markings/sec, 120 secs
lola: 20825970 markings, 127042267 edges, 150042 markings/sec, 125 secs
lola: 21495035 markings, 131341514 edges, 133813 markings/sec, 130 secs
lola: 22128230 markings, 135223077 edges, 126639 markings/sec, 135 secs
lola: 22673782 markings, 139175944 edges, 109110 markings/sec, 140 secs
lola: 23215249 markings, 142709719 edges, 108293 markings/sec, 145 secs
lola: 23708949 markings, 145997421 edges, 98740 markings/sec, 150 secs
lola: 24178860 markings, 149481791 edges, 93982 markings/sec, 155 secs
lola: 24842027 markings, 153179407 edges, 132633 markings/sec, 160 secs
lola: 25435626 markings, 157113086 edges, 118720 markings/sec, 165 secs
lola: 25985943 markings, 161185360 edges, 110063 markings/sec, 170 secs
lola: 26513346 markings, 164815997 edges, 105481 markings/sec, 175 secs
lola: 26977979 markings, 168461800 edges, 92927 markings/sec, 180 secs
lola: 27409063 markings, 172055112 edges, 86217 markings/sec, 185 secs
lola: 28131852 markings, 176135765 edges, 144558 markings/sec, 190 secs
lola: 28767317 markings, 179709736 edges, 127093 markings/sec, 195 secs
lola: 29570983 markings, 184573781 edges, 160733 markings/sec, 200 secs
lola: 30770752 markings, 190183359 edges, 239954 markings/sec, 205 secs
lola: 31567564 markings, 194930788 edges, 159362 markings/sec, 210 secs
lola: 32297585 markings, 199590547 edges, 146004 markings/sec, 215 secs
lola: 33353107 markings, 204979220 edges, 211104 markings/sec, 220 secs
lola: 33944981 markings, 209233080 edges, 118375 markings/sec, 225 secs
lola: 34892164 markings, 214291011 edges, 189437 markings/sec, 230 secs
lola: 35834948 markings, 219696679 edges, 188557 markings/sec, 235 secs
lola: 36626755 markings, 224774695 edges, 158361 markings/sec, 240 secs
lola: 37413144 markings, 229847803 edges, 157278 markings/sec, 245 secs
lola: 38482939 markings, 235433323 edges, 213959 markings/sec, 250 secs
lola: 39768393 markings, 241340160 edges, 257091 markings/sec, 255 secs
lola: 40604727 markings, 246581594 edges, 167267 markings/sec, 260 secs
lola: 41384370 markings, 251657945 edges, 155929 markings/sec, 265 secs
lola: 42289108 markings, 256956318 edges, 180948 markings/sec, 270 secs
lola: 43044339 markings, 261957653 edges, 151046 markings/sec, 275 secs
lola: 43796398 markings, 266901520 edges, 150412 markings/sec, 280 secs
lola: 45307579 markings, 273721426 edges, 302236 markings/sec, 285 secs
lola: 45936125 markings, 278233840 edges, 125709 markings/sec, 290 secs
lola: 46944578 markings, 283656643 edges, 201691 markings/sec, 295 secs
lola: 47663153 markings, 288287173 edges, 143715 markings/sec, 300 secs
lola: 48165322 markings, 292401184 edges, 100434 markings/sec, 305 secs
lola: 49090182 markings, 297502615 edges, 184972 markings/sec, 310 secs
lola: 49855871 markings, 302466907 edges, 153138 markings/sec, 315 secs
lola: 50570857 markings, 307393530 edges, 142997 markings/sec, 320 secs
lola: 51761968 markings, 313237399 edges, 238222 markings/sec, 325 secs
lola: 52529687 markings, 318321894 edges, 153544 markings/sec, 330 secs
lola: 53342462 markings, 323386981 edges, 162555 markings/sec, 335 secs
lola: 53938582 markings, 327914899 edges, 119224 markings/sec, 340 secs
lola: 54529023 markings, 332424456 edges, 118088 markings/sec, 345 secs
lola: 55122947 markings, 336879774 edges, 118785 markings/sec, 350 secs
lola: 56446747 markings, 343358592 edges, 264760 markings/sec, 355 secs
lola: 57499649 markings, 348791889 edges, 210580 markings/sec, 360 secs
lola: 58199783 markings, 353674107 edges, 140027 markings/sec, 365 secs
lola: 58955826 markings, 358620489 edges, 151209 markings/sec, 370 secs
lola: 59649015 markings, 362977551 edges, 138638 markings/sec, 375 secs
lola: 60223635 markings, 366905686 edges, 114924 markings/sec, 380 secs
lola: 60789239 markings, 370831357 edges, 113121 markings/sec, 385 secs
lola: 61411789 markings, 375262939 edges, 124510 markings/sec, 390 secs
lola: 62361742 markings, 380404443 edges, 189991 markings/sec, 395 secs
lola: 63223932 markings, 385431159 edges, 172438 markings/sec, 400 secs
lola: 64337420 markings, 390953016 edges, 222698 markings/sec, 405 secs
lola: 65658827 markings, 397260289 edges, 264281 markings/sec, 410 secs
lola: 66786857 markings, 402644923 edges, 225606 markings/sec, 415 secs
lola: 67602471 markings, 407587675 edges, 163123 markings/sec, 420 secs
lola: 68252532 markings, 412177336 edges, 130012 markings/sec, 425 secs
lola: 68967278 markings, 416971298 edges, 142949 markings/sec, 430 secs
lola: 69660876 markings, 421587714 edges, 138720 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((p18 <= 2) AND (1 <= p5)) OR A (F ((3 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p18 <= 2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p18 <= 2) AND (1 <= p5)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: subprocess 11 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= p5)))
lola: processed formula length: 23
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((3 <= p20))) AND E (X ((3 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (p20 <= 2))) AND EX((3 <= p11))))
lola: processed formula length: 56
lola: 4 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: 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 667 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26)) AND NOT(E (G ((p8 <= p20))))) OR ((p7 <= 2) AND (p8 <= p4) AND ((p16 + 1 <= p9) OR (p8 <= p12)) AND (p25 + 1 <= p23) AND ((p13 <= 0) OR (p18 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 667 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p22 <= 0) AND (p23 <= 1) AND (p23 <= p26))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 3 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 13 will run for 889 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p20 + 1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p20 + 1 <= p8))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 13 will run for 889 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((p8 <= p2))) U ((p13 <= 2) AND (3 <= p26))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX((p8 <= p2)) U ((p13 <= 2) AND (3 <= p26)))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: ========================================
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 1334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p7 + 1 <= p8) AND (3 <= p27))))
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 72 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HouseConstruction-PT-100-CTLCardinality-14.sara
lola: subprocess 15 will run for 2668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ...considering subproblem: (NOT(E (((p26 <= p7) U (2 <= p19)))) OR NOT((E (G ((p8 <= p16))) AND ((1 <= p25) OR (p15 <= p9) OR (p4 + 1 <= p25)))))
lola: lola: ========================================
state equation: calling and running sara========================================

lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p7 + 1 <= p26) R (p19 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((p26 <= p7) U (2 <= p19)))
lola: processed formula length: 32
lola: 12 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 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: sara: try reading problem file HouseConstruction-PT-100-CTLCardinality-14.sara.
========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p25 <= 0) AND (p9 + 1 <= p15) AND (p25 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p25 <= 0) AND (p9 + 1 <= p15) AND (p25 <= p4))
lola: processed formula length: 48
lola: 9 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-100-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes yes no no yes yes yes unknown no no yes yes yes unknown
sara: place or transition ordering is non-deterministic

FORMULA HouseConstruction-PT-100-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-100-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496402603572

--------------------
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="S_HouseConstruction-PT-100"
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/S_HouseConstruction-PT-100.tgz
mv S_HouseConstruction-PT-100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_HouseConstruction-PT-100, 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 r108-blw3-149441612600615"
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 ;