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-30b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700295
=====================================================================

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


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


checking for too many tokens
===========================================================================================
S_DES-PT-30b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DES-PT-30b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 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 || 560093 markings, 1295297 edges, 112019 markings/sec, 0 secs
lola: sara is running 5 secs || 1093567 markings, 2739985 edges, 106695 markings/sec, 5 secs
lola: sara is running 10 secs || 1660380 markings, 4082510 edges, 113363 markings/sec, 10 secs
lola: sara is running 15 secs || 2207800 markings, 5291202 edges, 109484 markings/sec, 15 secs
lola: sara is running 20 secs || 2770155 markings, 6669555 edges, 112471 markings/sec, 20 secs
lola: sara is running 25 secs || 3296588 markings, 8111317 edges, 105287 markings/sec, 25 secs
lola: sara is running 30 secs || 3929755 markings, 9413377 edges, 126633 markings/sec, 30 secs
lola: sara is running 35 secs || 4506174 markings, 10700814 edges, 115284 markings/sec, 35 secs
lola: sara is running 40 secs || 5008673 markings, 11863039 edges, 100500 markings/sec, 40 secs
lola: sara is running 45 secs || 5538649 markings, 13085923 edges, 105995 markings/sec, 45 secs
lola: sara is running 50 secs || 6089060 markings, 14513093 edges, 110082 markings/sec, 50 secs
lola: sara is running 55 secs || 6795309 markings, 15543365 edges, 141250 markings/sec, 55 secs
lola: sara is running 60 secs || 7560236 markings, 16349828 edges, 152985 markings/sec, 60 secs
lola: sara is running 65 secs || 8273996 markings, 17185363 edges, 142752 markings/sec, 65 secs
lola: sara is running 70 secs || 8883732 markings, 18363102 edges, 121947 markings/sec, 70 secs
lola: sara is running 75 secs || 9391545 markings, 19717420 edges, 101563 markings/sec, 75 secs
lola: sara is running 80 secs || 9975184 markings, 21064866 edges, 116728 markings/sec, 80 secs
lola: sara is running 85 secs || 10741275 markings, 21873933 edges, 153218 markings/sec, 85 secs
lola: sara is running 90 secs || 11494496 markings, 22667299 edges, 150644 markings/sec, 90 secs
lola: sara is running 95 secs || 12194890 markings, 23659811 edges, 140079 markings/sec, 95 secs
lola: sara is running 100 secs || 12719060 markings, 24930282 edges, 104834 markings/sec, 100 secs
lola: sara is running 105 secs || 13258736 markings, 26333047 edges, 107935 markings/sec, 105 secs
lola: sara is running 110 secs || 13938784 markings, 27411149 edges, 136010 markings/sec, 110 secs
lola: sara is running 115 secs || 14702075 markings, 28217474 edges, 152658 markings/sec, 115 secs
lola: sara is running 120 secs || 15419391 markings, 28995201 edges, 143463 markings/sec, 120 secs
lola: sara is running 125 secs || 16038924 markings, 30157272 edges, 123907 markings/sec, 125 secs
lola: sara is running 130 secs || 16537428 markings, 31475485 edges, 99701 markings/sec, 130 secs
lola: sara is running 135 secs || 17097457 markings, 32888784 edges, 112006 markings/sec, 135 secs
lola: sara is running 140 secs || 17860115 markings, 33714936 edges, 152532 markings/sec, 140 secs
lola: sara is running 145 secs || 18612569 markings, 34507521 edges, 150491 markings/sec, 145 secs
lola: sara is running 150 secs || 19305134 markings, 35455115 edges, 138513 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 || 627355 markings, 1311705 edges, 125471 markings/sec, 0 secs
lola: sara is running 5 secs || 1158973 markings, 2625660 edges, 106324 markings/sec, 5 secs
lola: sara is running 10 secs || 1677178 markings, 3918421 edges, 103641 markings/sec, 10 secs
lola: sara is running 15 secs || 2203170 markings, 5222468 edges, 105198 markings/sec, 15 secs
lola: sara is running 20 secs || 2733984 markings, 6531365 edges, 106163 markings/sec, 20 secs
lola: sara is running 25 secs || 3257510 markings, 7760745 edges, 104705 markings/sec, 25 secs
lola: sara is running 30 secs || 3822322 markings, 8860206 edges, 112962 markings/sec, 30 secs
lola: sara is running 35 secs || 4401383 markings, 9919442 edges, 115812 markings/sec, 35 secs
lola: sara is running 40 secs || 4976311 markings, 11028193 edges, 114986 markings/sec, 40 secs
lola: sara is running 45 secs || 5546734 markings, 12076622 edges, 114085 markings/sec, 45 secs
lola: sara is running 50 secs || 6090642 markings, 13148683 edges, 108782 markings/sec, 50 secs
lola: sara is running 55 secs || 6653584 markings, 14242348 edges, 112588 markings/sec, 55 secs
lola: sara is running 60 secs || 7230118 markings, 15338763 edges, 115307 markings/sec, 60 secs
lola: sara is running 65 secs || 7803566 markings, 16387177 edges, 114690 markings/sec, 65 secs
lola: sara is running 70 secs || 8369463 markings, 17485016 edges, 113179 markings/sec, 70 secs
lola: sara is running 75 secs || 8948882 markings, 18591347 edges, 115884 markings/sec, 75 secs
lola: sara is running 80 secs || 9518644 markings, 19629994 edges, 113952 markings/sec, 80 secs
lola: sara is running 85 secs || 10106260 markings, 20811452 edges, 117523 markings/sec, 85 secs
lola: sara is running 90 secs || 10659523 markings, 21975605 edges, 110653 markings/sec, 90 secs
lola: sara is running 95 secs || 11180742 markings, 23179897 edges, 104244 markings/sec, 95 secs
lola: sara is running 100 secs || 11700357 markings, 24412648 edges, 103923 markings/sec, 100 secs
lola: sara is running 105 secs || 12131365 markings, 25659373 edges, 86202 markings/sec, 105 secs
lola: sara is running 110 secs || 12592454 markings, 26927680 edges, 92218 markings/sec, 110 secs
lola: sara is running 115 secs || 13010467 markings, 28138686 edges, 83603 markings/sec, 115 secs
lola: sara is running 120 secs || 13458410 markings, 29366669 edges, 89589 markings/sec, 120 secs
lola: sara is running 125 secs || 13972465 markings, 30587144 edges, 102811 markings/sec, 125 secs
lola: sara is running 130 secs || 14475961 markings, 31828314 edges, 100699 markings/sec, 130 secs
lola: sara is running 135 secs || 14953451 markings, 32987375 edges, 95498 markings/sec, 135 secs
lola: sara is running 140 secs || 15359016 markings, 34152624 edges, 81113 markings/sec, 140 secs
lola: sara is running 145 secs || 15832249 markings, 35247694 edges, 94647 markings/sec, 145 secs
lola: sara is running 150 secs || 16321357 markings, 36449355 edges, 97822 markings/sec, 150 secs
lola: sara is running 155 secs || 16829434 markings, 37660761 edges, 101615 markings/sec, 155 secs
lola: sara is running 160 secs || 17311045 markings, 38730476 edges, 96322 markings/sec, 160 secs
lola: sara is running 165 secs || 17764671 markings, 39835172 edges, 90725 markings/sec, 165 secs
lola: sara is running 170 secs || 18245003 markings, 40935978 edges, 96066 markings/sec, 170 secs
lola: sara is running 175 secs || 18752064 markings, 42084559 edges, 101412 markings/sec, 175 secs
lola: sara is running 180 secs || 19212097 markings, 43190295 edges, 92007 markings/sec, 180 secs
lola: sara is running 185 secs || 19682146 markings, 44282873 edges, 94010 markings/sec, 185 secs
lola: sara is running 190 secs || 20157511 markings, 45411447 edges, 95073 markings/sec, 190 secs
lola: sara is running 195 secs || 20630643 markings, 46512633 edges, 94626 markings/sec, 195 secs
lola: sara is running 200 secs || 21091381 markings, 47605345 edges, 92148 markings/sec, 200 secs
lola: sara is running 205 secs || 21566739 markings, 48613114 edges, 95072 markings/sec, 205 secs
lola: sara is running 210 secs || 22042486 markings, 49686982 edges, 95149 markings/sec, 210 secs
lola: sara is running 215 secs || 22507742 markings, 50785197 edges, 93051 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 || 595406 markings, 1303812 edges, 119081 markings/sec, 0 secs
lola: sara is running 5 secs || 1215358 markings, 2556355 edges, 123990 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 || 432977 markings, 1232293 edges, 86595 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: 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 invariancelola:
========================================
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: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DES-PT-30b-ReachabilityCardinality-7.sara
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: lola: state equation: calling and running sara
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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
sara: try reading problem file DES-PT-30b-ReachabilityCardinality-7.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
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 530494 markings, 1323068 edges, 106099 markings/sec, 0 secs
lola: sara is running 5 secs || 1060424 markings, 2632726 edges, 105986 markings/sec, 5 secs
lola: sara is running 10 secs || 1601284 markings, 3968958 edges, 108172 markings/sec, 10 secs
lola: sara is running 15 secs || 2131820 markings, 5305550 edges, 106107 markings/sec, 15 secs
lola: sara is running 20 secs || 2662050 markings, 6616444 edges, 106046 markings/sec, 20 secs
lola: sara is running 25 secs || 3198470 markings, 7935970 edges, 107284 markings/sec, 25 secs
lola: sara is running 30 secs || 3718026 markings, 9239034 edges, 103911 markings/sec, 30 secs
lola: sara is running 35 secs || 4251419 markings, 10547411 edges, 106679 markings/sec, 35 secs
lola: sara is running 40 secs || 4781193 markings, 11866386 edges, 105955 markings/sec, 40 secs
lola: sara is running 45 secs || 5305970 markings, 13185591 edges, 104955 markings/sec, 45 secs
lola: sara is running 50 secs || 5846567 markings, 14511074 edges, 108119 markings/sec, 50 secs
lola: sara is running 55 secs || 6375111 markings, 15827206 edges, 105709 markings/sec, 55 secs
lola: sara is running 60 secs || 6901477 markings, 17128335 edges, 105273 markings/sec, 60 secs
lola: sara is running 65 secs || 7437376 markings, 18453937 edges, 107180 markings/sec, 65 secs
lola: sara is running 70 secs || 7967712 markings, 19783207 edges, 106067 markings/sec, 70 secs
lola: sara is running 75 secs || 8498519 markings, 21104746 edges, 106161 markings/sec, 75 secs
lola: sara is running 80 secs || 9039718 markings, 22436527 edges, 108240 markings/sec, 80 secs
lola: sara is running 85 secs || 9565492 markings, 23750854 edges, 105155 markings/sec, 85 secs
lola: sara is running 90 secs || 10096979 markings, 25061780 edges, 106297 markings/sec, 90 secs
lola: sara is running 95 secs || 10629780 markings, 26380251 edges, 106560 markings/sec, 95 secs
lola: sara is running 100 secs || 11155494 markings, 27704990 edges, 105143 markings/sec, 100 secs
lola: sara is running 105 secs || 11687888 markings, 29021534 edges, 106479 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.
sara: place or transition ordering is non-deterministic
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: 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-14.sara
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: ========================================lola:
RESULT
lola:
SUMMARY: no unknown no no yes no yes no no no no no no yes yes yes
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 1496454639571

--------------------
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-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/S_DES-PT-30b.tgz
mv S_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 S_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 r098-ebro-149488455700295"
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 ;