fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r059-smll-152646386000024
Last Updated
June 26, 2018

About the Execution of M4M.struct for CloudReconfiguration-PT-304

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2462.360 645118.00 613360.00 2410.30 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-structural
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 r059-smll-152646386000024
=====================================================================


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


BK_STOP 1526516340433

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 235 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 || 82363 markings, 101558 edges, 16473 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: 192814 markings, 615092 edges, 3689348869717491712 markings/sec, 0 secs
lola: 387247 markings, 1232137 edges, 38887 markings/sec, 5 secs
lola: 557736 markings, 1865577 edges, 34098 markings/sec, 10 secs
lola: 701216 markings, 2455183 edges, 28696 markings/sec, 15 secs
lola: 853684 markings, 3076535 edges, 30494 markings/sec, 20 secs
lola: 992467 markings, 3714030 edges, 27757 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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 70 markings, 69 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
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).
lola: 186541 markings, 512119 edges, 37295 markings/sec, 0 secs
lola: 341411 markings, 998148 edges, 30974 markings/sec, 5 secs
lola: 521414 markings, 1483818 edges, 36001 markings/sec, 10 secs
lola: 700828 markings, 1978974 edges, 35883 markings/sec, 15 secs
lola: 855146 markings, 2417896 edges, 30864 markings/sec, 20 secs
lola: 1023141 markings, 2874388 edges, 33599 markings/sec, 25 secs
lola: 1171031 markings, 3278615 edges, 29578 markings/sec, 30 secs
lola: 1340454 markings, 3724853 edges, 33885 markings/sec, 35 secs
lola: 1498233 markings, 4167224 edges, 31556 markings/sec, 40 secs
lola: 1648222 markings, 4575140 edges, 29998 markings/sec, 45 secs
lola: 1790342 markings, 4979546 edges, 28424 markings/sec, 50 secs
lola: 1925846 markings, 5388089 edges, 27101 markings/sec, 55 secs
lola: 2067767 markings, 5806462 edges, 28384 markings/sec, 60 secs
lola: 2207985 markings, 6223482 edges, 28044 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 490 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: 191755 markings, 612361 edges, 3095312973799882752 markings/sec, 0 secs
lola: 386360 markings, 1229424 edges, 38921 markings/sec, 5 secs
lola: 557051 markings, 1861727 edges, 34138 markings/sec, 10 secs
lola: 699625 markings, 2450560 edges, 28515 markings/sec, 15 secs
lola: 852389 markings, 3070916 edges, 30553 markings/sec, 20 secs
lola: 990876 markings, 3707037 edges, 27697 markings/sec, 25 secs
lola: 1167060 markings, 4225793 edges, 35237 markings/sec, 30 secs
lola: 1337237 markings, 4693154 edges, 34035 markings/sec, 35 secs
lola: 1477645 markings, 5087618 edges, 28082 markings/sec, 40 secs
lola: 1598274 markings, 5445585 edges, 24126 markings/sec, 45 secs
lola: 1715260 markings, 5787654 edges, 23397 markings/sec, 50 secs
lola: 1859214 markings, 6179326 edges, 28791 markings/sec, 55 secs
lola: 1981301 markings, 6527838 edges, 24417 markings/sec, 60 secs
lola: 2094992 markings, 6877635 edges, 22738 markings/sec, 65 secs
lola: 2200730 markings, 7188664 edges, 21148 markings/sec, 70 secs
lola: 2306741 markings, 7482661 edges, 21202 markings/sec, 75 secs
lola: 2413664 markings, 7793751 edges, 21385 markings/sec, 80 secs
lola: 2509627 markings, 8071592 edges, 19193 markings/sec, 85 secs
lola: 2627450 markings, 8391465 edges, 23565 markings/sec, 90 secs
lola: 2745309 markings, 8762162 edges, 23572 markings/sec, 95 secs
lola: 2871616 markings, 9131541 edges, 25261 markings/sec, 100 secs
lola: 2988799 markings, 9540826 edges, 23437 markings/sec, 105 secs
lola: 3103366 markings, 9906488 edges, 22913 markings/sec, 110 secs
lola: 3236536 markings, 10359126 edges, 26634 markings/sec, 115 secs
lola: 3363416 markings, 10789519 edges, 25376 markings/sec, 120 secs
lola: 3483105 markings, 11136920 edges, 23938 markings/sec, 125 secs
lola: 3589009 markings, 11457313 edges, 21181 markings/sec, 130 secs
lola: 3682713 markings, 11796873 edges, 18741 markings/sec, 135 secs
lola: 3783676 markings, 12147023 edges, 20193 markings/sec, 140 secs
lola: 3889136 markings, 12482488 edges, 21092 markings/sec, 145 secs
lola: 3977011 markings, 12767382 edges, 17575 markings/sec, 150 secs
lola: 4092390 markings, 13152756 edges, 23076 markings/sec, 155 secs
lola: 4211574 markings, 13542013 edges, 23837 markings/sec, 160 secs
lola: 4335093 markings, 13937295 edges, 24704 markings/sec, 165 secs
lola: 4439338 markings, 14289303 edges, 20849 markings/sec, 170 secs
lola: 4519102 markings, 14574367 edges, 15953 markings/sec, 175 secs
lola: 4610078 markings, 14886686 edges, 18195 markings/sec, 180 secs
lola: 4688788 markings, 15139436 edges, 15742 markings/sec, 185 secs
lola: 4794739 markings, 15479226 edges, 21190 markings/sec, 190 secs
lola: 4917936 markings, 15891978 edges, 24639 markings/sec, 195 secs
lola: 5043446 markings, 16350581 edges, 25102 markings/sec, 200 secs
lola: 5170519 markings, 16798461 edges, 25415 markings/sec, 205 secs
lola: 5293911 markings, 17236724 edges, 24678 markings/sec, 210 secs
lola: 5420959 markings, 17662312 edges, 25410 markings/sec, 215 secs
lola: 5526923 markings, 18037554 edges, 21193 markings/sec, 220 secs
lola: 5645818 markings, 18463457 edges, 23779 markings/sec, 225 secs
lola: 5735516 markings, 18748531 edges, 17940 markings/sec, 230 secs
lola: 5821339 markings, 19044489 edges, 17165 markings/sec, 235 secs
lola: 5933148 markings, 19416458 edges, 22362 markings/sec, 240 secs
lola: 6029506 markings, 19744833 edges, 19272 markings/sec, 245 secs
lola: 6110565 markings, 20030643 edges, 16212 markings/sec, 250 secs
lola: 6193123 markings, 20324178 edges, 16512 markings/sec, 255 secs
lola: 6277821 markings, 20599409 edges, 16940 markings/sec, 260 secs
lola: 6353033 markings, 20874180 edges, 15042 markings/sec, 265 secs
lola: 6442164 markings, 21169096 edges, 17826 markings/sec, 270 secs
lola: 6523908 markings, 21438090 edges, 16349 markings/sec, 275 secs
lola: 6607270 markings, 21718577 edges, 16672 markings/sec, 280 secs
lola: 6687966 markings, 22012666 edges, 16139 markings/sec, 285 secs
lola: 6759644 markings, 22261212 edges, 14336 markings/sec, 290 secs
lola: 6828333 markings, 22493273 edges, 13738 markings/sec, 295 secs
lola: 6897419 markings, 22738260 edges, 13817 markings/sec, 300 secs
lola: 6953936 markings, 22938847 edges, 11303 markings/sec, 305 secs
lola: 7017253 markings, 23163351 edges, 12663 markings/sec, 310 secs
lola: 7078566 markings, 23372847 edges, 12263 markings/sec, 315 secs
lola: 7156536 markings, 23641197 edges, 15594 markings/sec, 320 secs
lola: 7258743 markings, 23990016 edges, 20441 markings/sec, 325 secs
lola: 7323079 markings, 24207377 edges, 12867 markings/sec, 330 secs
lola: 7434364 markings, 24576957 edges, 22257 markings/sec, 335 secs
lola: 7554217 markings, 24976601 edges, 23971 markings/sec, 340 secs
lola: 7676383 markings, 25389176 edges, 24433 markings/sec, 345 secs
lola: 7788291 markings, 25767284 edges, 22382 markings/sec, 350 secs
lola: 7888273 markings, 26109021 edges, 19996 markings/sec, 355 secs
lola: 7976443 markings, 26407461 edges, 17634 markings/sec, 360 secs
lola: 8053326 markings, 26673952 edges, 15377 markings/sec, 365 secs
lola: 8121431 markings, 26908106 edges, 13621 markings/sec, 370 secs
lola: 8189965 markings, 27150433 edges, 13707 markings/sec, 375 secs
lola: 8265226 markings, 27405503 edges, 15052 markings/sec, 380 secs
lola: 8367187 markings, 27736399 edges, 20392 markings/sec, 385 secs
lola: 8479302 markings, 28104168 edges, 22423 markings/sec, 390 secs
lola: 8568176 markings, 28401582 edges, 17775 markings/sec, 395 secs
lola: 8656051 markings, 28696631 edges, 17575 markings/sec, 400 secs
lola: 8744948 markings, 28992624 edges, 17779 markings/sec, 405 secs
lola: 8850990 markings, 29344989 edges, 21208 markings/sec, 410 secs
lola: 8951745 markings, 29683210 edges, 20151 markings/sec, 415 secs
lola: 9060391 markings, 30047872 edges, 21729 markings/sec, 420 secs
lola: 9149315 markings, 30352708 edges, 17785 markings/sec, 425 secs
lola: 9241332 markings, 30681335 edges, 18403 markings/sec, 430 secs
lola: 9330521 markings, 30963781 edges, 17838 markings/sec, 435 secs
lola: 9424147 markings, 31255492 edges, 18725 markings/sec, 440 secs
lola: 9526680 markings, 31602841 edges, 20507 markings/sec, 445 secs
lola: 9633345 markings, 31965164 edges, 21333 markings/sec, 450 secs
lola: 9717879 markings, 32251079 edges, 16907 markings/sec, 455 secs
lola: 9809414 markings, 32555129 edges, 18307 markings/sec, 460 secs
lola: 9916285 markings, 32920808 edges, 21374 markings/sec, 465 secs
lola: 10011795 markings, 33241527 edges, 19102 markings/sec, 470 secs
lola: 10118485 markings, 33597536 edges, 21338 markings/sec, 475 secs
lola: 10209284 markings, 33898060 edges, 18160 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
sara: try reading problem file CloudReconfiguration-PT-304-CTLCardinality-13.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: 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 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-304"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r059-smll-152646386000024"
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 ;