fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r071-smll-152649743900112
Last Updated
June 26, 2018

About the Execution of M4M.struct for DLCround-PT-10b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2612.550 658111.00 1236263.00 2606.10 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-structural
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 r071-smll-152649743900112
=====================================================================

--------------------
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 1526689903884


BK_STOP 1526690561995

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
ReachabilityFireability @ DLCround-PT-10b @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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 235 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 || 24493 markings, 31354 edges, 4899 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 48073 markings, 62662 edges, 4716 markings/sec, 5 secs
lola: sara is running 10 secs || 72354 markings, 95728 edges, 4856 markings/sec, 10 secs
lola: sara is running 15 secs || 96156 markings, 127732 edges, 4760 markings/sec, 15 secs
lola: sara is running 20 secs || 119588 markings, 160193 edges, 4686 markings/sec, 20 secs
lola: sara is running 25 secs || 142817 markings, 192025 edges, 4646 markings/sec, 25 secs
lola: sara is running 30 secs || 166268 markings, 225510 edges, 4690 markings/sec, 30 secs
lola: sara is running 35 secs || 190321 markings, 258772 edges, 4811 markings/sec, 35 secs
lola: sara is running 40 secs || 213371 markings, 292961 edges, 4610 markings/sec, 40 secs
lola: sara is running 45 secs || 237008 markings, 326849 edges, 4727 markings/sec, 45 secs
lola: sara is running 50 secs || 260559 markings, 359983 edges, 4710 markings/sec, 50 secs
lola: sara is running 55 secs || 284665 markings, 393402 edges, 4821 markings/sec, 55 secs
lola: sara is running 60 secs || 308981 markings, 426621 edges, 4863 markings/sec, 60 secs
lola: sara is running 65 secs || 333126 markings, 459909 edges, 4829 markings/sec, 65 secs
lola: sara is running 70 secs || 357106 markings, 492528 edges, 4796 markings/sec, 70 secs
lola: sara is running 75 secs || 380797 markings, 525425 edges, 4738 markings/sec, 75 secs
lola: sara is running 80 secs || 405984 markings, 555931 edges, 5037 markings/sec, 80 secs
lola: sara is running 85 secs || 431186 markings, 583361 edges, 5040 markings/sec, 85 secs
lola: sara is running 90 secs || 456717 markings, 611406 edges, 5106 markings/sec, 90 secs
lola: sara is running 95 secs || 482160 markings, 639365 edges, 5089 markings/sec, 95 secs
lola: sara is running 100 secs || 508097 markings, 668144 edges, 5187 markings/sec, 100 secs
lola: sara is running 105 secs || 533896 markings, 696665 edges, 5160 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 || 129432 markings, 142268 edges, 25886 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 257363 markings, 283653 edges, 25586 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 || 68994 markings, 74333 edges, 13799 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 132370 markings, 142286 edges, 12675 markings/sec, 5 secs
lola: sara is running 10 secs || 195733 markings, 210249 edges, 12673 markings/sec, 10 secs

