fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for S_DES-PT-20b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7856.280 773535.00 1548598.00 115.10 FTT?TTTFFFFFFTFT 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 S_DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700277
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496452688132


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


checking for too many tokens
===========================================================================================
S_DES-PT-20b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DES-PT-20b @ 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: 671/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 360 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 408 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20b-ReachabilityCardinality.task
lola: A (G ((((p305 <= 1) OR (2 <= p146)) AND (p166 <= p42)))) : E (F (((1 <= p169) OR ((p8 + 1 <= p282) AND (p260 + 1 <= p352))))) : A (G ((p175 <= p267))) : E (F (((p46 + 1 <= p282) AND ((3 <= p75) OR (1 <= p105)) AND (p201 <= p321) AND (2 <= p342) AND ((3 <= p188) OR (p171 <= p212))))) : E (F ((3 <= p165))) : E (F (((p168 <= 1) AND (2 <= p252)))) : E (F (((p159 <= p317) AND (2 <= p202) AND (p316 + 1 <= p182) AND ((3 <= p37) OR (3 <= p87))))) : E (F (((p237 + 1 <= p139) AND (p292 <= 0) AND (p253 <= 1) AND (p317 + 1 <= p48)))) : A (G ((p267 <= p295))) : E (F ((1 <= p230))) : A (G ((((p278 <= 1) OR (p263 <= 2)) AND ((p119 + 1 <= p274) OR (p96 <= 2))))) : A (G (((3 <= p90) OR (p259 <= p357) OR (p60 <= p77) OR (p244 <= p234) OR ((2 <= p233) AND (p121 <= p240))))) : E (F ((1 <= p197))) : E (F ((1 <= p16))) : E (F (((1 <= p234) AND (p350 <= p127)))) : E (F (((2 <= p6) AND (1 <= p242) AND (p333 <= p147))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p305 <= 1) OR (2 <= p146)) AND (p166 <= p42))))
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 40 bytes per marking, with 25 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p169) OR ((p8 + 1 <= p282) AND (p260 + 1 <= p352)))))
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 40 bytes per marking, with 25 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p175 <= p267)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-2.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p46 + 1 <= p282) AND ((3 <= p75) OR (1 <= p105)) AND (p201 <= p321) AND (2 <= p342) AND ((3 <= p188) OR (p171 <= p212)))))
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 40 bytes per marking, with 25 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-3.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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p165)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p168 <= 1) AND (2 <= p252))))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-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: E (F (((p159 <= p317) AND (2 <= p202) AND (p316 + 1 <= p182) AND ((3 <= p37) OR (3 <= p87)))))
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 40 bytes per marking, with 25 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p237 + 1 <= p139) AND (p292 <= 0) AND (p253 <= 1) AND (p317 + 1 <= p48))))
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 40 bytes per marking, with 25 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-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: A (G ((p267 <= p295)))
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 40 bytes per marking, with 25 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p230)))
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 40 bytes per marking, with 25 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: ========================================
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p278 <= 1) OR (p263 <= 2)) AND ((p119 + 1 <= p274) OR (p96 <= 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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-10.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: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p90) OR (p259 <= p357) OR (p60 <= p77) OR (p244 <= p234) OR ((2 <= p233) AND (p121 <= p240)))))
lola: ========================================
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 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 620925 markings, 1419926 edges, 124185 markings/sec, 0 secs
lola: sara is running 5 secs || 1247365 markings, 2819648 edges, 125288 markings/sec, 5 secs
lola: sara is running 10 secs || 1877175 markings, 4166400 edges, 125962 markings/sec, 10 secs
lola: sara is running 15 secs || 2517027 markings, 5444373 edges, 127970 markings/sec, 15 secs
lola: sara is running 20 secs || 3123319 markings, 6820968 edges, 121258 markings/sec, 20 secs
lola: sara is running 25 secs || 3841293 markings, 8052930 edges, 143595 markings/sec, 25 secs
lola: sara is running 30 secs || 4598041 markings, 9281140 edges, 151350 markings/sec, 30 secs
lola: sara is running 35 secs || 5241353 markings, 10499802 edges, 128662 markings/sec, 35 secs
lola: sara is running 40 secs || 6098633 markings, 11690261 edges, 171456 markings/sec, 40 secs
lola: sara is running 45 secs || 6996561 markings, 12837002 edges, 179586 markings/sec, 45 secs
lola: sara is running 50 secs || 7685620 markings, 14012673 edges, 137812 markings/sec, 50 secs
lola: sara is running 55 secs || 8330128 markings, 15176344 edges, 128902 markings/sec, 55 secs
lola: sara is running 60 secs || 9012848 markings, 16379476 edges, 136544 markings/sec, 60 secs
lola: sara is running 65 secs || 9677600 markings, 17573670 edges, 132950 markings/sec, 65 secs
lola: sara is running 70 secs || 10334794 markings, 18754173 edges, 131439 markings/sec, 70 secs
lola: sara is running 75 secs || 10993948 markings, 19912391 edges, 131831 markings/sec, 75 secs
lola: sara is running 80 secs || 11620565 markings, 21054704 edges, 125323 markings/sec, 80 secs
lola: sara is running 85 secs || 12258154 markings, 22176650 edges, 127518 markings/sec, 85 secs
lola: sara is running 90 secs || 12864121 markings, 23283243 edges, 121193 markings/sec, 90 secs
lola: sara is running 95 secs || 13482039 markings, 24371029 edges, 123584 markings/sec, 95 secs
lola: sara is running 100 secs || 14082211 markings, 25451499 edges, 120034 markings/sec, 100 secs
lola: sara is running 105 secs || 14683372 markings, 26508453 edges, 120232 markings/sec, 105 secs
lola: sara is running 110 secs || 15349635 markings, 27636051 edges, 133253 markings/sec, 110 secs
lola: sara is running 115 secs || 16000849 markings, 28727064 edges, 130243 markings/sec, 115 secs
lola: sara is running 120 secs || 16610394 markings, 29858726 edges, 121909 markings/sec, 120 secs
lola: sara is running 125 secs || 17266104 markings, 30961815 edges, 131142 markings/sec, 125 secs
lola: sara is running 130 secs || 17876639 markings, 32067286 edges, 122107 markings/sec, 130 secs
lola: sara is running 135 secs || 18488514 markings, 33330250 edges, 122375 markings/sec, 135 secs
lola: sara is running 140 secs || 19074312 markings, 34560163 edges, 117160 markings/sec, 140 secs
lola: sara is running 145 secs || 19609133 markings, 35812342 edges, 106964 markings/sec, 145 secs
lola: sara is running 150 secs || 20136695 markings, 37000285 edges, 105512 markings/sec, 150 secs
lola: sara is running 155 secs || 20686203 markings, 38276955 edges, 109902 markings/sec, 155 secs
lola: sara is running 160 secs || 21251528 markings, 39486907 edges, 113065 markings/sec, 160 secs
lola: sara is running 165 secs || 21805950 markings, 40668880 edges, 110884 markings/sec, 165 secs
lola: sara is running 170 secs || 22348883 markings, 41776805 edges, 108587 markings/sec, 170 secs
lola: sara is running 175 secs || 22907660 markings, 42806520 edges, 111755 markings/sec, 175 secs
lola: sara is running 180 secs || 23537468 markings, 43754960 edges, 125962 markings/sec, 180 secs
lola: sara is running 185 secs || 24162790 markings, 44722790 edges, 125064 markings/sec, 185 secs
lola: sara is running 190 secs || 24832352 markings, 45898636 edges, 133912 markings/sec, 190 secs
lola: sara is running 195 secs || 25398168 markings, 47162731 edges, 113163 markings/sec, 195 secs
lola: sara is running 200 secs || 25937450 markings, 48438069 edges, 107856 markings/sec, 200 secs
lola: sara is running 205 secs || 26459520 markings, 49646786 edges, 104414 markings/sec, 205 secs
lola: sara is running 210 secs || 26994023 markings, 50818840 edges, 106901 markings/sec, 210 secs
lola: sara is running 215 secs || 27590588 markings, 51958275 edges, 119313 markings/sec, 215 secs
lola: sara is running 220 secs || 28182206 markings, 53170485 edges, 118324 markings/sec, 220 secs
lola: sara is running 225 secs || 28777014 markings, 54363015 edges, 118962 markings/sec, 225 secs
lola: sara is running 230 secs || 29341428 markings, 55528720 edges, 112883 markings/sec, 230 secs
lola: sara is running 235 secs || 29948256 markings, 56632457 edges, 121366 markings/sec, 235 secs
lola: sara is running 240 secs || 30523122 markings, 57800985 edges, 114973 markings/sec, 240 secs
lola: sara is running 245 secs || 31511666 markings, 58994150 edges, 197709 markings/sec, 245 secs
lola: sara is running 250 secs || 32362387 markings, 60204493 edges, 170144 markings/sec, 250 secs
lola: sara is running 255 secs || 33212814 markings, 61409175 edges, 170085 markings/sec, 255 secs
lola: sara is running 260 secs || 33989765 markings, 62574444 edges, 155390 markings/sec, 260 secs
lola: sara is running 265 secs || 34643470 markings, 63620208 edges, 130741 markings/sec, 265 secs
lola: sara is running 270 secs || 35230403 markings, 64744283 edges, 117387 markings/sec, 270 secs
lola: sara is running 275 secs || 35928982 markings, 65918953 edges, 139716 markings/sec, 275 secs
lola: sara is running 280 secs || 36980436 markings, 67001940 edges, 210291 markings/sec, 280 secs
lola: sara is running 285 secs || 38030509 markings, 68075903 edges, 210015 markings/sec, 285 secs
lola: sara is running 290 secs || 39083691 markings, 69157417 edges, 210636 markings/sec, 290 secs
lola: sara is running 295 secs || 40112412 markings, 70210858 edges, 205744 markings/sec, 295 secs
lola: sara is running 300 secs || 41041601 markings, 71343025 edges, 185838 markings/sec, 300 secs
lola: sara is running 305 secs || 41729077 markings, 72443715 edges, 137495 markings/sec, 305 secs
lola: sara is running 310 secs || 42498455 markings, 73563968 edges, 153876 markings/sec, 310 secs
lola: sara is running 315 secs || 43287256 markings, 74701883 edges, 157760 markings/sec, 315 secs
lola: sara is running 320 secs || 44141276 markings, 75904305 edges, 170804 markings/sec, 320 secs
lola: sara is running 325 secs || 44865683 markings, 76998440 edges, 144881 markings/sec, 325 secs
lola: sara is running 330 secs || 45529766 markings, 78119997 edges, 132817 markings/sec, 330 secs
lola: sara is running 335 secs || 46186515 markings, 79138194 edges, 131350 markings/sec, 335 secs
lola: sara is running 340 secs || 46794653 markings, 80288455 edges, 121628 markings/sec, 340 secs
lola: sara is running 345 secs || 47440701 markings, 81378200 edges, 129210 markings/sec, 345 secs
lola: sara is running 350 secs || 48073743 markings, 82552661 edges, 126608 markings/sec, 350 secs
lola: sara is running 355 secs || 48730689 markings, 83620629 edges, 131389 markings/sec, 355 secs
lola: sara is running 360 secs || 49323701 markings, 84697392 edges, 118602 markings/sec, 360 secs
lola: sara is running 365 secs || 49911097 markings, 85814742 edges, 117479 markings/sec, 365 secs
lola: sara is running 370 secs || 50459447 markings, 86889970 edges, 109670 markings/sec, 370 secs
lola: sara is running 375 secs || 50973468 markings, 88129990 edges, 102804 markings/sec, 375 secs
lola: sara is running 380 secs || 51451744 markings, 89295314 edges, 95655 markings/sec, 380 secs
lola: sara is running 385 secs || 52123944 markings, 90387753 edges, 134440 markings/sec, 385 secs
lola: sara is running 390 secs || 52719681 markings, 91471323 edges, 119147 markings/sec, 390 secs
lola: sara is running 395 secs || 53295930 markings, 92583640 edges, 115250 markings/sec, 395 secs
lola: sara is running 400 secs || 53841485 markings, 93654549 edges, 109111 markings/sec, 400 secs
lola: sara is running 405 secs || 54357490 markings, 94877125 edges, 103201 markings/sec, 405 secs
lola: sara is running 410 secs || 54820394 markings, 96022225 edges, 92581 markings/sec, 410 secs
lola: sara is running 415 secs || 55484620 markings, 97104439 edges, 132845 markings/sec, 415 secs
lola: sara is running 420 secs || 56055709 markings, 98142990 edges, 114218 markings/sec, 420 secs
lola: sara is running 425 secs || 56627699 markings, 99207943 edges, 114398 markings/sec, 425 secs
lola: sara is running 430 secs || 57144876 markings, 100257155 edges, 103435 markings/sec, 430 secs
lola: sara is running 435 secs || 57642606 markings, 101406229 edges, 99546 markings/sec, 435 secs
lola: sara is running 440 secs || 58060407 markings, 102508058 edges, 83560 markings/sec, 440 secs
lola: sara is running 445 secs || 58685810 markings, 103547246 edges, 125081 markings/sec, 445 secs
lola: sara is running 450 secs || 59258581 markings, 104598319 edges, 114554 markings/sec, 450 secs
lola: sara is running 455 secs || 59841497 markings, 105589748 edges, 116583 markings/sec, 455 secs
lola: sara is running 460 secs || 60347712 markings, 106674077 edges, 101243 markings/sec, 460 secs
lola: sara is running 465 secs || 60847834 markings, 107810206 edges, 100024 markings/sec, 465 secs
lola: sara is running 470 secs || 61320411 markings, 108906011 edges, 94515 markings/sec, 470 secs
lola: sara is running 475 secs || 61884275 markings, 109921261 edges, 112773 markings/sec, 475 secs
lola: sara is running 480 secs || 62422449 markings, 110981462 edges, 107635 markings/sec, 480 secs
lola: sara is running 485 secs || 62909911 markings, 112023905 edges, 97492 markings/sec, 485 secs
lola: sara is running 490 secs || 63527630 markings, 113051812 edges, 123544 markings/sec, 490 secs
lola: sara is running 495 secs || 64053401 markings, 114136302 edges, 105154 markings/sec, 495 secs
lola: sara is running 500 secs || 64542647 markings, 115237592 edges, 97849 markings/sec, 500 secs
lola: sara is running 505 secs || 65078135 markings, 116263058 edges, 107098 markings/sec, 505 secs
lola: sara is running 510 secs || 65763830 markings, 117340258 edges, 137139 markings/sec, 510 secs
lola: sara is running 515 secs || 66419807 markings, 118309850 edges, 131195 markings/sec, 515 secs
lola: sara is running 520 secs || 67079353 markings, 119198764 edges, 131909 markings/sec, 520 secs
lola: sara is running 525 secs || 67559478 markings, 120295602 edges, 96025 markings/sec, 525 secs
lola: sara is running 530 secs || 68090711 markings, 121320622 edges, 106247 markings/sec, 530 secs
lola: sara is running 535 secs || 68672005 markings, 122364870 edges, 116259 markings/sec, 535 secs
lola: sara is running 540 secs || 69191344 markings, 123542710 edges, 103868 markings/sec, 540 secs
lola: sara is running 545 secs || 69965862 markings, 124672371 edges, 154904 markings/sec, 545 secs
lola: sara is running 550 secs || 70518826 markings, 125767226 edges, 110593 markings/sec, 550 secs
lola: sara is running 555 secs || 71080691 markings, 126885716 edges, 112373 markings/sec, 555 secs
lola: sara is running 560 secs || 71648359 markings, 128011871 edges, 113534 markings/sec, 560 secs
lola: sara is running 565 secs || 72226103 markings, 129170258 edges, 115549 markings/sec, 565 secs
lola: sara is running 570 secs || 72816850 markings, 130331304 edges, 118149 markings/sec, 570 secs
lola: sara is running 575 secs || 73336932 markings, 131454066 edges, 104016 markings/sec, 575 secs
lola: sara is running 580 secs || 73919818 markings, 132529420 edges, 116577 markings/sec, 580 secs
lola: sara is running 585 secs || 74554398 markings, 133646014 edges, 126916 markings/sec, 585 secs
lola: sara is running 590 secs || 75196459 markings, 134677268 edges, 128412 markings/sec, 590 secs
lola: sara is running 595 secs || 75830875 markings, 135786766 edges, 126883 markings/sec, 595 secs
lola: sara is running 600 secs || 76543785 markings, 136850283 edges, 142582 markings/sec, 600 secs
lola: sara is running 605 secs || 77112677 markings, 137988349 edges, 113778 markings/sec, 605 secs
lola: sara is running 610 secs || 77858896 markings, 139166013 edges, 149244 markings/sec, 610 secs
lola: sara is running 615 secs || 78958557 markings, 140270654 edges, 219932 markings/sec, 615 secs
lola: sara is running 620 secs || 79860718 markings, 141422839 edges, 180432 markings/sec, 620 secs
lola: sara is running 625 secs || 80684030 markings, 142598987 edges, 164662 markings/sec, 625 secs
lola: sara is running 630 secs || 81519695 markings, 143789261 edges, 167133 markings/sec, 630 secs
lola: sara is running 635 secs || 82269400 markings, 144946255 edges, 149941 markings/sec, 635 secs
lola: sara is running 640 secs || 82891213 markings, 145999252 edges, 124363 markings/sec, 640 secs
lola: sara is running 645 secs || 83502249 markings, 147065710 edges, 122207 markings/sec, 645 secs
lola: sara is running 650 secs || 84103154 markings, 148099784 edges, 120181 markings/sec, 650 secs
lola: sara is running 655 secs || 84842396 markings, 149203306 edges, 147848 markings/sec, 655 secs
lola: sara is running 660 secs || 85320335 markings, 150353495 edges, 95588 markings/sec, 660 secs
lola: sara is running 665 secs || 86104477 markings, 151497627 edges, 156828 markings/sec, 665 secs
lola: sara is running 670 secs || 86915999 markings, 152627032 edges, 162304 markings/sec, 670 secs
lola: sara is running 675 secs || 87722891 markings, 153749922 edges, 161378 markings/sec, 675 secs
lola: sara is running 680 secs || 88420652 markings, 154812894 edges, 139552 markings/sec, 680 secs
lola: sara is running 685 secs || 88987060 markings, 155947510 edges, 113282 markings/sec, 685 secs
lola: sara is running 690 secs || 89584667 markings, 157103160 edges, 119521 markings/sec, 690 secs
lola: sara is running 695 secs || 90445170 markings, 158192318 edges, 172101 markings/sec, 695 secs
lola: sara is running 700 secs || 91495063 markings, 159250996 edges, 209979 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p197)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 943 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p16)))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 639905 markings, 1327694 edges, 127981 markings/sec, 0 secs
lola: sara is running 5 secs || 1184239 markings, 2680414 edges, 108867 markings/sec, 5 secs
lola: sara is running 10 secs || 1756791 markings, 3982017 edges, 114510 markings/sec, 10 secs
lola: sara is running 15 secs || 2321306 markings, 5263926 edges, 112903 markings/sec, 15 secs
lola: sara is running 20 secs || 2870754 markings, 6507315 edges, 109890 markings/sec, 20 secs
lola: sara is running 25 secs || 3401626 markings, 7746831 edges, 106174 markings/sec, 25 secs
lola: sara is running 30 secs || 3931788 markings, 9021785 edges, 106032 markings/sec, 30 secs
lola: sara is running 35 secs || 4475405 markings, 10254954 edges, 108723 markings/sec, 35 secs
lola: sara is running 40 secs || 5009989 markings, 11461507 edges, 106917 markings/sec, 40 secs
lola: sara is running 45 secs || 5519898 markings, 12645820 edges, 101982 markings/sec, 45 secs
lola: sara is running 50 secs || 6029062 markings, 13872541 edges, 101833 markings/sec, 50 secs
lola: sara is running 55 secs || 6555375 markings, 15059629 edges, 105263 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p234) AND (p350 <= p127))))
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 40 bytes per marking, with 25 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p6) AND (1 <= p242) AND (p333 <= p147))))
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 40 bytes per marking, with 25 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 DES-PT-20b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no yes no no no no no yes no yes yes unknown yes yes yes no
FORMULA DES-PT-20b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496453461667

--------------------
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_DES-PT-20b"
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_DES-PT-20b.tgz
mv S_DES-PT-20b 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_DES-PT-20b, 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-149488455700277"
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 ;