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 irma4mcc-structural
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 r043-smll-152646359600238
=====================================================================

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


BK_STOP 1526484424340

--------------------
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 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': 'gspn'}].
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: 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 || 76750 markings, 3948293 edges, 15350 markings/sec, 0 secs
lola: sara is running 5 secs || 157854 markings, 7948244 edges, 16221 markings/sec, 5 secs
lola: sara is running 10 secs || 229181 markings, 12005394 edges, 14265 markings/sec, 10 secs
lola: sara is running 15 secs || 301165 markings, 16162911 edges, 14397 markings/sec, 15 secs
lola: sara is running 20 secs || 376529 markings, 20290628 edges, 15073 markings/sec, 20 secs
lola: sara is running 25 secs || 466179 markings, 23723928 edges, 17930 markings/sec, 25 secs
lola: sara is running 30 secs || 547954 markings, 27632536 edges, 16355 markings/sec, 30 secs
lola: sara is running 35 secs || 591593 markings, 32727704 edges, 8728 markings/sec, 35 secs
lola: sara is running 40 secs || 688656 markings, 36377978 edges, 19413 markings/sec, 40 secs
lola: sara is running 45 secs || 741573 markings, 40452051 edges, 10583 markings/sec, 45 secs
lola: sara is running 50 secs || 809017 markings, 45609819 edges, 13489 markings/sec, 50 secs
lola: sara is running 55 secs || 886995 markings, 49685844 edges, 15596 markings/sec, 55 secs
lola: sara is running 60 secs || 965103 markings, 54077919 edges, 15622 markings/sec, 60 secs
lola: sara is running 65 secs || 1035278 markings, 58733995 edges, 14035 markings/sec, 65 secs
lola: sara is running 70 secs || 1108693 markings, 62648726 edges, 14683 markings/sec, 70 secs
lola: sara is running 75 secs || 1182374 markings, 67152944 edges, 14736 markings/sec, 75 secs
lola: sara is running 80 secs || 1260728 markings, 71145812 edges, 15671 markings/sec, 80 secs
lola: sara is running 85 secs || 1332422 markings, 75515233 edges, 14339 markings/sec, 85 secs
lola: sara is running 90 secs || 1411317 markings, 79593622 edges, 15779 markings/sec, 90 secs
lola: sara is running 95 secs || 1478386 markings, 83688015 edges, 13414 markings/sec, 95 secs
lola: sara is running 100 secs || 1588846 markings, 87653617 edges, 22092 markings/sec, 100 secs
lola: sara is running 105 secs || 1691035 markings, 91201624 edges, 20438 markings/sec, 105 secs
lola: sara is running 110 secs || 1738766 markings, 96718654 edges, 9546 markings/sec, 110 secs
lola: sara is running 115 secs || 1830983 markings, 100901555 edges, 18443 markings/sec, 115 secs
lola: sara is running 120 secs || 1913616 markings, 104826402 edges, 16527 markings/sec, 120 secs
lola: sara is running 125 secs || 1991714 markings, 109084891 edges, 15620 markings/sec, 125 secs
lola: sara is running 130 secs || 2067387 markings, 113421595 edges, 15135 markings/sec, 130 secs
lola: sara is running 135 secs || 2149949 markings, 117761911 edges, 16512 markings/sec, 135 secs
lola: sara is running 140 secs || 2219699 markings, 122367774 edges, 13950 markings/sec, 140 secs
lola: sara is running 145 secs || 2306837 markings, 126573824 edges, 17428 markings/sec, 145 secs
lola: sara is running 150 secs || 2386353 markings, 130560815 edges, 15903 markings/sec, 150 secs
lola: sara is running 155 secs || 2452697 markings, 134652201 edges, 13269 markings/sec, 155 secs
lola: sara is running 160 secs || 2523451 markings, 138500964 edges, 14151 markings/sec, 160 secs
lola: sara is running 165 secs || 2595433 markings, 142927553 edges, 14396 markings/sec, 165 secs
lola: sara is running 170 secs || 2670969 markings, 146946903 edges, 15107 markings/sec, 170 secs
lola: sara is running 175 secs || 2741285 markings, 150949660 edges, 14063 markings/sec, 175 secs
lola: sara is running 180 secs || 2817433 markings, 155148000 edges, 15230 markings/sec, 180 secs
lola: sara is running 185 secs || 2896965 markings, 159318491 edges, 15906 markings/sec, 185 secs
lola: sara is running 190 secs || 2975276 markings, 163524458 edges, 15662 markings/sec, 190 secs
lola: sara is running 195 secs || 3046975 markings, 167553552 edges, 14340 markings/sec, 195 secs
lola: sara is running 200 secs || 3121379 markings, 171559113 edges, 14881 markings/sec, 200 secs
lola: sara is running 205 secs || 3197367 markings, 175593547 edges, 15198 markings/sec, 205 secs
lola: sara is running 210 secs || 3270410 markings, 179537461 edges, 14609 markings/sec, 210 secs
lola: sara is running 215 secs || 3347989 markings, 183632066 edges, 15516 markings/sec, 215 secs
lola: sara is running 220 secs || 3416220 markings, 187638751 edges, 13646 markings/sec, 220 secs
lola: sara is running 225 secs || 3491560 markings, 191677950 edges, 15068 markings/sec, 225 secs
lola: sara is running 230 secs || 3566720 markings, 195596990 edges, 15032 markings/sec, 230 secs
lola: sara is running 235 secs || 3632050 markings, 199528878 edges, 13066 markings/sec, 235 secs
lola: sara is running 240 secs || 3702281 markings, 203407116 edges, 14046 markings/sec, 240 secs
lola: sara is running 245 secs || 3774453 markings, 207338997 edges, 14434 markings/sec, 245 secs
sara: warning, failure of lp_solve (at job 35862)
lola: sara is running 250 secs || 3853291 markings, 211406503 edges, 15768 markings/sec, 250 secs
lola: sara is running 255 secs || 3929629 markings, 215732177 edges, 15268 markings/sec, 255 secs
lola: sara is running 260 secs || 4006885 markings, 219991811 edges, 15451 markings/sec, 260 secs
lola: sara is running 265 secs || 4088216 markings, 224229771 edges, 16266 markings/sec, 265 secs
lola: sara is running 270 secs || 4162233 markings, 228489762 edges, 14803 markings/sec, 270 secs
lola: sara is running 275 secs || 4238139 markings, 232716114 edges, 15181 markings/sec, 275 secs
lola: sara is running 280 secs || 4318961 markings, 236920270 edges, 16164 markings/sec, 280 secs
lola: sara is running 285 secs || 4392137 markings, 241174755 edges, 14635 markings/sec, 285 secs
lola: sara is running 290 secs || 4467759 markings, 245405123 edges, 15124 markings/sec, 290 secs
lola: sara is running 295 secs || 4540473 markings, 249489886 edges, 14543 markings/sec, 295 secs
lola: sara is running 300 secs || 4617652 markings, 253685431 edges, 15436 markings/sec, 300 secs
lola: sara is running 305 secs || 4698031 markings, 257986732 edges, 16076 markings/sec, 305 secs
lola: sara is running 310 secs || 4772954 markings, 261977712 edges, 14985 markings/sec, 310 secs
lola: sara is running 315 secs || 4847319 markings, 266226411 edges, 14873 markings/sec, 315 secs
lola: sara is running 320 secs || 4925076 markings, 270440328 edges, 15551 markings/sec, 320 secs
lola: sara is running 325 secs || 5003443 markings, 274525464 edges, 15673 markings/sec, 325 secs
lola: sara is running 330 secs || 5074122 markings, 278744705 edges, 14136 markings/sec, 330 secs
lola: sara is running 335 secs || 5151008 markings, 282907397 edges, 15377 markings/sec, 335 secs
lola: sara is running 340 secs || 5224511 markings, 286881387 edges, 14701 markings/sec, 340 secs
lola: sara is running 345 secs || 5295296 markings, 290734667 edges, 14157 markings/sec, 345 secs
lola: sara is running 350 secs || 5369430 markings, 294699587 edges, 14827 markings/sec, 350 secs
lola: sara is running 355 secs || 5442764 markings, 298640870 edges, 14667 markings/sec, 355 secs
lola: sara is running 360 secs || 5513454 markings, 302485495 edges, 14138 markings/sec, 360 secs
lola: sara is running 365 secs || 5586756 markings, 306368963 edges, 14660 markings/sec, 365 secs
lola: sara is running 370 secs || 5664334 markings, 310274654 edges, 15516 markings/sec, 370 secs
lola: sara is running 375 secs || 5729597 markings, 314303584 edges, 13053 markings/sec, 375 secs
lola: sara is running 380 secs || 5801720 markings, 318046094 edges, 14425 markings/sec, 380 secs
lola: sara is running 385 secs || 5869896 markings, 321786404 edges, 13635 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: 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)
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
sara: try reading problem file CloudDeployment-PT-5a-ReachabilityFireability-12.sara.
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: 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: 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

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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-5a"
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/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 irma4mcc-structural"
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 r043-smll-152646359600238"
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 ;