fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r082-blw3-152649949900490
Last Updated
June 26, 2018

About the Execution of M4M.full for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14494.730 744503.00 1416603.00 595.70 TFTTTFTTTF?FTTTF 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 3.4M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is EnergyBus-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949900490
=====================================================================


--------------------
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 EnergyBus-PT-none-ReachabilityFireability-00
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-01
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-02
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-03
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-04
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-05
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-06
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-07
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-08
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-09
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-10
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-11
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-12
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-13
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-14
FORMULA_NAME EnergyBus-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527435130016


BK_STOP 1527435874519

--------------------
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 EnergyBus-PT-none as instance name.
Using EnergyBus 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': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 32654, 'Memory': 1230.02, 'Tool': 'itstools'}, {'Time': 34163, 'Memory': 1324.13, 'Tool': 'itstools'}, {'Time': 629631, 'Memory': 6694.96, 'Tool': 'marcie'}, {'Time': 640239, 'Memory': 6695.09, 'Tool': 'marcie'}, {'Time': 1622231, 'Memory': 15585.09, 'Tool': 'lola'}, {'Time': 1638529, 'Memory': 14078.07, 'Tool': 'lola'}, {'Time': 3411463, 'Memory': 3237.84, 'Tool': 'gspn'}, {'Time': 3557819, 'Memory': 3267.29, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 49.679396092362346x far from the best tool itstools.
ReachabilityFireability lola EnergyBus-PT-none...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
EnergyBus-PT-none: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
EnergyBus-PT-none: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ EnergyBus-PT-none @ 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: 4587/65536 symbol table entries, 981 collisions
lola: preprocessing...
lola: finding significant places
lola: 157 places, 4430 transitions, 134 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1049 transition conflict sets
lola: TASK
lola: reading formula from EnergyBus-PT-none-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t3389) AND FIREABLE(t3466)) OR FIREABLE(t4403)))) : E (F ((NOT FIREABLE(t4110) AND (NOT FIREABLE(t4296) OR NOT FIREABLE(t935)) AND FIREABLE(t2617)))) : E (F (FIREABLE(t1469))) : E (F ((FIREABLE(t3194) OR FIREABLE(t841) OR FIREABLE(t3011) OR FIREABLE(t3735) OR FIREABLE(t1018) OR (NOT FIREABLE(t138) AND NOT FIREABLE(t1231) AND FIREABLE(t2223) AND FIREABLE(t2109) AND FIREABLE(t2107))))) : E (F ((FIREABLE(t226) OR FIREABLE(t4361)))) : E (F ((FIREABLE(t2181) AND FIREABLE(t3976) AND FIREABLE(t1900)))) : E (F (FIREABLE(t2196))) : E (F ((FIREABLE(t4274) AND NOT FIREABLE(t4030)))) : A (G (((FIREABLE(t3843) AND FIREABLE(t2955)) OR NOT FIREABLE(t4120) OR FIREABLE(t4282) OR NOT FIREABLE(t391)))) : E (F ((NOT FIREABLE(t3522) AND (FIREABLE(t4256) OR FIREABLE(t1544)) AND (FIREABLE(t1210) OR NOT FIREABLE(t481)) AND FIREABLE(t2707)))) : E (F (FIREABLE(t3436))) : A (G (((NOT FIREABLE(t1532) OR (NOT FIREABLE(t2078) AND NOT FIREABLE(t604))) AND NOT FIREABLE(t121)))) : E (F ((FIREABLE(t724) AND (NOT FIREABLE(t288) OR NOT FIREABLE(t4137) OR (NOT FIREABLE(t2130) AND NOT FIREABLE(t3052)))))) : E (F (((NOT FIREABLE(t2994) OR NOT FIREABLE(t418) OR NOT FIREABLE(t80)) AND (FIREABLE(t716) OR FIREABLE(t4396))))) : A (G (((NOT FIREABLE(t4086) AND NOT FIREABLE(t4303)) OR (NOT FIREABLE(t3236) AND NOT FIREABLE(t3600)) OR (NOT FIREABLE(t1942) AND NOT FIREABLE(t264) AND FIREABLE(t1755))))) : A (G ((FIREABLE(t2097) OR NOT FIREABLE(t828))))
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 (((NOT FIREABLE(t3389) AND FIREABLE(t3466)) OR FIREABLE(t4403))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 29 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 396 markings, 746 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t4110) AND (NOT FIREABLE(t4296) OR NOT FIREABLE(t935)) AND FIREABLE(t2617))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 450 literals and 45 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability.sara.
lola: sara is running 0 secs || 36809 markings, 69986 edges, 7362 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 68318 markings, 132298 edges, 6302 markings/sec, 5 secs

