About the Execution of Irma.struct for AutoFlight-PT-48b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3524.040 | 754796.00 | 1468078.00 | 3295.80 | FFF?TFF?TFTTTFFT | 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)
.....................................................................................................................................................................................
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 956K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is AutoFlight-PT-48b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r019-qhx1-152646243700173
=====================================================================
--------------------
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 AutoFlight-PT-48b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526811517086
BK_STOP 1526812271882
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using AutoFlight-PT-48b as instance name.
Using AutoFlight as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 514296, 'Memory': 2695.04, 'Tool': 'lola'}, {'Time': 517328, 'Memory': 2732.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola AutoFlight-PT-48b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
AutoFlight-PT-48b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
AutoFlight-PT-48b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ AutoFlight-PT-48b @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7886/65536 symbol table entries, 1706 collisions
lola: preprocessing...
lola: finding significant places
lola: 3950 places, 3936 transitions, 3692 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4350 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-48b-ReachabilityCardinality.task
lola: E (F (((p339 <= 0) AND (p2099 + 1 <= p2561) AND (p1014 <= 0) AND (p151 + 1 <= p2660)))) : A (G (((p3184 + 1 <= p861) OR (p3797 <= 0) OR (3 <= p87)))) : A (G (((p2998 <= p186) AND ((p2646 <= 0) OR (p2394 + 1 <= p1536))))) : E (F (((p1564 + 1 <= p3845) AND (1 <= p2709)))) : E (F ((1 <= p1303))) : E (F ((((p3329 <= p2241) OR (3 <= p814)) AND ((2 <= p2596) OR (p2681 <= p187)) AND (1 <= p2577) AND (3 <= p1445) AND (p1058 <= p1547)))) : E (F ((2 <= p3223))) : A (G (((((p290 <= p3555) OR (p1653 <= p2316)) AND (p3227 <= p3171)) OR ((p1969 <= 1) AND (p425 <= 0))))) : A (G ((p3681 <= 1))) : E (F ((3 <= p516))) : E (F (((p2196 + 1 <= p2623) AND ((p1658 <= 1) OR (p601 <= 0))))) : A (G (((p1542 <= 1) OR ((3 <= p3542) AND (2 <= p1300)) OR ((2 <= p991) AND (p1353 <= p793) AND (3 <= p414))))) : E (F ((((p185 + 1 <= p1435) AND (p254 <= 2)) OR (1 <= p1638)))) : E (F (((p858 + 1 <= p3228) AND (3 <= p433)))) : A (G (((p2416 <= 0) OR (p841 + 1 <= p2433) OR ((p1496 <= 0) AND (p1703 <= 0))))) : E (F (((p3389 + 1 <= p1538) OR ((p3047 + 1 <= p2705) AND (p875 + 1 <= p1958)))))
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 (((p339 <= 0) AND (p2099 + 1 <= p2561) AND (p1014 <= 0) AND (p151 + 1 <= p2660))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 31280 markings, 66927 edges, 6256 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 109766 markings, 263080 edges, 15697 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3184 + 1 <= p861) OR (p3797 <= 0) OR (3 <= p87))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 41972 markings, 94954 edges, 8394 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 121580 markings, 326464 edges, 15922 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 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2998 <= p186) AND ((p2646 <= 0) OR (p2394 + 1 <= p1536)))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1564 + 1 <= p3845) AND (1 <= p2709))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 77767 markings, 125841 edges, 15553 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 201368 markings, 334475 edges, 24720 markings/sec, 5 secs
lola: sara is running 10 secs || 311651 markings, 551871 edges, 22057 markings/sec, 10 secs
lola: sara is running 15 secs || 430110 markings, 762459 edges, 23692 markings/sec, 15 secs
lola: sara is running 20 secs || 534970 markings, 988774 edges, 20972 markings/sec, 20 secs
lola: sara is running 25 secs || 653757 markings, 1199697 edges, 23757 markings/sec, 25 secs
lola: sara is running 30 secs || 761382 markings, 1435733 edges, 21525 markings/sec, 30 secs
lola: sara is running 35 secs || 884713 markings, 1677635 edges, 24666 markings/sec, 35 secs
lola: sara is running 40 secs || 1018428 markings, 1903403 edges, 26743 markings/sec, 40 secs
lola: sara is running 45 secs || 1144427 markings, 2145214 edges, 25200 markings/sec, 45 secs
lola: sara is running 50 secs || 1258248 markings, 2406561 edges, 22764 markings/sec, 50 secs
lola: sara is running 55 secs || 1384225 markings, 2658834 edges, 25195 markings/sec, 55 secs
lola: sara is running 60 secs || 1522979 markings, 2907072 edges, 27751 markings/sec, 60 secs
lola: sara is running 65 secs || 1656398 markings, 3142851 edges, 26684 markings/sec, 65 secs
lola: sara is running 70 secs || 1773789 markings, 3410805 edges, 23478 markings/sec, 70 secs
lola: sara is running 75 secs || 1900483 markings, 3671072 edges, 25339 markings/sec, 75 secs
lola: sara is running 80 secs || 2030179 markings, 3915482 edges, 25939 markings/sec, 80 secs
lola: sara is running 85 secs || 2175967 markings, 4154428 edges, 29158 markings/sec, 85 secs
lola: sara is running 90 secs || 2299293 markings, 4434018 edges, 24665 markings/sec, 90 secs
lola: sara is running 95 secs || 2421197 markings, 4694055 edges, 24381 markings/sec, 95 secs
lola: sara is running 100 secs || 2551388 markings, 4946487 edges, 26038 markings/sec, 100 secs
lola: sara is running 105 secs || 2691331 markings, 5175326 edges, 27989 markings/sec, 105 secs
lola: sara is running 110 secs || 2812793 markings, 5436188 edges, 24292 markings/sec, 110 secs
lola: sara is running 115 secs || 2935700 markings, 5705031 edges, 24581 markings/sec, 115 secs
lola: sara is running 120 secs || 3060225 markings, 5949297 edges, 24905 markings/sec, 120 secs
lola: sara is running 125 secs || 3191137 markings, 6171140 edges, 26182 markings/sec, 125 secs
lola: sara is running 130 secs || 3311886 markings, 6402072 edges, 24150 markings/sec, 130 secs
lola: sara is running 135 secs || 3422750 markings, 6653056 edges, 22173 markings/sec, 135 secs
lola: sara is running 140 secs || 3543247 markings, 6897562 edges, 24099 markings/sec, 140 secs
lola: sara is running 145 secs || 3672662 markings, 7137911 edges, 25883 markings/sec, 145 secs
lola: sara is running 150 secs || 3808023 markings, 7359338 edges, 27072 markings/sec, 150 secs
lola: sara is running 155 secs || 3941307 markings, 7584015 edges, 26657 markings/sec, 155 secs
lola: sara is running 160 secs || 4031182 markings, 7814633 edges, 17975 markings/sec, 160 secs
lola: sara is running 165 secs || 4123167 markings, 8055647 edges, 18397 markings/sec, 165 secs
lola: sara is running 170 secs || 4250509 markings, 8295607 edges, 25468 markings/sec, 170 secs
lola: sara is running 175 secs || 4377649 markings, 8536943 edges, 25428 markings/sec, 175 secs
lola: sara is running 180 secs || 4500749 markings, 8778191 edges, 24620 markings/sec, 180 secs
lola: sara is running 185 secs || 4628013 markings, 9019154 edges, 25453 markings/sec, 185 secs
lola: sara is running 190 secs || 4754346 markings, 9258302 edges, 25267 markings/sec, 190 secs
lola: sara is running 195 secs || 4877551 markings, 9496376 edges, 24641 markings/sec, 195 secs
lola: sara is running 200 secs || 4998390 markings, 9734140 edges, 24168 markings/sec, 200 secs
lola: sara is running 205 secs || 5118138 markings, 9975916 edges, 23950 markings/sec, 205 secs
lola: sara is running 210 secs || 5244181 markings, 10214986 edges, 25209 markings/sec, 210 secs
lola: sara is running 215 secs || 5382466 markings, 10443106 edges, 27657 markings/sec, 215 secs
lola: sara is running 220 secs || 5488111 markings, 10719572 edges, 21129 markings/sec, 220 secs
lola: sara is running 225 secs || 5592294 markings, 10988739 edges, 20837 markings/sec, 225 secs
lola: sara is running 230 secs || 5710357 markings, 11224955 edges, 23613 markings/sec, 230 secs
lola: sara is running 235 secs || 5831307 markings, 11442210 edges, 24190 markings/sec, 235 secs
lola: sara is running 240 secs || 5953412 markings, 11655906 edges, 24421 markings/sec, 240 secs
lola: sara is running 245 secs || 6049824 markings, 11915599 edges, 19282 markings/sec, 245 secs
lola: sara is running 250 secs || 6151374 markings, 12172450 edges, 20310 markings/sec, 250 secs
lola: sara is running 255 secs || 6268564 markings, 12405363 edges, 23438 markings/sec, 255 secs
lola: sara is running 260 secs || 6396295 markings, 12632776 edges, 25546 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1303)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3329 <= p2241) OR (3 <= p814)) AND ((2 <= p2596) OR (p2681 <= p187)) AND (1 <= p2577) AND (3 <= p1445) AND (p1058 <= p1547))))
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 464 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 70984 markings, 123991 edges, 14197 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 210701 markings, 380409 edges, 27943 markings/sec, 5 secs
lola: sara is running 10 secs || 346601 markings, 642809 edges, 27180 markings/sec, 10 secs
lola: sara is running 15 secs || 482966 markings, 885640 edges, 27273 markings/sec, 15 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 322 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p3223)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 35861 markings, 85410 edges, 7172 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 111147 markings, 323582 edges, 15057 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p290 <= p3555) OR (p1653 <= p2316)) AND (p3227 <= p3171)) OR ((p1969 <= 1) AND (p425 <= 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 464 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 46791 markings, 128443 edges, 9358 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 116846 markings, 358892 edges, 14011 markings/sec, 5 secs
lola: sara is running 10 secs || 191730 markings, 588791 edges, 14977 markings/sec, 10 secs
lola: sara is running 15 secs || 259292 markings, 820930 edges, 13512 markings/sec, 15 secs
lola: sara is running 20 secs || 332785 markings, 1049969 edges, 14699 markings/sec, 20 secs
lola: sara is running 25 secs || 408467 markings, 1268115 edges, 15136 markings/sec, 25 secs
lola: sara is running 30 secs || 484618 markings, 1509751 edges, 15230 markings/sec, 30 secs
lola: sara is running 35 secs || 556176 markings, 1740872 edges, 14312 markings/sec, 35 secs
lola: sara is running 40 secs || 624548 markings, 1977330 edges, 13674 markings/sec, 40 secs
lola: sara is running 45 secs || 691868 markings, 2211306 edges, 13464 markings/sec, 45 secs
lola: sara is running 50 secs || 759997 markings, 2446170 edges, 13626 markings/sec, 50 secs
lola: sara is running 55 secs || 825890 markings, 2676509 edges, 13179 markings/sec, 55 secs
lola: sara is running 60 secs || 895183 markings, 2912364 edges, 13859 markings/sec, 60 secs
lola: sara is running 65 secs || 961506 markings, 3141998 edges, 13265 markings/sec, 65 secs
lola: sara is running 70 secs || 1029595 markings, 3377446 edges, 13618 markings/sec, 70 secs
lola: sara is running 75 secs || 1097011 markings, 3612501 edges, 13483 markings/sec, 75 secs
lola: sara is running 80 secs || 1168751 markings, 3863268 edges, 14348 markings/sec, 80 secs
lola: sara is running 85 secs || 1240432 markings, 4114359 edges, 14336 markings/sec, 85 secs
lola: sara is running 90 secs || 1314333 markings, 4373255 edges, 14780 markings/sec, 90 secs
lola: sara is running 95 secs || 1384150 markings, 4617865 edges, 13963 markings/sec, 95 secs
lola: sara is running 100 secs || 1454449 markings, 4862130 edges, 14060 markings/sec, 100 secs
lola: sara is running 105 secs || 1524988 markings, 5106492 edges, 14108 markings/sec, 105 secs
lola: sara is running 110 secs || 1594226 markings, 5345522 edges, 13848 markings/sec, 110 secs
lola: sara is running 115 secs || 1664394 markings, 5588703 edges, 14034 markings/sec, 115 secs
lola: sara is running 120 secs || 1731337 markings, 5820627 edges, 13389 markings/sec, 120 secs
lola: sara is running 125 secs || 1801658 markings, 6067946 edges, 14064 markings/sec, 125 secs
lola: sara is running 130 secs || 1870782 markings, 6310532 edges, 13825 markings/sec, 130 secs
lola: sara is running 135 secs || 1939824 markings, 6548925 edges, 13808 markings/sec, 135 secs
lola: sara is running 140 secs || 2007381 markings, 6782959 edges, 13511 markings/sec, 140 secs
lola: sara is running 145 secs || 2074134 markings, 7014828 edges, 13351 markings/sec, 145 secs
lola: sara is running 150 secs || 2136470 markings, 7227971 edges, 12467 markings/sec, 150 secs
lola: sara is running 155 secs || 2194533 markings, 7431113 edges, 11613 markings/sec, 155 secs
lola: sara is running 160 secs || 2257341 markings, 7652131 edges, 12562 markings/sec, 160 secs
lola: sara is running 165 secs || 2321188 markings, 7876187 edges, 12769 markings/sec, 165 secs
lola: sara is running 170 secs || 2385117 markings, 8097882 edges, 12786 markings/sec, 170 secs
lola: sara is running 175 secs || 2448181 markings, 8314857 edges, 12613 markings/sec, 175 secs
lola: sara is running 180 secs || 2511213 markings, 8534136 edges, 12606 markings/sec, 180 secs
lola: sara is running 185 secs || 2574726 markings, 8753162 edges, 12703 markings/sec, 185 secs
lola: sara is running 190 secs || 2636508 markings, 8967325 edges, 12356 markings/sec, 190 secs
lola: sara is running 195 secs || 2700167 markings, 9191067 edges, 12732 markings/sec, 195 secs
lola: sara is running 200 secs || 2764475 markings, 9416798 edges, 12862 markings/sec, 200 secs
lola: sara is running 205 secs || 2831331 markings, 9645360 edges, 13371 markings/sec, 205 secs
lola: sara is running 210 secs || 2898000 markings, 9879219 edges, 13334 markings/sec, 210 secs
lola: sara is running 215 secs || 2963410 markings, 10102633 edges, 13082 markings/sec, 215 secs
lola: sara is running 220 secs || 3028694 markings, 10325706 edges, 13057 markings/sec, 220 secs
lola: sara is running 225 secs || 3091173 markings, 10541788 edges, 12496 markings/sec, 225 secs
lola: sara is running 230 secs || 3154597 markings, 10761344 edges, 12685 markings/sec, 230 secs
lola: sara is running 235 secs || 3220412 markings, 10986273 edges, 13163 markings/sec, 235 secs
lola: sara is running 240 secs || 3291939 markings, 11235292 edges, 14305 markings/sec, 240 secs
lola: sara is running 245 secs || 3364565 markings, 11483761 edges, 14525 markings/sec, 245 secs
lola: sara is running 250 secs || 3435866 markings, 11731016 edges, 14260 markings/sec, 250 secs
lola: sara is running 255 secs || 3505171 markings, 11970848 edges, 13861 markings/sec, 255 secs
lola: sara is running 260 secs || 3577884 markings, 12218753 edges, 14543 markings/sec, 260 secs
lola: sara is running 265 secs || 3647509 markings, 12458977 edges, 13925 markings/sec, 265 secs
lola: sara is running 270 secs || 3715679 markings, 12695930 edges, 13634 markings/sec, 270 secs
lola: sara is running 275 secs || 3785714 markings, 12939209 edges, 14007 markings/sec, 275 secs
lola: sara is running 280 secs || 3854771 markings, 13180538 edges, 13811 markings/sec, 280 secs
lola: sara is running 285 secs || 3926841 markings, 13432444 edges, 14414 markings/sec, 285 secs
lola: sara is running 290 secs || 3991886 markings, 13659804 edges, 13009 markings/sec, 290 secs
lola: sara is running 295 secs || 4058901 markings, 13893966 edges, 13403 markings/sec, 295 secs
lola: sara is running 300 secs || 4128526 markings, 14137065 edges, 13925 markings/sec, 300 secs
lola: sara is running 305 secs || 4200332 markings, 14383814 edges, 14361 markings/sec, 305 secs
lola: sara is running 310 secs || 4270808 markings, 14624939 edges, 14095 markings/sec, 310 secs
lola: sara is running 315 secs || 4341334 markings, 14867395 edges, 14105 markings/sec, 315 secs
lola: sara is running 320 secs || 4410498 markings, 15108336 edges, 13833 markings/sec, 320 secs
lola: sara is running 325 secs || 4481412 markings, 15355793 edges, 14183 markings/sec, 325 secs
lola: sara is running 330 secs || 4553436 markings, 15607027 edges, 14405 markings/sec, 330 secs
lola: sara is running 335 secs || 4624289 markings, 15851021 edges, 14171 markings/sec, 335 secs
lola: sara is running 340 secs || 4694856 markings, 16092942 edges, 14113 markings/sec, 340 secs
lola: sara is running 345 secs || 4765649 markings, 16336648 edges, 14159 markings/sec, 345 secs
lola: sara is running 350 secs || 4834645 markings, 16573433 edges, 13799 markings/sec, 350 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 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3681 <= 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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 39972 markings, 95672 edges, 7994 markings/sec, 0 secs
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 9 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p516)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 187 markings, 186 edges
lola: ========================================
lola: subprocess 10 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2196 + 1 <= p2623) AND ((p1658 <= 1) OR (p601 <= 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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2042 markings, 2088 edges
lola: ========================================
lola: subprocess 11 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1542 <= 1) OR ((3 <= p3542) AND (2 <= p1300)) OR ((2 <= p991) AND (p1353 <= p793) AND (3 <= p414)))))
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 464 bytes per marking, with 20 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 107 markings, 106 edges
lola: ========================================
lola: subprocess 12 will run for 711 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p185 + 1 <= p1435) AND (p254 <= 2)) OR (1 <= p1638))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 13 will run for 948 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p858 + 1 <= p3228) AND (3 <= p433))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 34240 markings, 77449 edges, 6848 markings/sec, 0 secs
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: subprocess 14 will run for 1418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2416 <= 0) OR (p841 + 1 <= p2433) OR ((p1496 <= 0) AND (p1703 <= 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 464 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 15 will run for 2836 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3389 + 1 <= p1538) OR ((p3047 + 1 <= p2705) AND (p875 + 1 <= p1958)))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown yes no no unknown yes no yes yes yes no no yes
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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="AutoFlight-PT-48b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is AutoFlight-PT-48b, 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 r019-qhx1-152646243700173"
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 ;