About the Execution of LoLA for FlexibleBarrier-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 907.090 | 891634.00 | 1795319.00 | 330.10 | TFFFFTTTTF?TT?FF | 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-3254
Executing tool lola
Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034400160
=====================================================================
--------------------
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 FlexibleBarrier-PT-20b-ReachabilityCardinality-0
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-1
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-15
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-2
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-3
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-4
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-5
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-6
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-7
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-8
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496498205006
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
FlexibleBarrier-PT-20b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-20b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ FlexibleBarrier-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: 11565/65536 symbol table entries, 3169 collisions
lola: preprocessing...
lola: finding significant places
lola: 5372 places, 6193 transitions, 5350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6235 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-20b-ReachabilityCardinality.task
lola: E (F ((((p1564 + 1 <= p4447) OR (p4478 + 1 <= p2577)) AND ((p5031 + 1 <= p3408) OR (p36 + 1 <= p5008))))) : A (G ((p3167 <= 0))) : E (F (((p5271 + 1 <= p2007) AND (1 <= p4063) AND (p687 <= 2)))) : A (G ((p2519 <= p4134))) : E (F ((1 <= p4640))) : A (G (((p4039 <= 2) OR (1 <= p5099)))) : A (G (((p4468 <= 1) AND (p1877 <= 2) AND ((p2768 <= 1) OR (p3865 + 1 <= p2083))))) : E (F (((1 <= p1348) OR (p264 + 1 <= p4751)))) : A (G ((p2385 <= p4054))) : E (F ((3 <= p2899))) : E (F ((3 <= p4843))) : E (F (((p2064 <= 1) AND (p588 + 1 <= p2) AND (p4028 <= 1) AND (p4420 + 1 <= p3055)))) : E (F (((3 <= p5029) OR (2 <= p3779) OR (2 <= p3402) OR (2 <= p341) OR (3 <= p4606) OR ((3 <= p476) AND (p1876 <= p2547))))) : E (F (((p1126 <= p207) AND (1 <= p3087) AND (p2949 <= 2) AND (1 <= p443)))) : A (G ((p2295 <= 1))) : E (F (((p3246 + 1 <= p3351) AND (1 <= p382) AND ((3 <= p1408) OR (p453 <= p1916) OR (p5012 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1564 + 1 <= p4447) OR (p4478 + 1 <= p2577)) AND ((p5031 + 1 <= p3408) OR (p36 + 1 <= p5008)))))
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 672 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 33238 markings, 64344 edges, 6648 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 66124 markings, 128763 edges, 6577 markings/sec, 5 secs
lola: sara is running 10 secs || 98756 markings, 193653 edges, 6526 markings/sec, 10 secs
lola: sara is running 15 secs || 131240 markings, 258373 edges, 6497 markings/sec, 15 secs
lola: sara is running 20 secs || 164097 markings, 323779 edges, 6571 markings/sec, 20 secs
lola: sara is running 25 secs || 197018 markings, 389323 edges, 6584 markings/sec, 25 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3167 <= 0)))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5271 + 1 <= p2007) AND (1 <= p4063) AND (p687 <= 2))))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 31750 markings, 62763 edges, 6350 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 63660 markings, 125546 edges, 6382 markings/sec, 5 secs
lola: sara is running 10 secs || 95562 markings, 188822 edges, 6380 markings/sec, 10 secs
lola: sara is running 15 secs || 127566 markings, 252251 edges, 6401 markings/sec, 15 secs
lola: sara is running 20 secs || 155063 markings, 306001 edges, 5499 markings/sec, 20 secs
lola: sara is running 25 secs || 185029 markings, 364938 edges, 5993 markings/sec, 25 secs
lola: sara is running 30 secs || 216956 markings, 428251 edges, 6385 markings/sec, 30 secs
lola: sara is running 35 secs || 248994 markings, 491784 edges, 6408 markings/sec, 35 secs
lola: sara is running 40 secs || 274984 markings, 544040 edges, 5198 markings/sec, 40 secs
lola: sara is running 45 secs || 304786 markings, 602909 edges, 5960 markings/sec, 45 secs
lola: sara is running 50 secs || 336597 markings, 665922 edges, 6362 markings/sec, 50 secs
lola: sara is running 55 secs || 368094 markings, 728372 edges, 6299 markings/sec, 55 secs
lola: sara is running 60 secs || 395635 markings, 806596 edges, 5508 markings/sec, 60 secs
lola: sara is running 65 secs || 420106 markings, 900409 edges, 4894 markings/sec, 65 secs
lola: sara is running 70 secs || 445284 markings, 996649 edges, 5036 markings/sec, 70 secs
lola: sara is running 75 secs || 470538 markings, 1093191 edges, 5051 markings/sec, 75 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2519 <= p4134)))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 33783 markings, 65315 edges, 6757 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 67739 markings, 131915 edges, 6791 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 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p4640)))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 33750 markings, 64898 edges, 6750 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 66767 markings, 130473 edges, 6603 markings/sec, 5 secs
lola: sara is running 10 secs || 99388 markings, 195230 edges, 6524 markings/sec, 10 secs
lola: sara is running 15 secs || 131821 markings, 259677 edges, 6487 markings/sec, 15 secs
lola: sara is running 20 secs || 164552 markings, 324793 edges, 6546 markings/sec, 20 secs
lola: sara is running 25 secs || 197278 markings, 389845 edges, 6545 markings/sec, 25 secs
lola: sara is running 30 secs || 229890 markings, 454714 edges, 6522 markings/sec, 30 secs
lola: sara is running 35 secs || 262237 markings, 519496 edges, 6469 markings/sec, 35 secs
lola: sara is running 40 secs || 294975 markings, 584172 edges, 6548 markings/sec, 40 secs
lola: sara is running 45 secs || 328760 markings, 649299 edges, 6757 markings/sec, 45 secs
lola: sara is running 50 secs || 361432 markings, 714536 edges, 6534 markings/sec, 50 secs
lola: sara is running 55 secs || 389503 markings, 791960 edges, 5614 markings/sec, 55 secs
lola: sara is running 60 secs || 414665 markings, 887705 edges, 5032 markings/sec, 60 secs
lola: sara is running 65 secs || 440126 markings, 983996 edges, 5092 markings/sec, 65 secs
lola: sara is running 70 secs || 465662 markings, 1081197 edges, 5107 markings/sec, 70 secs
lola: sara is running 75 secs || 491205 markings, 1178432 edges, 5109 markings/sec, 75 secs
lola: sara is running 80 secs || 516464 markings, 1274168 edges, 5052 markings/sec, 80 secs
lola: sara is running 85 secs || 540434 markings, 1369891 edges, 4794 markings/sec, 85 secs
lola: sara is running 90 secs || 563755 markings, 1471175 edges, 4664 markings/sec, 90 secs
lola: sara is running 95 secs || 587261 markings, 1571963 edges, 4701 markings/sec, 95 secs
lola: sara is running 100 secs || 609876 markings, 1683416 edges, 4523 markings/sec, 100 secs
lola: sara is running 105 secs || 631716 markings, 1781909 edges, 4368 markings/sec, 105 secs
lola: sara is running 110 secs || 656225 markings, 1865597 edges, 4902 markings/sec, 110 secs
lola: sara is running 115 secs || 686549 markings, 1939190 edges, 6065 markings/sec, 115 secs
lola: sara is running 120 secs || 723791 markings, 2009018 edges, 7448 markings/sec, 120 secs
lola: sara is running 125 secs || 762622 markings, 2077996 edges, 7766 markings/sec, 125 secs
lola: sara is running 130 secs || 800942 markings, 2149153 edges, 7664 markings/sec, 130 secs
lola: sara is running 135 secs || 840262 markings, 2218743 edges, 7864 markings/sec, 135 secs
lola: sara is running 140 secs || 871973 markings, 2293601 edges, 6342 markings/sec, 140 secs
lola: sara is running 145 secs || 900172 markings, 2372345 edges, 5640 markings/sec, 145 secs
lola: sara is running 150 secs || 928097 markings, 2438761 edges, 5585 markings/sec, 150 secs
lola: sara is running 155 secs || 956266 markings, 2503493 edges, 5634 markings/sec, 155 secs
lola: sara is running 160 secs || 984365 markings, 2569009 edges, 5620 markings/sec, 160 secs
lola: sara is running 165 secs || 1006956 markings, 2620680 edges, 4518 markings/sec, 165 secs
lola: sara is running 170 secs || 1035314 markings, 2685818 edges, 5672 markings/sec, 170 secs
lola: sara is running 175 secs || 1063650 markings, 2751780 edges, 5667 markings/sec, 175 secs
lola: sara is running 180 secs || 1092093 markings, 2817108 edges, 5689 markings/sec, 180 secs
lola: sara is running 185 secs || 1114671 markings, 2869426 edges, 4516 markings/sec, 185 secs
lola: sara is running 190 secs || 1143172 markings, 2935136 edges, 5700 markings/sec, 190 secs
lola: sara is running 195 secs || 1170243 markings, 3007938 edges, 5414 markings/sec, 195 secs
lola: sara is running 200 secs || 1196949 markings, 3082566 edges, 5341 markings/sec, 200 secs
lola: sara is running 205 secs || 1223822 markings, 3157408 edges, 5375 markings/sec, 205 secs
lola: sara is running 210 secs || 1249693 markings, 3235406 edges, 5174 markings/sec, 210 secs
lola: sara is running 215 secs || 1275146 markings, 3320192 edges, 5091 markings/sec, 215 secs
lola: sara is running 220 secs || 1301880 markings, 3387520 edges, 5347 markings/sec, 220 secs
lola: sara is running 225 secs || 1337631 markings, 3456428 edges, 7150 markings/sec, 225 secs
lola: sara is running 230 secs || 1376433 markings, 3525293 edges, 7760 markings/sec, 230 secs
lola: sara is running 235 secs || 1414066 markings, 3595770 edges, 7527 markings/sec, 235 secs
lola: sara is running 240 secs || 1453140 markings, 3664934 edges, 7815 markings/sec, 240 secs
lola: sara is running 245 secs || 1490991 markings, 3735625 edges, 7570 markings/sec, 245 secs
lola: sara is running 250 secs || 1517682 markings, 3812931 edges, 5338 markings/sec, 250 secs
lola: sara is running 255 secs || 1545797 markings, 3886524 edges, 5623 markings/sec, 255 secs
lola: sara is running 260 secs || 1573600 markings, 3950395 edges, 5561 markings/sec, 260 secs
lola: sara is running 265 secs || 1595855 markings, 4001408 edges, 4451 markings/sec, 265 secs
lola: sara is running 270 secs || 1623709 markings, 4066010 edges, 5571 markings/sec, 270 secs
lola: sara is running 275 secs || 1651712 markings, 4130679 edges, 5601 markings/sec, 275 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4039 <= 2) OR (1 <= p5099))))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 29262 markings, 73664 edges, 5852 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 61497 markings, 148991 edges, 6447 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4468 <= 1) AND (p1877 <= 2) AND ((p2768 <= 1) OR (p3865 + 1 <= p2083)))))
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 672 bytes per marking, with 26 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 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 33924 markings, 65462 edges, 6785 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 67335 markings, 131264 edges, 6682 markings/sec, 5 secs
lola: sara is running 10 secs || 100327 markings, 196846 edges, 6598 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1348) OR (p264 + 1 <= p4751))))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 36283 markings, 67556 edges, 7257 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 75350 markings, 136750 edges, 7813 markings/sec, 5 secs
lola: sara is running 10 secs || 109231 markings, 199510 edges, 6776 markings/sec, 10 secs
lola: sara is running 15 secs || 148433 markings, 269338 edges, 7840 markings/sec, 15 secs
lola: sara is running 20 secs || 186387 markings, 339680 edges, 7591 markings/sec, 20 secs
lola: sara is running 25 secs || 215737 markings, 415696 edges, 5870 markings/sec, 25 secs
lola: sara is running 30 secs || 241986 markings, 481495 edges, 5250 markings/sec, 30 secs
lola: sara is running 35 secs || 268793 markings, 549611 edges, 5361 markings/sec, 35 secs
lola: sara is running 40 secs || 296145 markings, 614074 edges, 5470 markings/sec, 40 secs
lola: sara is running 45 secs || 323566 markings, 678709 edges, 5484 markings/sec, 45 secs
lola: sara is running 50 secs || 351047 markings, 743455 edges, 5496 markings/sec, 50 secs
lola: sara is running 55 secs || 378593 markings, 808390 edges, 5509 markings/sec, 55 secs
lola: sara is running 60 secs || 406120 markings, 873531 edges, 5505 markings/sec, 60 secs
lola: sara is running 65 secs || 433684 markings, 938711 edges, 5513 markings/sec, 65 secs
lola: sara is running 70 secs || 461252 markings, 1004226 edges, 5514 markings/sec, 70 secs
lola: sara is running 75 secs || 488747 markings, 1069120 edges, 5499 markings/sec, 75 secs
lola: sara is running 80 secs || 514793 markings, 1142727 edges, 5209 markings/sec, 80 secs
lola: sara is running 85 secs || 540978 markings, 1217845 edges, 5237 markings/sec, 85 secs
lola: sara is running 90 secs || 567238 markings, 1294722 edges, 5252 markings/sec, 90 secs
lola: sara is running 95 secs || 591998 markings, 1377876 edges, 4952 markings/sec, 95 secs
lola: sara is running 100 secs || 618193 markings, 1448819 edges, 5239 markings/sec, 100 secs
lola: sara is running 105 secs || 647275 markings, 1515132 edges, 5816 markings/sec, 105 secs
lola: sara is running 110 secs || 674035 markings, 1570999 edges, 5352 markings/sec, 110 secs
lola: sara is running 115 secs || 705243 markings, 1633191 edges, 6242 markings/sec, 115 secs
lola: sara is running 120 secs || 737004 markings, 1695727 edges, 6352 markings/sec, 120 secs
lola: sara is running 125 secs || 768975 markings, 1758442 edges, 6394 markings/sec, 125 secs
lola: sara is running 130 secs || 800229 markings, 1820934 edges, 6251 markings/sec, 130 secs
lola: sara is running 135 secs || 831548 markings, 1883655 edges, 6264 markings/sec, 135 secs
lola: sara is running 140 secs || 862807 markings, 1946297 edges, 6252 markings/sec, 140 secs
lola: sara is running 145 secs || 894088 markings, 2008958 edges, 6256 markings/sec, 145 secs
lola: sara is running 150 secs || 925609 markings, 2072158 edges, 6304 markings/sec, 150 secs
lola: sara is running 155 secs || 957307 markings, 2135751 edges, 6340 markings/sec, 155 secs
lola: sara is running 160 secs || 988662 markings, 2198850 edges, 6271 markings/sec, 160 secs
lola: sara is running 165 secs || 1017301 markings, 2273238 edges, 5728 markings/sec, 165 secs
lola: sara is running 170 secs || 1045905 markings, 2343068 edges, 5721 markings/sec, 170 secs
lola: sara is running 175 secs || 1069689 markings, 2433459 edges, 4757 markings/sec, 175 secs
lola: sara is running 180 secs || 1092537 markings, 2533449 edges, 4570 markings/sec, 180 secs
lola: sara is running 185 secs || 1115151 markings, 2632934 edges, 4523 markings/sec, 185 secs
lola: sara is running 190 secs || 1135296 markings, 2721012 edges, 4029 markings/sec, 190 secs
lola: sara is running 195 secs || 1158178 markings, 2819591 edges, 4576 markings/sec, 195 secs
lola: sara is running 200 secs || 1181307 markings, 2919749 edges, 4626 markings/sec, 200 secs
lola: sara is running 205 secs || 1204268 markings, 3021100 edges, 4592 markings/sec, 205 secs
lola: sara is running 210 secs || 1226479 markings, 3122926 edges, 4442 markings/sec, 210 secs
lola: sara is running 215 secs || 1247822 markings, 3238430 edges, 4269 markings/sec, 215 secs
lola: sara is running 220 secs || 1272235 markings, 3315883 edges, 4883 markings/sec, 220 secs
lola: sara is running 225 secs || 1301706 markings, 3379616 edges, 5894 markings/sec, 225 secs
lola: sara is running 230 secs || 1331676 markings, 3444800 edges, 5994 markings/sec, 230 secs
lola: sara is running 235 secs || 1369094 markings, 3520379 edges, 7484 markings/sec, 235 secs
lola: sara is running 240 secs || 1409384 markings, 3597557 edges, 8058 markings/sec, 240 secs
lola: sara is running 245 secs || 1449790 markings, 3674875 edges, 8081 markings/sec, 245 secs
lola: sara is running 250 secs || 1489248 markings, 3748872 edges, 7892 markings/sec, 250 secs
lola: sara is running 255 secs || 1516865 markings, 3811804 edges, 5523 markings/sec, 255 secs
lola: sara is running 260 secs || 1543861 markings, 3875191 edges, 5399 markings/sec, 260 secs
lola: sara is running 265 secs || 1570950 markings, 3938834 edges, 5418 markings/sec, 265 secs
lola: sara is running 270 secs || 1598010 markings, 4003653 edges, 5412 markings/sec, 270 secs
lola: sara is running 275 secs || 1625287 markings, 4067644 edges, 5455 markings/sec, 275 secs
lola: sara is running 280 secs || 1652659 markings, 4131905 edges, 5474 markings/sec, 280 secs
lola: sara is running 285 secs || 1679980 markings, 4197238 edges, 5464 markings/sec, 285 secs
lola: sara is running 290 secs || 1707547 markings, 4261915 edges, 5513 markings/sec, 290 secs
lola: sara is running 295 secs || 1735135 markings, 4327476 edges, 5518 markings/sec, 295 secs
lola: sara is running 300 secs || 1761572 markings, 4398569 edges, 5287 markings/sec, 300 secs
lola: sara is running 305 secs || 1787705 markings, 4472355 edges, 5227 markings/sec, 305 secs
lola: sara is running 310 secs || 1813925 markings, 4546814 edges, 5244 markings/sec, 310 secs
lola: sara is running 315 secs || 1839084 markings, 4623659 edges, 5032 markings/sec, 315 secs
lola: sara is running 320 secs || 1866567 markings, 4712985 edges, 5497 markings/sec, 320 secs
lola: sara is running 325 secs || 1894873 markings, 4782084 edges, 5661 markings/sec, 325 secs
lola: sara is running 330 secs || 1923306 markings, 4850248 edges, 5687 markings/sec, 330 secs
lola: sara is running 335 secs || 1961076 markings, 4922662 edges, 7554 markings/sec, 335 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2385 <= p4054)))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p2899)))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p4843)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-9.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 31736 markings, 62356 edges, 6347 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 63189 markings, 124510 edges, 6291 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2064 <= 1) AND (p588 + 1 <= p2) AND (p4028 <= 1) AND (p4420 + 1 <= p3055))))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 34187 markings, 65482 edges, 6837 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 66829 markings, 130593 edges, 6528 markings/sec, 5 secs
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 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p5029) OR (2 <= p3779) OR (2 <= p3402) OR (2 <= p341) OR (3 <= p4606) OR ((3 <= p476) AND (p1876 <= p2547)))))
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 672 bytes per marking, with 26 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 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 34029 markings, 65201 edges, 6806 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 67072 markings, 130942 edges, 6609 markings/sec, 5 secs
lola: sara is running 10 secs || 99797 markings, 196144 edges, 6545 markings/sec, 10 secs
lola: sara is running 15 secs || 132524 markings, 261253 edges, 6545 markings/sec, 15 secs
lola: sara is running 20 secs || 158043 markings, 312965 edges, 5104 markings/sec, 20 secs
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 900 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1126 <= p207) AND (1 <= p3087) AND (p2949 <= 2) AND (1 <= p443))))
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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 33590 markings, 65179 edges, 6718 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 67181 markings, 130659 edges, 6718 markings/sec, 5 secs
lola: sara is running 10 secs || 99509 markings, 194967 edges, 6466 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2295 <= 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 672 bytes per marking, with 26 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 FlexibleBarrier-PT-20b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 32328 markings, 63362 edges, 6466 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 65000 markings, 127105 edges, 6534 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2671 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3246 + 1 <= p3351) AND (1 <= p382) AND ((3 <= p1408) OR (p453 <= p1916) OR (p5012 <= 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 672 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 32652 markings, 63711 edges, 6530 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 65321 markings, 127456 edges, 6534 markings/sec, 5 secs
lola: sara is running 10 secs || 97743 markings, 191274 edges, 6484 markings/sec, 10 secs
lola: sara is running 15 secs || 130053 markings, 256076 edges, 6462 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no unknown yes yes unknown no no no no no yes yes yes
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496499096640
--------------------
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="FlexibleBarrier-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/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is FlexibleBarrier-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 r188-blw3-149581034400160"
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 ;