About the Execution of M4M.full for CloudReconfiguration-PT-311
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1742.540 | 538182.00 | 985547.00 | 2152.60 | TTFFFTTT?TFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 824K
-rw-r--r-- 1 mcc users 3.3K 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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K 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.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 660K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is CloudReconfiguration-PT-311, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385500075
=====================================================================
--------------------
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 CloudReconfiguration-PT-311-ReachabilityCardinality-00
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-01
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-02
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-03
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-04
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-05
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-06
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-07
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-08
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-09
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-10
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-11
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-12
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-13
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-14
FORMULA_NAME CloudReconfiguration-PT-311-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527862630599
BK_STOP 1527863168781
--------------------
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 CloudReconfiguration-PT-311 as instance name.
Using CloudReconfiguration as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 8839, 'Memory': 578.54, 'Tool': 'itstools'}, {'Time': 164929, 'Memory': 582.44, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 18.65923747030207x far from the best tool itstools.
ReachabilityCardinality lola CloudReconfiguration-PT-311...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
CloudReconfiguration-PT-311: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-311: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-311 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5680/65536 symbol table entries, 639 collisions
lola: preprocessing...
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2709 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-311-ReachabilityCardinality.task
lola: E (F ((1 <= p546))) : A (G ((((p753 <= 1) OR (p594 <= 1)) AND ((p141 <= 1) OR (p2013 + 1 <= p1230))))) : A (G (((p2171 <= p759) AND (p610 <= p549)))) : A (G (((p1426 <= p1877) AND (p1850 <= p1753)))) : E (F (((p1017 + 1 <= p2374) AND (p621 + 1 <= p2301) AND (p704 + 1 <= p1757) AND (p813 + 1 <= p133)))) : E (F (((1 <= p2499) AND ((2 <= p2154) OR (2 <= p1386) OR (p555 + 1 <= p1826))))) : E (F ((((1 <= p156) AND (p1369 <= p1727) AND (2 <= p2294)) OR (p2298 + 1 <= p196)))) : E (F (((p1126 <= 1) AND (p2397 + 1 <= p73) AND (p359 <= p124)))) : E (F (((p8 <= 2) AND (p2070 + 1 <= p199) AND (p778 + 1 <= p1545)))) : A (G (((p1849 + 1 <= p1616) OR (p2094 <= 0) OR (p1786 <= 1) OR (p2540 + 1 <= p2168)))) : A (G (((p156 <= p529) OR (3 <= p1346) OR (p2485 + 1 <= p2127) OR (2 <= p2539)))) : A (G ((p2235 <= p1244))) : E (F (((1 <= p858) OR (2 <= p1569)))) : E (F ((((p1756 <= 1) OR (p2346 + 1 <= p258)) AND (1 <= p963)))) : E (F (((p376 <= 2) AND (p2379 <= 1) AND (p2281 <= p632) AND (p1430 + 1 <= p2574)))) : A (G ((((p164 <= p2378) AND (2 <= p1318)) OR (p2513 <= 1) OR (((p898 <= p1686) OR (p200 <= p1312)) AND (p295 <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p546)))
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 324 bytes per marking, with 11 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 77 markings, 76 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p753 <= 1) OR (p594 <= 1)) AND ((p141 <= 1) OR (p2013 + 1 <= p1230)))))
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 324 bytes per marking, with 11 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: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 71056 markings, 86130 edges, 14211 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2171 <= p759) AND (p610 <= p549))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1426 <= p1877) AND (p1850 <= p1753))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 98646 markings, 135466 edges, 19729 markings/sec, 0 secs
lola: sara is running 5 secs || 214691 markings, 288444 edges, 23209 markings/sec, 5 secs
lola: sara is running 10 secs || 320783 markings, 448717 edges, 21218 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 419988 markings, 583672 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1017 + 1 <= p2374) AND (p621 + 1 <= p2301) AND (p704 + 1 <= p1757) AND (p813 + 1 <= p133))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-4.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: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p2499) AND ((2 <= p2154) OR (2 <= p1386) OR (p555 + 1 <= p1826)))))
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 324 bytes per marking, with 11 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: ========================================
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 92385 markings, 120167 edges, 18477 markings/sec, 0 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p156) AND (p1369 <= p1727) AND (2 <= p2294)) OR (p2298 + 1 <= p196))))
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 324 bytes per marking, with 11 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: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 421 markings, 440 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((p1126 <= 1) AND (p2397 + 1 <= p73) AND (p359 <= p124))))
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 324 bytes per marking, with 11 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 85 markings, 84 edges
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p8 <= 2) AND (p2070 + 1 <= p199) AND (p778 + 1 <= p1545))))
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 324 bytes per marking, with 11 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 70828 markings, 85856 edges, 14166 markings/sec, 0 secs
lola: sara is running 5 secs || 147523 markings, 179801 edges, 15339 markings/sec, 5 secs
lola: sara is running 10 secs || 221629 markings, 270434 edges, 14821 markings/sec, 10 secs
lola: sara is running 15 secs || 301081 markings, 370198 edges, 15890 markings/sec, 15 secs
lola: sara is running 20 secs || 379000 markings, 493403 edges, 15584 markings/sec, 20 secs
lola: sara is running 25 secs || 476497 markings, 715121 edges, 19499 markings/sec, 25 secs
lola: sara is running 30 secs || 575224 markings, 939516 edges, 19745 markings/sec, 30 secs
lola: sara is running 35 secs || 670858 markings, 1156500 edges, 19127 markings/sec, 35 secs
lola: sara is running 40 secs || 767110 markings, 1374201 edges, 19250 markings/sec, 40 secs
lola: sara is running 45 secs || 867651 markings, 1603355 edges, 20108 markings/sec, 45 secs
lola: sara is running 50 secs || 945803 markings, 1738346 edges, 15630 markings/sec, 50 secs
lola: sara is running 55 secs || 1026747 markings, 1872387 edges, 16189 markings/sec, 55 secs
lola: sara is running 60 secs || 1120694 markings, 1989717 edges, 18789 markings/sec, 60 secs
lola: sara is running 65 secs || 1215547 markings, 2116471 edges, 18971 markings/sec, 65 secs
lola: sara is running 70 secs || 1303569 markings, 2247337 edges, 17604 markings/sec, 70 secs
lola: sara is running 75 secs || 1383793 markings, 2376669 edges, 16045 markings/sec, 75 secs
lola: sara is running 80 secs || 1464592 markings, 2508515 edges, 16160 markings/sec, 80 secs
lola: sara is running 85 secs || 1546301 markings, 2641327 edges, 16342 markings/sec, 85 secs
lola: sara is running 90 secs || 1620532 markings, 2756390 edges, 14846 markings/sec, 90 secs
lola: sara is running 95 secs || 1714300 markings, 2892808 edges, 18754 markings/sec, 95 secs
lola: sara is running 100 secs || 1807337 markings, 3033255 edges, 18607 markings/sec, 100 secs
lola: sara is running 105 secs || 1911347 markings, 3214436 edges, 20802 markings/sec, 105 secs
lola: sara is running 110 secs || 2022401 markings, 3470457 edges, 22211 markings/sec, 110 secs
lola: sara is running 115 secs || 2128956 markings, 3717612 edges, 21311 markings/sec, 115 secs
lola: sara is running 120 secs || 2220526 markings, 3845148 edges, 18314 markings/sec, 120 secs
lola: sara is running 125 secs || 2301235 markings, 3946280 edges, 16142 markings/sec, 125 secs
lola: sara is running 130 secs || 2405709 markings, 4114965 edges, 20895 markings/sec, 130 secs
lola: sara is running 135 secs || 2513893 markings, 4357902 edges, 21637 markings/sec, 135 secs
lola: sara is running 140 secs || 2595118 markings, 4472666 edges, 16245 markings/sec, 140 secs
lola: sara is running 145 secs || 2683639 markings, 4607295 edges, 17704 markings/sec, 145 secs
lola: sara is running 150 secs || 2773640 markings, 4728905 edges, 18000 markings/sec, 150 secs
lola: sara is running 155 secs || 2873595 markings, 4926048 edges, 19991 markings/sec, 155 secs
lola: sara is running 160 secs || 2978822 markings, 5167930 edges, 21045 markings/sec, 160 secs
lola: sara is running 165 secs || 3079862 markings, 5400521 edges, 20208 markings/sec, 165 secs
lola: sara is running 170 secs || 3170853 markings, 5568325 edges, 18198 markings/sec, 170 secs
lola: sara is running 175 secs || 3258729 markings, 5678123 edges, 17575 markings/sec, 175 secs
lola: sara is running 180 secs || 3341616 markings, 5782340 edges, 16577 markings/sec, 180 secs
lola: sara is running 185 secs || 3431346 markings, 5934781 edges, 17946 markings/sec, 185 secs
lola: sara is running 190 secs || 3529318 markings, 6115101 edges, 19594 markings/sec, 190 secs
lola: sara is running 195 secs || 3604401 markings, 6223200 edges, 15017 markings/sec, 195 secs
lola: sara is running 200 secs || 3695462 markings, 6355970 edges, 18212 markings/sec, 200 secs
lola: sara is running 205 secs || 3779891 markings, 6483448 edges, 16886 markings/sec, 205 secs
lola: sara is running 210 secs || 3877662 markings, 6623579 edges, 19554 markings/sec, 210 secs
lola: sara is running 215 secs || 3992833 markings, 6891738 edges, 23034 markings/sec, 215 secs
lola: sara is running 220 secs || 4105952 markings, 7153472 edges, 22624 markings/sec, 220 secs
lola: sara is running 225 secs || 4203806 markings, 7329711 edges, 19571 markings/sec, 225 secs
lola: sara is running 230 secs || 4295046 markings, 7443493 edges, 18248 markings/sec, 230 secs
lola: sara is running 235 secs || 4376552 markings, 7545514 edges, 16301 markings/sec, 235 secs
lola: sara is running 240 secs || 4456592 markings, 7644863 edges, 16008 markings/sec, 240 secs
lola: sara is running 245 secs || 4556735 markings, 7793402 edges, 20029 markings/sec, 245 secs
lola: sara is running 250 secs || 4646924 markings, 7931549 edges, 18038 markings/sec, 250 secs
lola: sara is running 255 secs || 4744921 markings, 8077932 edges, 19599 markings/sec, 255 secs
lola: sara is running 260 secs || 4848732 markings, 8220640 edges, 20762 markings/sec, 260 secs
lola: sara is running 265 secs || 4961746 markings, 8474758 edges, 22603 markings/sec, 265 secs
lola: sara is running 270 secs || 5073713 markings, 8731738 edges, 22393 markings/sec, 270 secs
lola: sara is running 275 secs || 5178462 markings, 8952273 edges, 20950 markings/sec, 275 secs
lola: sara is running 280 secs || 5274023 markings, 9075520 edges, 19112 markings/sec, 280 secs
lola: sara is running 285 secs || 5361714 markings, 9185854 edges, 17538 markings/sec, 285 secs
lola: sara is running 290 secs || 5442669 markings, 9286616 edges, 16191 markings/sec, 290 secs
lola: sara is running 295 secs || 5534356 markings, 9428060 edges, 18337 markings/sec, 295 secs
lola: sara is running 300 secs || 5642194 markings, 9628283 edges, 21568 markings/sec, 300 secs
lola: sara is running 305 secs || 5759492 markings, 9829855 edges, 23460 markings/sec, 305 secs
lola: sara is running 310 secs || 5872231 markings, 10039317 edges, 22548 markings/sec, 310 secs
lola: sara is running 315 secs || 5978403 markings, 10210947 edges, 21234 markings/sec, 315 secs
lola: sara is running 320 secs || 6074245 markings, 10332781 edges, 19168 markings/sec, 320 secs
lola: sara is running 325 secs || 6144231 markings, 10420325 edges, 13997 markings/sec, 325 secs
lola: sara is running 330 secs || 6237633 markings, 10536770 edges, 18680 markings/sec, 330 secs
lola: sara is running 335 secs || 6304046 markings, 10617294 edges, 13283 markings/sec, 335 secs
lola: sara is running 340 secs || 6395910 markings, 10730316 edges, 18373 markings/sec, 340 secs
lola: sara is running 345 secs || 6478964 markings, 10855447 edges, 16611 markings/sec, 345 secs
lola: sara is running 350 secs || 6587815 markings, 11046328 edges, 21770 markings/sec, 350 secs
lola: sara is running 355 secs || 6676594 markings, 11156107 edges, 17756 markings/sec, 355 secs
lola: sara is running 360 secs || 6763337 markings, 11263815 edges, 17349 markings/sec, 360 secs
lola: sara is running 365 secs || 6837786 markings, 11357796 edges, 14890 markings/sec, 365 secs
lola: sara is running 370 secs || 6915652 markings, 11454807 edges, 15573 markings/sec, 370 secs
lola: sara is running 375 secs || 6990311 markings, 11545736 edges, 14932 markings/sec, 375 secs
lola: sara is running 380 secs || 7083127 markings, 11660872 edges, 18563 markings/sec, 380 secs
lola: sara is running 385 secs || 7158252 markings, 11761461 edges, 15025 markings/sec, 385 secs
lola: sara is running 390 secs || 7240977 markings, 11862279 edges, 16545 markings/sec, 390 secs
lola: sara is running 395 secs || 7325420 markings, 11966535 edges, 16889 markings/sec, 395 secs
lola: sara is running 400 secs || 7407912 markings, 12067424 edges, 16498 markings/sec, 400 secs
lola: sara is running 405 secs || 7507275 markings, 12211251 edges, 19873 markings/sec, 405 secs
lola: sara is running 410 secs || 7605976 markings, 12373715 edges, 19740 markings/sec, 410 secs
lola: sara is running 415 secs || 7692060 markings, 12480974 edges, 17217 markings/sec, 415 secs
lola: sara is running 420 secs || 7776203 markings, 12586829 edges, 16829 markings/sec, 420 secs
lola: sara is running 425 secs || 7866265 markings, 12699854 edges, 18012 markings/sec, 425 secs
lola: sara is running 430 secs || 7953708 markings, 12811996 edges, 17489 markings/sec, 430 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1849 + 1 <= p1616) OR (p2094 <= 0) OR (p1786 <= 1) OR (p2540 + 1 <= p2168))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p156 <= p529) OR (3 <= p1346) OR (p2485 + 1 <= p2127) OR (2 <= p2539))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1156 markings, 1251 edges
lola: ========================================
lola: subprocess 11 will run for 611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2235 <= p1244)))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-311-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 12 will run for 764 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p858) OR (2 <= p1569))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 167 markings, 179 edges
lola: ========================================
lola: subprocess 13 will run for 1019 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1756 <= 1) OR (p2346 + 1 <= p258)) AND (1 <= p963))))
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 324 bytes per marking, with 11 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: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 77 markings, 76 edges
lola: ========================================
lola: subprocess 14 will run for 1529 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p376 <= 2) AND (p2379 <= 1) AND (p2281 <= p632) AND (p1430 + 1 <= p2574))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 15 will run for 3059 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p164 <= p2378) AND (2 <= p1318)) OR (p2513 <= 1) OR (((p898 <= p1686) OR (p200 <= p1312)) AND (p295 <= 1)))))
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 324 bytes per marking, with 11 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-311-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-311-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 81779 markings, 107981 edges, 16356 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes yes yes unknown yes no no yes yes yes yes
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-311-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-311"
export BK_EXAMINATION="ReachabilityCardinality"
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/CloudReconfiguration-PT-311.tgz
mv CloudReconfiguration-PT-311 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 CloudReconfiguration-PT-311, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-152646385500075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;