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 388K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K 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 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 230K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is CloudDeployment-PT-5a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-152646362700238
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526577174068


BK_STOP 1526577612427

--------------------
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 CloudDeployment-PT-5a as instance name.
Using CloudDeployment 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': True, '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': 766, 'Memory': 108.22, 'Tool': 'lola'}, {'Time': 919, 'Memory': 115.44, 'Tool': 'lola'}, {'Time': 7091, 'Memory': 375.39, 'Tool': 'itstools'}, {'Time': 7127, 'Memory': 369.35, 'Tool': 'itstools'}, {'Time': 23039, 'Memory': 2351.94, 'Tool': 'marcie'}, {'Time': 23354, 'Memory': 2352.19, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola CloudDeployment-PT-5a...

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


checking for too many tokens
===========================================================================================
CloudDeployment-PT-5a: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ CloudDeployment-PT-5a @ 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: 855/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 180 places, 675 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 594 transition conflict sets
lola: TASK
lola: reading formula from CloudDeployment-PT-5a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t392) OR NOT FIREABLE(t210)))) : E (F (FIREABLE(t354))) : E (F ((FIREABLE(t504) AND FIREABLE(t82) AND (FIREABLE(t520) OR FIREABLE(t253)) AND NOT FIREABLE(t151) AND FIREABLE(t186) AND NOT FIREABLE(t246)))) : E (F ((FIREABLE(t472) AND FIREABLE(t300) AND NOT FIREABLE(t605) AND NOT FIREABLE(t106) AND FIREABLE(t469)))) : A (G ((FIREABLE(t57) OR FIREABLE(t302) OR NOT FIREABLE(t166) OR (FIREABLE(t574) AND FIREABLE(t379)) OR (FIREABLE(t8) AND FIREABLE(t324)) OR FIREABLE(t238)))) : E (F ((FIREABLE(t664) AND ((FIREABLE(t122) AND FIREABLE(t434)) OR (FIREABLE(t341) AND FIREABLE(t242)) OR FIREABLE(t39))))) : E (F (FIREABLE(t633))) : E (F ((NOT FIREABLE(t567) AND FIREABLE(t123) AND FIREABLE(t551)))) : E (F (FIREABLE(t29))) : E (F (((NOT FIREABLE(t136) AND NOT FIREABLE(t347) AND FIREABLE(t526)) OR (NOT FIREABLE(t126) AND FIREABLE(t410))))) : E (F ((FIREABLE(t255) AND FIREABLE(t484) AND FIREABLE(t213) AND FIREABLE(t70) AND (NOT FIREABLE(t506) OR NOT FIREABLE(t226)) AND FIREABLE(t609) AND FIREABLE(t35)))) : A (G ((FIREABLE(t357) OR NOT FIREABLE(t597)))) : E (F ((FIREABLE(t145) AND (FIREABLE(t94) OR FIREABLE(t495) OR FIREABLE(t397) OR FIREABLE(t522) OR FIREABLE(t102) OR NOT FIREABLE(t4))))) : A (G (((NOT FIREABLE(t78) OR NOT FIREABLE(t176) OR (FIREABLE(t112) AND (FIREABLE(t607) OR FIREABLE(t266)))) AND NOT FIREABLE(t417)))) : A (G ((NOT FIREABLE(t331) OR FIREABLE(t635)))) : A (G (NOT FIREABLE(t421)))
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 ((NOT FIREABLE(t392) OR NOT FIREABLE(t210))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t354)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t504) AND FIREABLE(t82) AND (FIREABLE(t520) OR FIREABLE(t253)) AND NOT FIREABLE(t151) AND FIREABLE(t186) AND NOT FIREABLE(t246))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 68 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t472) AND FIREABLE(t300) AND NOT FIREABLE(t605) AND NOT FIREABLE(t106) AND FIREABLE(t469))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 22 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t57) OR FIREABLE(t302) OR NOT FIREABLE(t166) OR (FIREABLE(t574) AND FIREABLE(t379)) OR (FIREABLE(t8) AND FIREABLE(t324)) OR FIREABLE(t238))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t664) AND ((FIREABLE(t122) AND FIREABLE(t434)) OR (FIREABLE(t341) AND FIREABLE(t242)) OR FIREABLE(t39)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 29 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t633)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t567) AND FIREABLE(t123) AND FIREABLE(t551))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 80833 markings, 4323181 edges, 16167 markings/sec, 0 secs
lola: sara is running 5 secs || 168911 markings, 8407783 edges, 17616 markings/sec, 5 secs
lola: sara is running 10 secs || 238753 markings, 12680818 edges, 13968 markings/sec, 10 secs
lola: sara is running 15 secs || 311714 markings, 16803467 edges, 14592 markings/sec, 15 secs
lola: sara is running 20 secs || 394924 markings, 20684976 edges, 16642 markings/sec, 20 secs
lola: sara is running 25 secs || 472266 markings, 24272660 edges, 15468 markings/sec, 25 secs
lola: sara is running 30 secs || 548772 markings, 28317975 edges, 15301 markings/sec, 30 secs
lola: sara is running 35 secs || 600252 markings, 33388218 edges, 10296 markings/sec, 35 secs
lola: sara is running 40 secs || 698215 markings, 36876621 edges, 19593 markings/sec, 40 secs
lola: sara is running 45 secs || 760892 markings, 40917584 edges, 12535 markings/sec, 45 secs
lola: sara is running 50 secs || 816879 markings, 46196717 edges, 11197 markings/sec, 50 secs
lola: sara is running 55 secs || 894566 markings, 50171604 edges, 15537 markings/sec, 55 secs
lola: sara is running 60 secs || 970191 markings, 54546648 edges, 15125 markings/sec, 60 secs
lola: sara is running 65 secs || 1042373 markings, 59297045 edges, 14436 markings/sec, 65 secs
lola: sara is running 70 secs || 1122720 markings, 63050105 edges, 16069 markings/sec, 70 secs
lola: sara is running 75 secs || 1188544 markings, 67570631 edges, 13165 markings/sec, 75 secs
lola: sara is running 80 secs || 1264425 markings, 71568352 edges, 15176 markings/sec, 80 secs
lola: sara is running 85 secs || 1341814 markings, 75888899 edges, 15478 markings/sec, 85 secs
lola: sara is running 90 secs || 1414955 markings, 79980812 edges, 14628 markings/sec, 90 secs
lola: sara is running 95 secs || 1487400 markings, 84017322 edges, 14489 markings/sec, 95 secs
lola: sara is running 100 secs || 1592833 markings, 88163778 edges, 21087 markings/sec, 100 secs
lola: sara is running 105 secs || 1692181 markings, 91728246 edges, 19870 markings/sec, 105 secs
lola: sara is running 110 secs || 1751413 markings, 97033127 edges, 11846 markings/sec, 110 secs
lola: sara is running 115 secs || 1837916 markings, 101165964 edges, 17301 markings/sec, 115 secs
lola: sara is running 120 secs || 1919447 markings, 105512094 edges, 16306 markings/sec, 120 secs
lola: sara is running 125 secs || 1995067 markings, 109899926 edges, 15124 markings/sec, 125 secs
lola: sara is running 130 secs || 2077414 markings, 114179470 edges, 16469 markings/sec, 130 secs
lola: sara is running 135 secs || 2160816 markings, 118502621 edges, 16680 markings/sec, 135 secs
lola: sara is running 140 secs || 2231013 markings, 123125111 edges, 14039 markings/sec, 140 secs
lola: sara is running 145 secs || 2321205 markings, 127230470 edges, 18038 markings/sec, 145 secs
lola: sara is running 150 secs || 2401878 markings, 131045544 edges, 16135 markings/sec, 150 secs
lola: sara is running 155 secs || 2462375 markings, 135238356 edges, 12099 markings/sec, 155 secs
lola: sara is running 160 secs || 2539873 markings, 139052946 edges, 15500 markings/sec, 160 secs
lola: sara is running 165 secs || 2605605 markings, 143448189 edges, 13146 markings/sec, 165 secs
lola: sara is running 170 secs || 2682627 markings, 147399430 edges, 15404 markings/sec, 170 secs
lola: sara is running 175 secs || 2749968 markings, 151438141 edges, 13468 markings/sec, 175 secs
lola: sara is running 180 secs || 2831199 markings, 155486830 edges, 16246 markings/sec, 180 secs
lola: sara is running 185 secs || 2906484 markings, 159714403 edges, 15057 markings/sec, 185 secs
lola: sara is running 190 secs || 2983867 markings, 163935947 edges, 15477 markings/sec, 190 secs
lola: sara is running 195 secs || 3053304 markings, 167900216 edges, 13887 markings/sec, 195 secs
lola: sara is running 200 secs || 3129087 markings, 171895209 edges, 15157 markings/sec, 200 secs
lola: sara is running 205 secs || 3204299 markings, 175874375 edges, 15042 markings/sec, 205 secs
lola: sara is running 210 secs || 3273080 markings, 179874875 edges, 13756 markings/sec, 210 secs
lola: sara is running 215 secs || 3351146 markings, 183772784 edges, 15613 markings/sec, 215 secs
lola: sara is running 220 secs || 3419319 markings, 187743892 edges, 13635 markings/sec, 220 secs
lola: sara is running 225 secs || 3493733 markings, 191773264 edges, 14883 markings/sec, 225 secs
lola: sara is running 230 secs || 3567561 markings, 195683303 edges, 14766 markings/sec, 230 secs
lola: sara is running 235 secs || 3634591 markings, 199689961 edges, 13406 markings/sec, 235 secs
lola: sara is running 240 secs || 3704999 markings, 203561822 edges, 14082 markings/sec, 240 secs
sara: warning, failure of lp_solve (at job 35862)
lola: sara is running 245 secs || 3778685 markings, 207538397 edges, 14737 markings/sec, 245 secs
lola: sara is running 250 secs || 3857786 markings, 211644268 edges, 15820 markings/sec, 250 secs
lola: sara is running 255 secs || 3934189 markings, 215984712 edges, 15281 markings/sec, 255 secs
lola: sara is running 260 secs || 4011974 markings, 220269605 edges, 15557 markings/sec, 260 secs
lola: sara is running 265 secs || 4094208 markings, 224498830 edges, 16447 markings/sec, 265 secs
lola: sara is running 270 secs || 4167809 markings, 228784137 edges, 14720 markings/sec, 270 secs
lola: sara is running 275 secs || 4245607 markings, 233075492 edges, 15560 markings/sec, 275 secs
lola: sara is running 280 secs || 4325672 markings, 237284954 edges, 16013 markings/sec, 280 secs
lola: sara is running 285 secs || 4400330 markings, 241541739 edges, 14932 markings/sec, 285 secs
lola: sara is running 290 secs || 4476052 markings, 245848825 edges, 15144 markings/sec, 290 secs
lola: sara is running 295 secs || 4548624 markings, 249932995 edges, 14514 markings/sec, 295 secs
lola: sara is running 300 secs || 4626993 markings, 254179542 edges, 15674 markings/sec, 300 secs
lola: sara is running 305 secs || 4707223 markings, 258481378 edges, 16046 markings/sec, 305 secs
lola: sara is running 310 secs || 4782960 markings, 262604863 edges, 15147 markings/sec, 310 secs
lola: sara is running 315 secs || 4857379 markings, 266845051 edges, 14884 markings/sec, 315 secs
lola: sara is running 320 secs || 4935151 markings, 271107964 edges, 15554 markings/sec, 320 secs
lola: sara is running 325 secs || 5013609 markings, 275183877 edges, 15692 markings/sec, 325 secs
lola: sara is running 330 secs || 5085782 markings, 279374238 edges, 14435 markings/sec, 330 secs
lola: sara is running 335 secs || 5163858 markings, 283625405 edges, 15615 markings/sec, 335 secs
lola: sara is running 340 secs || 5236385 markings, 287587366 edges, 14505 markings/sec, 340 secs
lola: sara is running 345 secs || 5307101 markings, 291401725 edges, 14143 markings/sec, 345 secs
lola: sara is running 350 secs || 5383830 markings, 295424694 edges, 15346 markings/sec, 350 secs
lola: sara is running 355 secs || 5456386 markings, 299428922 edges, 14511 markings/sec, 355 secs
lola: sara is running 360 secs || 5527379 markings, 303208474 edges, 14199 markings/sec, 360 secs
lola: sara is running 365 secs || 5601796 markings, 307163205 edges, 14883 markings/sec, 365 secs
lola: sara is running 370 secs || 5675688 markings, 311111845 edges, 14778 markings/sec, 370 secs
lola: sara is running 375 secs || 5743646 markings, 315045299 edges, 13592 markings/sec, 375 secs
lola: sara is running 380 secs || 5815267 markings, 318851175 edges, 14324 markings/sec, 380 secs
lola: sara is running 385 secs || 5884246 markings, 322571062 edges, 13796 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t29)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 CloudDeployment-PT-5a-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t136) AND NOT FIREABLE(t347) AND FIREABLE(t526)) OR (NOT FIREABLE(t126) AND FIREABLE(t410)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 26 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t255) AND FIREABLE(t484) AND FIREABLE(t213) AND FIREABLE(t70) AND (NOT FIREABLE(t506) OR NOT FIREABLE(t226)) AND FIREABLE(t609) AND FIREABLE(t35))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 95 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t357) OR NOT FIREABLE(t597))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 15 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t145) AND (FIREABLE(t94) OR FIREABLE(t495) OR FIREABLE(t397) OR FIREABLE(t522) OR FIREABLE(t102) OR NOT FIREABLE(t4)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 17 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t78) OR NOT FIREABLE(t176) OR (FIREABLE(t112) AND (FIREABLE(t607) OR FIREABLE(t266)))) AND NOT FIREABLE(t417))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityFireability-12.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 48 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t331) OR FIREABLE(t635))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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: sara: try reading problem file CloudDeployment-PT-5a-ReachabilityFireability-13.sara.
state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t421)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-5a-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes unknown yes yes no no yes no no no
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

FORMULA CloudDeployment-PT-5a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudDeployment-PT-5a-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-5a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5a.tgz
mv CloudDeployment-PT-5a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is CloudDeployment-PT-5a, 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 r046-smll-152646362700238"
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 ;