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 264K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K 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 4.0K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CSRepetitions-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-ebro-152732364100125
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527506937152


BK_STOP 1527506982425

--------------------
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 CSRepetitions-PT-02 as instance name.
Using CSRepetitions as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, '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': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 341, 'Memory': 106.54, 'Tool': 'lola'}, {'Time': 595, 'Memory': 105.91, 'Tool': 'lola'}, {'Time': 5317, 'Memory': 297.99, 'Tool': 'itstools'}, {'Time': 5339, 'Memory': 275.26, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'gspn'}].
LTLCardinality lola CSRepetitions-PT-02...

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


checking for too many tokens
===========================================================================================
CSRepetitions-PT-02: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ CSRepetitions-PT-02 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 51/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 45 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-02-LTLCardinality.task
lola: A (F (((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (3 <= RequestBufferSlots)))) : A (G (X ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)))) : A (X ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= RequestBufferSlots))) : A (X ((F ((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U X ((RequestBufferSlots <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1))))) : A (G (F ((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)))) : A (X ((F ((1 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)) U G ((1 <= Server_Waiting_2 + Server_Waiting_1))))) : A (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1) U ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBufferSlots) U (1 <= Server_Waiting_2 + Server_Waiting_1)))) : A (F ((G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots)) U F ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4))))) : A (G (G ((Server_Anwering_1_2 <= Client_Waiting_1)))) : A (F (X (X (G (TRUE))))) : A (X (X ((Server_Anwering_3_2 <= RequestBuffer_3)))) : A (X (F (F ((Client_Sending_2 <= Client_Waiting_1))))) : A (TRUE) : A (X ((X ((Server_Anwering_4_2 <= Server_Anwering_3_2)) U X ((Client_Waiting_3 <= RequestBuffer_1))))) : A (G (G (F (G ((Client_Waiting_1 <= Server_Anwering_3_1)))))) : A (F (X (G ((Client_Sending_4 <= Client_Waiting_1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (3 <= RequestBufferSlots))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (3 <= RequestBufferSlots))))
lola: processed formula: A (F (((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (3 <= RequestBufferSlots))))
lola: processed formula length: 186
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4))))
lola: processed formula: A (G (X ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4))))
lola: processed formula length: 160
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= RequestBufferSlots)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= RequestBufferSlots)))
lola: processed formula: A (X ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= RequestBufferSlots)))
lola: processed formula length: 101
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U X ((RequestBufferSlots <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U X ((RequestBufferSlots <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)))))
lola: processed formula: A (X ((F ((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U X ((RequestBufferSlots <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)))))
lola: processed formula length: 228
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 25 markings, 36 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2))))
lola: processed formula: A (G (F ((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2))))
lola: processed formula length: 192
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)) U G ((1 <= Server_Waiting_2 + Server_Waiting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((1 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)) U G ((1 <= Server_Waiting_2 + Server_Waiting_1)))))
lola: processed formula: A (X ((F ((1 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1)) U G ((1 <= Server_Waiting_2 + Server_Waiting_1)))))
lola: processed formula length: 143
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 182 markings, 221 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1) U ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBufferSlots) U (1 <= Server_Waiting_2 + Server_Waiting_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1) U ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBufferSlots) U (1 <= Server_Waiting_2 + Server_Waiting_1))))
lola: processed formula: A (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1) U ((Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBufferSlots) U (1 <= Server_Waiting_2 + Server_Waiting_1))))
lola: processed formula length: 305
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots)) U F ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots)) U F ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4)))))
lola: processed formula: A (F ((G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots)) U F ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4)))))
lola: processed formula length: 266
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((Server_Anwering_1_2 <= Client_Waiting_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((Server_Anwering_1_2 <= Client_Waiting_1))))
lola: processed formula: A (G (G ((Server_Anwering_1_2 <= Client_Waiting_1))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 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: 75 markings, 104 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((Server_Anwering_3_2 <= RequestBuffer_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((Server_Anwering_3_2 <= RequestBuffer_3))))
lola: processed formula: A (X (X ((Server_Anwering_3_2 <= RequestBuffer_3))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 15 markings, 20 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((Client_Sending_2 <= Client_Waiting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((Client_Sending_2 <= Client_Waiting_1))))
lola: processed formula: A (X (F ((Client_Sending_2 <= Client_Waiting_1))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (TRUE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((Server_Anwering_4_2 <= Server_Anwering_3_2)) U X ((Client_Waiting_3 <= RequestBuffer_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((Server_Anwering_4_2 <= Server_Anwering_3_2) U (Client_Waiting_3 <= RequestBuffer_1)))))
lola: processed formula: A (X (X (((Server_Anwering_4_2 <= Server_Anwering_3_2) U (Client_Waiting_3 <= RequestBuffer_1)))))
lola: processed formula length: 98
lola: 1 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((Client_Waiting_1 <= Server_Anwering_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((Client_Waiting_1 <= Server_Anwering_3_1))))
lola: processed formula: A (F (G ((Client_Waiting_1 <= Server_Anwering_3_1))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G ((Client_Sending_4 <= Client_Waiting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((Client_Sending_4 <= Client_Waiting_1)))))
lola: processed formula: A (F (X (G ((Client_Sending_4 <= Client_Waiting_1)))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 34 markings, 35 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes yes no yes yes yes yes no no no
FORMULA CSRepetitions-PT-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is CSRepetitions-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-ebro-152732364100125"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;