About the Execution of Irma.struct for HypertorusGrid-PT-d4k3p2b08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1593.770 | 155951.00 | 115731.00 | 854.20 | FFTFFFFTTFTFFFTF | 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 3.0M
-rw-r--r-- 1 mcc users 4.7K 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 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 4.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 2.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is HypertorusGrid-PT-d4k3p2b08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261900307
=====================================================================
--------------------
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 HypertorusGrid-PT-d4k3p2b08-LTLCardinality-00
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-01
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-02
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-03
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-04
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-05
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-06
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-07
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-08
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-09
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-10
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-11
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-12
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-13
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-14
FORMULA_NAME HypertorusGrid-PT-d4k3p2b08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527428439427
BK_STOP 1527428595378
--------------------
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 HypertorusGrid-PT-d4k3p2b08 as instance name.
Using HypertorusGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 425162, 'Memory': 577.39, 'Tool': 'lola'}, {'Time': 432556, 'Memory': 577.54, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola HypertorusGrid-PT-d4k3p2b08...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
HypertorusGrid-PT-d4k3p2b08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d4k3p2b08: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ HypertorusGrid-PT-d4k3p2b08 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7209/65536 symbol table entries, 1791 collisions
lola: preprocessing...
lola: finding significant places
lola: 2025 places, 5184 transitions, 1295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5913 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: A (G (G (G (X ((3 <= pi_d2_n1_2_2_2_3)))))) : A (X ((F ((pi_d4_n1_3_3_3_2 <= pol_d3_n1_2_2_1_1)) U (3 <= pil_d4_n1_3_1_2_3)))) : A ((G (G ((pb_d1_n2_2_1_3_3 <= pil_d3_n1_3_2_2_3))) U ((pb_d2_n1_3_3_1_2 <= pb_d1_n2_2_1_3_2) U (pb_d1_n2_1_3_1_3 <= pb_d3_n2_1_3_2_3)))) : A ((((1 <= po_d2_n1_1_3_1_3) U (2 <= po_d2_n1_1_1_1_2)) U X (X ((2 <= po_d1_n1_2_2_1_1))))) : A ((3 <= pil_d1_n1_2_2_2_2)) : A (G ((F ((1 <= pil_d2_n1_3_2_3_3)) U G ((2 <= pol_d4_n1_2_1_2_1))))) : A (F (X (G (X ((1 <= pb_d4_n2_1_3_1_1)))))) : A ((F (X ((2 <= pb_d1_n2_3_3_3_1))) U F ((po_d4_n1_3_3_1_3 <= po_d2_n1_1_3_2_3)))) : A ((1 <= pol_d4_n1_3_3_1_3)) : A ((2 <= pi_d3_n1_3_1_3_2)) : A ((pb_d4_n2_1_2_2_3 <= pb_d4_n2_1_1_3_3)) : A (((pbl_1_2_1_3 <= po_d2_n1_1_2_3_3) U G (F ((pol_d2_n1_2_3_3_1 <= pi_d2_n1_2_3_1_1))))) : A (X (G (G (G ((pb_d3_n2_2_1_1_3 <= pb_d1_n1_3_1_2_3)))))) : A ((((1 <= pil_d1_n1_1_2_2_1) U (pb_d1_n2_1_1_3_1 <= po_d4_n1_2_3_2_3)) U F (G ((pb_d2_n2_2_1_1_2 <= pil_d1_n1_2_1_1_1))))) : A (X (F (F (X ((pi_d3_n1_1_3_2_2 <= pb_d3_n2_3_1_3_1)))))) : A (X ((pi_d3_n1_3_1_2_1 <= po_d1_n1_1_3_2_3)))
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 (G (G (G (X ((3 <= pi_d2_n1_2_2_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (X ((3 <= pi_d2_n1_2_2_2_3))))))
lola: processed formula: A (G (G (G (X ((3 <= pi_d2_n1_2_2_2_3))))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 122 markings, 122 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((pi_d4_n1_3_3_3_2 <= pol_d3_n1_2_2_1_1)) U (3 <= pil_d4_n1_3_1_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((pi_d4_n1_3_3_3_2 <= pol_d3_n1_2_2_1_1)) U (3 <= pil_d4_n1_3_1_2_3))))
lola: processed formula: A (X ((F ((pi_d4_n1_3_3_3_2 <= pol_d3_n1_2_2_1_1)) U (3 <= pil_d4_n1_3_1_2_3))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 122 markings, 122 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((pb_d1_n2_2_1_3_3 <= pil_d3_n1_3_2_2_3))) U ((pb_d2_n1_3_3_1_2 <= pb_d1_n2_2_1_3_2) U (pb_d1_n2_1_3_1_3 <= pb_d3_n2_1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((pb_d1_n2_2_1_3_3 <= pil_d3_n1_3_2_2_3))) U ((pb_d2_n1_3_3_1_2 <= pb_d1_n2_2_1_3_2) U (pb_d1_n2_1_3_1_3 <= pb_d3_n2_1_3_2_3))))
lola: processed formula: A ((G (G ((pb_d1_n2_2_1_3_3 <= pil_d3_n1_3_2_2_3))) U ((pb_d2_n1_3_3_1_2 <= pb_d1_n2_2_1_3_2) U (pb_d1_n2_1_3_1_3 <= pb_d3_n2_1_3_2_3))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 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 ((((1 <= po_d2_n1_1_3_1_3) U (2 <= po_d2_n1_1_1_1_2)) U X (X ((2 <= po_d1_n1_2_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= po_d2_n1_1_3_1_3) U (2 <= po_d2_n1_1_1_1_2)) U X (X ((2 <= po_d1_n1_2_2_1_1)))))
lola: processed formula: A ((((1 <= po_d2_n1_1_3_1_3) U (2 <= po_d2_n1_1_1_1_2)) U X (X ((2 <= po_d1_n1_2_2_1_1)))))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 bytes per marking, with 28 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: 122 markings, 122 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= pil_d1_n1_2_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pil_d1_n1_2_2_2_2)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= pil_d2_n1_3_2_3_3)) U G ((2 <= pol_d4_n1_2_1_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((1 <= pil_d2_n1_3_2_3_3)) U G ((2 <= pol_d4_n1_2_1_2_1)))))
lola: processed formula: A (G ((F ((1 <= pil_d2_n1_3_2_3_3)) U G ((2 <= pol_d4_n1_2_1_2_1)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1090 markings, 1089 edges, 218 markings/sec, 0 secs
lola: 1106 markings, 1105 edges, 3 markings/sec, 5 secs
lola: 1123 markings, 1122 edges, 3 markings/sec, 10 secs
lola: 1138 markings, 1137 edges, 3 markings/sec, 15 secs
lola: 1162 markings, 1161 edges, 5 markings/sec, 20 secs
lola: 1176 markings, 1175 edges, 3 markings/sec, 25 secs
lola: 1220 markings, 1219 edges, 9 markings/sec, 30 secs
lola: 1262 markings, 1261 edges, 8 markings/sec, 35 secs
lola: 1310 markings, 1309 edges, 10 markings/sec, 40 secs
lola: 1377 markings, 1376 edges, 13 markings/sec, 45 secs
lola: 1452 markings, 1451 edges, 15 markings/sec, 50 secs
lola: 1553 markings, 1552 edges, 20 markings/sec, 55 secs
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: 1580 markings, 1581 edges
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (X ((1 <= pb_d4_n2_1_3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (X ((1 <= pb_d4_n2_1_3_1_1))))))
lola: processed formula: A (F (X (G (X ((1 <= pb_d4_n2_1_3_1_1))))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 31670 markings, 42186 edges
lola: ========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((2 <= pb_d1_n2_3_3_3_1))) U F ((po_d4_n1_3_3_1_3 <= po_d2_n1_1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((2 <= pb_d1_n2_3_3_3_1))) U F ((po_d4_n1_3_3_1_3 <= po_d2_n1_1_3_2_3))))
lola: processed formula: A ((F (X ((2 <= pb_d1_n2_3_3_3_1))) U F ((po_d4_n1_3_3_1_3 <= po_d2_n1_1_3_2_3))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 bytes per marking, with 31 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= pol_d4_n1_3_3_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pol_d4_n1_3_3_1_3)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= pi_d3_n1_3_1_3_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pi_d3_n1_3_1_3_2)
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.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: subprocess 10 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d4_n2_1_2_2_3 <= pb_d4_n2_1_1_3_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d4_n2_1_2_2_3 <= pb_d4_n2_1_1_3_3)
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-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 695 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pbl_1_2_1_3 <= po_d2_n1_1_2_3_3) U G (F ((pol_d2_n1_2_3_3_1 <= pi_d2_n1_2_3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((pbl_1_2_1_3 <= po_d2_n1_1_2_3_3) U G (F ((pol_d2_n1_2_3_3_1 <= pi_d2_n1_2_3_1_1)))))
lola: processed formula: A (((pbl_1_2_1_3 <= po_d2_n1_1_2_3_3) U G (F ((pol_d2_n1_2_3_3_1 <= pi_d2_n1_2_3_1_1)))))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 1194 markings, 1193 edges, 239 markings/sec, 0 secs
lola: 1318 markings, 1317 edges, 25 markings/sec, 5 secs
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: 1426 markings, 1426 edges
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (G ((pb_d3_n2_2_1_1_3 <= pb_d1_n1_3_1_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (G ((pb_d3_n2_2_1_1_3 <= pb_d1_n1_3_1_2_3))))))
lola: processed formula: A (X (G (G (G ((pb_d3_n2_2_1_1_3 <= pb_d1_n1_3_1_2_3))))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 25541 markings, 30812 edges
lola: subprocess 13 will run for 1155 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= pil_d1_n1_1_2_2_1) U (pb_d1_n2_1_1_3_1 <= po_d4_n1_2_3_2_3)) U F (G ((pb_d2_n2_2_1_1_2 <= pil_d1_n1_2_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= pil_d1_n1_1_2_2_1) U (pb_d1_n2_1_1_3_1 <= po_d4_n1_2_3_2_3)) U F (G ((pb_d2_n2_2_1_1_2 <= pil_d1_n1_2_1_1_1)))))
lola: processed formula: A ((((1 <= pil_d1_n1_1_2_2_1) U (pb_d1_n2_1_1_3_1 <= po_d4_n1_2_3_2_3)) U F (G ((pb_d2_n2_2_1_1_2 <= pil_d1_n1_2_1_1_1)))))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: ========================================
lola: 1204 markings, 1203 edges, 241 markings/sec, 0 secs
lola: 1253 markings, 1252 edges, 10 markings/sec, 5 secs
lola: 1316 markings, 1315 edges, 13 markings/sec, 10 secs
lola: 1354 markings, 1353 edges, 8 markings/sec, 15 secs
lola: 1403 markings, 1402 edges, 10 markings/sec, 20 secs
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: 1449 markings, 1450 edges
lola: ========================================
lola: subprocess 14 will run for 1719 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (X ((pi_d3_n1_1_3_2_2 <= pb_d3_n2_3_1_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((pi_d3_n1_1_3_2_2 <= pb_d3_n2_3_1_3_1)))))
lola: processed formula: A (X (F (X ((pi_d3_n1_1_3_2_2 <= pb_d3_n2_3_1_3_1)))))
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 166943 markings, 226628 edges, 33389 markings/sec, 0 secs
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: 214813 markings, 424440 edges
lola: ========================================
lola: subprocess 15 will run for 3429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pi_d3_n1_3_1_2_1 <= po_d1_n1_1_3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((pi_d3_n1_3_1_2_1 <= po_d1_n1_1_3_2_3)))
lola: processed formula: A (X ((pi_d3_n1_3_1_2_1 <= po_d1_n1_1_3_2_3)))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 2025 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d4k3p2b08-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 5184 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: 133 markings, 133 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes yes no yes no no no yes no
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d4k3p2b08-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 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="HypertorusGrid-PT-d4k3p2b08"
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/HypertorusGrid-PT-d4k3p2b08.tgz
mv HypertorusGrid-PT-d4k3p2b08 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 HypertorusGrid-PT-d4k3p2b08, 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 r211-smll-152732261900307"
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 '
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 ;