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-structural
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 r055-smll-152646383000294
=====================================================================

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


BK_STOP 1526520186843

--------------------
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 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': 'gspn'}].
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 stderr -----
----- Start make result stdout -----
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: state equation: calling and running sara
sara: try reading problem file 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: ========================================
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.sara
lola: SUBRESULT
lola: result: no
lola: lola: produced by: state space
state equation: calling and running sara
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
sara: try reading problem file DES-PT-60b-ReachabilityFireability-3.sara.
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: state equation: calling and running sara
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
sara: lola: try reading problem file DES-PT-60b-ReachabilityFireability-4.sara.
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

sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1134493 markings, 1446447 edges, 226899 markings/sec, 0 secs
lola: sara is running 5 secs || 2211678 markings, 2893851 edges, 215437 markings/sec, 5 secs
lola: sara is running 10 secs || 3257317 markings, 4342039 edges, 209128 markings/sec, 10 secs
lola: sara is running 15 secs || 4277301 markings, 5753837 edges, 203997 markings/sec, 15 secs
lola: sara is running 20 secs || 5277973 markings, 7180529 edges, 200134 markings/sec, 20 secs
lola: sara is running 25 secs || 6204428 markings, 8589251 edges, 185291 markings/sec, 25 secs
lola: sara is running 30 secs || 6905802 markings, 10057986 edges, 140275 markings/sec, 30 secs
lola: sara is running 35 secs || 7614946 markings, 11645106 edges, 141829 markings/sec, 35 secs
lola: sara is running 40 secs || 8364429 markings, 13165924 edges, 149897 markings/sec, 40 secs
lola: sara is running 45 secs || 9116453 markings, 14692504 edges, 150405 markings/sec, 45 secs
lola: sara is running 50 secs || 9853730 markings, 16184865 edges, 147455 markings/sec, 50 secs
lola: sara is running 55 secs || 10565480 markings, 17622571 edges, 142350 markings/sec, 55 secs
lola: sara is running 60 secs || 11252013 markings, 19209773 edges, 137307 markings/sec, 60 secs
lola: sara is running 65 secs || 12006899 markings, 20748486 edges, 150977 markings/sec, 65 secs
lola: sara is running 70 secs || 12762793 markings, 22284489 edges, 151179 markings/sec, 70 secs
lola: sara is running 75 secs || 13524608 markings, 23834437 edges, 152363 markings/sec, 75 secs

lola: sara is running 80 secs || 14251428 markings, 25302018 edges, 145364 markings/sec, 80 secs
lola: sara is running 85 secs || 14951418 markings, 26824582 edges, 139998 markings/sec, 85 secs
lola: sara is running 90 secs || 15695139 markings, 28434719 edges, 148744 markings/sec, 90 secs
lola: sara is running 95 secs || 16459551 markings, 29990724 edges, 152882 markings/sec, 95 secs
lola: sara is running 100 secs || 17227308 markings, 31554621 edges, 153551 markings/sec, 100 secs
lola: sara is running 105 secs || 17989602 markings, 33105706 edges, 152459 markings/sec, 105 secs
lola: sara is running 110 secs || 18729607 markings, 34604178 edges, 148001 markings/sec, 110 secs
lola: sara is running 115 secs || 19467806 markings, 36199838 edges, 147640 markings/sec, 115 secs
lola: sara is running 120 secs || 20241941 markings, 37898322 edges, 154827 markings/sec, 120 secs
lola: sara is running 125 secs || 21040097 markings, 39528510 edges, 159631 markings/sec, 125 secs
lola: sara is running 130 secs || 21836721 markings, 41160923 edges, 159325 markings/sec, 130 secs
lola: sara is running 135 secs || 22639242 markings, 42807076 edges, 160504 markings/sec, 135 secs
lola: sara is running 140 secs || 23449204 markings, 44467550 edges, 161992 markings/sec, 140 secs
lola: sara is running 145 secs || 24252101 markings, 46112226 edges, 160579 markings/sec, 145 secs
lola: sara is running 150 secs || 25054023 markings, 47756552 edges, 160384 markings/sec, 150 secs
lola: sara is running 155 secs || 25849464 markings, 49407391 edges, 159088 markings/sec, 155 secs
lola: sara is running 160 secs || 26629451 markings, 51118746 edges, 155997 markings/sec, 160 secs
lola: sara is running 165 secs || 27443128 markings, 52866759 edges, 162735 markings/sec, 165 secs
lola: sara is running 170 secs || 28271254 markings, 54568367 edges, 165625 markings/sec, 170 secs
lola: sara is running 175 secs || 29081162 markings, 56231496 edges, 161982 markings/sec, 175 secs
lola: sara is running 180 secs || 29883806 markings, 57875903 edges, 160529 markings/sec, 180 secs
lola: sara is running 185 secs || 30685893 markings, 59515855 edges, 160417 markings/sec, 185 secs
lola: sara is running 190 secs || 31475554 markings, 61132960 edges, 157932 markings/sec, 190 secs
lola: sara is running 195 secs || 32255629 markings, 62725956 edges, 156015 markings/sec, 195 secs
lola: sara is running 200 secs || 33022506 markings, 64338365 edges, 153375 markings/sec, 200 secs
lola: sara is running 205 secs || 33782498 markings, 66024103 edges, 151998 markings/sec, 205 secs
lola: sara is running 210 secs || 34584287 markings, 67693576 edges, 160358 markings/sec, 210 secs
lola: sara is running 215 secs || 35390437 markings, 69348309 edges, 161230 markings/sec, 215 secs
lola: sara is running 220 secs || 36187457 markings, 70978755 edges, 159404 markings/sec, 220 secs
lola: sara is running 225 secs || 36999695 markings, 72645064 edges, 162448 markings/sec, 225 secs
lola: sara is running 230 secs || 37803466 markings, 74293552 edges, 160754 markings/sec, 230 secs
lola: sara is running 235 secs || 38596704 markings, 75917437 edges, 158648 markings/sec, 235 secs
lola: sara is running 240 secs || 39394139 markings, 77548241 edges, 159487 markings/sec, 240 secs
lola: sara is running 245 secs || 40162273 markings, 79224537 edges, 153627 markings/sec, 245 secs
lola: sara is running 250 secs || 40955338 markings, 80955747 edges, 158613 markings/sec, 250 secs
lola: sara is running 255 secs || 41781490 markings, 82652719 edges, 165230 markings/sec, 255 secs
lola: sara is running 260 secs || 42602687 markings, 84342586 edges, 164239 markings/sec, 260 secs
lola: sara is running 265 secs || 43429153 markings, 86040199 edges, 165293 markings/sec, 265 secs
lola: sara is running 270 secs || 44261549 markings, 87756368 edges, 166479 markings/sec, 270 secs
lola: sara is running 275 secs || 45099555 markings, 89481000 edges, 167601 markings/sec, 275 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 325 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: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60b-ReachabilityFireability-6.sara.
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 361 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60b-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 406 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
sara: try reading problem file DES-PT-60b-ReachabilityFireability-7.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
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 464 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 541 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: subprocess 11 will run for 649 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
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
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 811 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 1082 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: lola: SUBRESULT
state equation: calling and running saralola:
result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 79 markings, 97 edges
lola: ========================================
lola: subprocess 14 will run for 1623 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
sara: lola: try reading problem file DES-PT-60b-ReachabilityFireability-13.sara.
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 3247 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: lola: 36 markings, 35 edges
state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no no no no no yes yes yes yes yes
sara: try reading problem file DES-PT-60b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-60b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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