About the Execution of LoLA for GlobalResAllocation-COL-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
153.160 | 3607.00 | 5156.00 | 15.10 | FFTFTTTTFFTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is GlobalResAllocation-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264300426
=====================================================================
--------------------
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 GlobalResAllocation-COL-03-CTLCardinality-0
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-1
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-15
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-2
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-3
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-4
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-5
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-6
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-7
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-8
FORMULA_NAME GlobalResAllocation-COL-03-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494701581137
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ GlobalResAllocation-COL-03 @ 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: 4824/65536 symbol table entries, 1224 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-03-CTLCardinality.task
lola: A ((A (F ((2 <= p9 + p10 + p11))) U (p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2))) : E (X (A (F ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p9 + p10 + p11))))) : E (F (((p0 + p1 + p2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (1 <= p9 + p10 + p11) AND (p9 + p10 + p11 <= 1) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p3 + p4 + p5 + p6 + p7 + p8 <= p9 + p10 + p11) AND (p9 + p10 + p11 <= p30 + p31 + p32)))) : A (F (A (G ((2 <= p30 + p31 + p32))))) : A (G (E (X (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11)))))) : E (G (())) : NOT(NOT(A (F (((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : NOT(((E (G (TRUE)) OR A (G ((2 <= p9 + p10 + p11)))) AND ((2 <= p0 + p1 + p2) OR (1 <= p30 + p31 + p32) OR (p0 + p1 + p2 <= 2) OR (3 <= p0 + p1 + p2)))) : ((FALSE OR (A (F ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR ((p30 + p31 + p32 + 1 <= p9 + p10 + p11) OR ((2 <= p9 + p10 + p11))))) OR E (G (E (X ((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : (E (F (A (X ((3 <= p3 + p4 + p5 + p6 + p7 + p8))))) OR (p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2)) : A (G (E (F ((p0 + p1 + p2 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : A (F ((3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) : A (F ((((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p0 + p1 + p2 <= 1)) AND ((p0 + p1 + p2 <= 0) OR (p0 + p1 + p2 <= 2))))) : ((2 <= p9 + p10 + p11) OR A (X (A (G (TRUE))))) : ((A (((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32))) OR (E (F ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11))) OR (p9 + p10 + p11 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) AND A (X (E (X ((p3 + p4 + p5 + p6 + p7 + p8 <= p30 + p31 + p32)))))) : A (F ((((1 <= p30 + p31 + p32) AND ((p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2) OR (3 <= p0 + p1 + p2))) OR (1 <= p30 + p31 + p32))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p9 + p10 + p11))) U (p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (2 <= p9 + p10 + p11)) U (p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p9 + p10 + p11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p9 + p10 + p11)))
lola: processed formula length: 143
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (1 <= p9 + p10 + p11) AND (p9 + p10 + p11 <= 1) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8) AND (p3 + p4 + p5 + p6 + p7 + p8 <= p9 + p10 + p11) AND (p9 + p10 + p11 <= p30 + p31 + p32))))
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 84 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 GlobalResAllocation-COL-03-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-03-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= p30 + p31 + p32)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (p30 + p31 + p32 <= 1))))
lola: processed formula length: 47
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11))))))
lola: processed formula length: 151
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: processed formula with 0 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (F (((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p3 + p4 + p5 + p6 + p7 + p8 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 150
lola: 7 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G (TRUE)) OR A (G ((2 <= p9 + p10 + p11)))) AND ((2 <= p0 + p1 + p2) OR (1 <= p30 + p31 + p32) OR (p0 + p1 + p2 <= 2) OR (3 <= p0 + p1 + p2))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 <= 1) AND (p30 + p31 + p32 <= 0) AND (3 <= p0 + p1 + p2) AND (p0 + p1 + p2 <= 2))
lola: processed formula length: 96
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: processed formula with 4 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: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FALSE OR (A (F ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR ((p30 + p31 + p32 + 1 <= p9 + p10 + p11) OR ((2 <= p9 + p10 + p11))))) OR E (G (E (X ((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))
lola: processed formula length: 122
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p30 + p31 + p32 + 1 <= p9 + p10 + p11) OR ((2 <= p9 + p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p30 + p31 + p32 + 1 <= p9 + p10 + p11) OR ((2 <= p9 + p10 + p11)))
lola: processed formula length: 69
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: processed formula with 2 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: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: processed formula length: 136
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((3 <= p3 + p4 + p5 + p6 + p7 + p8))))) OR (p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((3 <= p3 + p4 + p5 + p6 + p7 + p8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((3 <= p3 + p4 + p5 + p6 + p7 + p8)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p0 + p1 + p2 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: ========================================
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p0 + p1 + p2 + 1 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: processed formula length: 157
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29))
lola: processed formula length: 122
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p0 + p1 + p2 <= 1)) AND ((p0 + p1 + p2 <= 0) OR (p0 + p1 + p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p3 + p4 + p5 + p6 + p7 + p8) OR (p0 + p1 + p2 <= 1)) AND ((p0 + p1 + p2 <= 0) OR (p0 + p1 + p2 <= 2))))
lola: processed formula length: 230
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p9 + p10 + p11) OR A (X (A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: processed formula with 0 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 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32))) OR (E (F ((p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p9 + p10 + p11))) OR (p9 + p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((2 <= p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29) U (p22 + p12 + p13 + p14 + p15 + p16 + p21 + p18 + p19 + p20 + p17 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32))
lola: processed formula length: 244
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((p3 + p4 + p5 + p6 + p7 + p8 <= p30 + p31 + p32)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((p3 + p4 + p5 + p6 + p7 + p8 <= p30 + p31 + p32)))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p30 + p31 + p32) AND ((p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2) OR (3 <= p0 + p1 + p2))) OR (1 <= p30 + p31 + p32))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((1 <= p30 + p31 + p32) AND ((p3 + p4 + p5 + p6 + p7 + p8 <= p0 + p1 + p2) OR (3 <= p0 + p1 + p2))) OR (1 <= p30 + p31 + p32)))
lola: processed formula length: 139
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: RESULT
lola:
SUMMARY: no no no no yes yes no no yes yes yes no yes yes yes yes
lola: ========================================
FORMULA GlobalResAllocation-COL-03-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-03-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494701584744
--------------------
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="GlobalResAllocation-COL-03"
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/GlobalResAllocation-COL-03.tgz
mv GlobalResAllocation-COL-03 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 GlobalResAllocation-COL-03, 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 r028-blw3-149440264300426"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;