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 IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494618709679


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ IBM703-PT-none @ 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: 546/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 262 places, 284 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 261 transition conflict sets
lola: TASK
lola: reading formula from IBM703-PT-none-CTLCardinality.task
lola: NOT(E (G (A (X ((decision_s00000783_input_s00000263 <= decision_s00000793_input_s00000263)))))) : A (F ((E (F ((2 <= merge_s00000446_input_s00000290))) OR ((callToProcess_s00000348_output_s00000264 <= merge_s00000461_input_s00000263) AND (3 <= process_s00000030__s00000703_input_s00000263) AND (decision_s00000802_activated <= task_s00000758_output_s00000264))))) : (NOT(((task_s00000763_input_s00000263 <= task_s00000706_output_s00000264) AND E (F ((3 <= decision_s00000802_input_s00000263))))) AND (((3 <= merge_s00000319_activated) OR E (F ((1 <= decision_s00000804_activated)))) OR ((task_s00000729_input_s00000263 <= task_s00000724_inputCriterion_s00000257_used) AND E (F ((task_s00000738_input_s00000263 <= task_s00000741_output_s00000264)))))) : NOT(E (F ((2 <= task_s00000731_inputCriterion_s00000257_used)))) : ((task_s00000717_output_s00000264 <= task_s00000713_inputCriterion_s00000257_used) AND E (G (E (X ((merge_s00000319_activated <= fork_s00000465_activated_s00000272)))))) : (E (F (A (F ((3 <= task_s00000710_inputCriterion_s00000257_used))))) AND (NOT(A (G ((2 <= task_s00000754_input_s00000263)))) OR E (((3 <= decision_s00000783_input_s00000263) U (task_s00000725_input_s00000263 <= task_s00000741_output_s00000264))))) : A (F ((E (X ((1 <= task_s00000732_inputCriterion_s00000257_used))) OR ((3 <= task_s00000710_inputCriterion_s00000257_used) OR ((2 <= merge_s00000462_input_s00000285) AND (merge_s00000452_input_s00000285 <= task_s00000749_inputCriterion_s00000257_used)))))) : E (((2 <= task_s00000763_inputCriterion_s00000257_used) U A (F ((2 <= task_s00000756_input_s00000263))))) : A (F ((1 <= merge_s00000283_input_s00000263))) : A (X (E (((task_s00000722_output_s00000264 <= merge_s00000449_activated) U (3 <= merge_s00000453_activated))))) : (A ((((1 <= merge_s00000445_activated) AND (task_s00000713_output_s00000264 <= task_s00000750_inputCriterion_s00000257_used)) U ((decision_s00000793_activated <= task_s00000756_inputCriterion_s00000257_used) OR (task_s00000712_inputCriterion_s00000257_used <= decision_s00000784_input_s00000263)))) AND (E (F (((1 <= fork_s00000463_activated_s00000274) AND (3 <= task_s00000735_output_s00000264)))) AND ((merge_s00000451_input_s00000285 <= task_s00000716_inputCriterion_s00000257_used) OR (2 <= task_s00000726_output_s00000264) OR (2 <= decision_s00000793_input_s00000263) OR (task_s00000729_inputCriterion_s00000257_used <= decision_s00000801_activated) OR ((task_s00000757_input_s00000263 <= task_s00000717_output_s00000264) AND (decision_s00000773_activated <= task_s00000733_inputCriterion_s00000257_used) AND (task_s00000711_input_s00000263 + 1 <= decision_s00000792_activated))))) : NOT(E (G (((task_s00000714_output_s00000264 <= 1) OR (task_s00000717_inputCriterion_s00000257_used <= 2))))) : ((((task_s00000727_input_s00000263 + 1 <= decision_s00000804_activated) AND (task_s00000725_output_s00000264 + 1 <= task_s00000720_input_s00000263)) OR (1 <= task_s00000755_input_s00000263) OR ((task_s00000762_input_s00000263 <= 2) AND (merge_s00000806_activated <= 0) AND (task_s00000761_input_s00000263 <= task_s00000705_output_s00000264))) AND (NOT(A (G ((task_s00000761_input_s00000263 <= task_s00000758_inputCriterion_s00000257_used)))) AND A (F ((3 <= decision_s00000789_activated))))) : A ((E (F ((task_s00000710_output_s00000264 <= task_s00000742_output_s00000264))) U (3 <= task_s00000729_output_s00000264))) : ((task_s00000758_output_s00000264 <= task_s00000745_output_s00000264) AND E (F (E (X ((2 <= task_s00000718_output_s00000264)))))) : (A (F ((task_s00000741_output_s00000264 + 1 <= task_s00000753_input_s00000263))) OR A ((((task_s00000731_output_s00000264 <= merge_s00000453_input_s00000290) OR (2 <= task_s00000725_output_s00000264)) U (2 <= task_s00000735_inputCriterion_s00000257_used))))
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 (G (A (X ((decision_s00000783_input_s00000263 <= decision_s00000793_input_s00000263))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((decision_s00000793_input_s00000263 + 1 <= decision_s00000783_input_s00000263)))
lola: processed formula length: 92
lola: 7 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((2 <= merge_s00000446_input_s00000290))) OR ((callToProcess_s00000348_output_s00000264 <= merge_s00000461_input_s00000263) AND (3 <= process_s00000030__s00000703_input_s00000263) AND (decision_s00000802_activated <= task_s00000758_output_s00000264)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U (2 <= merge_s00000446_input_s00000290)) OR ((callToProcess_s00000348_output_s00000264 <= merge_s00000461_input_s00000263) AND (3 <= process_s00000030__s00000703_input_s00000263) AND (decision_s00000802_activated <= task_s00000758_output_s00000264))))
lola: processed formula length: 269
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: (NOT(((task_s00000763_input_s00000263 <= task_s00000706_output_s00000264) AND E (F ((3 <= decision_s00000802_input_s00000263))))) AND (((3 <= merge_s00000319_activated) OR E (F ((1 <= decision_s00000804_activated)))) OR ((task_s00000729_input_s00000263 <= task_s00000724_inputCriterion_s00000257_used) AND E (F ((task_s00000738_input_s00000263 <= task_s00000741_output_s00000264))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (task_s00000706_output_s00000264 + 1 <= task_s00000763_input_s00000263)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (task_s00000706_output_s00000264 + 1 <= task_s00000763_input_s00000263)
lola: processed formula length: 71
lola: 6 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 1 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 (G ((decision_s00000802_input_s00000263 <= 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 1044 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 IBM703-PT-none-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= merge_s00000319_activated)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= merge_s00000319_activated)
lola: processed formula length: 32
lola: 6 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 1 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= decision_s00000804_activated)))
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 1044 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 IBM703-PT-none-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= task_s00000731_inputCriterion_s00000257_used))))
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 1044 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 IBM703-PT-none-CTLCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((task_s00000717_output_s00000264 <= task_s00000713_inputCriterion_s00000257_used) AND E (G (E (X ((merge_s00000319_activated <= fork_s00000465_activated_s00000272))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (task_s00000717_output_s00000264 <= task_s00000713_inputCriterion_s00000257_used)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (task_s00000717_output_s00000264 <= task_s00000713_inputCriterion_s00000257_used)
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((merge_s00000319_activated <= fork_s00000465_activated_s00000272)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((merge_s00000319_activated <= fork_s00000465_activated_s00000272)))))
lola: processed formula length: 89
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (F ((3 <= task_s00000710_inputCriterion_s00000257_used))))) AND (NOT(A (G ((2 <= task_s00000754_input_s00000263)))) OR E (((3 <= decision_s00000783_input_s00000263) U (task_s00000725_input_s00000263 <= task_s00000741_output_s00000264)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((3 <= task_s00000710_inputCriterion_s00000257_used)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (3 <= task_s00000710_inputCriterion_s00000257_used)))
lola: processed formula length: 71
lola: 5 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((1 <= task_s00000732_inputCriterion_s00000257_used))) OR ((3 <= task_s00000710_inputCriterion_s00000257_used) OR ((2 <= merge_s00000462_input_s00000285) AND (merge_s00000452_input_s00000285 <= task_s00000749_inputCriterion_s00000257_used))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((1 <= task_s00000732_inputCriterion_s00000257_used)) OR ((3 <= task_s00000710_inputCriterion_s00000257_used) OR ((2 <= merge_s00000462_input_s00000285) AND (merge_s00000452_input_s00000285 <= task_s00000749_inputCriterion_s00000257_used)))))
lola: processed formula length: 255
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= task_s00000763_inputCriterion_s00000257_used) U A (F ((2 <= task_s00000756_input_s00000263)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= task_s00000763_inputCriterion_s00000257_used) U A(TRUE U (2 <= task_s00000756_input_s00000263)))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= merge_s00000283_input_s00000263)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= merge_s00000283_input_s00000263))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: A (X (E (((task_s00000722_output_s00000264 <= merge_s00000449_activated) U (3 <= merge_s00000453_activated)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((task_s00000722_output_s00000264 <= merge_s00000449_activated) U (3 <= merge_s00000453_activated)))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= merge_s00000445_activated) AND (task_s00000713_output_s00000264 <= task_s00000750_inputCriterion_s00000257_used)) U ((decision_s00000793_activated <= task_s00000756_inputCriterion_s00000257_used) OR (task_s00000712_inputCriterion_s00000257_used <= decision_s00000784_input_s00000263)))) AND (E (F (((1 <= fork_s00000463_activated_s00000274) AND (3 <= task_s00000735_output_s00000264)))) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= merge_s00000445_activated) AND (task_s00000713_output_s00000264 <= task_s00000750_inputCriterion_s00000257_used)) U ((decision_s00000793_activated <= task_s00000756_inputCriterion_s00000257_used) OR (task_s00000712_inputCriterion_s00000257_used <= decision_s00000784_input_s00000263))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= merge_s00000445_activated) AND (task_s00000713_output_s00000264 <= task_s00000750_inputCriterion_s00000257_used)) U ((decision_s00000793_activated <= task_s00000756_inputCriterion_s00000257_used) OR (task_s00000712_inputCriterion_s00000257_used <= decision_s00000784_input_s00000263)))
lola: processed formula length: 295
lola: 1 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= fork_s00000463_activated_s00000274) AND (3 <= task_s00000735_output_s00000264))))
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 1044 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 unreachable.
lola: state equation: write sara problem file to IBM703-PT-none-CTLCardinality-11.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((task_s00000714_output_s00000264 <= 1) OR (task_s00000717_inputCriterion_s00000257_used <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= task_s00000714_output_s00000264) AND (3 <= task_s00000717_inputCriterion_s00000257_used)))
lola: processed formula length: 106
lola: 4 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((task_s00000727_input_s00000263 + 1 <= decision_s00000804_activated) AND (task_s00000725_output_s00000264 + 1 <= task_s00000720_input_s00000263)) OR (1 <= task_s00000755_input_s00000263) OR ((task_s00000762_input_s00000263 <= 2) AND (merge_s00000806_activated <= 0) AND (task_s00000761_input_s00000263 <= task_s00000705_output_s00000264))) AND (NOT(A (G ((task_s00000761_input_s00000263 <= task_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((task_s00000727_input_s00000263 + 1 <= decision_s00000804_activated) AND (task_s00000725_output_s00000264 + 1 <= task_s00000720_input_s00000263)) OR (1 <= task_s00000755_input_s00000263) OR ((task_s00000762_input_s00000263 <= 2) AND (merge_s00000806_activated <= 0) AND (task_s00000761_input_s00000263 <= task_s00000705_output_s00000264)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((task_s00000727_input_s00000263 + 1 <= decision_s00000804_activated) AND (task_s00000725_output_s00000264 + 1 <= task_s00000720_input_s00000263)) OR (1 <= task_s00000755_input_s00000263) OR ((task_s00000762_input_s00000263 <= 2) AND (merge_s00000806_activated <= 0) AND (task_s00000761_input_s00000263 <= task_s00000705_output_s00000264)))
lola: processed formula length: 343
lola: 3 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 6 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 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((task_s00000758_inputCriterion_s00000257_used + 1 <= task_s00000761_input_s00000263)))
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 1044 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 IBM703-PT-none-CTLCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= decision_s00000789_activated)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= decision_s00000789_activated))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((task_s00000710_output_s00000264 <= task_s00000742_output_s00000264))) U (3 <= task_s00000729_output_s00000264)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (task_s00000710_output_s00000264 <= task_s00000742_output_s00000264)) U (3 <= task_s00000729_output_s00000264))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((task_s00000758_output_s00000264 <= task_s00000745_output_s00000264) AND E (F (E (X ((2 <= task_s00000718_output_s00000264))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (task_s00000758_output_s00000264 <= task_s00000745_output_s00000264)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (task_s00000758_output_s00000264 <= task_s00000745_output_s00000264)
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((2 <= task_s00000718_output_s00000264)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((2 <= task_s00000718_output_s00000264)))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((task_s00000741_output_s00000264 + 1 <= task_s00000753_input_s00000263))) OR A ((((task_s00000731_output_s00000264 <= merge_s00000453_input_s00000290) OR (2 <= task_s00000725_output_s00000264)) U (2 <= task_s00000735_inputCriterion_s00000257_used))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((task_s00000741_output_s00000264 + 1 <= task_s00000753_input_s00000263)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (task_s00000741_output_s00000264 + 1 <= task_s00000753_input_s00000263))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no no no no no no no no no no unknown
FORMULA IBM703-PT-none-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494618710017

--------------------
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="IBM703-PT-none"
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/IBM703-PT-none.tgz
mv IBM703-PT-none 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 IBM703-PT-none, 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 r038-blw7-149440484500075"
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 ;