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 300K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K 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 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 139K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DES-PT-60b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646382300294
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526519717097


BK_STOP 1526520050102

--------------------
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 DES-PT-60b as instance name.
Using DES 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': None, 'Source Transition': False, 'Sink Transition': None, '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': 1694104, 'Memory': 6101.89, 'Tool': 'lola'}, {'Time': 1698902, 'Memory': 6054.28, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola DES-PT-60b...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DES-PT-60b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-60b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ DES-PT-60b @ 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: 989/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 519 places, 470 transitions, 454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 567 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60b-ReachabilityFireability.task
lola: A (G ((FIREABLE(t413) OR NOT FIREABLE(t118)))) : A (G (NOT FIREABLE(t391))) : E (F ((((FIREABLE(t390) OR FIREABLE(t261)) AND (FIREABLE(t304) OR FIREABLE(t297))) OR (FIREABLE(t278) AND FIREABLE(t287) AND (FIREABLE(t410) OR FIREABLE(t217))) OR FIREABLE(t423)))) : A (G (NOT FIREABLE(t23))) : E (F ((FIREABLE(t38) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t35) AND (FIREABLE(t260) OR FIREABLE(t114)) AND NOT FIREABLE(t363))))) : E (F (FIREABLE(t185))) : A (G (((FIREABLE(t227) AND (NOT FIREABLE(t178) OR NOT FIREABLE(t314))) OR NOT FIREABLE(t151)))) : A (G (NOT FIREABLE(t92))) : A (G (NOT FIREABLE(t394))) : E (F ((FIREABLE(t184) AND FIREABLE(t121) AND (FIREABLE(t338) OR FIREABLE(t221))))) : A (G (NOT FIREABLE(t464))) : E (F (((NOT FIREABLE(t447) OR NOT FIREABLE(t73)) AND (NOT FIREABLE(t338) OR NOT FIREABLE(t460)) AND FIREABLE(t330) AND FIREABLE(t59)))) : E (F ((FIREABLE(t440) OR FIREABLE(t8) OR (FIREABLE(t68) AND FIREABLE(t220))))) : A (G (((NOT FIREABLE(t162) AND NOT FIREABLE(t348)) OR (NOT FIREABLE(t444) AND NOT FIREABLE(t171)) OR NOT FIREABLE(t176) OR NOT FIREABLE(t120) OR FIREABLE(t121)))) : E (F ((FIREABLE(t161) AND NOT FIREABLE(t270)))) : E (F ((NOT FIREABLE(t234) AND NOT FIREABLE(t149) AND ((FIREABLE(t244) AND FIREABLE(t241) AND NOT FIREABLE(t438)) OR (FIREABLE(t112) AND (FIREABLE(t429) OR FIREABLE(t54)))))))
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(t413) OR NOT FIREABLE(t118))))
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 60 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (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 60 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t390) OR FIREABLE(t261)) AND (FIREABLE(t304) OR FIREABLE(t297))) OR (FIREABLE(t278) AND FIREABLE(t287) AND (FIREABLE(t410) OR FIREABLE(t217))) OR FIREABLE(t423))))
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 60 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 30 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t23)))
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 60 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-3.sarasara:
try reading problem file DES-PT-60b-ReachabilityFireability-2.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t38) OR (NOT FIREABLE(t80) AND NOT FIREABLE(t35) AND (FIREABLE(t260) OR FIREABLE(t114)) AND NOT FIREABLE(t363)))))
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 60 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 19 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t185)))
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 60 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1131496 markings, 1443085 edges, 226299 markings/sec, 0 secs
lola: sara is running 5 secs || 2256507 markings, 2961315 edges, 225002 markings/sec, 5 secs
lola: sara is running 10 secs || 3358636 markings, 4483518 edges, 220426 markings/sec, 10 secs
lola: sara is running 15 secs || 4423950 markings, 5960821 edges, 213063 markings/sec, 15 secs
lola: sara is running 20 secs || 5479744 markings, 7454129 edges, 211159 markings/sec, 20 secs
lola: sara is running 25 secs || 6384376 markings, 9005083 edges, 180926 markings/sec, 25 secs
lola: sara is running 30 secs || 7155561 markings, 10577104 edges, 154237 markings/sec, 30 secs
lola: sara is running 35 secs || 7915389 markings, 12122250 edges, 151966 markings/sec, 35 secs
lola: sara is running 40 secs || 8641607 markings, 13713681 edges, 145244 markings/sec, 40 secs
lola: sara is running 45 secs || 9408820 markings, 15372152 edges, 153443 markings/sec, 45 secs
lola: sara is running 50 secs || 10193045 markings, 16974653 edges, 156845 markings/sec, 50 secs
lola: sara is running 55 secs || 10978979 markings, 18579678 edges, 157187 markings/sec, 55 secs
lola: sara is running 60 secs || 11775682 markings, 20207966 edges, 159341 markings/sec, 60 secs
lola: sara is running 65 secs || 12553318 markings, 21795986 edges, 155527 markings/sec, 65 secs
lola: sara is running 70 secs || 13322729 markings, 23363802 edges, 153882 markings/sec, 70 secs
lola: sara is running 75 secs || 14068039 markings, 24973884 edges, 149062 markings/sec, 75 secs
lola: sara is running 80 secs || 14839041 markings, 26667334 edges, 154200 markings/sec, 80 secs
lola: sara is running 85 secs || 15639745 markings, 28304033 edges, 160141 markings/sec, 85 secs
lola: sara is running 90 secs || 16435107 markings, 29932940 edges, 159072 markings/sec, 90 secs
lola: sara is running 95 secs || 17237076 markings, 31577689 edges, 160394 markings/sec, 95 secs
lola: sara is running 100 secs || 18042685 markings, 33229690 edges, 161122 markings/sec, 100 secs
lola: sara is running 105 secs || 18818511 markings, 34811003 edges, 155165 markings/sec, 105 secs
lola: sara is running 110 secs || 19603949 markings, 36414192 edges, 157088 markings/sec, 110 secs
lola: sara is running 115 secs || 20359714 markings, 38059269 edges, 151153 markings/sec, 115 secs
lola: sara is running 120 secs || 21143136 markings, 39771800 edges, 156684 markings/sec, 120 secs
lola: sara is running 125 secs || 21952860 markings, 41428450 edges, 161945 markings/sec, 125 secs
lola: sara is running 130 secs || 22758519 markings, 43083245 edges, 161132 markings/sec, 130 secs
lola: sara is running 135 secs || 23558868 markings, 44723836 edges, 160070 markings/sec, 135 secs
lola: sara is running 140 secs || 24371092 markings, 46388408 edges, 162445 markings/sec, 140 secs
lola: sara is running 145 secs || 25186203 markings, 48063288 edges, 163022 markings/sec, 145 secs
lola: sara is running 150 secs || 25986996 markings, 49704929 edges, 160159 markings/sec, 150 secs
lola: sara is running 155 secs || 26792971 markings, 51354896 edges, 161195 markings/sec, 155 secs
lola: sara is running 160 secs || 27583196 markings, 53059423 edges, 158045 markings/sec, 160 secs
lola: sara is running 165 secs || 28387652 markings, 54805210 edges, 160891 markings/sec, 165 secs
lola: sara is running 170 secs || 29201715 markings, 56510651 edges, 162813 markings/sec, 170 secs
lola: sara is running 175 secs || 30006055 markings, 58160699 edges, 160868 markings/sec, 175 secs
lola: sara is running 180 secs || 30810226 markings, 59807207 edges, 160834 markings/sec, 180 secs
lola: sara is running 185 secs || 31622115 markings, 61473534 edges, 162378 markings/sec, 185 secs
lola: sara is running 190 secs || 32430536 markings, 63133098 edges, 161684 markings/sec, 190 secs
lola: sara is running 195 secs || 33218331 markings, 64740887 edges, 157559 markings/sec, 195 secs
lola: sara is running 200 secs || 34011098 markings, 66361187 edges, 158553 markings/sec, 200 secs
lola: sara is running 205 secs || 34772847 markings, 68012501 edges, 152350 markings/sec, 205 secs
lola: sara is running 210 secs || 35549162 markings, 69717137 edges, 155263 markings/sec, 210 secs
lola: sara is running 215 secs || 36360278 markings, 71377695 edges, 162223 markings/sec, 215 secs
lola: sara is running 220 secs || 37163878 markings, 73027061 edges, 160720 markings/sec, 220 secs
lola: sara is running 225 secs || 37969124 markings, 74679017 edges, 161049 markings/sec, 225 secs
lola: sara is running 230 secs || 38783623 markings, 76347523 edges, 162900 markings/sec, 230 secs
lola: sara is running 235 secs || 39595940 markings, 78017501 edges, 162463 markings/sec, 235 secs
lola: sara is running 240 secs || 40398637 markings, 79663356 edges, 160539 markings/sec, 240 secs
lola: sara is running 245 secs || 41206651 markings, 81318483 edges, 161603 markings/sec, 245 secs
lola: sara is running 250 secs || 41998334 markings, 83014836 edges, 158337 markings/sec, 250 secs
lola: sara is running 255 secs || 42797365 markings, 84753386 edges, 159806 markings/sec, 255 secs
lola: sara is running 260 secs || 43623726 markings, 86493865 edges, 165272 markings/sec, 260 secs
lola: sara is running 265 secs || 44463067 markings, 88220987 edges, 167868 markings/sec, 265 secs
lola: sara is running 270 secs || 45308550 markings, 89968344 edges, 169097 markings/sec, 270 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45456615 markings, 90312252 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t227) AND (NOT FIREABLE(t178) OR NOT FIREABLE(t314))) OR NOT FIREABLE(t151))))
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 60 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t92)))
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 60 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t394)))
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 60 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t184) AND FIREABLE(t121) AND (FIREABLE(t338) OR FIREABLE(t221)))))
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 60 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 DES-PT-60b-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 60 markings, 73 edges
lola: ========================================
lola: subprocess 10 will run for 542 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t464)))
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 60 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t447) OR NOT FIREABLE(t73)) AND (NOT FIREABLE(t338) OR NOT FIREABLE(t460)) AND FIREABLE(t330) AND FIREABLE(t59))))
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 60 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 9 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-11.sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-10.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 558213 markings, 777826 edges
lola: ========================================
lola: subprocess 12 will run for 813 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t440) OR FIREABLE(t8) OR (FIREABLE(t68) AND FIREABLE(t220)))))
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 60 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2166 markings, 2178 edges
lola: ========================================
lola: subprocess 13 will run for 1084 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t162) AND NOT FIREABLE(t348)) OR (NOT FIREABLE(t444) AND NOT FIREABLE(t171)) OR NOT FIREABLE(t176) OR NOT FIREABLE(t120) OR 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 60 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 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 79 markings, 97 edges
lola: ========================================
lola: subprocess 14 will run for 1627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t161) AND NOT FIREABLE(t270))))
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 60 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 3254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t234) AND NOT FIREABLE(t149) AND ((FIREABLE(t244) AND FIREABLE(t241) AND NOT FIREABLE(t438)) OR (FIREABLE(t112) AND (FIREABLE(t429) OR FIREABLE(t54)))))))
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 60 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 32 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no no no no no yes yes yes yes yeslola:
state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA DES-PT-60b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-ReachabilityFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="DES-PT-60b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-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/DES-PT-60b.tgz
mv DES-PT-60b execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is DES-PT-60b, 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 r054-smll-152646382300294"
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 ;