About the Execution of LoLA for SmallOperatingSystem-PT-MT8192DC4096
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15950.360 | 818838.00 | 826939.00 | 217.00 | ?FFTFT?FTTTTFTTF | 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 SmallOperatingSystem-PT-MT8192DC4096, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008200061
=====================================================================
--------------------
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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494929483475
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ SmallOperatingSystem-PT-MT8192DC4096 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.task
lola: E (F (((LoadingMem <= DiskControllerUnit) AND (CPUUnit <= 1)))) : E (F ((CPUUnit + 1 <= TaskSuspended))) : E (F (((TaskOnDisk <= TransferToDisk)))) : E (F ((FreeMemSegment <= ExecutingTask))) : E (F (((TaskSuspended <= TaskReady) AND ((FreeMemSegment <= 1) OR (FreeMemSegment + 1 <= TaskReady))))) : A (G (((ExecutingTask <= TaskOnDisk) OR ((1 <= TaskOnDisk) AND (2 <= DiskControllerUnit) AND ((3 <= FreeMemSegment) OR (ExecutingTask <= FreeMemSegment)))))) : E (F (((CPUUnit <= DiskControllerUnit) AND (ExecutingTask <= LoadingMem) AND (TransferToDisk + 1 <= FreeMemSegment) AND (TaskSuspended + 1 <= LoadingMem) AND (1 <= LoadingMem)))) : A (G (TRUE)) : E (F (((CPUUnit <= 1) AND (LoadingMem + 1 <= TaskReady) AND (LoadingMem <= DiskControllerUnit)))) : A (G ((((3 <= DiskControllerUnit) AND (DiskControllerUnit <= 0)) OR (2 <= FreeMemSegment)))) : E (F (())) : A (G ((1 <= TaskOnDisk))) : E (F (((CPUUnit + 1 <= FreeMemSegment) OR (TaskOnDisk <= 2)))) : A (G ((((DiskControllerUnit <= FreeMemSegment)) OR (ExecutingTask <= TaskOnDisk) OR (3 <= FreeMemSegment)))) : A (G (((1 <= CPUUnit) AND ((LoadingMem <= TransferToDisk) OR (1 <= TaskOnDisk))))) : E (F ((((2 <= ExecutingTask) OR (1 <= CPUUnit)) AND ())))
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 (((LoadingMem <= DiskControllerUnit) AND (CPUUnit <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2689689 markings, 4034531 edges, 537938 markings/sec, 0 secs
lola: sara is running 5 secs || 4974498 markings, 7461745 edges, 456962 markings/sec, 5 secs
lola: sara is running 10 secs || 7019566 markings, 10529347 edges, 409014 markings/sec, 10 secs
lola: sara is running 15 secs || 8918008 markings, 13377011 edges, 379688 markings/sec, 15 secs
lola: sara is running 20 secs || 10851365 markings, 16277045 edges, 386671 markings/sec, 20 secs
lola: sara is running 25 secs || 12755741 markings, 19133609 edges, 380875 markings/sec, 25 secs
lola: sara is running 30 secs || 14585278 markings, 21877915 edges, 365907 markings/sec, 30 secs
lola: sara is running 35 secs || 16444258 markings, 24666385 edges, 371796 markings/sec, 35 secs
lola: sara is running 40 secs || 18340476 markings, 27510713 edges, 379244 markings/sec, 40 secs
lola: sara is running 45 secs || 20234783 markings, 30352171 edges, 378861 markings/sec, 45 secs
lola: sara is running 50 secs || 22124730 markings, 33187092 edges, 377989 markings/sec, 50 secs
lola: sara is running 55 secs || 23916817 markings, 35875223 edges, 358417 markings/sec, 55 secs
lola: sara is running 60 secs || 25691299 markings, 38536946 edges, 354896 markings/sec, 60 secs
lola: sara is running 65 secs || 27496878 markings, 41245314 edges, 361116 markings/sec, 65 secs
lola: sara is running 70 secs || 29325110 markings, 43987663 edges, 365646 markings/sec, 70 secs
lola: sara is running 75 secs || 31184168 markings, 46776250 edges, 371812 markings/sec, 75 secs
lola: sara is running 80 secs || 32991455 markings, 49487180 edges, 361457 markings/sec, 80 secs
lola: sara is running 85 secs || 34679256 markings, 52018881 edges, 337560 markings/sec, 85 secs
lola: sara is running 90 secs || 36387074 markings, 54580610 edges, 341564 markings/sec, 90 secs
lola: sara is running 95 secs || 38114461 markings, 57171689 edges, 345477 markings/sec, 95 secs
lola: sara is running 100 secs || 39855722 markings, 59783581 edges, 348252 markings/sec, 100 secs
lola: sara is running 105 secs || 41598820 markings, 62398229 edges, 348620 markings/sec, 105 secs
lola: sara is running 110 secs || 43340658 markings, 65010985 edges, 348368 markings/sec, 110 secs
lola: sara is running 115 secs || 45083267 markings, 67624898 edges, 348522 markings/sec, 115 secs
lola: sara is running 120 secs || 46820857 markings, 70231283 edges, 347518 markings/sec, 120 secs
lola: sara is running 125 secs || 48552731 markings, 72829095 edges, 346375 markings/sec, 125 secs
lola: sara is running 130 secs || 50238546 markings, 75357817 edges, 337163 markings/sec, 130 secs
lola: sara is running 135 secs || 51642143 markings, 78882060 edges, 280719 markings/sec, 135 secs
lola: sara is running 140 secs || 52885041 markings, 82110187 edges, 248580 markings/sec, 140 secs
lola: sara is running 145 secs || 54071463 markings, 85193021 edges, 237284 markings/sec, 145 secs
lola: sara is running 150 secs || 55243354 markings, 88237385 edges, 234378 markings/sec, 150 secs
lola: sara is running 155 secs || 56275858 markings, 90918527 edges, 206501 markings/sec, 155 secs
lola: sara is running 160 secs || 57355854 markings, 93725962 edges, 215999 markings/sec, 160 secs
lola: sara is running 165 secs || 58431713 markings, 96521275 edges, 215172 markings/sec, 165 secs
lola: sara is running 170 secs || 59500622 markings, 99299628 edges, 213782 markings/sec, 170 secs
lola: sara is running 175 secs || 60563073 markings, 102060595 edges, 212490 markings/sec, 175 secs
lola: sara is running 180 secs || 61618071 markings, 104801471 edges, 211000 markings/sec, 180 secs
lola: sara is running 185 secs || 62676750 markings, 107554881 edges, 211736 markings/sec, 185 secs
lola: sara is running 190 secs || 63738381 markings, 110312263 edges, 212326 markings/sec, 190 secs
lola: sara is running 195 secs || 64803534 markings, 113081842 edges, 213031 markings/sec, 195 secs
lola: sara is running 200 secs || 65866193 markings, 115842734 edges, 212532 markings/sec, 200 secs
lola: sara is running 205 secs || 66928137 markings, 118601849 edges, 212389 markings/sec, 205 secs
lola: sara is running 210 secs || 67989934 markings, 121362395 edges, 212359 markings/sec, 210 secs
lola: sara is running 215 secs || 69018553 markings, 124037625 edges, 205724 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit + 1 <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskOnDisk <= TransferToDisk))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskSuspended <= TaskReady) AND ((FreeMemSegment <= 1) OR (FreeMemSegment + 1 <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask <= TaskOnDisk) OR ((1 <= TaskOnDisk) AND (2 <= DiskControllerUnit) AND ((3 <= FreeMemSegment) OR (ExecutingTask <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5.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 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= DiskControllerUnit) AND (ExecutingTask <= LoadingMem) AND (TransferToDisk + 1 <= FreeMemSegment) AND (TaskSuspended + 1 <= LoadingMem) AND (1 <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= 1) AND (LoadingMem + 1 <= TaskReady) AND (LoadingMem <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= DiskControllerUnit) AND (DiskControllerUnit <= 0)) OR (2 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-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 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= TaskOnDisk)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11.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 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit + 1 <= FreeMemSegment) OR (TaskOnDisk <= 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 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-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 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((DiskControllerUnit <= FreeMemSegment)) OR (ExecutingTask <= TaskOnDisk) OR (3 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-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 1659 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= CPUUnit) AND ((LoadingMem <= TransferToDisk) OR (1 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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 SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2613551 markings, 3924365 edges, 522710 markings/sec, 0 secs
lola: sara is running 5 secs || 5229346 markings, 7851075 edges, 523159 markings/sec, 5 secs
lola: sara is running 10 secs || 7275525 markings, 11611714 edges, 409236 markings/sec, 10 secs
lola: sara is running 15 secs || 8747627 markings, 14930549 edges, 294420 markings/sec, 15 secs
lola: sara is running 20 secs || 10173012 markings, 18142215 edges, 285077 markings/sec, 20 secs
lola: sara is running 25 secs || 11533683 markings, 21207322 edges, 272134 markings/sec, 25 secs
lola: sara is running 30 secs || 12839867 markings, 24149258 edges, 261237 markings/sec, 30 secs
lola: sara is running 35 secs || 14125438 markings, 27044488 edges, 257114 markings/sec, 35 secs
lola: sara is running 40 secs || 15385685 markings, 29882478 edges, 252049 markings/sec, 40 secs
lola: sara is running 45 secs || 16619412 markings, 32660583 edges, 246745 markings/sec, 45 secs
lola: sara is running 50 secs || 17814970 markings, 35352627 edges, 239112 markings/sec, 50 secs
lola: sara is running 55 secs || 18985170 markings, 37987440 edges, 234040 markings/sec, 55 secs
lola: sara is running 60 secs || 20286090 markings, 40916510 edges, 260184 markings/sec, 60 secs
lola: sara is running 65 secs || 21525815 markings, 43707714 edges, 247945 markings/sec, 65 secs
lola: sara is running 70 secs || 22753077 markings, 46470774 edges, 245452 markings/sec, 70 secs
lola: sara is running 75 secs || 23980029 markings, 49233068 edges, 245390 markings/sec, 75 secs
lola: sara is running 80 secs || 25187561 markings, 51951608 edges, 241506 markings/sec, 80 secs
lola: sara is running 85 secs || 26386907 markings, 54651648 edges, 239869 markings/sec, 85 secs
lola: sara is running 90 secs || 27605387 markings, 57394734 edges, 243696 markings/sec, 90 secs
lola: sara is running 95 secs || 28788819 markings, 60058870 edges, 236686 markings/sec, 95 secs
lola: sara is running 100 secs || 29946116 markings, 62664152 edges, 231459 markings/sec, 100 secs
lola: sara is running 105 secs || 31109273 markings, 65282558 edges, 232631 markings/sec, 105 secs
lola: sara is running 110 secs || 32239432 markings, 67826671 edges, 226032 markings/sec, 110 secs
lola: sara is running 115 secs || 33368056 markings, 70367290 edges, 225725 markings/sec, 115 secs
lola: sara is running 120 secs || 34466884 markings, 72840826 edges, 219766 markings/sec, 120 secs
lola: sara is running 125 secs || 35652838 markings, 75510460 edges, 237191 markings/sec, 125 secs
lola: sara is running 130 secs || 36844278 markings, 78192439 edges, 238288 markings/sec, 130 secs
lola: sara is running 135 secs || 38013972 markings, 80825413 edges, 233939 markings/sec, 135 secs
lola: sara is running 140 secs || 39141513 markings, 83363481 edges, 225508 markings/sec, 140 secs
lola: sara is running 145 secs || 40238677 markings, 85833147 edges, 219433 markings/sec, 145 secs
lola: sara is running 150 secs || 41348331 markings, 88330927 edges, 221931 markings/sec, 150 secs
lola: sara is running 155 secs || 42416522 markings, 90735361 edges, 213638 markings/sec, 155 secs
lola: sara is running 160 secs || 43524971 markings, 93230406 edges, 221690 markings/sec, 160 secs
lola: sara is running 165 secs || 44585763 markings, 95618150 edges, 212158 markings/sec, 165 secs
lola: sara is running 170 secs || 45665051 markings, 98047532 edges, 215858 markings/sec, 170 secs
lola: sara is running 175 secs || 46769431 markings, 100533343 edges, 220876 markings/sec, 175 secs
lola: sara is running 180 secs || 47828757 markings, 102917753 edges, 211865 markings/sec, 180 secs
lola: sara is running 185 secs || 48905387 markings, 105341101 edges, 215326 markings/sec, 185 secs
lola: sara is running 190 secs || 49956622 markings, 107707279 edges, 210247 markings/sec, 190 secs
lola: sara is running 195 secs || 51015490 markings, 110090605 edges, 211774 markings/sec, 195 secs
lola: sara is running 200 secs || 52125082 markings, 112588112 edges, 221918 markings/sec, 200 secs
lola: sara is running 205 secs || 53204244 markings, 115017124 edges, 215832 markings/sec, 205 secs
lola: sara is running 210 secs || 54266944 markings, 117409042 edges, 212540 markings/sec, 210 secs
lola: sara is running 215 secs || 55319108 markings, 119777279 edges, 210433 markings/sec, 215 secs
lola: sara is running 220 secs || 56349732 markings, 122096996 edges, 206125 markings/sec, 220 secs
lola: sara is running 225 secs || 57659883 markings, 125002402 edges, 262030 markings/sec, 225 secs
lola: sara is running 230 secs || 59168724 markings, 128558088 edges, 301768 markings/sec, 230 secs
lola: sara is running 235 secs || 61007185 markings, 132447878 edges, 367692 markings/sec, 235 secs
lola: sara is running 240 secs || 62219094 markings, 135623547 edges, 242382 markings/sec, 240 secs
lola: sara is running 245 secs || 63366225 markings, 138684828 edges, 229426 markings/sec, 245 secs
lola: sara is running 250 secs || 64488186 markings, 141683369 edges, 224392 markings/sec, 250 secs
lola: sara is running 255 secs || 66091949 markings, 145234652 edges, 320753 markings/sec, 255 secs
lola: sara is running 260 secs || 67228674 markings, 148254965 edges, 227345 markings/sec, 260 secs
lola: sara is running 265 secs || 68376814 markings, 151306629 edges, 229628 markings/sec, 265 secs
lola: sara is running 270 secs || 69496576 markings, 154311157 edges, 223952 markings/sec, 270 secs
lola: sara is running 275 secs || 71319013 markings, 158072511 edges, 364487 markings/sec, 275 secs
lola: sara is running 280 secs || 73055195 markings, 161785641 edges, 347236 markings/sec, 280 secs
lola: sara is running 285 secs || 74837410 markings, 165465851 edges, 356443 markings/sec, 285 secs
lola: sara is running 290 secs || 76663782 markings, 169158395 edges, 365274 markings/sec, 290 secs
lola: sara is running 295 secs || 77834754 markings, 172201198 edges, 234194 markings/sec, 295 secs
lola: sara is running 300 secs || 78943254 markings, 175170845 edges, 221700 markings/sec, 300 secs
lola: sara is running 305 secs || 80694311 markings, 178794610 edges, 350211 markings/sec, 305 secs
lola: sara is running 310 secs || 82058298 markings, 182064117 edges, 272797 markings/sec, 310 secs
lola: sara is running 315 secs || 83154271 markings, 184995060 edges, 219195 markings/sec, 315 secs
lola: sara is running 320 secs || 84284758 markings, 188009161 edges, 226097 markings/sec, 320 secs
lola: sara is running 325 secs || 85431900 markings, 191082493 edges, 229428 markings/sec, 325 secs
lola: sara is running 330 secs || 86549767 markings, 194077936 edges, 223573 markings/sec, 330 secs
lola: sara is running 335 secs || 87632818 markings, 196981634 edges, 216610 markings/sec, 335 secs
lola: sara is running 340 secs || 89267776 markings, 200424717 edges, 326992 markings/sec, 340 secs
lola: sara is running 345 secs || 90879088 markings, 204016824 edges, 322262 markings/sec, 345 secs
lola: sara is running 350 secs || 91934921 markings, 206839948 edges, 211167 markings/sec, 350 secs
lola: sara is running 355 secs || 93043186 markings, 209797486 edges, 221653 markings/sec, 355 secs
lola: sara is running 360 secs || 94130579 markings, 212711193 edges, 217479 markings/sec, 360 secs
lola: sara is running 365 secs || 95231194 markings, 215639012 edges, 220123 markings/sec, 365 secs
lola: sara is running 370 secs || 96391991 markings, 218707173 edges, 232159 markings/sec, 370 secs
lola: sara is running 375 secs || 97465147 markings, 221590993 edges, 214631 markings/sec, 375 secs
lola: sara is running 380 secs || 98600631 markings, 224615044 edges, 227097 markings/sec, 380 secs
lola: sara is running 385 secs || 99681054 markings, 227515439 edges, 216085 markings/sec, 385 secs
lola: sara is running 390 secs || 100735805 markings, 230355883 edges, 210950 markings/sec, 390 secs
lola: sara is running 395 secs || 101886828 markings, 233416907 edges, 230205 markings/sec, 395 secs
lola: sara is running 400 secs || 103008402 markings, 236407074 edges, 224315 markings/sec, 400 secs
lola: sara is running 405 secs || 104146743 markings, 239414954 edges, 227668 markings/sec, 405 secs
lola: sara is running 410 secs || 105267748 markings, 242400768 edges, 224201 markings/sec, 410 secs
lola: sara is running 415 secs || 106399472 markings, 245416560 edges, 226345 markings/sec, 415 secs
lola: sara is running 420 secs || 107506623 markings, 248377449 edges, 221430 markings/sec, 420 secs
lola: sara is running 425 secs || 108596497 markings, 251298785 edges, 217975 markings/sec, 425 secs
lola: sara is running 430 secs || 109648277 markings, 254130891 edges, 210356 markings/sec, 430 secs
lola: sara is running 435 secs || 110752566 markings, 257091931 edges, 220858 markings/sec, 435 secs
lola: sara is running 440 secs || 111910838 markings, 260152249 edges, 231654 markings/sec, 440 secs
lola: sara is running 445 secs || 113032749 markings, 263148581 edges, 224382 markings/sec, 445 secs
lola: sara is running 450 secs || 114162974 markings, 266156406 edges, 226045 markings/sec, 450 secs
lola: sara is running 455 secs || 115223318 markings, 269006461 edges, 212069 markings/sec, 455 secs
lola: sara is running 460 secs || 116618846 markings, 272254052 edges, 279106 markings/sec, 460 secs
lola: sara is running 465 secs || 118573670 markings, 276163700 edges, 390965 markings/sec, 465 secs
lola: sara is running 470 secs || 119941254 markings, 279438824 edges, 273517 markings/sec, 470 secs
lola: sara is running 475 secs || 121031444 markings, 282332865 edges, 218038 markings/sec, 475 secs
lola: sara is running 480 secs || 122162134 markings, 285332092 edges, 226138 markings/sec, 480 secs
lola: sara is running 485 secs || 123258809 markings, 288270769 edges, 219335 markings/sec, 485 secs
lola: sara is running 490 secs || 124322465 markings, 291128242 edges, 212731 markings/sec, 490 secs
lola: sara is running 495 secs || 125343283 markings, 293883676 edges, 204164 markings/sec, 495 secs
lola: sara is running 500 secs || 127042301 markings, 297355794 edges, 339804 markings/sec, 500 secs
lola: sara is running 505 secs || 129048207 markings, 301372969 edges, 401181 markings/sec, 505 secs
lola: sara is running 510 secs || 130157496 markings, 304328983 edges, 221858 markings/sec, 510 secs
lola: sara is running 515 secs || 131273066 markings, 307305283 edges, 223114 markings/sec, 515 secs
lola: sara is running 520 secs || 132422163 markings, 310363171 edges, 229819 markings/sec, 520 secs
lola: sara is running 525 secs || 133536970 markings, 313349276 edges, 222961 markings/sec, 525 secs
lola: sara is running 530 secs || 134612370 markings, 316225190 edges, 215080 markings/sec, 530 secs
lola: sara is running 535 secs || 135713421 markings, 319159475 edges, 220210 markings/sec, 535 secs
lola: sara is running 540 secs || 136848547 markings, 322142202 edges, 227025 markings/sec, 540 secs
lola: sara is running 545 secs || 137908185 markings, 324984811 edges, 211928 markings/sec, 545 secs
lola: sara is running 550 secs || 138933155 markings, 327761690 edges, 204994 markings/sec, 550 secs
lola: sara is running 555 secs || 140072842 markings, 330778777 edges, 227937 markings/sec, 555 secs
lola: sara is running 560 secs || 141303819 markings, 333879326 edges, 246195 markings/sec, 560 secs
lola: sara is running 565 secs || 143063743 markings, 337399171 edges, 351985 markings/sec, 565 secs
lola: sara is running 570 secs || 144955466 markings, 341255789 edges, 378345 markings/sec, 570 secs
lola: sara is running 575 secs || 146064345 markings, 344203284 edges, 221776 markings/sec, 575 secs
lola: sara is running 580 secs || 147198594 markings, 347221592 edges, 226850 markings/sec, 580 secs
lola: sara is running 585 secs || 148233706 markings, 350015248 edges, 207022 markings/sec, 585 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2721 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= ExecutingTask) OR (1 <= CPUUnit)) AND ())))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes yes yes yes no yes yes no no yes no yes unknown no
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494930302313
--------------------
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="SmallOperatingSystem-PT-MT8192DC4096"
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/SmallOperatingSystem-PT-MT8192DC4096.tgz
mv SmallOperatingSystem-PT-MT8192DC4096 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 SmallOperatingSystem-PT-MT8192DC4096, 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 r078-ebro-149441008200061"
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 ;