lola: sara is running 10 secs || 106387 markings, 207785 edges, 7614 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1469)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 673 markings, 1243 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3194) OR FIREABLE(t841) OR FIREABLE(t3011) OR FIREABLE(t3735) OR FIREABLE(t1018) OR (NOT FIREABLE(t138) AND NOT FIREABLE(t1231) AND FIREABLE(t2223) AND FIREABLE(t2109) AND FIREABLE(t2107)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 118 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 26894 markings, 50245 edges, 5379 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 54336 markings, 102219 edges, 5488 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 54554 markings, 102626 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t226) OR FIREABLE(t4361))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2181) AND FIREABLE(t3976) AND FIREABLE(t1900))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 11905 markings, 23186 edges, 2381 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 26644 markings, 51313 edges, 2948 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 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2196)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1038 markings, 1989 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4274) AND NOT FIREABLE(t4030))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t3843) AND FIREABLE(t2955)) OR NOT FIREABLE(t4120) OR FIREABLE(t4282) OR NOT FIREABLE(t391))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 648 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 37119 markings, 69004 edges, 7424 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 70834 markings, 131739 edges, 6743 markings/sec, 5 secs

lola: sara is running 10 secs || 103962 markings, 193468 edges, 6626 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3522) AND (FIREABLE(t4256) OR FIREABLE(t1544)) AND (FIREABLE(t1210) OR NOT FIREABLE(t481)) AND FIREABLE(t2707))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 122 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-9.sara.
lola: sara is running 0 secs || 36312 markings, 72442 edges, 7262 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 72491 markings, 144540 edges, 7236 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 10 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3436)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 10564 markings, 21462 edges, 2113 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 21603 markings, 43723 edges, 2208 markings/sec, 5 secs
lola: sara is running 10 secs || 33969 markings, 68620 edges, 2473 markings/sec, 10 secs
lola: sara is running 15 secs || 46015 markings, 92901 edges, 2409 markings/sec, 15 secs
lola: sara is running 20 secs || 57516 markings, 115980 edges, 2300 markings/sec, 20 secs
lola: sara is running 25 secs || 68129 markings, 137574 edges, 2123 markings/sec, 25 secs
lola: sara is running 30 secs || 80184 markings, 161959 edges, 2411 markings/sec, 30 secs
lola: sara is running 35 secs || 91465 markings, 184646 edges, 2256 markings/sec, 35 secs
lola: sara is running 40 secs || 102856 markings, 207608 edges, 2278 markings/sec, 40 secs
lola: sara is running 45 secs || 114112 markings, 230483 edges, 2251 markings/sec, 45 secs
lola: sara is running 50 secs || 125342 markings, 252975 edges, 2246 markings/sec, 50 secs
lola: sara is running 55 secs || 136532 markings, 275653 edges, 2238 markings/sec, 55 secs
lola: sara is running 60 secs || 147511 markings, 298258 edges, 2196 markings/sec, 60 secs
lola: sara is running 65 secs || 158265 markings, 320285 edges, 2151 markings/sec, 65 secs
lola: sara is running 70 secs || 170173 markings, 344386 edges, 2382 markings/sec, 70 secs
lola: sara is running 75 secs || 181217 markings, 366777 edges, 2209 markings/sec, 75 secs
lola: sara is running 80 secs || 192956 markings, 390603 edges, 2348 markings/sec, 80 secs
lola: sara is running 85 secs || 204603 markings, 414580 edges, 2329 markings/sec, 85 secs
lola: sara is running 90 secs || 216251 markings, 438087 edges, 2330 markings/sec, 90 secs
lola: sara is running 95 secs || 228529 markings, 463096 edges, 2456 markings/sec, 95 secs
lola: sara is running 100 secs || 240781 markings, 488029 edges, 2450 markings/sec, 100 secs
lola: sara is running 105 secs || 251439 markings, 509950 edges, 2132 markings/sec, 105 secs
lola: sara is running 110 secs || 261049 markings, 530348 edges, 1922 markings/sec, 110 secs
lola: sara is running 115 secs || 272882 markings, 554253 edges, 2367 markings/sec, 115 secs
lola: sara is running 120 secs || 284757 markings, 578869 edges, 2375 markings/sec, 120 secs
lola: sara is running 125 secs || 294733 markings, 599928 edges, 1995 markings/sec, 125 secs
lola: sara is running 130 secs || 304694 markings, 621039 edges, 1992 markings/sec, 130 secs
lola: sara is running 135 secs || 313938 markings, 640980 edges, 1849 markings/sec, 135 secs
lola: sara is running 140 secs || 325162 markings, 664365 edges, 2245 markings/sec, 140 secs
lola: sara is running 145 secs || 333639 markings, 682921 edges, 1695 markings/sec, 145 secs
lola: sara is running 150 secs || 344758 markings, 705964 edges, 2224 markings/sec, 150 secs
lola: sara is running 155 secs || 359023 markings, 735832 edges, 2853 markings/sec, 155 secs
lola: sara is running 160 secs || 370608 markings, 759892 edges, 2317 markings/sec, 160 secs
lola: sara is running 165 secs || 382586 markings, 784002 edges, 2396 markings/sec, 165 secs
lola: sara is running 170 secs || 394206 markings, 808327 edges, 2324 markings/sec, 170 secs
lola: sara is running 175 secs || 405177 markings, 833823 edges, 2194 markings/sec, 175 secs
lola: sara is running 180 secs || 430303 markings, 892301 edges, 5025 markings/sec, 180 secs
lola: sara is running 185 secs || 440790 markings, 919105 edges, 2097 markings/sec, 185 secs
lola: sara is running 190 secs || 451269 markings, 941126 edges, 2096 markings/sec, 190 secs
lola: sara is running 195 secs || 462585 markings, 965792 edges, 2263 markings/sec, 195 secs
lola: sara is running 200 secs || 471765 markings, 985681 edges, 1836 markings/sec, 200 secs
lola: sara is running 205 secs || 483346 markings, 1009164 edges, 2316 markings/sec, 205 secs
lola: sara is running 210 secs || 495406 markings, 1034779 edges, 2412 markings/sec, 210 secs
lola: sara is running 215 secs || 504767 markings, 1055506 edges, 1872 markings/sec, 215 secs
lola: sara is running 220 secs || 519083 markings, 1085160 edges, 2863 markings/sec, 220 secs
lola: sara is running 225 secs || 527101 markings, 1103019 edges, 1604 markings/sec, 225 secs
lola: sara is running 230 secs || 536721 markings, 1124169 edges, 1924 markings/sec, 230 secs
lola: sara is running 235 secs || 546010 markings, 1144173 edges, 1858 markings/sec, 235 secs
lola: sara is running 240 secs || 554793 markings, 1163704 edges, 1757 markings/sec, 240 secs
lola: sara is running 245 secs || 565390 markings, 1185854 edges, 2119 markings/sec, 245 secs
lola: sara is running 250 secs || 580602 markings, 1219107 edges, 3042 markings/sec, 250 secs
lola: sara is running 255 secs || 594645 markings, 1248934 edges, 2809 markings/sec, 255 secs
lola: sara is running 260 secs || 620120 markings, 1306563 edges, 5095 markings/sec, 260 secs
lola: sara is running 265 secs || 632612 markings, 1335476 edges, 2498 markings/sec, 265 secs
lola: sara is running 270 secs || 639686 markings, 1352354 edges, 1415 markings/sec, 270 secs
lola: sara is running 275 secs || 651608 markings, 1380277 edges, 2384 markings/sec, 275 secs
lola: sara is running 280 secs || 661952 markings, 1405078 edges, 2069 markings/sec, 280 secs
lola: sara is running 285 secs || 671217 markings, 1425717 edges, 1853 markings/sec, 285 secs
lola: sara is running 290 secs || 679719 markings, 1444679 edges, 1700 markings/sec, 290 secs
lola: sara is running 295 secs || 691818 markings, 1469567 edges, 2420 markings/sec, 295 secs
lola: sara is running 300 secs || 701983 markings, 1492152 edges, 2033 markings/sec, 300 secs
lola: sara is running 305 secs || 716133 markings, 1529941 edges, 2830 markings/sec, 305 secs
lola: sara is running 310 secs || 728792 markings, 1557288 edges, 2532 markings/sec, 310 secs
lola: sara is running 315 secs || 742236 markings, 1585962 edges, 2689 markings/sec, 315 secs
lola: sara is running 320 secs || 747839 markings, 1600169 edges, 1121 markings/sec, 320 secs
lola: sara is running 325 secs || 755364 markings, 1617720 edges, 1505 markings/sec, 325 secs
lola: sara is running 330 secs || 763664 markings, 1636777 edges, 1660 markings/sec, 330 secs
lola: sara is running 335 secs || 771355 markings, 1654407 edges, 1538 markings/sec, 335 secs
lola: sara is running 340 secs || 780390 markings, 1674251 edges, 1807 markings/sec, 340 secs
lola: sara is running 345 secs || 790111 markings, 1696953 edges, 1944 markings/sec, 345 secs
lola: sara is running 350 secs || 799235 markings, 1716996 edges, 1825 markings/sec, 350 secs
lola: sara is running 355 secs || 805552 markings, 1732147 edges, 1263 markings/sec, 355 secs
lola: sara is running 360 secs || 816331 markings, 1755538 edges, 2156 markings/sec, 360 secs
lola: sara is running 365 secs || 829662 markings, 1784695 edges, 2666 markings/sec, 365 secs
lola: sara is running 370 secs || 839493 markings, 1805863 edges, 1966 markings/sec, 370 secs
lola: sara is running 375 secs || 858384 markings, 1847701 edges, 3778 markings/sec, 375 secs
lola: sara is running 380 secs || 865519 markings, 1865759 edges, 1427 markings/sec, 380 secs
lola: sara is running 385 secs || 876100 markings, 1888677 edges, 2116 markings/sec, 385 secs
lola: sara is running 390 secs || 886577 markings, 1911300 edges, 2095 markings/sec, 390 secs
lola: sara is running 395 secs || 895220 markings, 1931457 edges, 1729 markings/sec, 395 secs
lola: sara is running 400 secs || 904312 markings, 1951547 edges, 1818 markings/sec, 400 secs
lola: sara is running 405 secs || 913107 markings, 1971656 edges, 1759 markings/sec, 405 secs
lola: sara is running 410 secs || 923879 markings, 1994820 edges, 2154 markings/sec, 410 secs
lola: sara is running 415 secs || 932896 markings, 2014918 edges, 1803 markings/sec, 415 secs
lola: sara is running 420 secs || 944167 markings, 2039824 edges, 2254 markings/sec, 420 secs
lola: sara is running 425 secs || 955559 markings, 2066366 edges, 2278 markings/sec, 425 secs
lola: sara is running 430 secs || 966829 markings, 2090542 edges, 2254 markings/sec, 430 secs
lola: sara is running 435 secs || 975642 markings, 2110567 edges, 1763 markings/sec, 435 secs
lola: sara is running 440 secs || 983925 markings, 2129658 edges, 1657 markings/sec, 440 secs
lola: sara is running 445 secs || 996571 markings, 2157916 edges, 2529 markings/sec, 445 secs
lola: sara is running 450 secs || 1006468 markings, 2180422 edges, 1979 markings/sec, 450 secs
lola: sara is running 455 secs || 1016126 markings, 2202863 edges, 1932 markings/sec, 455 secs
lola: sara is running 460 secs || 1024948 markings, 2222795 edges, 1764 markings/sec, 460 secs
lola: sara is running 465 secs || 1040636 markings, 2256417 edges, 3138 markings/sec, 465 secs
lola: sara is running 470 secs || 1049082 markings, 2275418 edges, 1689 markings/sec, 470 secs
lola: sara is running 475 secs || 1052082 markings, 2284968 edges, 600 markings/sec, 475 secs
lola: sara is running 480 secs || 1056653 markings, 2296975 edges, 914 markings/sec, 480 secs
lola: sara is running 485 secs || 1060080 markings, 2307693 edges, 685 markings/sec, 485 secs
lola: sara is running 490 secs || 1064813 markings, 2320350 edges, 947 markings/sec, 490 secs
lola: sara is running 495 secs || 1073157 markings, 2341403 edges, 1669 markings/sec, 495 secs
lola: sara is running 500 secs || 1077072 markings, 2352664 edges, 783 markings/sec, 500 secs
lola: sara is running 505 secs || 1084500 markings, 2371722 edges, 1486 markings/sec, 505 secs
lola: sara is running 510 secs || 1104167 markings, 2417931 edges, 3933 markings/sec, 510 secs
lola: sara is running 515 secs || 1117322 markings, 2448422 edges, 2631 markings/sec, 515 secs
lola: sara is running 520 secs || 1125575 markings, 2467876 edges, 1651 markings/sec, 520 secs
lola: sara is running 525 secs || 1137598 markings, 2494124 edges, 2405 markings/sec, 525 secs
lola: sara is running 530 secs || 1139370 markings, 2500628 edges, 354 markings/sec, 530 secs
lola: sara is running 535 secs || 1140933 markings, 2506903 edges, 313 markings/sec, 535 secs
lola: sara is running 540 secs || 1150365 markings, 2528735 edges, 1886 markings/sec, 540 secs
lola: sara is running 545 secs || 1159933 markings, 2551260 edges, 1914 markings/sec, 545 secs
lola: sara is running 550 secs || 1171001 markings, 2574604 edges, 2214 markings/sec, 550 secs
lola: sara is running 555 secs || 1178399 markings, 2591851 edges, 1480 markings/sec, 555 secs
lola: sara is running 560 secs || 1182770 markings, 2603806 edges, 874 markings/sec, 560 secs
lola: sara is running 565 secs || 1189140 markings, 2619755 edges, 1274 markings/sec, 565 secs
lola: sara is running 570 secs || 1201022 markings, 2647110 edges, 2376 markings/sec, 570 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1532) OR (NOT FIREABLE(t2078) AND NOT FIREABLE(t604))) AND NOT FIREABLE(t121))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 33 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 440 markings, 809 edges
lola: ========================================
lola: subprocess 12 will run for 723 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t724) AND (NOT FIREABLE(t288) OR NOT FIREABLE(t4137) OR (NOT FIREABLE(t2130) AND NOT FIREABLE(t3052))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 223 literals and 23 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 184 markings, 312 edges
lola: ========================================
lola: subprocess 13 will run for 965 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t2994) OR NOT FIREABLE(t418) OR NOT FIREABLE(t80)) AND (FIREABLE(t716) OR FIREABLE(t4396)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 141 literals and 27 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 125 markings, 229 edges
lola: ========================================
lola: subprocess 14 will run for 1447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t4086) AND NOT FIREABLE(t4303)) OR (NOT FIREABLE(t3236) AND NOT FIREABLE(t3600)) OR (NOT FIREABLE(t1942) AND NOT FIREABLE(t264) AND FIREABLE(t1755)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 362 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 12522 markings, 27081 edges, 2504 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 24301 markings, 52918 edges, 2356 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2097) OR NOT FIREABLE(t828))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 45 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to EnergyBus-PT-none-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file EnergyBus-PT-none-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 30170 markings, 59683 edges, 6034 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 58297 markings, 114539 edges, 5625 markings/sec, 5 secs
lola: sara is running 10 secs || 88087 markings, 173203 edges, 5958 markings/sec, 10 secs
lola: sara is running 15 secs || 119919 markings, 234564 edges, 6366 markings/sec, 15 secs
lola: sara is running 20 secs || 150026 markings, 293744 edges, 6021 markings/sec, 20 secs
lola: sara is running 25 secs || 176456 markings, 345597 edges, 5286 markings/sec, 25 secs
lola: sara is running 30 secs || 204135 markings, 401662 edges, 5536 markings/sec, 30 secs
lola: sara is running 35 secs || 233066 markings, 460126 edges, 5786 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 242082 markings, 478555 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes yes yes no unknown no yes yes yes no
FORMULA EnergyBus-PT-none-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-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 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="EnergyBus-PT-none"
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/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none 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 EnergyBus-PT-none, 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 r082-blw3-152649949900490"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;