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 828K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K 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 19K 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 irma4mcc-full
Input is CloudReconfiguration-PT-312, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646382000080
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526477461335


BK_STOP 1526478260037

--------------------
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-312 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': 615003, 'Memory': 1827.45, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CloudReconfiguration-PT-312...

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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-312: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ CloudReconfiguration-PT-312 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-312-CTLCardinality.task
lola: (E (F (E (F ((1 <= p175))))) AND (A (G (((p1531 <= p1857) OR (p60 <= p2385)))) AND A (X (((1 <= p2193) OR (p864 <= p79)))))) : E (G ((((p81 <= p393) OR (p2432 <= p1945) OR (2 <= p2267)) OR E (G ((1 <= p1315)))))) : E (F (E (F (((1 <= p709) AND (2 <= p2187)))))) : NOT((E (((p1193 <= p1825) U (3 <= p343))) OR (E (F ((p1289 <= p554))) AND (3 <= p956)))) : ((E (G ((p1774 <= p936))) OR ((3 <= p1174) OR ((p172 <= p768) AND (2 <= p704)) OR ((p1036 + 1 <= p2382) AND (p498 <= 0)))) AND E (((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094))))) : ((p776 <= p2287) AND E (G (A (F ((2 <= p1796)))))) : NOT(NOT(E (G (((3 <= p2193) OR (p397 <= p1357)))))) : (E (X (((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461)))) OR (E (F (((1 <= p1910) AND (2 <= p499)))) OR E (G ((2 <= p215))))) : A ((A (F ((p1932 <= p1554))) U A (F ((3 <= p1593))))) : A (G (A (((3 <= p563) U (p2254 <= p267))))) : A (G ((p374 <= 1))) : A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244))))) : (E (F (((p1894 + 1 <= p1627) OR (p1265 <= 1)))) AND A (G (((1 <= p483) OR (p2450 <= 0))))) : (E (G (A (F ((p1118 <= p1098))))) AND A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))) : E (G (((p2188 <= p2439) OR (2 <= p2580) OR (1 <= p2510)))) : E (G (A (G (((p539 <= p1661) OR (3 <= p2462))))))
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 (E (F ((1 <= p175))))) AND (A (G (((p1531 <= p1857) OR (p60 <= p2385)))) AND A (X (((1 <= p2193) OR (p864 <= p79))))))
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: E (F ((1 <= p175)))
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: 79 markings, 78 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1531 <= p1857) OR (p60 <= p2385))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p81 <= p393) OR (p2432 <= p1945) OR (2 <= p2267)) OR E (G ((1 <= p1315))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p393 + 1 <= p81) AND (p1945 + 1 <= p2432) AND (p2267 <= 1)) AND A(TRUE U (p1315 <= 0)))))
lola: processed formula length: 105
lola: 6 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= p709) AND (2 <= p2187))))))
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-312-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((p1193 <= p1825) U (3 <= p343))) OR (E (F ((p1289 <= p554))) AND (3 <= p956))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1825 + 1 <= p1193) R (p343 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1825 + 1 <= p1193) R (p343 <= 2)))
lola: processed formula: A (((p1825 + 1 <= p1193) R (p343 <= 2)))
lola: processed formula length: 40
lola: 10 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 342476 markings, 427374 edges, 68495 markings/sec, 0 secs
lola: 700751 markings, 873832 edges, 71655 markings/sec, 5 secs
lola: 1032671 markings, 1288388 edges, 66384 markings/sec, 10 secs
lola: 1347180 markings, 1680729 edges, 62902 markings/sec, 15 secs
lola: 1659866 markings, 2071164 edges, 62537 markings/sec, 20 secs
lola: 1981080 markings, 2471909 edges, 64243 markings/sec, 25 secs
lola: 2299588 markings, 2868346 edges, 63702 markings/sec, 30 secs
lola: 2613242 markings, 3257973 edges, 62731 markings/sec, 35 secs
lola: 2896711 markings, 3609587 edges, 56694 markings/sec, 40 secs
lola: 3169635 markings, 3949248 edges, 54585 markings/sec, 45 secs
lola: 3436086 markings, 4281614 edges, 53290 markings/sec, 50 secs
lola: 3715755 markings, 4629489 edges, 55934 markings/sec, 55 secs
lola: 3993016 markings, 4974321 edges, 55452 markings/sec, 60 secs
lola: 4274349 markings, 5323278 edges, 56267 markings/sec, 65 secs
lola: 4552735 markings, 5669800 edges, 55677 markings/sec, 70 secs
lola: 4817661 markings, 5999782 edges, 52985 markings/sec, 75 secs
lola: 5095211 markings, 6345455 edges, 55510 markings/sec, 80 secs
lola: 5375166 markings, 6693755 edges, 55991 markings/sec, 85 secs
lola: 5625450 markings, 7005804 edges, 50057 markings/sec, 90 secs
lola: 5900298 markings, 7348026 edges, 54970 markings/sec, 95 secs
lola: 6187564 markings, 7706619 edges, 57453 markings/sec, 100 secs
lola: 6452225 markings, 8035663 edges, 52932 markings/sec, 105 secs
lola: 6714310 markings, 8362713 edges, 52417 markings/sec, 110 secs
lola: 6967691 markings, 8677732 edges, 50676 markings/sec, 115 secs
lola: 7260272 markings, 9041053 edges, 58516 markings/sec, 120 secs
lola: 7550862 markings, 9402371 edges, 58118 markings/sec, 125 secs
lola: 7820290 markings, 9738290 edges, 53886 markings/sec, 130 secs
lola: 8093450 markings, 10080098 edges, 54632 markings/sec, 135 secs
lola: 8362308 markings, 10416025 edges, 53772 markings/sec, 140 secs
lola: 8620088 markings, 10738447 edges, 51556 markings/sec, 145 secs
lola: 8880087 markings, 11063395 edges, 52000 markings/sec, 150 secs
lola: 9130748 markings, 11377665 edges, 50132 markings/sec, 155 secs
lola: 9388299 markings, 11700368 edges, 51510 markings/sec, 160 secs
lola: 9653749 markings, 12032299 edges, 53090 markings/sec, 165 secs
lola: 9991959 markings, 12452857 edges, 67642 markings/sec, 170 secs
lola: 10312065 markings, 12850709 edges, 64021 markings/sec, 175 secs
lola: 10635794 markings, 13253836 edges, 64746 markings/sec, 180 secs
lola: 10957753 markings, 13654657 edges, 64392 markings/sec, 185 secs
lola: 11271732 markings, 14045497 edges, 62796 markings/sec, 190 secs
lola: 11599782 markings, 14454066 edges, 65610 markings/sec, 195 secs
lola: 11910678 markings, 14842073 edges, 62179 markings/sec, 200 secs
lola: 12243538 markings, 15255950 edges, 66572 markings/sec, 205 secs
lola: 12555264 markings, 15644140 edges, 62345 markings/sec, 210 secs
lola: 12863684 markings, 16027346 edges, 61684 markings/sec, 215 secs
lola: 13173549 markings, 16412983 edges, 61973 markings/sec, 220 secs
lola: 13485047 markings, 16800745 edges, 62300 markings/sec, 225 secs
lola: 13776472 markings, 17164678 edges, 58285 markings/sec, 230 secs
lola: 14108168 markings, 17578416 edges, 66339 markings/sec, 235 secs
lola: 14447507 markings, 18000876 edges, 67868 markings/sec, 240 secs
lola: 14752642 markings, 18379938 edges, 61027 markings/sec, 245 secs
lola: 15065773 markings, 18767588 edges, 62626 markings/sec, 250 secs
lola: 15333717 markings, 19098718 edges, 53589 markings/sec, 255 secs
lola: 15600204 markings, 19429440 edges, 53297 markings/sec, 260 secs
lola: 15858146 markings, 19750145 edges, 51588 markings/sec, 265 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 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((p1774 <= p936))) OR ((3 <= p1174) OR ((p172 <= p768) AND (2 <= p704)) OR ((p1036 + 1 <= p2382) AND (p498 <= 0)))) AND E (((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p1774 <= p936)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p936 + 1 <= p1774)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094)))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p776 <= p2287) AND E (G (A (F ((2 <= p1796))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p776 <= p2287)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p776 <= p2287)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((2 <= p1796)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (2 <= p1796)))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 63 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((3 <= p2193) OR (p397 <= p1357))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p2193 <= 2) AND (p1357 + 1 <= p397))))
lola: processed formula length: 53
lola: 8 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461)))) OR (E (F (((1 <= p1910) AND (2 <= p499)))) OR E (G ((2 <= p215)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461)))
lola: processed formula length: 59
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1910) AND (2 <= p499))))
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-312-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p215)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p215 <= 1)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((p1932 <= p1554))) U A (F ((3 <= p1593)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (p1932 <= p1554)) U A(TRUE U (3 <= p1593)))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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 3 significant temporal operators and needs 13 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: 63 markings, 252 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((3 <= p563) U (p2254 <= p267)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((3 <= p563) U (p2254 <= p267)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 170941 markings, 463527 edges, 3689348869717491712 markings/sec, 0 secs
lola: 341594 markings, 928609 edges, 34131 markings/sec, 5 secs
lola: 509234 markings, 1379058 edges, 33528 markings/sec, 10 secs
lola: 694636 markings, 1847371 edges, 37080 markings/sec, 15 secs
lola: 880386 markings, 2324697 edges, 37150 markings/sec, 20 secs
lola: 1038750 markings, 2756032 edges, 31673 markings/sec, 25 secs
lola: 1209746 markings, 3198802 edges, 34199 markings/sec, 30 secs
lola: 1351728 markings, 3580925 edges, 28396 markings/sec, 35 secs
lola: 1516512 markings, 4000439 edges, 32957 markings/sec, 40 secs
lola: 1674708 markings, 4405018 edges, 31639 markings/sec, 45 secs
lola: 1817178 markings, 4803791 edges, 28494 markings/sec, 50 secs
lola: 1974827 markings, 5208452 edges, 31530 markings/sec, 55 secs
lola: 2112236 markings, 5579957 edges, 27482 markings/sec, 60 secs
lola: 2249095 markings, 5964490 edges, 27372 markings/sec, 65 secs
lola: 2426511 markings, 6406954 edges, 35483 markings/sec, 70 secs
lola: 2567253 markings, 6826592 edges, 28148 markings/sec, 75 secs
lola: 2735799 markings, 7247275 edges, 33709 markings/sec, 80 secs
lola: 2884478 markings, 7638175 edges, 29736 markings/sec, 85 secs
lola: 3062722 markings, 8106673 edges, 35649 markings/sec, 90 secs
lola: 3262256 markings, 8621594 edges, 39907 markings/sec, 95 secs
lola: 3459468 markings, 9124917 edges, 39442 markings/sec, 100 secs
lola: 3648298 markings, 9616121 edges, 37766 markings/sec, 105 secs
lola: 3814598 markings, 10060788 edges, 33260 markings/sec, 110 secs
lola: 4000911 markings, 10534835 edges, 37263 markings/sec, 115 secs
lola: 4175807 markings, 10995372 edges, 34979 markings/sec, 120 secs
lola: 4360112 markings, 11462139 edges, 36861 markings/sec, 125 secs
lola: 4533341 markings, 11904234 edges, 34646 markings/sec, 130 secs
lola: 4684702 markings, 12323154 edges, 30272 markings/sec, 135 secs
lola: 4798786 markings, 12671356 edges, 22817 markings/sec, 140 secs
lola: 4945435 markings, 13052261 edges, 29330 markings/sec, 145 secs
lola: 5082993 markings, 13435306 edges, 27512 markings/sec, 150 secs
lola: 5208981 markings, 13776319 edges, 25198 markings/sec, 155 secs
lola: 5334510 markings, 14122715 edges, 25106 markings/sec, 160 secs
lola: 5464358 markings, 14462487 edges, 25970 markings/sec, 165 secs
lola: 5574834 markings, 14766325 edges, 22095 markings/sec, 170 secs
lola: 5681277 markings, 15060009 edges, 21289 markings/sec, 175 secs
lola: 5779984 markings, 15383972 edges, 19741 markings/sec, 180 secs
lola: 5852145 markings, 15660981 edges, 14432 markings/sec, 185 secs
lola: 5959693 markings, 16010079 edges, 21510 markings/sec, 190 secs
lola: 6049721 markings, 16342230 edges, 18006 markings/sec, 195 secs
lola: 6154535 markings, 16700169 edges, 20963 markings/sec, 200 secs
lola: 6261669 markings, 17073992 edges, 21427 markings/sec, 205 secs
lola: 6373557 markings, 17457815 edges, 22378 markings/sec, 210 secs
lola: 6458772 markings, 17788523 edges, 17043 markings/sec, 215 secs
lola: 6538322 markings, 18083204 edges, 15910 markings/sec, 220 secs
lola: 6626869 markings, 18399957 edges, 17709 markings/sec, 225 secs
lola: 6719169 markings, 18739497 edges, 18460 markings/sec, 230 secs
lola: 6828363 markings, 19110165 edges, 21839 markings/sec, 235 secs
lola: 6945829 markings, 19522016 edges, 23493 markings/sec, 240 secs
lola: 7064376 markings, 19905635 edges, 23709 markings/sec, 245 secs
lola: 7183156 markings, 20295618 edges, 23756 markings/sec, 250 secs
lola: 7294822 markings, 20677290 edges, 22333 markings/sec, 255 secs
lola: 7396889 markings, 21002758 edges, 20413 markings/sec, 260 secs
lola: 7500039 markings, 21343782 edges, 20630 markings/sec, 265 secs
lola: 7598166 markings, 21662450 edges, 19625 markings/sec, 270 secs
lola: 7782988 markings, 22172666 edges, 36964 markings/sec, 275 secs
lola: 7932624 markings, 22626427 edges, 29927 markings/sec, 280 secs
lola: 8085474 markings, 23070612 edges, 30570 markings/sec, 285 secs
lola: 8235562 markings, 23492966 edges, 30018 markings/sec, 290 secs
lola: 8357067 markings, 23854553 edges, 24301 markings/sec, 295 secs
lola: 8473049 markings, 24203125 edges, 23196 markings/sec, 300 secs
lola: 8579275 markings, 24563866 edges, 21245 markings/sec, 305 secs
lola: 8680902 markings, 24902798 edges, 20325 markings/sec, 310 secs
lola: 8792863 markings, 25266194 edges, 22392 markings/sec, 315 secs
lola: 8897723 markings, 25629465 edges, 20972 markings/sec, 320 secs
lola: 9008107 markings, 26010801 edges, 22077 markings/sec, 325 secs
lola: 9110220 markings, 26349662 edges, 20423 markings/sec, 330 secs
lola: 9179807 markings, 26606150 edges, 13917 markings/sec, 335 secs
lola: 9275441 markings, 26950940 edges, 19127 markings/sec, 340 secs
lola: 9379469 markings, 27279081 edges, 20806 markings/sec, 345 secs
lola: 9494405 markings, 27619094 edges, 22987 markings/sec, 350 secs
lola: 9626853 markings, 28029382 edges, 26490 markings/sec, 355 secs
lola: 9748479 markings, 28423719 edges, 24325 markings/sec, 360 secs
lola: 9865943 markings, 28807709 edges, 23493 markings/sec, 365 secs
lola: 9982784 markings, 29205814 edges, 23368 markings/sec, 370 secs
lola: 10116149 markings, 29605638 edges, 26673 markings/sec, 375 secs
lola: 10219814 markings, 29976763 edges, 20733 markings/sec, 380 secs
lola: 10370191 markings, 30413407 edges, 30075 markings/sec, 385 secs
lola: 10512596 markings, 30832368 edges, 28481 markings/sec, 390 secs
lola: 10638922 markings, 31253342 edges, 25265 markings/sec, 395 secs
lola: 10782624 markings, 31679747 edges, 28740 markings/sec, 400 secs
lola: 10927642 markings, 32099617 edges, 29004 markings/sec, 405 secs
lola: 11066229 markings, 32547295 edges, 27717 markings/sec, 410 secs
lola: 11161479 markings, 32906796 edges, 19050 markings/sec, 415 secs
lola: 11287351 markings, 33307432 edges, 25174 markings/sec, 420 secs
lola: 11401194 markings, 33690630 edges, 22769 markings/sec, 425 secs
lola: 11501892 markings, 34118390 edges, 20140 markings/sec, 430 secs
lola: 11601569 markings, 34488008 edges, 19935 markings/sec, 435 secs
lola: 11678300 markings, 34765763 edges, 15346 markings/sec, 440 secs
lola: 11761851 markings, 35064607 edges, 16710 markings/sec, 445 secs
lola: 11824143 markings, 35305800 edges, 12458 markings/sec, 450 secs
lola: 11912105 markings, 35624837 edges, 17592 markings/sec, 455 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p374 <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-10.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 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244)))))
lola: processed formula: A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244)))))
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 70 markings, 70 edges
lola: ========================================
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p1894 + 1 <= p1627) OR (p1265 <= 1)))) AND A (G (((1 <= p483) OR (p2450 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1894 + 1 <= p1627) OR (p1265 <= 1))))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p483) OR (p2450 <= 0))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 60 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((p1118 <= p1098))))) AND A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p1118 <= p1098)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p1118 <= p1098)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 126 edges
lola: ========================================
lola: subprocess 14 will run for 1393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))
lola: processed formula: A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2188 <= p2439) OR (2 <= p2580) OR (1 <= p2510))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p2439 + 1 <= p2188) AND (p2580 <= 1) AND (p2510 <= 0))))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 64 markings, 64 edges
lola: ========================================
lola: subprocess 15 will run for 2787 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (((p539 <= p1661) OR (3 <= p2462))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U ((p1661 + 1 <= p539) AND (p2462 <= 2)))))
lola: processed formula length: 63
lola: 4 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-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: 4749 markings, 6125 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown yes no yes no no unknown yes no no no yes no
FORMULA CloudReconfiguration-PT-312-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA CloudReconfiguration-PT-312-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-312"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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-312.tgz
mv CloudReconfiguration-PT-312 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is CloudReconfiguration-PT-312, 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 r054-smll-152646382000080"
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 ;