About the Execution of M4M.full for DLCround-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2609.500 | 656485.00 | 1229856.00 | 2064.70 | FTFFFTFTFTFFTTTF | 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.7M
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 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.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DLCround-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649742900112
=====================================================================
--------------------
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 DLCround-PT-10b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526684905320
BK_STOP 1526685561805
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCround-PT-10b as instance name.
Using DLCround as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': 201911, 'Memory': 1527.72, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola DLCround-PT-10b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DLCround-PT-10b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCround-PT-10b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ DLCround-PT-10b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 10116/65536 symbol table entries, 2628 collisions
lola: preprocessing...
lola: finding significant places
lola: 3924 places, 6192 transitions, 3711 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 8844 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-10b-ReachabilityFireability.task
lola: A (G (((FIREABLE(t1722) OR FIREABLE(t5039) OR NOT FIREABLE(t83)) AND (NOT FIREABLE(t5162) OR NOT FIREABLE(t2664)) AND NOT FIREABLE(t982)))) : E (F ((FIREABLE(t1915) AND (NOT FIREABLE(t5095) OR NOT FIREABLE(t4112)) AND ((FIREABLE(t1963) AND FIREABLE(t4506)) OR (FIREABLE(t1667) AND FIREABLE(t2524)) OR FIREABLE(t2093))))) : E (F ((FIREABLE(t5352) AND FIREABLE(t3433) AND FIREABLE(t3698)))) : A (G ((FIREABLE(t4496) OR FIREABLE(t1208) OR (FIREABLE(t4586) AND FIREABLE(t2184)) OR (NOT FIREABLE(t5864) AND NOT FIREABLE(t6149)) OR (NOT FIREABLE(t5261) AND NOT FIREABLE(t5202)) OR NOT FIREABLE(t2129)))) : A (G ((FIREABLE(t3982) OR FIREABLE(t3265) OR NOT FIREABLE(t3814) OR (FIREABLE(t4703) AND FIREABLE(t4654)) OR (FIREABLE(t3349) AND FIREABLE(t5704)) OR FIREABLE(t302)))) : E (F ((FIREABLE(t6108) OR (FIREABLE(t5429) AND (FIREABLE(t31) OR FIREABLE(t3251))) OR (NOT FIREABLE(t5986) AND (FIREABLE(t5584) OR FIREABLE(t4477)) AND (FIREABLE(t3393) OR FIREABLE(t1061) OR (FIREABLE(t1141) AND FIREABLE(t2087))))))) : A (G ((NOT FIREABLE(t5330) AND (NOT FIREABLE(t1259) OR (NOT FIREABLE(t1874) AND NOT FIREABLE(t451)))))) : E (F ((((FIREABLE(t1724) OR FIREABLE(t4661) OR FIREABLE(t2539)) AND NOT FIREABLE(t597)) OR ((FIREABLE(t1230) OR FIREABLE(t737) OR (FIREABLE(t1545) AND FIREABLE(t2867))) AND (FIREABLE(t4179) OR NOT FIREABLE(t3752)))))) : A (G (NOT FIREABLE(t1248))) : E (F ((FIREABLE(t2660) OR FIREABLE(t1715) OR (FIREABLE(t2261) AND NOT FIREABLE(t5844))))) : A (G ((NOT FIREABLE(t3453) OR ((FIREABLE(t5962) OR FIREABLE(t5396)) AND (FIREABLE(t4447) OR FIREABLE(t4043)) AND NOT FIREABLE(t887))))) : A (G (NOT FIREABLE(t3064))) : E (F (FIREABLE(t5086))) : E (F ((FIREABLE(t604) AND (NOT FIREABLE(t176) OR NOT FIREABLE(t971) OR NOT FIREABLE(t3497))))) : E (F ((NOT FIREABLE(t5858) AND NOT FIREABLE(t2158) AND FIREABLE(t3731) AND FIREABLE(t327) AND FIREABLE(t3580)))) : A (G (((NOT FIREABLE(t5945) AND NOT FIREABLE(t4286)) OR (NOT FIREABLE(t2362) AND NOT FIREABLE(t5418)) OR (FIREABLE(t2704) AND FIREABLE(t386) AND (FIREABLE(t5471) OR FIREABLE(t1826)) AND FIREABLE(t4908)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1722) OR FIREABLE(t5039) OR NOT FIREABLE(t83)) AND (NOT FIREABLE(t5162) OR NOT FIREABLE(t2664)) AND NOT FIREABLE(t982))))
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 1 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1915) AND (NOT FIREABLE(t5095) OR NOT FIREABLE(t4112)) AND ((FIREABLE(t1963) AND FIREABLE(t4506)) OR (FIREABLE(t1667) AND FIREABLE(t2524)) OR FIREABLE(t2093)))))
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 1 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 48 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 23410 markings, 30046 edges, 4682 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 47962 markings, 62517 edges, 4910 markings/sec, 5 secs
lola: sara is running 10 secs || 72285 markings, 95632 edges, 4865 markings/sec, 10 secs
lola: sara is running 15 secs || 96682 markings, 128386 edges, 4879 markings/sec, 15 secs
lola: sara is running 20 secs || 120853 markings, 162356 edges, 4834 markings/sec, 20 secs
lola: sara is running 25 secs || 144843 markings, 194754 edges, 4798 markings/sec, 25 secs
lola: sara is running 30 secs || 168913 markings, 229038 edges, 4814 markings/sec, 30 secs
lola: sara is running 35 secs || 192856 markings, 262345 edges, 4789 markings/sec, 35 secs
lola: sara is running 40 secs || 216430 markings, 297353 edges, 4715 markings/sec, 40 secs
lola: sara is running 45 secs || 240816 markings, 331831 edges, 4877 markings/sec, 45 secs
lola: sara is running 50 secs || 265021 markings, 365945 edges, 4841 markings/sec, 50 secs
lola: sara is running 55 secs || 289762 markings, 400077 edges, 4948 markings/sec, 55 secs
lola: sara is running 60 secs || 314532 markings, 434203 edges, 4954 markings/sec, 60 secs
lola: sara is running 65 secs || 339099 markings, 468173 edges, 4913 markings/sec, 65 secs
lola: sara is running 70 secs || 363598 markings, 501733 edges, 4900 markings/sec, 70 secs
lola: sara is running 75 secs || 388142 markings, 535829 edges, 4909 markings/sec, 75 secs
lola: sara is running 80 secs || 412225 markings, 562905 edges, 4817 markings/sec, 80 secs
lola: sara is running 85 secs || 436838 markings, 589546 edges, 4923 markings/sec, 85 secs
lola: sara is running 90 secs || 461432 markings, 616552 edges, 4919 markings/sec, 90 secs
lola: sara is running 95 secs || 486329 markings, 644011 edges, 4979 markings/sec, 95 secs
lola: sara is running 100 secs || 511343 markings, 671667 edges, 5003 markings/sec, 100 secs
lola: sara is running 105 secs || 536353 markings, 699398 edges, 5002 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 543682 markings, 707535 edges
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t5352) AND FIREABLE(t3433) AND FIREABLE(t3698))))
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 1 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 DLCround-PT-10b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-2.sara.
lola: sara is running 0 secs || 127810 markings, 140477 edges, 25562 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 255829 markings, 281967 edges, 25604 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 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4496) OR FIREABLE(t1208) OR (FIREABLE(t4586) AND FIREABLE(t2184)) OR (NOT FIREABLE(t5864) AND NOT FIREABLE(t6149)) OR (NOT FIREABLE(t5261) AND NOT FIREABLE(t5202)) OR NOT FIREABLE(t2129))))
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 1 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 192 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 68564 markings, 73869 edges, 13713 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 131486 markings, 141337 edges, 12584 markings/sec, 5 secs
lola: sara is running 10 secs || 194536 markings, 208969 edges, 12610 markings/sec, 10 secs
lola: sara is running 15 secs || 258084 markings, 277173 edges, 12710 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t3982) OR FIREABLE(t3265) OR NOT FIREABLE(t3814) OR (FIREABLE(t4703) AND FIREABLE(t4654)) OR (FIREABLE(t3349) AND FIREABLE(t5704)) OR FIREABLE(t302))))
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 1 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 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-4.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: 54 markings, 53 edges
lola: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6108) OR (FIREABLE(t5429) AND (FIREABLE(t31) OR FIREABLE(t3251))) OR (NOT FIREABLE(t5986) AND (FIREABLE(t5584) OR FIREABLE(t4477)) AND (FIREABLE(t3393) OR FIREABLE(t1061) OR (FIREABLE(t1141) AND FIREABLE(t2087)))))))
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 1 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 60 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 108 markings, 107 edges
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t5330) AND (NOT FIREABLE(t1259) OR (NOT FIREABLE(t1874) AND NOT FIREABLE(t451))))))
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 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 24212 markings, 29816 edges, 4842 markings/sec, 0 secs
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: 43266 markings, 53598 edges
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1724) OR FIREABLE(t4661) OR FIREABLE(t2539)) AND NOT FIREABLE(t597)) OR ((FIREABLE(t1230) OR FIREABLE(t737) OR (FIREABLE(t1545) AND FIREABLE(t2867))) AND (FIREABLE(t4179) OR NOT FIREABLE(t3752))))))
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 1 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 24 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1948 markings, 2178 edges
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1248)))
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 1 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 DLCround-PT-10b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2376 markings, 2691 edges
lola: ========================================
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2660) OR FIREABLE(t1715) OR (FIREABLE(t2261) AND NOT FIREABLE(t5844)))))
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 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3453) OR ((FIREABLE(t5962) OR FIREABLE(t5396)) AND (FIREABLE(t4447) OR FIREABLE(t4043)) AND NOT FIREABLE(t887)))))
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 1 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 26 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 24616 markings, 32046 edges, 4923 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 49288 markings, 63325 edges, 4934 markings/sec, 5 secs
lola: sara is running 10 secs || 74020 markings, 95680 edges, 4946 markings/sec, 10 secs
lola: sara is running 15 secs || 98875 markings, 128025 edges, 4971 markings/sec, 15 secs
lola: sara is running 20 secs || 123567 markings, 160698 edges, 4938 markings/sec, 20 secs
lola: sara is running 25 secs || 148216 markings, 193839 edges, 4930 markings/sec, 25 secs
lola: sara is running 30 secs || 172737 markings, 226407 edges, 4904 markings/sec, 30 secs
lola: sara is running 35 secs || 196848 markings, 257669 edges, 4822 markings/sec, 35 secs
lola: sara is running 40 secs || 220968 markings, 288861 edges, 4824 markings/sec, 40 secs
lola: sara is running 45 secs || 245073 markings, 320798 edges, 4821 markings/sec, 45 secs
lola: sara is running 50 secs || 269113 markings, 352608 edges, 4808 markings/sec, 50 secs
lola: sara is running 55 secs || 293156 markings, 383489 edges, 4809 markings/sec, 55 secs
lola: sara is running 60 secs || 317157 markings, 415663 edges, 4800 markings/sec, 60 secs
lola: sara is running 65 secs || 341357 markings, 447931 edges, 4840 markings/sec, 65 secs
lola: sara is running 70 secs || 365655 markings, 480285 edges, 4860 markings/sec, 70 secs
lola: sara is running 75 secs || 389387 markings, 513114 edges, 4746 markings/sec, 75 secs
lola: sara is running 80 secs || 413001 markings, 544622 edges, 4723 markings/sec, 80 secs
lola: sara is running 85 secs || 436819 markings, 575186 edges, 4764 markings/sec, 85 secs
lola: sara is running 90 secs || 460674 markings, 607423 edges, 4771 markings/sec, 90 secs
lola: sara is running 95 secs || 484610 markings, 640933 edges, 4787 markings/sec, 95 secs
lola: sara is running 100 secs || 508220 markings, 671802 edges, 4722 markings/sec, 100 secs
lola: sara is running 105 secs || 531775 markings, 702842 edges, 4711 markings/sec, 105 secs
lola: sara is running 110 secs || 555273 markings, 732815 edges, 4700 markings/sec, 110 secs
lola: sara is running 115 secs || 578978 markings, 764489 edges, 4741 markings/sec, 115 secs
lola: sara is running 120 secs || 602529 markings, 796211 edges, 4710 markings/sec, 120 secs
lola: sara is running 125 secs || 626031 markings, 827248 edges, 4700 markings/sec, 125 secs
lola: sara is running 130 secs || 649646 markings, 859203 edges, 4723 markings/sec, 130 secs
lola: sara is running 135 secs || 673137 markings, 890541 edges, 4698 markings/sec, 135 secs
lola: sara is running 140 secs || 696625 markings, 920919 edges, 4698 markings/sec, 140 secs
lola: sara is running 145 secs || 720156 markings, 951946 edges, 4706 markings/sec, 145 secs
lola: sara is running 150 secs || 743678 markings, 982811 edges, 4704 markings/sec, 150 secs
lola: sara is running 155 secs || 767198 markings, 1014577 edges, 4704 markings/sec, 155 secs
lola: sara is running 160 secs || 790588 markings, 1044590 edges, 4678 markings/sec, 160 secs
lola: sara is running 165 secs || 814179 markings, 1075602 edges, 4718 markings/sec, 165 secs
lola: sara is running 170 secs || 838023 markings, 1106212 edges, 4769 markings/sec, 170 secs
lola: sara is running 175 secs || 861840 markings, 1137080 edges, 4763 markings/sec, 175 secs
lola: sara is running 180 secs || 885701 markings, 1168497 edges, 4772 markings/sec, 180 secs
lola: sara is running 185 secs || 909631 markings, 1199514 edges, 4786 markings/sec, 185 secs
lola: sara is running 190 secs || 933434 markings, 1230666 edges, 4761 markings/sec, 190 secs
lola: sara is running 195 secs || 957204 markings, 1262156 edges, 4754 markings/sec, 195 secs
lola: sara is running 200 secs || 981338 markings, 1295551 edges, 4827 markings/sec, 200 secs
lola: sara is running 205 secs || 1005137 markings, 1326888 edges, 4760 markings/sec, 205 secs
lola: sara is running 210 secs || 1029078 markings, 1358775 edges, 4788 markings/sec, 210 secs
lola: sara is running 215 secs || 1053714 markings, 1391320 edges, 4927 markings/sec, 215 secs
lola: sara is running 220 secs || 1078699 markings, 1424087 edges, 4997 markings/sec, 220 secs
lola: sara is running 225 secs || 1103775 markings, 1458847 edges, 5015 markings/sec, 225 secs
lola: sara is running 230 secs || 1128562 markings, 1493012 edges, 4957 markings/sec, 230 secs
lola: sara is running 235 secs || 1153967 markings, 1528914 edges, 5081 markings/sec, 235 secs
lola: sara is running 240 secs || 1179092 markings, 1562327 edges, 5025 markings/sec, 240 secs
lola: sara is running 245 secs || 1204059 markings, 1596246 edges, 4993 markings/sec, 245 secs
lola: sara is running 250 secs || 1229662 markings, 1631431 edges, 5121 markings/sec, 250 secs
lola: sara is running 255 secs || 1255391 markings, 1666344 edges, 5146 markings/sec, 255 secs
lola: sara is running 260 secs || 1280667 markings, 1700081 edges, 5055 markings/sec, 260 secs
lola: sara is running 265 secs || 1306257 markings, 1735157 edges, 5118 markings/sec, 265 secs
lola: sara is running 270 secs || 1331501 markings, 1769316 edges, 5049 markings/sec, 270 secs
lola: sara is running 275 secs || 1356081 markings, 1802548 edges, 4916 markings/sec, 275 secs
lola: sara is running 280 secs || 1381120 markings, 1835574 edges, 5008 markings/sec, 280 secs
lola: sara is running 285 secs || 1406224 markings, 1867946 edges, 5021 markings/sec, 285 secs
lola: sara is running 290 secs || 1430868 markings, 1901306 edges, 4929 markings/sec, 290 secs
lola: sara is running 295 secs || 1455515 markings, 1933995 edges, 4929 markings/sec, 295 secs
lola: sara is running 300 secs || 1480284 markings, 1967864 edges, 4954 markings/sec, 300 secs
lola: sara is running 305 secs || 1505732 markings, 2001177 edges, 5090 markings/sec, 305 secs
lola: sara is running 310 secs || 1531196 markings, 2035966 edges, 5093 markings/sec, 310 secs
lola: sara is running 315 secs || 1556538 markings, 2069211 edges, 5068 markings/sec, 315 secs
lola: sara is running 320 secs || 1581114 markings, 2101354 edges, 4915 markings/sec, 320 secs
lola: sara is running 325 secs || 1605768 markings, 2133598 edges, 4931 markings/sec, 325 secs
lola: sara is running 330 secs || 1631072 markings, 2166921 edges, 5061 markings/sec, 330 secs
lola: sara is running 335 secs || 1656122 markings, 2199950 edges, 5010 markings/sec, 335 secs
lola: sara is running 340 secs || 1680642 markings, 2232389 edges, 4904 markings/sec, 340 secs
lola: sara is running 345 secs || 1706025 markings, 2265182 edges, 5077 markings/sec, 345 secs
lola: sara is running 350 secs || 1731382 markings, 2298819 edges, 5071 markings/sec, 350 secs
lola: sara is running 355 secs || 1756671 markings, 2332471 edges, 5058 markings/sec, 355 secs
lola: sara is running 360 secs || 1782443 markings, 2367995 edges, 5154 markings/sec, 360 secs
lola: sara is running 365 secs || 1808466 markings, 2403890 edges, 5205 markings/sec, 365 secs
lola: sara is running 370 secs || 1833906 markings, 2437301 edges, 5088 markings/sec, 370 secs
lola: sara is running 375 secs || 1859337 markings, 2472151 edges, 5086 markings/sec, 375 secs
lola: sara is running 380 secs || 1884643 markings, 2506649 edges, 5061 markings/sec, 380 secs
lola: sara is running 385 secs || 1909247 markings, 2539826 edges, 4921 markings/sec, 385 secs
lola: sara is running 390 secs || 1934084 markings, 2572774 edges, 4967 markings/sec, 390 secs
lola: sara is running 395 secs || 1959056 markings, 2604955 edges, 4994 markings/sec, 395 secs
lola: sara is running 400 secs || 1983487 markings, 2638308 edges, 4886 markings/sec, 400 secs
lola: sara is running 405 secs || 2007856 markings, 2670343 edges, 4874 markings/sec, 405 secs
lola: sara is running 410 secs || 2032159 markings, 2702806 edges, 4861 markings/sec, 410 secs
lola: sara is running 415 secs || 2056821 markings, 2734611 edges, 4932 markings/sec, 415 secs
lola: sara is running 420 secs || 2081302 markings, 2766978 edges, 4896 markings/sec, 420 secs
lola: sara is running 425 secs || 2105990 markings, 2799181 edges, 4938 markings/sec, 425 secs
lola: sara is running 430 secs || 2130988 markings, 2832587 edges, 5000 markings/sec, 430 secs
lola: sara is running 435 secs || 2155941 markings, 2866248 edges, 4991 markings/sec, 435 secs
lola: sara is running 440 secs || 2180633 markings, 2897946 edges, 4938 markings/sec, 440 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2183449 markings, 2901320 edges
lola: ========================================
lola: subprocess 11 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t3064)))
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 1 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 DLCround-PT-10b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 385 markings, 384 edges
lola: ========================================
lola: subprocess 12 will run for 735 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5086)))
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 1 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 DLCround-PT-10b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 236 markings, 235 edges
lola: ========================================
lola: subprocess 13 will run for 980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t604) AND (NOT FIREABLE(t176) OR NOT FIREABLE(t971) OR NOT FIREABLE(t3497)))))
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 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 14 will run for 1470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t5858) AND NOT FIREABLE(t2158) AND FIREABLE(t3731) AND FIREABLE(t327) AND FIREABLE(t3580))))
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 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 21475 markings, 26941 edges, 4295 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 44598 markings, 57543 edges, 4625 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52967 markings, 68693 edges
lola: ========================================
lola: subprocess 15 will run for 2929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t5945) AND NOT FIREABLE(t4286)) OR (NOT FIREABLE(t2362) AND NOT FIREABLE(t5418)) OR (FIREABLE(t2704) AND FIREABLE(t386) AND (FIREABLE(t5471) OR FIREABLE(t1826)) AND FIREABLE(t4908)))))
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 1 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 116 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 170 markings, 169 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes no yes no yes no no yes yes yes no
FORMULA DLCround-PT-10b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
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="DLCround-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-full"
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/DLCround-PT-10b.tgz
mv DLCround-PT-10b 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 mcc4mcc-full"
echo " Input is DLCround-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-152649742900112"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 ;