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 9.9M
-rw-r--r-- 1 mcc users 5.5K 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 350K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 87K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 234K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 566K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.8M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is GlobalResAllocation-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r247-blw7-152732549100117
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527951249893


BK_STOP 1527951294840

--------------------
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 GlobalResAllocation-PT-03 as instance name.
Using GlobalResAllocation 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 1895, 'Memory': 151.23, 'Tool': 'lola'}, {'Time': 2202, 'Memory': 147.88, 'Tool': 'lola'}, {'Time': 16870, 'Memory': 671.07, 'Tool': 'itstools'}, {'Time': 17113, 'Memory': 667.34, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola GlobalResAllocation-PT-03...

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


checking for too many tokens
===========================================================================================
GlobalResAllocation-PT-03: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ GlobalResAllocation-PT-03 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4824/65536 symbol table entries, 2874 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 4791 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 243 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-PT-03-LTLCardinality.task
lola: A (X (X (X ((2 <= pr_in_1 + pr_in_2 + pr_in_3))))) : A ((F (F ((3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))) U G ((pr_released_3 + pr_released_2 + pr_released_1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)))) : A (F (F ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)))) : A ((G (X ((pr_in_1 + pr_in_2 + pr_in_3 <= Processes_1 + Processes_2 + Processes_3))) U X (F ((3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6))))) : A (F (X (((2 <= pr_released_3 + pr_released_2 + pr_released_1) U (pr_in_1 + pr_in_2 + pr_in_3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6))))) : A ((3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)) : A (F (X (X ((pr_in_1 + pr_in_2 + pr_in_3 <= pr_released_3 + pr_released_2 + pr_released_1))))) : A (F (G (G (G ((2 <= pr_released_3 + pr_released_2 + pr_released_1)))))) : A ((pr_released_1 <= pr_released_3)) : A (G ((Resources_5 <= in_critical_s_3_1))) : A ((Processes_3 <= Resources_6)) : A ((in_critical_s_1_6 <= pr_released_2)) : A (X (F (F (G ((pr_in_3 <= in_critical_s_1_6)))))) : A (F (((Resources_2 <= pr_released_1) U F ((in_critical_s_2_6 <= Processes_2))))) : A (F (F (F (G ((pr_released_3 <= Processes_2)))))) : A ((in_critical_s_1_1 <= Resources_5))
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 (X (X (X ((2 <= pr_in_1 + pr_in_2 + pr_in_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X ((2 <= pr_in_1 + pr_in_2 + pr_in_3)))))
lola: processed formula: A (X (X (X ((2 <= pr_in_1 + pr_in_2 + pr_in_3)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))) U G ((pr_released_3 + pr_released_2 + pr_released_1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_c... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)) U G ((pr_released_3 + pr_released_2 + pr_released_1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6))))
lola: processed formula: A ((F ((3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)) U G ((pr_released_3 + pr_released_2 + pr_released_1 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_criti... (shortened)
lola: processed formula length: 513
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)))
lola: processed formula: A (F ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)))
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((pr_in_1 + pr_in_2 + pr_in_3 <= Processes_1 + Processes_2 + Processes_3))) U X (F ((3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + i... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((pr_in_1 + pr_in_2 + pr_in_3 <= Processes_1 + Processes_2 + Processes_3))) U X (F ((3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)))))
lola: processed formula: A ((G (X ((pr_in_1 + pr_in_2 + pr_in_3 <= Processes_1 + Processes_2 + Processes_3))) U X (F ((3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + i... (shortened)
lola: processed formula length: 461
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 251 markings, 445 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((2 <= pr_released_3 + pr_released_2 + pr_released_1) U (pr_in_1 + pr_in_2 + pr_in_3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((2 <= pr_released_3 + pr_released_2 + pr_released_1) U (pr_in_1 + pr_in_2 + pr_in_3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6)))))
lola: processed formula: A (F (X (((2 <= pr_released_3 + pr_released_2 + pr_released_1) U (pr_in_1 + pr_in_2 + pr_in_3 <= in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_6 + in_critical_s_2_6 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_... (shortened)
lola: processed formula length: 459
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 169 markings, 1548 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6)
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X ((pr_in_1 + pr_in_2 + pr_in_3 <= pr_released_3 + pr_released_2 + pr_released_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((pr_in_1 + pr_in_2 + pr_in_3 <= pr_released_3 + pr_released_2 + pr_released_1)))))
lola: processed formula: A (F (X (X ((pr_in_1 + pr_in_2 + pr_in_3 <= pr_released_3 + pr_released_2 + pr_released_1)))))
lola: processed formula length: 94
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 2725 markings, 31806 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((2 <= pr_released_3 + pr_released_2 + pr_released_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (G ((2 <= pr_released_3 + pr_released_2 + pr_released_1))))))
lola: processed formula: A (F (G (G (G ((2 <= pr_released_3 + pr_released_2 + pr_released_1))))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 4404 markings, 21298 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pr_released_1 <= pr_released_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pr_released_1 <= pr_released_3)
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Resources_5 <= in_critical_s_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Processes_3 <= Resources_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Processes_3 <= Resources_6)
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((in_critical_s_1_6 <= pr_released_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (in_critical_s_1_6 <= pr_released_2)
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((pr_in_3 <= in_critical_s_1_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((pr_in_3 <= in_critical_s_1_6)))))
lola: processed formula: A (X (F (G ((pr_in_3 <= in_critical_s_1_6)))))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 13 markings, 14 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((Resources_2 <= pr_released_1) U F ((in_critical_s_2_6 <= Processes_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((Resources_2 <= pr_released_1) U F ((in_critical_s_2_6 <= Processes_2)))))
lola: processed formula: A (F (((Resources_2 <= pr_released_1) U F ((in_critical_s_2_6 <= Processes_2)))))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (G ((pr_released_3 <= Processes_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((pr_released_3 <= Processes_2))))
lola: processed formula: A (F (G ((pr_released_3 <= Processes_2))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 49 markings, 218 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((in_critical_s_1_1 <= Resources_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (in_critical_s_1_1 <= Resources_5)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GlobalResAllocation-PT-03-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes no yes no yes yes no yes no yes
FORMULA GlobalResAllocation-PT-03-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-PT-03-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GlobalResAllocation-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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/GlobalResAllocation-PT-03.tgz
mv GlobalResAllocation-PT-03 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-structural"
echo " Input is GlobalResAllocation-PT-03, 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 r247-blw7-152732549100117"
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 ;