About the Execution of M4M.full for CloudReconfiguration-PT-304
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2509.200 | 644818.00 | 615413.00 | 2107.80 | TTTFTTFFF?FTTTT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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-304, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385400024
=====================================================================
--------------------
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-304-CTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-304-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526500903835
BK_STOP 1526501548653
--------------------
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-304 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': 995057, 'Memory': 15894.09, 'Tool': 'itstools'}, {'Time': 1506047, 'Memory': 2291.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.5135283707365508x far from the best tool itstools.
CTLCardinality lola CloudReconfiguration-PT-304...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
CloudReconfiguration-PT-304: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-304: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ CloudReconfiguration-PT-304 @ 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: 5678/65536 symbol table entries, 638 collisions
lola: preprocessing...
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2707 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-304-CTLCardinality.task
lola: NOT(NOT(NOT(A (F ((2 <= p1573)))))) : A (G (((p2045 <= 1) AND (p268 <= 2) AND ((p2143 <= 0) OR (p658 <= 2))))) : NOT(E (X (A (G ((p2155 <= p2562)))))) : A (G (((p548 <= 2) AND (p348 <= p2516)))) : E (F ((1 <= p2322))) : NOT(A (F (((1 <= p1107) AND ((3 <= p396) OR (p1101 <= p2028)))))) : (A (F ((3 <= p1617))) OR ((((3 <= p1057) OR (2 <= p2554) OR (1 <= p2137)) OR E (F ((p467 <= p2335)))) AND A (G (((p192 <= p2446) AND (p2295 <= p253)))))) : A (((p282 <= 0) U ((p948 + 1 <= p232) AND (p300 + 1 <= p337)))) : (A (G (A (F ((p2423 <= p94))))) AND E ((((p676 <= p1938) OR (p2099 <= p2320)) U ((2 <= p1565) OR (2 <= p794))))) : E (F (((((3 <= p1771) AND (p1795 <= p1485)) OR ((p2501 <= p842) AND (1 <= p828))) AND E (X ((3 <= p1507)))))) : NOT((E (G (((p2440 <= p1087) OR (p1780 <= p1966)))) AND (((p531 <= 0) OR (p1551 + 1 <= p2336)) AND ((p154 <= p1065) OR (p693 <= p305))))) : E (G (E (G (((p2152 <= p1720) OR (p1698 <= p1168)))))) : (((p2180 <= 2) AND (((3 <= p1392) AND (p489 <= p227) AND (p1397 <= p473)) OR (3 <= p1270))) OR NOT(A (G (((p1036 <= p1783) OR (2 <= p1166)))))) : E (F (E (G ((p1229 <= 0))))) : E (F (((p946 <= 2) AND (p1076 + 1 <= p1505) AND (((p1582 <= p1196) AND (1 <= p388)) OR (p1876 <= p2411))))) : NOT(((p1649 <= p1858) AND A (F ((2 <= p84)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(A (F ((2 <= p1573))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p1573)))
lola: processed formula length: 27
lola: 11 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 71 markings, 71 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2045 <= 1) AND (p268 <= 2) AND ((p2143 <= 0) OR (p658 <= 2)))))
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 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 85122 markings, 104907 edges, 17024 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((p2155 <= p2562))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p2562 + 1 <= p2155)))
lola: processed formula length: 34
lola: 7 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 189865 markings, 605779 edges, 3689348869717491712 markings/sec, 0 secs
lola: 382668 markings, 1217772 edges, 38561 markings/sec, 5 secs
lola: 555023 markings, 1853891 edges, 34471 markings/sec, 10 secs
lola: 697507 markings, 2440269 edges, 28497 markings/sec, 15 secs
lola: 850563 markings, 3062977 edges, 30611 markings/sec, 20 secs
lola: 988581 markings, 3697599 edges, 27604 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1064332 markings, 3942250 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p548 <= 2) AND (p348 <= p2516))))
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 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 760 markings, 839 edges
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p2322)))
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 12 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-304-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((1 <= p1107) AND ((3 <= p396) OR (p1101 <= p2028))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p1107) AND ((3 <= p396) OR (p1101 <= p2028)))))
lola: processed formula length: 68
lola: 5 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 71 markings, 71 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((3 <= p1617))) OR ((((3 <= p1057) OR (2 <= p2554) OR (1 <= p2137)) OR E (F ((p467 <= p2335)))) AND A (G (((p192 <= p2446) AND (p2295 <= p253))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p1617)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p1617)))
lola: processed formula: A (F ((3 <= p1617)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-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 11 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 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p1057) OR (2 <= p2554) OR (1 <= p2137))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p1057) OR (2 <= p2554) OR (1 <= p2137))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: processed formula with 3 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 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p467 <= p2335)))
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 12 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: state equation: write sara problem file to CloudReconfiguration-PT-304-CTLCardinality-8.sara
lola: The predicate is reachable.
lola: lola: 0 markings, 0 edges
state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p192 <= p2446) AND (p2295 <= p253))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file CloudReconfiguration-PT-304-CTLCardinality-8.sara.lola:
STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-CTLCardinality-9.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: 70 markings, 69 edges
lola: SUBRESULT
lola: result: no
lola: lola: ========================================The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p282 <= 0) U ((p948 + 1 <= p232) AND (p300 + 1 <= p337))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p282 <= 0) U ((p948 + 1 <= p232) AND (p300 + 1 <= p337))))
lola: processed formula: A (((p282 <= 0) U ((p948 + 1 <= p232) AND (p300 + 1 <= p337))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-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 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 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p2423 <= p94))))) AND E ((((p676 <= p1938) OR (p2099 <= p2320)) U ((2 <= p1565) OR (2 <= p794)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p2423 <= p94)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p2423 <= p94)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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).
sara: place or transition ordering is non-deterministic
lola: 177370 markings, 481522 edges, 35461 markings/sec, 0 secs
lola: 332051 markings, 965195 edges, 30936 markings/sec, 5 secs
lola: 505888 markings, 1443926 edges, 34767 markings/sec, 10 secs
lola: 687712 markings, 1938637 edges, 36365 markings/sec, 15 secs
lola: 837804 markings, 2369797 edges, 30018 markings/sec, 20 secs
lola: 1009599 markings, 2837434 edges, 34359 markings/sec, 25 secs
lola: 1154614 markings, 3237809 edges, 29003 markings/sec, 30 secs
lola: 1322056 markings, 3679301 edges, 33488 markings/sec, 35 secs
lola: 1482727 markings, 4124233 edges, 32134 markings/sec, 40 secs
lola: 1630528 markings, 4523043 edges, 29560 markings/sec, 45 secs
lola: 1761131 markings, 4895606 edges, 26121 markings/sec, 50 secs
lola: 1895680 markings, 5289729 edges, 26910 markings/sec, 55 secs
lola: 2027994 markings, 5675136 edges, 26463 markings/sec, 60 secs
lola: 2158831 markings, 6081077 edges, 26167 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2223819 markings, 6265107 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((3 <= p1771) AND (p1795 <= p1485)) OR ((p2501 <= p842) AND (1 <= p828))) AND E (X ((3 <= p1507))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((((3 <= p1771) AND (p1795 <= p1485)) OR ((p2501 <= p842) AND (1 <= p828))) AND EX((3 <= p1507))))
lola: processed formula length: 108
lola: 2 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 174700 markings, 559126 edges, 3095312973799882752 markings/sec, 0 secs
lola: 366314 markings, 1153030 edges, 38323 markings/sec, 5 secs
lola: 542043 markings, 1786041 edges, 35146 markings/sec, 10 secs
lola: 681450 markings, 2376806 edges, 27881 markings/sec, 15 secs
lola: 838077 markings, 3006772 edges, 31325 markings/sec, 20 secs
lola: 974017 markings, 3634424 edges, 27188 markings/sec, 25 secs
lola: 1152087 markings, 4175270 edges, 35614 markings/sec, 30 secs
lola: 1313569 markings, 4638163 edges, 32296 markings/sec, 35 secs
lola: 1477539 markings, 5087206 edges, 32794 markings/sec, 40 secs
lola: 1599488 markings, 5449445 edges, 24390 markings/sec, 45 secs
lola: 1716935 markings, 5792060 edges, 23489 markings/sec, 50 secs
lola: 1862325 markings, 6187635 edges, 29078 markings/sec, 55 secs
lola: 1986985 markings, 6544687 edges, 24932 markings/sec, 60 secs
lola: 2104399 markings, 6904658 edges, 23483 markings/sec, 65 secs
lola: 2211869 markings, 7219439 edges, 21494 markings/sec, 70 secs
lola: 2320410 markings, 7521744 edges, 21708 markings/sec, 75 secs
lola: 2423792 markings, 7824801 edges, 20676 markings/sec, 80 secs
lola: 2524416 markings, 8111803 edges, 20125 markings/sec, 85 secs
lola: 2651864 markings, 8474989 edges, 25490 markings/sec, 90 secs
lola: 2767356 markings, 8826750 edges, 23098 markings/sec, 95 secs
lola: 2895240 markings, 9205925 edges, 25577 markings/sec, 100 secs
lola: 3012859 markings, 9621870 edges, 23524 markings/sec, 105 secs
lola: 3133865 markings, 10018874 edges, 24201 markings/sec, 110 secs
lola: 3263334 markings, 10446501 edges, 25894 markings/sec, 115 secs
lola: 3391884 markings, 10881609 edges, 25710 markings/sec, 120 secs
lola: 3512009 markings, 11219764 edges, 24025 markings/sec, 125 secs
lola: 3618264 markings, 11563003 edges, 21251 markings/sec, 130 secs
lola: 3714731 markings, 11900495 edges, 19293 markings/sec, 135 secs
lola: 3820167 markings, 12257213 edges, 21087 markings/sec, 140 secs
lola: 3928846 markings, 12596846 edges, 21736 markings/sec, 145 secs
lola: 4021113 markings, 12914803 edges, 18453 markings/sec, 150 secs
lola: 4131879 markings, 13297455 edges, 22153 markings/sec, 155 secs
lola: 4258774 markings, 13697181 edges, 25379 markings/sec, 160 secs
lola: 4377938 markings, 14075011 edges, 23833 markings/sec, 165 secs
lola: 4471783 markings, 14397427 edges, 18769 markings/sec, 170 secs
lola: 4554583 markings, 14696868 edges, 16560 markings/sec, 175 secs
lola: 4642684 markings, 14996793 edges, 17620 markings/sec, 180 secs
lola: 4733548 markings, 15279884 edges, 18173 markings/sec, 185 secs
lola: 4858908 markings, 15689345 edges, 25072 markings/sec, 190 secs
lola: 4970369 markings, 16081236 edges, 22292 markings/sec, 195 secs
lola: 5109088 markings, 16581995 edges, 27744 markings/sec, 200 secs
lola: 5238155 markings, 17031337 edges, 25813 markings/sec, 205 secs
lola: 5361886 markings, 17465867 edges, 24746 markings/sec, 210 secs
lola: 5480815 markings, 17879598 edges, 23786 markings/sec, 215 secs
lola: 5593541 markings, 18276599 edges, 22545 markings/sec, 220 secs
lola: 5709160 markings, 18664921 edges, 23124 markings/sec, 225 secs
lola: 5786711 markings, 18939674 edges, 15510 markings/sec, 230 secs
lola: 5891747 markings, 19270240 edges, 21007 markings/sec, 235 secs
lola: 5991960 markings, 19613806 edges, 20043 markings/sec, 240 secs
lola: 6080134 markings, 19931091 edges, 17635 markings/sec, 245 secs
lola: 6160927 markings, 20200517 edges, 16159 markings/sec, 250 secs
lola: 6250072 markings, 20508980 edges, 17829 markings/sec, 255 secs
lola: 6325282 markings, 20775911 edges, 15042 markings/sec, 260 secs
lola: 6414395 markings, 21075919 edges, 17823 markings/sec, 265 secs
lola: 6505867 markings, 21375862 edges, 18294 markings/sec, 270 secs
lola: 6587981 markings, 21652804 edges, 16423 markings/sec, 275 secs
lola: 6670001 markings, 21949791 edges, 16404 markings/sec, 280 secs
lola: 6746438 markings, 22216596 edges, 15287 markings/sec, 285 secs
lola: 6817583 markings, 22454868 edges, 14229 markings/sec, 290 secs
lola: 6889047 markings, 22709775 edges, 14293 markings/sec, 295 secs
lola: 6947658 markings, 22913970 edges, 11722 markings/sec, 300 secs
lola: 7008292 markings, 23130595 edges, 12127 markings/sec, 305 secs
lola: 7072843 markings, 23356657 edges, 12910 markings/sec, 310 secs
lola: 7149528 markings, 23616837 edges, 15337 markings/sec, 315 secs
lola: 7254969 markings, 23976992 edges, 21088 markings/sec, 320 secs
lola: 7322949 markings, 24206831 edges, 13596 markings/sec, 325 secs
lola: 7435759 markings, 24581732 edges, 22562 markings/sec, 330 secs
lola: 7557454 markings, 24990709 edges, 24339 markings/sec, 335 secs
lola: 7680899 markings, 25404434 edges, 24689 markings/sec, 340 secs
lola: 7795070 markings, 25790530 edges, 22834 markings/sec, 345 secs
lola: 7895988 markings, 26136825 edges, 20184 markings/sec, 350 secs
lola: 7987522 markings, 26447388 edges, 18307 markings/sec, 355 secs
lola: 8064011 markings, 26710485 edges, 15298 markings/sec, 360 secs
lola: 8135740 markings, 26957798 edges, 14346 markings/sec, 365 secs
lola: 8198206 markings, 27183608 edges, 12493 markings/sec, 370 secs
lola: 8293191 markings, 27489490 edges, 18997 markings/sec, 375 secs
lola: 8397834 markings, 27836967 edges, 20929 markings/sec, 380 secs
lola: 8506769 markings, 28197126 edges, 21787 markings/sec, 385 secs
lola: 8597609 markings, 28502865 edges, 18168 markings/sec, 390 secs
lola: 8693632 markings, 28819628 edges, 19205 markings/sec, 395 secs
lola: 8791591 markings, 29146705 edges, 19592 markings/sec, 400 secs
lola: 8905199 markings, 29527522 edges, 22722 markings/sec, 405 secs
lola: 9012130 markings, 29887037 edges, 21386 markings/sec, 410 secs
lola: 9110833 markings, 30221621 edges, 19741 markings/sec, 415 secs
lola: 9201208 markings, 30555206 edges, 18075 markings/sec, 420 secs
lola: 9301309 markings, 30868793 edges, 20020 markings/sec, 425 secs
lola: 9401724 markings, 31183286 edges, 20083 markings/sec, 430 secs
lola: 9499603 markings, 31507135 edges, 19576 markings/sec, 435 secs
lola: 9611321 markings, 31889707 edges, 22344 markings/sec, 440 secs
lola: 9704961 markings, 32206584 edges, 18728 markings/sec, 445 secs
lola: 9795378 markings, 32509994 edges, 18083 markings/sec, 450 secs
lola: 9905188 markings, 32875052 edges, 21962 markings/sec, 455 secs
lola: 9999786 markings, 33205101 edges, 18920 markings/sec, 460 secs
lola: 10107752 markings, 33560954 edges, 21593 markings/sec, 465 secs
lola: 10203825 markings, 33879713 edges, 19215 markings/sec, 470 secs
lola: 10324024 markings, 34265432 edges, 24040 markings/sec, 475 secs
lola: 10440051 markings, 34676160 edges, 23205 markings/sec, 480 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 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((p2440 <= p1087) OR (p1780 <= p1966)))) AND (((p531 <= 0) OR (p1551 + 1 <= p2336)) AND ((p154 <= p1065) OR (p693 <= p305)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p1087 + 1 <= p2440) AND (p1966 + 1 <= p1780))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p1087 + 1 <= p2440) AND (p1966 + 1 <= p1780))))
lola: processed formula: A (F (((p1087 + 1 <= p2440) AND (p1966 + 1 <= p1780))))
lola: processed formula length: 55
lola: 5 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-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 11 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 11 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= p531) AND (p2336 <= p1551)) OR ((p1065 + 1 <= p154) AND (p305 + 1 <= p693)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p531) AND (p2336 <= p1551)) OR ((p1065 + 1 <= p154) AND (p305 + 1 <= p693)))
lola: processed formula length: 85
lola: 5 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: processed formula with 4 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: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (((p2152 <= p1720) OR (p1698 <= p1168))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((p1720 + 1 <= p2152) AND (p1168 + 1 <= p1698)))))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 71 markings, 213 edges
lola: ========================================
lola: subprocess 12 will run for 735 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p2180 <= 2) AND (((3 <= p1392) AND (p489 <= p227) AND (p1397 <= p473)) OR (3 <= p1270))) OR NOT(A (G (((p1036 <= p1783) OR (2 <= p1166))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 735 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p2180 <= 2) AND (((3 <= p1392) AND (p489 <= p227) AND (p1397 <= p473)) OR (3 <= p1270)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2180 <= 2) AND (((3 <= p1392) AND (p489 <= p227) AND (p1397 <= p473)) OR (3 <= p1270)))
lola: processed formula length: 91
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: processed formula with 5 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 13 will run for 980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1783 + 1 <= p1036) AND (p1166 <= 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 12 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-304-CTLCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 54 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p1229 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= p1229))))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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: 71 markings, 72 edges
lola: ========================================
lola: subprocess 14 will run for 1470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p946 <= 2) AND (p1076 + 1 <= p1505) AND (((p1582 <= p1196) AND (1 <= p388)) OR (p1876 <= p2411)))))
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 12 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 15 will run for 2940 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((p1649 <= p1858) AND A (F ((2 <= p84)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2940 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1858 + 1 <= p1649)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1858 + 1 <= p1649)
lola: processed formula length: 20
lola: 5 rewrites
lola: formula mentions 0 of 2584 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-304-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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes no no no unknown no yes yes yes yes unknown
FORMULA CloudReconfiguration-PT-304-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudReconfiguration-PT-304"
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-304.tgz
mv CloudReconfiguration-PT-304 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-304, 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-152646385400024"
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 '
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 ;