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_ResAllocation-PT-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496439755592


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


checking for too many tokens
===========================================================================================
S_ResAllocation-PT-R003C010: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_ResAllocation-PT-R003C010 @ 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: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 60 places, 40 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C010-CTLCardinality.task
lola: NOT(E ((((1 <= r_5_2) OR (p_6_0 <= p_5_2)) U ((2 <= p_1_0) AND (1 <= r_1_0))))) : A (F (E (F (((p_7_1 <= r_7_0) AND (2 <= r_4_1)))))) : E ((((3 <= p_8_1) OR (1 <= r_7_0) OR (r_6_0 <= r_5_2) OR (r_6_1 <= p_2_2)) U ())) : A (F (A (G (((p_4_2 <= r_2_1) OR (p_6_2 <= p_6_0)))))) : A (G (((p_9_0 <= 0) OR ((p_4_0 <= p_6_2) AND (r_9_1 <= r_3_1)) OR (2 <= r_4_2) OR (1 <= p_1_0) OR (r_4_0 <= p_0_2)))) : E ((E (F ((r_9_0 <= r_8_1))) U A (G ((p_2_0 <= p_9_0))))) : NOT(NOT(E (F ((2 <= p_7_2))))) : A (G (E ((TRUE U (r_9_2 <= r_6_2))))) : E (F (A (X ((2 <= p_8_1))))) : (A (X (((3 <= r_2_0) OR (p_1_2 <= p_6_1) OR (p_9_1 <= r_7_1) OR (2 <= r_6_2)))) AND NOT((E (X ((p_8_1 <= r_6_1))) AND E (F ((2 <= r_7_2)))))) : E (X ((A (F ((3 <= p_5_1))) AND A (X ((p_8_0 <= p_2_0)))))) : E (F (A (((p_6_0 <= r_8_2) U (3 <= r_2_0))))) : A (G ((A (X ((1 <= r_6_2))) OR ((p_7_0 <= 1) AND (r_6_2 <= 1))))) : E ((((r_5_2 <= r_5_1) AND (2 <= p_0_2)) U E (F ((3 <= p_9_2))))) : E (F (A (G (((r_6_1 <= r_8_0) AND (3 <= p_4_0)))))) : A (G ((A (F ((r_7_0 <= p_0_0))) OR ((3 <= p_9_1) OR (1 <= p_1_1) OR (p_7_2 <= r_1_1) OR (2 <= r_6_1)))))
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(E ((((1 <= r_5_2) OR (p_6_0 <= p_5_2)) U ((2 <= p_1_0) AND (1 <= r_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((1 <= r_5_2) OR (p_6_0 <= p_5_2)) U ((2 <= p_1_0) AND (1 <= r_1_0))))
lola: processed formula length: 77
lola: 7 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((p_7_1 <= r_7_0) AND (2 <= r_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((p_7_1 <= r_7_0) AND (2 <= r_4_1))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p_8_1) OR (1 <= r_7_0) OR (r_6_0 <= r_5_2) OR (r_6_1 <= p_2_2)) U ()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: processed formula with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p_4_2 <= r_2_1) OR (p_6_2 <= p_6_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((r_2_1 + 1 <= p_4_2) AND (p_6_0 + 1 <= p_6_2)))))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 (((p_9_0 <= 0) OR ((p_4_0 <= p_6_2) AND (r_9_1 <= r_3_1)) OR (2 <= r_4_2) OR (1 <= p_1_0) OR (r_4_0 <= p_0_2))))
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 120 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 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((r_9_0 <= r_8_1))) U A (G ((p_2_0 <= p_9_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (r_9_0 <= r_8_1)) U NOT(E(TRUE U (p_9_0 + 1 <= p_2_0))))
lola: processed formula length: 67
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F ((2 <= p_7_2)))))
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 120 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 ResAllocation-PT-R003C010-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E ((TRUE U (r_9_2 <= r_6_2)))))
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 (r_9_2 <= r_6_2)))))
lola: processed formula length: 46
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((2 <= p_8_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((2 <= p_8_1)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((3 <= r_2_0) OR (p_1_2 <= p_6_1) OR (p_9_1 <= r_7_1) OR (2 <= r_6_2)))) AND NOT((E (X ((p_8_1 <= r_6_1))) AND E (F ((2 <= r_7_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= r_2_0) OR (p_1_2 <= p_6_1) OR (p_9_1 <= r_7_1) OR (2 <= r_6_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((3 <= r_2_0) OR (p_1_2 <= p_6_1) OR (p_9_1 <= r_7_1) OR (2 <= r_6_2)))
lola: processed formula length: 77
lola: 8 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((r_6_1 + 1 <= p_8_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((r_6_1 + 1 <= p_8_1))
lola: processed formula length: 24
lola: 8 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((r_7_2 <= 1)))
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 120 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 ResAllocation-PT-R003C010-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((3 <= p_5_1))) AND A (X ((p_8_0 <= p_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((A(TRUE U (3 <= p_5_1)) AND AX((p_8_0 <= p_2_0))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((p_6_0 <= r_8_2) U (3 <= r_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((p_6_0 <= r_8_2) U (3 <= r_2_0)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((1 <= r_6_2))) OR ((p_7_0 <= 1) AND (r_6_2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(AX((1 <= r_6_2))) AND ((2 <= p_7_0) OR (2 <= r_6_2)))))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: 820717 markings, 5768605 edges, 2044176833989050368 markings/sec, 0 secs
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 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((r_5_2 <= r_5_1) AND (2 <= p_0_2)) U E (F ((3 <= p_9_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((r_5_2 <= r_5_1) AND (2 <= p_0_2)) U E(TRUE U (3 <= p_9_2)))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 14 will run for 1762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((r_6_1 <= r_8_0) AND (3 <= p_4_0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((r_8_0 + 1 <= r_6_1) OR (p_4_0 <= 2)))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: subprocess 15 will run for 3523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================...considering subproblem: A (G ((A (F ((r_7_0 <= p_0_0))) OR ((3 <= p_9_1) OR (1 <= p_1_1) OR (p_7_2 <= r_1_1) OR (2 <= r_6_1)))))

lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (r_7_0 <= p_0_0))) AND ((p_9_1 <= 2) AND (p_1_1 <= 0) AND (r_1_1 + 1 <= p_7_2) AND (r_6_1 <= 1)))))
lola: processed formula length: 126
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: RESULT
lola:
SUMMARY: yes no no no no no no yes yes yes no no yes no no no
lola: ========================================
FORMULA ResAllocation-PT-R003C010-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496439772409

--------------------
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_ResAllocation-PT-R003C010"
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_ResAllocation-PT-R003C010.tgz
mv S_ResAllocation-PT-R003C010 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_ResAllocation-PT-R003C010, 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 r148-csrt-149443432800075"
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 ;