fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r018-ebro-149436308800025
Last Updated
June 27, 2017

About the Execution of LoLA for CloudDeployment-PT-5a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2086.580 407024.00 815746.00 95.20 FTFFFFFTTTTFTTTT normal

Execution Chart

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

Trace from the execution

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


--------------------
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 1494613723639


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
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: 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: 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: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 14 will run for 1768 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: ========================================
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 CloudDeployment-PT-5a-ReachabilityCardinality-14.sara
lola: ========================================
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: 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 || 38638 markings, 2645858 edges, 7728 markings/sec, 0 secs
lola: sara is running 5 secs || 82378 markings, 5070285 edges, 8748 markings/sec, 5 secs
lola: sara is running 10 secs || 126918 markings, 7239967 edges, 8908 markings/sec, 10 secs
lola: sara is running 15 secs || 168860 markings, 9625550 edges, 8388 markings/sec, 15 secs
lola: sara is running 20 secs || 207288 markings, 11941337 edges, 7686 markings/sec, 20 secs
lola: sara is running 25 secs || 231067 markings, 14516164 edges, 4756 markings/sec, 25 secs
lola: sara is running 30 secs || 260670 markings, 16660962 edges, 5921 markings/sec, 30 secs
lola: sara is running 35 secs || 279586 markings, 19055882 edges, 3783 markings/sec, 35 secs
lola: sara is running 40 secs || 304443 markings, 21279758 edges, 4971 markings/sec, 40 secs
lola: sara is running 45 secs || 327407 markings, 23493850 edges, 4593 markings/sec, 45 secs
lola: sara is running 50 secs || 351225 markings, 25631411 edges, 4764 markings/sec, 50 secs
lola: sara is running 55 secs || 381135 markings, 28117683 edges, 5982 markings/sec, 55 secs
lola: sara is running 60 secs || 407746 markings, 30733748 edges, 5322 markings/sec, 60 secs
lola: sara is running 65 secs || 435693 markings, 33236069 edges, 5589 markings/sec, 65 secs
lola: sara is running 70 secs || 467825 markings, 35594411 edges, 6426 markings/sec, 70 secs
lola: sara is running 75 secs || 496310 markings, 38168247 edges, 5697 markings/sec, 75 secs
lola: sara is running 80 secs || 526809 markings, 40483815 edges, 6100 markings/sec, 80 secs
lola: sara is running 85 secs || 550379 markings, 42917935 edges, 4714 markings/sec, 85 secs
lola: sara is running 90 secs || 584771 markings, 45370616 edges, 6878 markings/sec, 90 secs
lola: sara is running 95 secs || 615659 markings, 47767286 edges, 6178 markings/sec, 95 secs
lola: sara is running 100 secs || 643488 markings, 50278963 edges, 5566 markings/sec, 100 secs
lola: sara is running 105 secs || 683837 markings, 52550254 edges, 8070 markings/sec, 105 secs
lola: sara is running 110 secs || 716619 markings, 55128609 edges, 6556 markings/sec, 110 secs
lola: sara is running 115 secs || 754226 markings, 57372218 edges, 7521 markings/sec, 115 secs
lola: sara is running 120 secs || 791832 markings, 59585508 edges, 7521 markings/sec, 120 secs
lola: sara is running 125 secs || 822865 markings, 61833648 edges, 6207 markings/sec, 125 secs
lola: sara is running 130 secs || 846175 markings, 64373892 edges, 4662 markings/sec, 130 secs
lola: sara is running 135 secs || 869104 markings, 66844396 edges, 4586 markings/sec, 135 secs
lola: sara is running 140 secs || 900733 markings, 69167595 edges, 6326 markings/sec, 140 secs
lola: sara is running 145 secs || 928693 markings, 71354271 edges, 5592 markings/sec, 145 secs
lola: sara is running 150 secs || 961556 markings, 73653381 edges, 6573 markings/sec, 150 secs
lola: sara is running 155 secs || 1003629 markings, 75983727 edges, 8415 markings/sec, 155 secs
lola: sara is running 160 secs || 1046785 markings, 78302560 edges, 8631 markings/sec, 160 secs
lola: sara is running 165 secs || 1102108 markings, 80373343 edges, 11065 markings/sec, 165 secs
lola: sara is running 170 secs || 1128280 markings, 82693561 edges, 5234 markings/sec, 170 secs
lola: sara is running 175 secs || 1170532 markings, 84970464 edges, 8450 markings/sec, 175 secs
lola: sara is running 180 secs || 1191271 markings, 87233555 edges, 4148 markings/sec, 180 secs
lola: sara is running 185 secs || 1215527 markings, 89575712 edges, 4851 markings/sec, 185 secs
lola: sara is running 190 secs || 1247359 markings, 91751832 edges, 6366 markings/sec, 190 secs
lola: sara is running 195 secs || 1290977 markings, 93952859 edges, 8724 markings/sec, 195 secs
lola: sara is running 200 secs || 1334953 markings, 96166693 edges, 8795 markings/sec, 200 secs
lola: sara is running 205 secs || 1379468 markings, 98418560 edges, 8903 markings/sec, 205 secs
lola: sara is running 210 secs || 1410155 markings, 100757451 edges, 6137 markings/sec, 210 secs
lola: sara is running 215 secs || 1454406 markings, 102789330 edges, 8850 markings/sec, 215 secs
lola: sara is running 220 secs || 1474729 markings, 105025080 edges, 4065 markings/sec, 220 secs
lola: sara is running 225 secs || 1510274 markings, 107220451 edges, 7109 markings/sec, 225 secs
lola: sara is running 230 secs || 1544984 markings, 109606060 edges, 6942 markings/sec, 230 secs
lola: sara is running 235 secs || 1570283 markings, 112154075 edges, 5060 markings/sec, 235 secs
lola: sara is running 240 secs || 1596418 markings, 114540527 edges, 5227 markings/sec, 240 secs
lola: sara is running 245 secs || 1630311 markings, 116740283 edges, 6779 markings/sec, 245 secs
lola: sara is running 250 secs || 1659331 markings, 118924185 edges, 5804 markings/sec, 250 secs
lola: sara is running 255 secs || 1692548 markings, 120972820 edges, 6643 markings/sec, 255 secs
lola: sara is running 260 secs || 1725794 markings, 122964082 edges, 6649 markings/sec, 260 secs
lola: sara is running 265 secs || 1766164 markings, 124929327 edges, 8074 markings/sec, 265 secs
lola: sara is running 270 secs || 1822327 markings, 126913571 edges, 11233 markings/sec, 270 secs
lola: sara is running 275 secs || 1886091 markings, 128911504 edges, 12753 markings/sec, 275 secs
lola: sara is running 280 secs || 1920222 markings, 130919415 edges, 6826 markings/sec, 280 secs
lola: sara is running 285 secs || 1942278 markings, 133038838 edges, 4411 markings/sec, 285 secs
lola: sara is running 290 secs || 1961181 markings, 135151014 edges, 3781 markings/sec, 290 secs
lola: sara is running 295 secs || 1981596 markings, 137372065 edges, 4083 markings/sec, 295 secs
lola: sara is running 300 secs || 2001589 markings, 139548325 edges, 3999 markings/sec, 300 secs
lola: sara is running 305 secs || 2021904 markings, 141756918 edges, 4063 markings/sec, 305 secs
lola: sara is running 310 secs || 2042891 markings, 144047365 edges, 4197 markings/sec, 310 secs
lola: sara is running 315 secs || 2064160 markings, 146369113 edges, 4254 markings/sec, 315 secs
lola: sara is running 320 secs || 2083966 markings, 148523778 edges, 3961 markings/sec, 320 secs
lola: sara is running 325 secs || 2104199 markings, 150724343 edges, 4047 markings/sec, 325 secs
lola: sara is running 330 secs || 2134736 markings, 152978855 edges, 6107 markings/sec, 330 secs
lola: sara is running 335 secs || 2168616 markings, 155454883 edges, 6776 markings/sec, 335 secs
lola: sara is running 340 secs || 2204526 markings, 157737063 edges, 7182 markings/sec, 340 secs
lola: sara is running 345 secs || 2240866 markings, 159994331 edges, 7268 markings/sec, 345 secs
lola: sara is running 350 secs || 2275636 markings, 162178543 edges, 6954 markings/sec, 350 secs
lola: sara is running 355 secs || 2312903 markings, 164573143 edges, 7453 markings/sec, 355 secs
lola: sara is running 360 secs || 2385160 markings, 166832989 edges, 14451 markings/sec, 360 secs
lola: sara is running 365 secs || 2443245 markings, 169193324 edges, 11617 markings/sec, 365 secs
lola: sara is running 370 secs || 2506794 markings, 171473707 edges, 12710 markings/sec, 370 secs
lola: sara is running 375 secs || 2555191 markings, 173850426 edges, 9679 markings/sec, 375 secs
lola: sara is running 380 secs || 2581814 markings, 176326229 edges, 5325 markings/sec, 380 secs
lola: sara is running 385 secs || 2608588 markings, 178818841 edges, 5355 markings/sec, 385 secs
lola: sara is running 390 secs || 2643513 markings, 181068307 edges, 6985 markings/sec, 390 secs
lola: sara is running 395 secs || 2685576 markings, 183452048 edges, 8413 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 1494614130663

--------------------
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="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/CloudDeployment-PT-5a.tgz
mv 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 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 r018-ebro-149436308800025"
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 ;