About the Execution of LoLA for DES-PT-30b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2426.810 | 514692.00 | 1030715.00 | 112.70 | F?FFFTTTFFTFTFFF | 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 DES-PT-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309100295
=====================================================================
--------------------
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-30b-ReachabilityCardinality-0
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-1
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-15
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-2
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-3
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-4
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-5
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-6
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-7
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-8
FORMULA_NAME DES-PT-30b-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494629842743
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DES-PT-30b @ 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: 749/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 399 places, 350 transitions, 334 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 447 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30b-ReachabilityCardinality.task
lola: A (G (((p377 <= p356) OR (2 <= p38) OR ((p30 <= p398) AND (p52 <= p212)) OR (2 <= p74)))) : A (G (((p54 + 1 <= p255) OR (p257 <= p24) OR (p141 <= p227) OR (p361 <= p331) OR ((p47 <= p64) AND (1 <= p196))))) : A (G (((p52 <= p385) OR (2 <= p40) OR (p326 <= p342) OR ((p84 <= p248) AND (1 <= p177) AND ((p105 <= p10) OR (3 <= p51)))))) : A (G (((p181 <= 1) AND (p122 <= p335) AND (p175 <= 1)))) : A (G (((1 <= p290) OR (2 <= p108) OR (3 <= p387) OR (p138 <= p368) OR (p192 <= 1)))) : A (G (((p155 <= p113) OR (p312 <= p243)))) : E (F (((1 <= p53) OR ((p63 + 1 <= p158) AND (p369 <= 0))))) : A (G (((2 <= p178) OR (p232 <= p99) OR (3 <= p232) OR (((2 <= p238) OR (1 <= p252)) AND (p232 <= p199))))) : A (G ((p104 <= p44))) : A (G (((p340 <= p229) OR ((p250 <= p63) AND (p143 <= p40) AND ((1 <= p83) OR (p218 <= p223)))))) : A (G (((p125 <= 1) AND (p383 <= p379)))) : E (F ((2 <= p123))) : E (F (((p379 + 1 <= p217) AND (2 <= p316)))) : A (G ((p328 <= 1))) : E (F ((((2 <= p133) OR (p339 <= 2)) AND (1 <= p152)))) : E (F ((((3 <= p396) OR (3 <= p95) OR (p269 <= p249)) AND (1 <= p91))))
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 (((p377 <= p356) OR (2 <= p38) OR ((p30 <= p398) AND (p52 <= p212)) OR (2 <= p74))))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 571112 markings, 1323447 edges, 114222 markings/sec, 0 secs
lola: sara is running 5 secs || 1096782 markings, 2746495 edges, 105134 markings/sec, 5 secs
lola: sara is running 10 secs || 1651101 markings, 4061280 edges, 110864 markings/sec, 10 secs
lola: sara is running 15 secs || 2198811 markings, 5269978 edges, 109542 markings/sec, 15 secs
lola: sara is running 20 secs || 2763259 markings, 6648346 edges, 112890 markings/sec, 20 secs
lola: sara is running 25 secs || 3288302 markings, 8089581 edges, 105009 markings/sec, 25 secs
lola: sara is running 30 secs || 3916251 markings, 9392834 edges, 125590 markings/sec, 30 secs
lola: sara is running 35 secs || 4491924 markings, 10674206 edges, 115135 markings/sec, 35 secs
lola: sara is running 40 secs || 4996399 markings, 11831351 edges, 100895 markings/sec, 40 secs
lola: sara is running 45 secs || 5528048 markings, 13056826 edges, 106330 markings/sec, 45 secs
lola: sara is running 50 secs || 6079045 markings, 14486518 edges, 110199 markings/sec, 50 secs
lola: sara is running 55 secs || 6785362 markings, 15533030 edges, 141263 markings/sec, 55 secs
lola: sara is running 60 secs || 7550882 markings, 16339837 edges, 153104 markings/sec, 60 secs
lola: sara is running 65 secs || 8267702 markings, 17174434 edges, 143364 markings/sec, 65 secs
lola: sara is running 70 secs || 8878581 markings, 18352062 edges, 122176 markings/sec, 70 secs
lola: sara is running 75 secs || 9371997 markings, 19665312 edges, 98683 markings/sec, 75 secs
lola: sara is running 80 secs || 9945107 markings, 21033430 edges, 114622 markings/sec, 80 secs
lola: sara is running 85 secs || 10714858 markings, 21845890 edges, 153950 markings/sec, 85 secs
lola: sara is running 90 secs || 11466203 markings, 22637187 edges, 150269 markings/sec, 90 secs
lola: sara is running 95 secs || 12163238 markings, 23615384 edges, 139407 markings/sec, 95 secs
lola: sara is running 100 secs || 12698025 markings, 24873381 edges, 106957 markings/sec, 100 secs
lola: sara is running 105 secs || 13231231 markings, 26263668 edges, 106641 markings/sec, 105 secs
lola: sara is running 110 secs || 13902533 markings, 27372755 edges, 134260 markings/sec, 110 secs
lola: sara is running 115 secs || 14661187 markings, 28174195 edges, 151731 markings/sec, 115 secs
lola: sara is running 120 secs || 15392712 markings, 28954339 edges, 146305 markings/sec, 120 secs
lola: sara is running 125 secs || 16019155 markings, 30111484 edges, 125289 markings/sec, 125 secs
lola: sara is running 130 secs || 16513679 markings, 31418006 edges, 98905 markings/sec, 130 secs
lola: sara is running 135 secs || 17081840 markings, 32850745 edges, 113632 markings/sec, 135 secs
lola: sara is running 140 secs || 17840214 markings, 33693798 edges, 151675 markings/sec, 140 secs
lola: sara is running 145 secs || 18592992 markings, 34486806 edges, 150556 markings/sec, 145 secs
lola: sara is running 150 secs || 19290073 markings, 35429478 edges, 139416 markings/sec, 150 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p54 + 1 <= p255) OR (p257 <= p24) OR (p141 <= p227) OR (p361 <= p331) OR ((p47 <= p64) AND (1 <= p196)))))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 619494 markings, 1293967 edges, 123899 markings/sec, 0 secs
lola: sara is running 5 secs || 1139573 markings, 2590865 edges, 104016 markings/sec, 5 secs
lola: sara is running 10 secs || 1661743 markings, 3884023 edges, 104434 markings/sec, 10 secs
lola: sara is running 15 secs || 2185270 markings, 5176072 edges, 104705 markings/sec, 15 secs
lola: sara is running 20 secs || 2712525 markings, 6476687 edges, 105451 markings/sec, 20 secs
lola: sara is running 25 secs || 3231793 markings, 7699056 edges, 103854 markings/sec, 25 secs
lola: sara is running 30 secs || 3792005 markings, 8797442 edges, 112042 markings/sec, 30 secs
lola: sara is running 35 secs || 4374725 markings, 9869419 edges, 116544 markings/sec, 35 secs
lola: sara is running 40 secs || 4950545 markings, 10980030 edges, 115164 markings/sec, 40 secs
lola: sara is running 45 secs || 5525338 markings, 12039071 edges, 114959 markings/sec, 45 secs
lola: sara is running 50 secs || 6070195 markings, 13106327 edges, 108971 markings/sec, 50 secs
lola: sara is running 55 secs || 6634306 markings, 14206590 edges, 112822 markings/sec, 55 secs
lola: sara is running 60 secs || 7210966 markings, 15304266 edges, 115332 markings/sec, 60 secs
lola: sara is running 65 secs || 7787915 markings, 16354668 edges, 115390 markings/sec, 65 secs
lola: sara is running 70 secs || 8356193 markings, 17460424 edges, 113656 markings/sec, 70 secs
lola: sara is running 75 secs || 8936038 markings, 18563053 edges, 115969 markings/sec, 75 secs
lola: sara is running 80 secs || 9507272 markings, 19606164 edges, 114247 markings/sec, 80 secs
lola: sara is running 85 secs || 10093069 markings, 20783707 edges, 117159 markings/sec, 85 secs
lola: sara is running 90 secs || 10638601 markings, 21934202 edges, 109106 markings/sec, 90 secs
lola: sara is running 95 secs || 11162143 markings, 23136278 edges, 104708 markings/sec, 95 secs
lola: sara is running 100 secs || 11685194 markings, 24375305 edges, 104610 markings/sec, 100 secs
lola: sara is running 105 secs || 12119139 markings, 25625487 edges, 86789 markings/sec, 105 secs
lola: sara is running 110 secs || 12580893 markings, 26892473 edges, 92351 markings/sec, 110 secs
lola: sara is running 115 secs || 13002480 markings, 28111845 edges, 84317 markings/sec, 115 secs
lola: sara is running 120 secs || 13449258 markings, 29341666 edges, 89356 markings/sec, 120 secs
lola: sara is running 125 secs || 13964990 markings, 30570936 edges, 103146 markings/sec, 125 secs
lola: sara is running 130 secs || 14470376 markings, 31813525 edges, 101077 markings/sec, 130 secs
lola: sara is running 135 secs || 14943103 markings, 32956433 edges, 94545 markings/sec, 135 secs
lola: sara is running 140 secs || 15349457 markings, 34127505 edges, 81271 markings/sec, 140 secs
lola: sara is running 145 secs || 15816151 markings, 35213761 edges, 93339 markings/sec, 145 secs
lola: sara is running 150 secs || 16308467 markings, 36415950 edges, 98463 markings/sec, 150 secs
lola: sara is running 155 secs || 16810615 markings, 37633326 edges, 100430 markings/sec, 155 secs
lola: sara is running 160 secs || 17305134 markings, 38716499 edges, 98904 markings/sec, 160 secs
lola: sara is running 165 secs || 17759271 markings, 39821894 edges, 90827 markings/sec, 165 secs
lola: sara is running 170 secs || 18240286 markings, 40924575 edges, 96203 markings/sec, 170 secs
lola: sara is running 175 secs || 18747113 markings, 42072466 edges, 101365 markings/sec, 175 secs
lola: sara is running 180 secs || 19215065 markings, 43197114 edges, 93590 markings/sec, 180 secs
lola: sara is running 185 secs || 19685742 markings, 44291169 edges, 94135 markings/sec, 185 secs
lola: sara is running 190 secs || 20159510 markings, 45416004 edges, 94754 markings/sec, 190 secs
lola: sara is running 195 secs || 20621781 markings, 46491200 edges, 92454 markings/sec, 195 secs
lola: sara is running 200 secs || 21084972 markings, 47588327 edges, 92638 markings/sec, 200 secs
lola: sara is running 205 secs || 21569838 markings, 48620165 edges, 96973 markings/sec, 205 secs
lola: sara is running 210 secs || 22048598 markings, 49700403 edges, 95752 markings/sec, 210 secs
lola: sara is running 215 secs || 22516292 markings, 50803674 edges, 93539 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p52 <= p385) OR (2 <= p40) OR (p326 <= p342) OR ((p84 <= p248) AND (1 <= p177) AND ((p105 <= p10) OR (3 <= p51))))))
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 44 bytes per marking, with 18 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 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 593034 markings, 1300696 edges, 118607 markings/sec, 0 secs
lola: sara is running 5 secs || 1221327 markings, 2570027 edges, 125659 markings/sec, 5 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 241 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p181 <= 1) AND (p122 <= p335) AND (p175 <= 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 44 bytes per marking, with 18 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 438486 markings, 1250542 edges, 87697 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p290) OR (2 <= p108) OR (3 <= p387) OR (p138 <= p368) OR (p192 <= 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 44 bytes per marking, with 18 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-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 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p155 <= p113) OR (p312 <= p243))))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality-5.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 6 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p53) OR ((p63 + 1 <= p158) AND (p369 <= 0)))))
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 44 bytes per marking, with 18 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p178) OR (p232 <= p99) OR (3 <= p232) OR (((2 <= p238) OR (1 <= p252)) AND (p232 <= p199)))))
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 44 bytes per marking, with 18 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p104 <= p44)))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 536658 markings, 1337433 edges, 107332 markings/sec, 0 secs
lola: sara is running 5 secs || 1063223 markings, 2639362 edges, 105313 markings/sec, 5 secs
lola: sara is running 10 secs || 1600806 markings, 3967956 edges, 107517 markings/sec, 10 secs
lola: sara is running 15 secs || 2127377 markings, 5297208 edges, 105314 markings/sec, 15 secs
lola: sara is running 20 secs || 2658192 markings, 6605271 edges, 106163 markings/sec, 20 secs
lola: sara is running 25 secs || 3191417 markings, 7919473 edges, 106645 markings/sec, 25 secs
lola: sara is running 30 secs || 3706407 markings, 9208502 edges, 102998 markings/sec, 30 secs
lola: sara is running 35 secs || 4235869 markings, 10507196 edges, 105892 markings/sec, 35 secs
lola: sara is running 40 secs || 4761933 markings, 11818257 edges, 105213 markings/sec, 40 secs
lola: sara is running 45 secs || 5285015 markings, 13129416 edges, 104616 markings/sec, 45 secs
lola: sara is running 50 secs || 5821802 markings, 14450138 edges, 107357 markings/sec, 50 secs
lola: sara is running 55 secs || 6345784 markings, 15759811 edges, 104796 markings/sec, 55 secs
lola: sara is running 60 secs || 6873222 markings, 17057201 edges, 105488 markings/sec, 60 secs
lola: sara is running 65 secs || 7403360 markings, 18373442 edges, 106028 markings/sec, 65 secs
lola: sara is running 70 secs || 7927087 markings, 19694207 edges, 104745 markings/sec, 70 secs
lola: sara is running 75 secs || 8461754 markings, 21006431 edges, 106933 markings/sec, 75 secs
lola: sara is running 80 secs || 9001403 markings, 22339728 edges, 107930 markings/sec, 80 secs
lola: sara is running 85 secs || 9519544 markings, 23640038 edges, 103628 markings/sec, 85 secs
lola: sara is running 90 secs || 10053746 markings, 24950937 edges, 106840 markings/sec, 90 secs
lola: sara is running 95 secs || 10592004 markings, 26293779 edges, 107652 markings/sec, 95 secs
lola: sara is running 100 secs || 11120265 markings, 27623811 edges, 105652 markings/sec, 100 secs
lola: sara is running 105 secs || 11660156 markings, 28947141 edges, 107978 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p340 <= p229) OR ((p250 <= p63) AND (p143 <= p40) AND ((1 <= p83) OR (p218 <= p223))))))
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 44 bytes per marking, with 18 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p125 <= 1) AND (p383 <= p379))))
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 44 bytes per marking, with 18 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30b-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 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p123)))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-11.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 12 will run for 756 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p379 + 1 <= p217) AND (2 <= p316))))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-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 1008 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p328 <= 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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-13.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 14 will run for 1512 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p133) OR (p339 <= 2)) AND (1 <= p152))))
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 44 bytes per marking, with 18 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-30b-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3025 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p396) OR (3 <= p95) OR (p269 <= p249)) AND (1 <= p91))))
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 44 bytes per marking, with 18 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 DES-PT-30b-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no unknown no no yes no yes no no no no no no yes yes yes
lola: ========================================
FORMULA DES-PT-30b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494630357435
--------------------
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="DES-PT-30b"
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/DES-PT-30b.tgz
mv DES-PT-30b 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 DES-PT-30b, 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-149436309100295"
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 '
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 ;