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 840K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-308, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385400052
=====================================================================

--------------------
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-308-CTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526505004476


BK_STOP 1526505396399

--------------------
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-308 as instance name.
Using CloudReconfiguration as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 1597082, 'Memory': 4852.89, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CloudReconfiguration-PT-308...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-308: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ CloudReconfiguration-PT-308 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 2708 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-308-CTLCardinality.task
lola: ((((2 <= p1672) AND (p1119 <= p1136) AND (p806 <= p353) AND (3 <= p1378) AND (p2200 + 1 <= p2524) AND (p945 + 1 <= p2221)) AND (A (G ((p957 <= p1337))) OR ((p819 + 1 <= p7) AND (p923 <= 1)))) OR NOT(A (F (((2 <= p47) OR (2 <= p1985)))))) : A ((((2 <= p2520) OR (p1516 <= p1254) OR (p492 <= p270) OR (3 <= p353)) U ((3 <= p1620) AND (3 <= p127) AND (3 <= p1215)))) : E (G (A (G (((p1795 <= p207) AND (p490 <= p35)))))) : NOT(E (F (E (F ((1 <= p624)))))) : (A (G (A (G ((p845 <= p1038))))) OR E (((p845 <= p1708) U (p1359 + 1 <= p1604)))) : A (F ((E (F ((p2467 <= p2254))) AND ((p2355 + 1 <= p215) OR (2 <= p682))))) : E ((A (G ((p596 <= p842))) U ((p294 + 1 <= p1747) AND (p2181 <= 1)))) : (A ((((p2141 <= p854) AND (p940 <= p1590)) U ((2 <= p30) OR (3 <= p1928)))) OR E (G ((1 <= p1402)))) : A (F ((p863 + 1 <= p37))) : ((2 <= p2063) OR E (F (((p1828 <= p2212) AND (p1930 + 1 <= p1987))))) : (E (F (((p1830 <= p1243) AND (1 <= p2354) AND ((1 <= p1091) OR (p1242 <= p1029))))) OR NOT(A (((p453 <= p1141) U (p489 <= p745))))) : E (X (E (F ((p1177 + 1 <= p2298))))) : (E (((p2102 + 1 <= p1259) U ((p633 <= p1506) AND (3 <= p1723)))) OR ((E (G ((2 <= p186))) OR ((p2475 + 1 <= p1141) AND (p1097 <= p817))) OR A (F (((2 <= p206) OR (2 <= p1705)))))) : NOT(A (F (((p1075 <= p1696) AND (1 <= p1709) AND ((p1506 <= p2086) OR (1 <= p413)))))) : A (F (A (F ((2 <= p1892))))) : (A (((p1707 <= p161) U ((2 <= p1635) AND (2 <= p528)))) OR (A (F (((2 <= p1209) AND (1 <= p1428)))) OR (3 <= p2142)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1672) AND (p1119 <= p1136) AND (p806 <= p353) AND (3 <= p1378) AND (p2200 + 1 <= p2524) AND (p945 + 1 <= p2221)) AND (A (G ((p957 <= p1337))) OR ((p819 + 1 <= p7) AND (p923 <= 1)))) OR NOT(A (F (((2 <= p47) OR (2 <= p1985))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p1672) AND (p1119 <= p1136) AND (p806 <= p353) AND (3 <= p1378) AND (p2200 + 1 <= p2524) AND (p945 + 1 <= p2221))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p1672) AND (p1119 <= p1136) AND (p806 <= p353) AND (3 <= p1378) AND (p2200 + 1 <= p2524) AND (p945 + 1 <= p2221))
lola: processed formula length: 120
lola: 3 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p47 <= 1) AND (p1985 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p47) OR (2 <= p1985))))
lola: processed formula length: 44
lola: 5 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 58 markings, 58 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p2520) OR (p1516 <= p1254) OR (p492 <= p270) OR (3 <= p353)) U ((3 <= p1620) AND (3 <= p127) AND (3 <= p1215))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= p2520) OR (p1516 <= p1254) OR (p492 <= p270) OR (3 <= p353)) U ((3 <= p1620) AND (3 <= p127) AND (3 <= p1215))))
lola: processed formula: A ((((2 <= p2520) OR (p1516 <= p1254) OR (p492 <= p270) OR (3 <= p353)) U ((3 <= p1620) AND (3 <= p127) AND (3 <= p1215))))
lola: processed formula length: 126
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (((p1795 <= p207) AND (p490 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U ((p207 + 1 <= p1795) OR (p35 + 1 <= p490)))))
lola: processed formula length: 68
lola: 4 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5252 markings, 6810 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (F ((1 <= p624))))))
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((p845 <= p1038))))) OR E (((p845 <= p1708) U (p1359 + 1 <= p1604))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p845 <= p1038)))
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-308-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p845 <= p1708) U (p1359 + 1 <= p1604)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p845 <= p1708) U (p1359 + 1 <= p1604))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 251552 markings, 431922 edges, 3689329903141912576 markings/sec, 0 secs
lola: 479179 markings, 871549 edges, 45525 markings/sec, 5 secs
lola: 731552 markings, 1307795 edges, 50475 markings/sec, 10 secs
lola: 956728 markings, 1718486 edges, 45035 markings/sec, 15 secs
lola: 1181419 markings, 2102332 edges, 44938 markings/sec, 20 secs
lola: 1413021 markings, 2488832 edges, 46320 markings/sec, 25 secs
lola: 1629122 markings, 2877131 edges, 43220 markings/sec, 30 secs
lola: 1823562 markings, 3242591 edges, 38888 markings/sec, 35 secs
lola: 2020101 markings, 3614818 edges, 39308 markings/sec, 40 secs
lola: 2222087 markings, 3976740 edges, 40397 markings/sec, 45 secs
lola: 2444189 markings, 4374678 edges, 44420 markings/sec, 50 secs
lola: 2666149 markings, 4757462 edges, 44392 markings/sec, 55 secs
lola: 2862754 markings, 5126404 edges, 39321 markings/sec, 60 secs
lola: 3058116 markings, 5468211 edges, 39072 markings/sec, 65 secs
lola: 3251428 markings, 5826760 edges, 38662 markings/sec, 70 secs
lola: 3455558 markings, 6172846 edges, 40826 markings/sec, 75 secs
lola: 3645114 markings, 6508815 edges, 37911 markings/sec, 80 secs
lola: 3838547 markings, 6839546 edges, 38687 markings/sec, 85 secs
lola: 4017776 markings, 7167866 edges, 35846 markings/sec, 90 secs
lola: 4195668 markings, 7465374 edges, 35578 markings/sec, 95 secs
lola: 4388650 markings, 7764604 edges, 38596 markings/sec, 100 secs
lola: 4569062 markings, 8090900 edges, 36082 markings/sec, 105 secs
lola: 4742754 markings, 8450878 edges, 34738 markings/sec, 110 secs
lola: 4942082 markings, 8838273 edges, 39866 markings/sec, 115 secs
lola: 5165341 markings, 9242411 edges, 44652 markings/sec, 120 secs
lola: 5314733 markings, 9584752 edges, 29878 markings/sec, 125 secs
lola: 5464940 markings, 9887452 edges, 30041 markings/sec, 130 secs
lola: 5650822 markings, 10193483 edges, 37176 markings/sec, 135 secs
lola: 5837862 markings, 10531570 edges, 37408 markings/sec, 140 secs
lola: 5971230 markings, 10868023 edges, 26674 markings/sec, 145 secs
lola: 6123564 markings, 11226865 edges, 30467 markings/sec, 150 secs
lola: 6270716 markings, 11583389 edges, 29430 markings/sec, 155 secs
lola: 6412885 markings, 11933619 edges, 28434 markings/sec, 160 secs
lola: 6556967 markings, 12291655 edges, 28816 markings/sec, 165 secs
lola: 6681767 markings, 12584613 edges, 24960 markings/sec, 170 secs
lola: 6803242 markings, 12880590 edges, 24295 markings/sec, 175 secs
lola: 6914580 markings, 13159088 edges, 22268 markings/sec, 180 secs
lola: 7034847 markings, 13462779 edges, 24053 markings/sec, 185 secs
lola: 7191257 markings, 13815101 edges, 31282 markings/sec, 190 secs
lola: 7374215 markings, 14235088 edges, 36592 markings/sec, 195 secs
lola: 7535225 markings, 14612038 edges, 32202 markings/sec, 200 secs
lola: 7685010 markings, 14992725 edges, 29957 markings/sec, 205 secs
lola: 7822709 markings, 15325867 edges, 27540 markings/sec, 210 secs
lola: 7958861 markings, 15679963 edges, 27230 markings/sec, 215 secs
lola: 8092529 markings, 16037891 edges, 26734 markings/sec, 220 secs
lola: 8215664 markings, 16345362 edges, 24627 markings/sec, 225 secs
lola: 8383074 markings, 16717289 edges, 33482 markings/sec, 230 secs
lola: 8521868 markings, 17056152 edges, 27759 markings/sec, 235 secs
lola: 8691148 markings, 17409542 edges, 33856 markings/sec, 240 secs
lola: 8845728 markings, 17768806 edges, 30916 markings/sec, 245 secs
lola: 9017279 markings, 18104675 edges, 34310 markings/sec, 250 secs
lola: 9183431 markings, 18439919 edges, 33230 markings/sec, 255 secs
lola: 9348996 markings, 18747647 edges, 33113 markings/sec, 260 secs
lola: 9511695 markings, 19069954 edges, 32540 markings/sec, 265 secs
lola: 9654178 markings, 19390699 edges, 28497 markings/sec, 270 secs
lola: 9796723 markings, 19700138 edges, 28509 markings/sec, 275 secs
lola: 9920480 markings, 19997242 edges, 24751 markings/sec, 280 secs
lola: 10049566 markings, 20312032 edges, 25817 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((p2467 <= p2254))) AND ((p2355 + 1 <= p215) OR (2 <= p682)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U (p2467 <= p2254)) AND ((p2355 + 1 <= p215) OR (2 <= p682))))
lola: processed formula length: 80
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 58 markings, 116 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((p596 <= p842))) U ((p294 + 1 <= p1747) AND (p2181 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p842 + 1 <= p596))) U ((p294 + 1 <= p1747) AND (p2181 <= 1)))
lola: processed formula length: 77
lola: 3 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1093 markings, 1151 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((p2141 <= p854) AND (p940 <= p1590)) U ((2 <= p30) OR (3 <= p1928)))) OR E (G ((1 <= p1402))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p2141 <= p854) AND (p940 <= p1590)) U ((2 <= p30) OR (3 <= p1928))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p2141 <= p854) AND (p940 <= p1590)) U ((2 <= p30) OR (3 <= p1928))))
lola: processed formula: A ((((p2141 <= p854) AND (p940 <= p1590)) U ((2 <= p30) OR (3 <= p1928))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p1402)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p1402 <= 0)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p863 + 1 <= p37)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p863 + 1 <= p37)))
lola: processed formula: A (F ((p863 + 1 <= p37)))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p2063) OR E (F (((p1828 <= p2212) AND (p1930 + 1 <= p1987)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p2063)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p2063)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1828 <= p2212) AND (p1930 + 1 <= p1987))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-308-CTLCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 233 markings, 272 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p1830 <= p1243) AND (1 <= p2354) AND ((1 <= p1091) OR (p1242 <= p1029))))) OR NOT(A (((p453 <= p1141) U (p489 <= p745)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1830 <= p1243) AND (1 <= p2354) AND ((1 <= p1091) OR (p1242 <= p1029)))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-308-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 55 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p1177 + 1 <= p2298)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p1177 + 1 <= p2298)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 199431 markings, 646005 edges, 3095761849421922304 markings/sec, 0 secs
lola: 378317 markings, 1217917 edges, 35777 markings/sec, 5 secs
lola: 574475 markings, 1841672 edges, 39232 markings/sec, 10 secs
lola: 768228 markings, 2465419 edges, 38751 markings/sec, 15 secs
lola: 935347 markings, 3106875 edges, 33424 markings/sec, 20 secs
lola: 1077731 markings, 3748261 edges, 28477 markings/sec, 25 secs
lola: 1213044 markings, 4312366 edges, 27063 markings/sec, 30 secs
lola: 1356960 markings, 4937718 edges, 28783 markings/sec, 35 secs
lola: 1515770 markings, 5565199 edges, 31762 markings/sec, 40 secs
lola: 1657807 markings, 6214094 edges, 28407 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1721163 markings, 6386201 edges
lola: ========================================
lola: subprocess 12 will run for 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p2102 + 1 <= p1259) U ((p633 <= p1506) AND (3 <= p1723)))) OR ((E (G ((2 <= p186))) OR ((p2475 + 1 <= p1141) AND (p1097 <= p817))) OR A (F (((2 <= p206) OR (2 <= p1705))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p2102 + 1 <= p1259) U ((p633 <= p1506) AND (3 <= p1723))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p2102 + 1 <= p1259) U ((p633 <= p1506) AND (3 <= p1723)))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1064 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p186)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p186 <= 1)))
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p2475 + 1 <= p1141) AND (p1097 <= p817))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2475 + 1 <= p1141) AND (p1097 <= p817))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3193 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p206) OR (2 <= p1705))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p206) OR (2 <= p1705))))
lola: processed formula: A (F (((2 <= p206) OR (2 <= p1705))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1064 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((p1075 <= p1696) AND (1 <= p1709) AND ((p1506 <= p2086) OR (1 <= p413))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p1075 <= p1696) AND (1 <= p1709) AND ((p1506 <= p2086) OR (1 <= p413)))))
lola: processed formula length: 89
lola: 5 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 58 markings, 58 edges
lola: ========================================
lola: subprocess 14 will run for 1596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((2 <= p1892)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p1892)))
lola: processed formula: A (F ((2 <= p1892)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 15 will run for 3193 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((p1707 <= p161) U ((2 <= p1635) AND (2 <= p528)))) OR (A (F (((2 <= p1209) AND (1 <= p1428)))) OR (3 <= p2142)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3193 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1707 <= p161) U ((2 <= p1635) AND (2 <= p528))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1707 <= p161) U ((2 <= p1635) AND (2 <= p528))))
lola: processed formula: A (((p1707 <= p161) U ((2 <= p1635) AND (2 <= p528))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p2142)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p2142)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-308-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no unknown no no no no yes yes yes no yes no unknown
FORMULA CloudReconfiguration-PT-308-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-308-CTLCardinality-15 CANNOT_COMPUTE 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-308"
export BK_EXAMINATION="CTLCardinality"
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-308.tgz
mv CloudReconfiguration-PT-308 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-308, examination is CTLCardinality"
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-152646385400052"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;