lola: sara is running 15 secs || 258888 markings, 278051 edges, 12631 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 282 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 || 23357 markings, 28704 edges, 4671 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 || 24578 markings, 32004 edges, 4916 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 49167 markings, 63170 edges, 4918 markings/sec, 5 secs
lola: sara is running 10 secs || 73830 markings, 95414 edges, 4933 markings/sec, 10 secs
lola: sara is running 15 secs || 98686 markings, 127818 edges, 4971 markings/sec, 15 secs
lola: sara is running 20 secs || 123373 markings, 160450 edges, 4937 markings/sec, 20 secs
lola: sara is running 25 secs || 148129 markings, 193713 edges, 4951 markings/sec, 25 secs
lola: sara is running 30 secs || 172682 markings, 226280 edges, 4911 markings/sec, 30 secs
lola: sara is running 35 secs || 196830 markings, 257649 edges, 4830 markings/sec, 35 secs
lola: sara is running 40 secs || 220956 markings, 288849 edges, 4825 markings/sec, 40 secs
lola: sara is running 45 secs || 244961 markings, 320664 edges, 4801 markings/sec, 45 secs
lola: sara is running 50 secs || 268989 markings, 352366 edges, 4806 markings/sec, 50 secs
lola: sara is running 55 secs || 293075 markings, 383377 edges, 4817 markings/sec, 55 secs
lola: sara is running 60 secs || 317120 markings, 415622 edges, 4809 markings/sec, 60 secs
lola: sara is running 65 secs || 341318 markings, 447876 edges, 4840 markings/sec, 65 secs
lola: sara is running 70 secs || 365616 markings, 480234 edges, 4860 markings/sec, 70 secs
lola: sara is running 75 secs || 389378 markings, 513101 edges, 4752 markings/sec, 75 secs
lola: sara is running 80 secs || 411923 markings, 543249 edges, 4509 markings/sec, 80 secs
lola: sara is running 85 secs || 436504 markings, 574764 edges, 4916 markings/sec, 85 secs
lola: sara is running 90 secs || 460775 markings, 607549 edges, 4854 markings/sec, 90 secs
lola: sara is running 95 secs || 484728 markings, 641081 edges, 4791 markings/sec, 95 secs
lola: sara is running 100 secs || 508374 markings, 671998 edges, 4729 markings/sec, 100 secs
lola: sara is running 105 secs || 531924 markings, 703025 edges, 4710 markings/sec, 105 secs
lola: sara is running 110 secs || 555451 markings, 733064 edges, 4705 markings/sec, 110 secs
lola: sara is running 115 secs || 580703 markings, 766842 edges, 5050 markings/sec, 115 secs
lola: sara is running 120 secs || 604886 markings, 799952 edges, 4837 markings/sec, 120 secs
lola: sara is running 125 secs || 629071 markings, 831177 edges, 4837 markings/sec, 125 secs
lola: sara is running 130 secs || 653503 markings, 865018 edges, 4886 markings/sec, 130 secs
lola: sara is running 135 secs || 677768 markings, 896563 edges, 4853 markings/sec, 135 secs
lola: sara is running 140 secs || 702040 markings, 928224 edges, 4854 markings/sec, 140 secs
lola: sara is running 145 secs || 726321 markings, 960063 edges, 4856 markings/sec, 145 secs
lola: sara is running 150 secs || 750625 markings, 991947 edges, 4861 markings/sec, 150 secs
lola: sara is running 155 secs || 775394 markings, 1025184 edges, 4954 markings/sec, 155 secs
lola: sara is running 160 secs || 799452 markings, 1056576 edges, 4812 markings/sec, 160 secs
lola: sara is running 165 secs || 823234 markings, 1087252 edges, 4756 markings/sec, 165 secs
lola: sara is running 170 secs || 847076 markings, 1117729 edges, 4768 markings/sec, 170 secs
lola: sara is running 175 secs || 869963 markings, 1147507 edges, 4577 markings/sec, 175 secs
lola: sara is running 180 secs || 895117 markings, 1180591 edges, 5031 markings/sec, 180 secs
lola: sara is running 185 secs || 920234 markings, 1213223 edges, 5023 markings/sec, 185 secs
lola: sara is running 190 secs || 945375 markings, 1246665 edges, 5028 markings/sec, 190 secs
lola: sara is running 195 secs || 970652 markings, 1280389 edges, 5055 markings/sec, 195 secs
lola: sara is running 200 secs || 996102 markings, 1315144 edges, 5090 markings/sec, 200 secs
lola: sara is running 205 secs || 1021168 markings, 1348420 edges, 5013 markings/sec, 205 secs
lola: sara is running 210 secs || 1046715 markings, 1381999 edges, 5109 markings/sec, 210 secs
lola: sara is running 215 secs || 1071505 markings, 1414481 edges, 4958 markings/sec, 215 secs
lola: sara is running 220 secs || 1095839 markings, 1448162 edges, 4867 markings/sec, 220 secs
lola: sara is running 225 secs || 1120052 markings, 1481842 edges, 4843 markings/sec, 225 secs
lola: sara is running 230 secs || 1144387 markings, 1515352 edges, 4867 markings/sec, 230 secs
lola: sara is running 235 secs || 1169009 markings, 1549369 edges, 4924 markings/sec, 235 secs
lola: sara is running 240 secs || 1193211 markings, 1581086 edges, 4840 markings/sec, 240 secs
lola: sara is running 245 secs || 1217669 markings, 1614394 edges, 4892 markings/sec, 245 secs
lola: sara is running 250 secs || 1242908 markings, 1650069 edges, 5048 markings/sec, 250 secs
lola: sara is running 255 secs || 1267610 markings, 1682227 edges, 4940 markings/sec, 255 secs
lola: sara is running 260 secs || 1291966 markings, 1715080 edges, 4871 markings/sec, 260 secs
lola: sara is running 265 secs || 1316623 markings, 1749478 edges, 4931 markings/sec, 265 secs
lola: sara is running 270 secs || 1340835 markings, 1782327 edges, 4842 markings/sec, 270 secs
lola: sara is running 275 secs || 1364499 markings, 1813886 edges, 4733 markings/sec, 275 secs
lola: sara is running 280 secs || 1388636 markings, 1845352 edges, 4827 markings/sec, 280 secs
lola: sara is running 285 secs || 1412563 markings, 1876408 edges, 4785 markings/sec, 285 secs
lola: sara is running 290 secs || 1436321 markings, 1908462 edges, 4752 markings/sec, 290 secs
lola: sara is running 295 secs || 1459459 markings, 1939360 edges, 4628 markings/sec, 295 secs
lola: sara is running 300 secs || 1483940 markings, 1972684 edges, 4896 markings/sec, 300 secs
lola: sara is running 305 secs || 1509065 markings, 2005554 edges, 5025 markings/sec, 305 secs
lola: sara is running 310 secs || 1534135 markings, 2039715 edges, 5014 markings/sec, 310 secs
lola: sara is running 315 secs || 1559032 markings, 2072464 edges, 4979 markings/sec, 315 secs
lola: sara is running 320 secs || 1583302 markings, 2104549 edges, 4854 markings/sec, 320 secs
lola: sara is running 325 secs || 1607813 markings, 2136073 edges, 4902 markings/sec, 325 secs
lola: sara is running 330 secs || 1632796 markings, 2169176 edges, 4997 markings/sec, 330 secs
lola: sara is running 335 secs || 1657603 markings, 2201942 edges, 4961 markings/sec, 335 secs
lola: sara is running 340 secs || 1681890 markings, 2234088 edges, 4857 markings/sec, 340 secs
lola: sara is running 345 secs || 1706969 markings, 2266408 edges, 5016 markings/sec, 345 secs
lola: sara is running 350 secs || 1732160 markings, 2299824 edges, 5038 markings/sec, 350 secs
lola: sara is running 355 secs || 1756042 markings, 2331711 edges, 4776 markings/sec, 355 secs
lola: sara is running 360 secs || 1782338 markings, 2367817 edges, 5259 markings/sec, 360 secs
lola: sara is running 365 secs || 1808878 markings, 2404401 edges, 5308 markings/sec, 365 secs
lola: sara is running 370 secs || 1834807 markings, 2438745 edges, 5186 markings/sec, 370 secs
lola: sara is running 375 secs || 1860846 markings, 2474280 edges, 5208 markings/sec, 375 secs
lola: sara is running 380 secs || 1886610 markings, 2509221 edges, 5153 markings/sec, 380 secs
lola: sara is running 385 secs || 1911643 markings, 2543059 edges, 5007 markings/sec, 385 secs
lola: sara is running 390 secs || 1936670 markings, 2576013 edges, 5005 markings/sec, 390 secs
lola: sara is running 395 secs || 1961251 markings, 2607744 edges, 4916 markings/sec, 395 secs
lola: sara is running 400 secs || 1985361 markings, 2640869 edges, 4822 markings/sec, 400 secs
lola: sara is running 405 secs || 2009402 markings, 2672541 edges, 4808 markings/sec, 405 secs
lola: sara is running 410 secs || 2033398 markings, 2704333 edges, 4799 markings/sec, 410 secs
lola: sara is running 415 secs || 2057896 markings, 2736064 edges, 4900 markings/sec, 415 secs
lola: sara is running 420 secs || 2082194 markings, 2768220 edges, 4860 markings/sec, 420 secs
lola: sara is running 425 secs || 2106748 markings, 2800181 edges, 4911 markings/sec, 425 secs
lola: sara is running 430 secs || 2131660 markings, 2833401 edges, 4982 markings/sec, 430 secs
lola: sara is running 435 secs || 2155974 markings, 2866314 edges, 4863 markings/sec, 435 secs
lola: sara is running 440 secs || 2179923 markings, 2897051 edges, 4790 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 587 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 734 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 979 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: state equation: calling and running 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 1469 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 || 22260 markings, 28020 edges, 4452 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 45731 markings, 59011 edges, 4694 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 2926 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: state equation: calling and running 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-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r071-smll-152649743900112"
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 ;