Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_CloudDeployment-PT-5a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455400025
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496437920567


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


checking for too many tokens
===========================================================================================
S_CloudDeployment-PT-5a: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_CloudDeployment-PT-5a @ 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: 855/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 180 places, 675 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 594 transition conflict sets
lola: TASK
lola: reading formula from CloudDeployment-PT-5a-ReachabilityCardinality.task
lola: E (F ((2 <= p11))) : A (G (((p48 <= 2) OR ((3 <= p125) AND (1 <= p25)) OR (2 <= p142)))) : E (F ((1 <= p166))) : E (F (((p103 + 1 <= p105) AND (p33 + 1 <= p156) AND ((3 <= p60) OR (1 <= p91) OR ((p135 <= p160) AND (p54 <= p77)))))) : A (G ((((p115 <= p29) AND (2 <= p71)) OR (p59 <= 1)))) : E (F (((2 <= p68) AND (2 <= p10)))) : A (G ((((p46 + 1 <= p75) AND (p82 <= 2)) OR ((p70 <= 1) AND (p52 <= 1))))) : E (F ((p3 + 1 <= p158))) : E (F ((((p163 <= 2) OR (p38 <= 2)) AND ((3 <= p133) OR (2 <= p124) OR (1 <= p76))))) : A (G (((p129 + 1 <= p97) OR (p12 <= 1) OR (p126 <= p143)))) : A (G ((p46 <= p157))) : A (G (((p166 <= p46) OR (2 <= p66)))) : E (F ((2 <= p8))) : A (G (((p157 <= 0) OR (p48 + 1 <= p63) OR ((3 <= p116) AND (p79 <= p169) AND (p24 <= 2))))) : E (F (((3 <= p30) AND (p137 <= p89)))) : E (F ((((p145 <= p164) OR (p153 <= p57) OR (p71 <= 1)) AND (p137 + 1 <= p1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p48 <= 2) OR ((3 <= p125) AND (1 <= p25)) OR (2 <= p142))))
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 20 bytes per marking, with 10 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality.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: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p166)))
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 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================lola:
========================================
lola: ...considering subproblem: E (F (((p103 + 1 <= p105) AND (p33 + 1 <= p156) AND ((3 <= p60) OR (1 <= p91) OR ((p135 <= p160) AND (p54 <= p77))))))
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 20 bytes per marking, with 10 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p115 <= p29) AND (2 <= p71)) OR (p59 <= 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 20 bytes per marking, with 10 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-4.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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p68) AND (2 <= p10))))
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 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-5.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p46 + 1 <= p75) AND (p82 <= 2)) OR ((p70 <= 1) AND (p52 <= 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 20 bytes per marking, with 10 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 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-6.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: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p3 + 1 <= p158)))
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 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p163 <= 2) OR (p38 <= 2)) AND ((3 <= p133) OR (2 <= p124) OR (1 <= p76)))))
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 20 bytes per marking, with 10 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p129 + 1 <= p97) OR (p12 <= 1) OR (p126 <= p143))))
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 20 bytes per marking, with 10 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-9.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: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p46 <= p157)))
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 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p166 <= p46) OR (2 <= p66))))
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 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p8)))
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 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-12.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 13 will run for 1178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p157 <= 0) OR (p48 + 1 <= p63) OR ((3 <= p116) AND (p79 <= p169) AND (p24 <= 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 20 bytes per marking, with 10 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p30) AND (p137 <= p89))))
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 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: subprocess 15 will run for 3535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p145 <= p164) OR (p153 <= p57) OR (p71 <= 1)) AND (p137 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 37792 markings, 2614750 edges, 7558 markings/sec, 0 secs
lola: sara is running 5 secs || 82180 markings, 5054733 edges, 8878 markings/sec, 5 secs
lola: sara is running 10 secs || 126853 markings, 7231319 edges, 8935 markings/sec, 10 secs
lola: sara is running 15 secs || 168992 markings, 9629318 edges, 8428 markings/sec, 15 secs
lola: sara is running 20 secs || 207608 markings, 11949966 edges, 7723 markings/sec, 20 secs
lola: sara is running 25 secs || 231331 markings, 14529579 edges, 4745 markings/sec, 25 secs
lola: sara is running 30 secs || 261266 markings, 16705933 edges, 5987 markings/sec, 30 secs
lola: sara is running 35 secs || 279683 markings, 19114265 edges, 3683 markings/sec, 35 secs
lola: sara is running 40 secs || 304931 markings, 21331967 edges, 5050 markings/sec, 40 secs
lola: sara is running 45 secs || 328146 markings, 23514921 edges, 4643 markings/sec, 45 secs
lola: sara is running 50 secs || 351423 markings, 25666404 edges, 4655 markings/sec, 50 secs
lola: sara is running 55 secs || 381765 markings, 28166672 edges, 6068 markings/sec, 55 secs
lola: sara is running 60 secs || 408562 markings, 30774657 edges, 5359 markings/sec, 60 secs
lola: sara is running 65 secs || 435990 markings, 33305406 edges, 5486 markings/sec, 65 secs
lola: sara is running 70 secs || 468160 markings, 35669327 edges, 6434 markings/sec, 70 secs
lola: sara is running 75 secs || 496870 markings, 38222023 edges, 5742 markings/sec, 75 secs
lola: sara is running 80 secs || 527211 markings, 40547975 edges, 6068 markings/sec, 80 secs
lola: sara is running 85 secs || 551095 markings, 42992079 edges, 4777 markings/sec, 85 secs
lola: sara is running 90 secs || 585690 markings, 45420838 edges, 6919 markings/sec, 90 secs
lola: sara is running 95 secs || 615854 markings, 47861543 edges, 6033 markings/sec, 95 secs
lola: sara is running 100 secs || 644475 markings, 50347984 edges, 5724 markings/sec, 100 secs
lola: sara is running 105 secs || 685639 markings, 52596995 edges, 8233 markings/sec, 105 secs
lola: sara is running 110 secs || 717922 markings, 55178086 edges, 6457 markings/sec, 110 secs
lola: sara is running 115 secs || 755045 markings, 57423653 edges, 7425 markings/sec, 115 secs
lola: sara is running 120 secs || 792218 markings, 59658429 edges, 7435 markings/sec, 120 secs
lola: sara is running 125 secs || 823330 markings, 61884950 edges, 6222 markings/sec, 125 secs
lola: sara is running 130 secs || 846545 markings, 64410776 edges, 4643 markings/sec, 130 secs
lola: sara is running 135 secs || 869381 markings, 66885747 edges, 4567 markings/sec, 135 secs
lola: sara is running 140 secs || 901210 markings, 69204751 edges, 6366 markings/sec, 140 secs
lola: sara is running 145 secs || 929431 markings, 71393561 edges, 5644 markings/sec, 145 secs
lola: sara is running 150 secs || 962102 markings, 73718367 edges, 6534 markings/sec, 150 secs
lola: sara is running 155 secs || 1004152 markings, 76040701 edges, 8410 markings/sec, 155 secs
lola: sara is running 160 secs || 1048086 markings, 78367042 edges, 8787 markings/sec, 160 secs
lola: sara is running 165 secs || 1102563 markings, 80430028 edges, 10895 markings/sec, 165 secs
lola: sara is running 170 secs || 1130162 markings, 82751194 edges, 5520 markings/sec, 170 secs
lola: sara is running 175 secs || 1171090 markings, 85036354 edges, 8186 markings/sec, 175 secs
lola: sara is running 180 secs || 1192042 markings, 87287218 edges, 4190 markings/sec, 180 secs
lola: sara is running 185 secs || 1216646 markings, 89635468 edges, 4921 markings/sec, 185 secs
lola: sara is running 190 secs || 1248354 markings, 91815165 edges, 6342 markings/sec, 190 secs
lola: sara is running 195 secs || 1291967 markings, 94021947 edges, 8723 markings/sec, 195 secs
lola: sara is running 200 secs || 1335919 markings, 96250355 edges, 8790 markings/sec, 200 secs
lola: sara is running 205 secs || 1380246 markings, 98503476 edges, 8865 markings/sec, 205 secs
lola: sara is running 210 secs || 1412382 markings, 100832101 edges, 6427 markings/sec, 210 secs
lola: sara is running 215 secs || 1455049 markings, 102883413 edges, 8533 markings/sec, 215 secs
lola: sara is running 220 secs || 1475514 markings, 105108751 edges, 4093 markings/sec, 220 secs
lola: sara is running 225 secs || 1512420 markings, 107303260 edges, 7381 markings/sec, 225 secs
lola: sara is running 230 secs || 1545775 markings, 109715376 edges, 6671 markings/sec, 230 secs
lola: sara is running 235 secs || 1570984 markings, 112232951 edges, 5042 markings/sec, 235 secs
lola: sara is running 240 secs || 1597236 markings, 114626682 edges, 5250 markings/sec, 240 secs
lola: sara is running 245 secs || 1630971 markings, 116806039 edges, 6747 markings/sec, 245 secs
lola: sara is running 250 secs || 1660398 markings, 119003234 edges, 5885 markings/sec, 250 secs
lola: sara is running 255 secs || 1693440 markings, 121055472 edges, 6608 markings/sec, 255 secs
lola: sara is running 260 secs || 1728430 markings, 123028818 edges, 6998 markings/sec, 260 secs
lola: sara is running 265 secs || 1768412 markings, 124995069 edges, 7996 markings/sec, 265 secs
lola: sara is running 270 secs || 1823718 markings, 126978533 edges, 11061 markings/sec, 270 secs
lola: sara is running 275 secs || 1887381 markings, 128962805 edges, 12733 markings/sec, 275 secs
lola: sara is running 280 secs || 1920377 markings, 130936483 edges, 6599 markings/sec, 280 secs
lola: sara is running 285 secs || 1942360 markings, 133070179 edges, 4397 markings/sec, 285 secs
lola: sara is running 290 secs || 1961537 markings, 135189032 edges, 3835 markings/sec, 290 secs
lola: sara is running 295 secs || 1981845 markings, 137397141 edges, 4062 markings/sec, 295 secs
lola: sara is running 300 secs || 2001855 markings, 139576081 edges, 4002 markings/sec, 300 secs
lola: sara is running 305 secs || 2022091 markings, 141776975 edges, 4047 markings/sec, 305 secs
lola: sara is running 310 secs || 2043186 markings, 144075854 edges, 4219 markings/sec, 310 secs
lola: sara is running 315 secs || 2064486 markings, 146404615 edges, 4260 markings/sec, 315 secs
lola: sara is running 320 secs || 2084351 markings, 148566307 edges, 3973 markings/sec, 320 secs
lola: sara is running 325 secs || 2104513 markings, 150762801 edges, 4032 markings/sec, 325 secs
lola: sara is running 330 secs || 2135074 markings, 153022937 edges, 6112 markings/sec, 330 secs
lola: sara is running 335 secs || 2169249 markings, 155501586 edges, 6835 markings/sec, 335 secs
lola: sara is running 340 secs || 2205178 markings, 157784188 edges, 7186 markings/sec, 340 secs
lola: sara is running 345 secs || 2241310 markings, 160032053 edges, 7226 markings/sec, 345 secs
lola: sara is running 350 secs || 2275947 markings, 162209894 edges, 6927 markings/sec, 350 secs
lola: sara is running 355 secs || 2313325 markings, 164597497 edges, 7476 markings/sec, 355 secs
lola: sara is running 360 secs || 2385360 markings, 166841594 edges, 14407 markings/sec, 360 secs
lola: sara is running 365 secs || 2443189 markings, 169191746 edges, 11566 markings/sec, 365 secs
lola: sara is running 370 secs || 2506762 markings, 171470443 edges, 12715 markings/sec, 370 secs
lola: sara is running 375 secs || 2555115 markings, 173846353 edges, 9671 markings/sec, 375 secs
lola: sara is running 380 secs || 2581743 markings, 176318400 edges, 5326 markings/sec, 380 secs
lola: sara is running 385 secs || 2608404 markings, 178809319 edges, 5332 markings/sec, 385 secs
lola: sara is running 390 secs || 2643451 markings, 181061898 edges, 7009 markings/sec, 390 secs
lola: sara is running 395 secs || 2685387 markings, 183441403 edges, 8387 markings/sec, 395 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes yes yes no no no no no yes
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496438327729

--------------------
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_CloudDeployment-PT-5a"
export BK_EXAMINATION="ReachabilityCardinality"
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_CloudDeployment-PT-5a.tgz
mv S_CloudDeployment-PT-5a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_CloudDeployment-PT-5a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-ebro-149488455400025"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;