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 512K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 346K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is ResAllocation-PT-R003C050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-qhx2-152732138700143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528245831742


BK_STOP 1528246179669

--------------------
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 ResAllocation-PT-R003C050 as instance name.
Using ResAllocation 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': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 354372, 'Memory': 4771.26, 'Tool': 'lola'}, {'Time': 354524, 'Memory': 4844.74, 'Tool': 'lola'}, {'Time': 763160, 'Memory': 15931.66, 'Tool': 'itstools'}, {'Time': 778939, 'Memory': 15949.09, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ResAllocation-PT-R003C050...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C050: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ ResAllocation-PT-R003C050 @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 300 places, 200 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C050-LTLCardinality.task
lola: A (F (F (F (G ((2 <= r_17_2)))))) : A (G (G (X (F ((3 <= r_19_0)))))) : A (G (F (X ((2 <= p_44_2))))) : A ((G (F ((r_37_1 <= p_36_2))) U ((r_48_2 <= p_31_1) U (1 <= r_17_1)))) : A ((X ((2 <= r_7_2)) U F (G ((p_4_2 <= r_37_0))))) : A (F (G (X (F ((r_4_0 <= p_7_1)))))) : A (X (F (((p_40_2 <= p_24_2) U (p_48_1 <= r_45_1))))) : A (X ((3 <= r_47_2))) : A (G (F (F ((r_11_0 <= r_33_0))))) : A ((F (X ((3 <= p_24_0))) U F (G ((r_9_1 <= r_34_2))))) : A (X (X ((r_21_0 <= r_5_0)))) : A ((((2 <= r_47_0) U (1 <= p_14_2)) U ((r_37_0 <= p_38_0) U (r_19_0 <= p_5_1)))) : A (G ((3 <= p_25_2))) : A (((3 <= p_5_0) U G (G ((r_49_1 <= r_40_0))))) : A ((p_4_1 <= r_35_2)) : A ((F (F ((1 <= r_21_2))) U ((r_32_1 <= p_21_1) U (r_33_1 <= p_2_2))))
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 (F (F (G ((2 <= r_17_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((2 <= r_17_2))))
lola: processed formula: A (F (G ((2 <= r_17_2))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: 5 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((3 <= r_19_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F ((3 <= r_19_0))))))
lola: processed formula: A (G (G (X (F ((3 <= r_19_0))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X ((2 <= p_44_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((2 <= p_44_2)))))
lola: processed formula: A (G (F (X ((2 <= p_44_2)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((r_37_1 <= p_36_2))) U ((r_48_2 <= p_31_1) U (1 <= r_17_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((r_37_1 <= p_36_2))) U ((r_48_2 <= p_31_1) U (1 <= r_17_1))))
lola: processed formula: A ((G (F ((r_37_1 <= p_36_2))) U ((r_48_2 <= p_31_1) U (1 <= r_17_1))))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((2 <= r_7_2)) U F (G ((p_4_2 <= r_37_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((2 <= r_7_2)) U F (G ((p_4_2 <= r_37_0)))))
lola: processed formula: A ((X ((2 <= r_7_2)) U F (G ((p_4_2 <= r_37_0)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 467182 markings, 3531499 edges, 93436 markings/sec, 0 secs
lola: 895301 markings, 7030963 edges, 85624 markings/sec, 5 secs
lola: 1274802 markings, 10428221 edges, 75900 markings/sec, 10 secs
lola: 1639334 markings, 13660697 edges, 72906 markings/sec, 15 secs
lola: 1987842 markings, 16835382 edges, 69702 markings/sec, 20 secs
lola: 2331700 markings, 20084163 edges, 68772 markings/sec, 25 secs
lola: 2649264 markings, 23284488 edges, 63513 markings/sec, 30 secs
lola: 3048058 markings, 26621313 edges, 79759 markings/sec, 35 secs
lola: 3396394 markings, 29669701 edges, 69667 markings/sec, 40 secs
lola: 3754468 markings, 32750712 edges, 71615 markings/sec, 45 secs
lola: 4108110 markings, 36042134 edges, 70728 markings/sec, 50 secs
lola: 4419685 markings, 39094913 edges, 62315 markings/sec, 55 secs
lola: 4726036 markings, 42031746 edges, 61270 markings/sec, 60 secs
lola: 5015578 markings, 44945728 edges, 57908 markings/sec, 65 secs
lola: 5397017 markings, 48031525 edges, 76288 markings/sec, 70 secs
lola: 5719185 markings, 51167264 edges, 64434 markings/sec, 75 secs
lola: 6054075 markings, 54282171 edges, 66978 markings/sec, 80 secs
lola: 6423297 markings, 57388896 edges, 73844 markings/sec, 85 secs
lola: 6774459 markings, 60535774 edges, 70232 markings/sec, 90 secs
lola: 7091857 markings, 63601173 edges, 63480 markings/sec, 95 secs
lola: 7377940 markings, 66669870 edges, 57217 markings/sec, 100 secs
lola: 7665071 markings, 69732973 edges, 57426 markings/sec, 105 secs
lola: 7947907 markings, 72745042 edges, 56567 markings/sec, 110 secs
lola: 8217062 markings, 75713464 edges, 53831 markings/sec, 115 secs
lola: 8533334 markings, 78482612 edges, 63254 markings/sec, 120 secs
lola: 8838783 markings, 81255011 edges, 61090 markings/sec, 125 secs
lola: 9117811 markings, 83929452 edges, 55806 markings/sec, 130 secs
lola: 9395118 markings, 86681163 edges, 55461 markings/sec, 135 secs
lola: 9669586 markings, 89456156 edges, 54894 markings/sec, 140 secs
lola: 9942691 markings, 92190725 edges, 54621 markings/sec, 145 secs
lola: 10225179 markings, 95018642 edges, 56498 markings/sec, 150 secs
lola: 10480814 markings, 97704373 edges, 51127 markings/sec, 155 secs
lola: 10730337 markings, 100476632 edges, 49905 markings/sec, 160 secs
lola: 11014809 markings, 103221494 edges, 56894 markings/sec, 165 secs
lola: 11309643 markings, 106047832 edges, 58967 markings/sec, 170 secs
lola: 11565688 markings, 108586469 edges, 51209 markings/sec, 175 secs
lola: 11858235 markings, 111351065 edges, 58509 markings/sec, 180 secs
lola: 12143375 markings, 114158764 edges, 57028 markings/sec, 185 secs
lola: 12408644 markings, 117007717 edges, 53054 markings/sec, 190 secs
lola: 12649883 markings, 119721768 edges, 48248 markings/sec, 195 secs
lola: 12905289 markings, 122512544 edges, 51081 markings/sec, 200 secs
lola: 13173020 markings, 125276964 edges, 53546 markings/sec, 205 secs
lola: 13498637 markings, 128272029 edges, 65123 markings/sec, 210 secs
lola: 13780853 markings, 131229083 edges, 56443 markings/sec, 215 secs
lola: 14048978 markings, 134119792 edges, 53625 markings/sec, 220 secs
lola: 14355705 markings, 136982797 edges, 61345 markings/sec, 225 secs
lola: 14673744 markings, 140032955 edges, 63608 markings/sec, 230 secs
lola: 14946775 markings, 143000149 edges, 54606 markings/sec, 235 secs
lola: 15227424 markings, 145828661 edges, 56130 markings/sec, 240 secs
lola: 15465950 markings, 148694692 edges, 47705 markings/sec, 245 secs
lola: 15703352 markings, 151529885 edges, 47480 markings/sec, 250 secs
lola: 15951381 markings, 154368679 edges, 49606 markings/sec, 255 secs
lola: 16215452 markings, 157032267 edges, 52814 markings/sec, 260 secs
lola: 16513655 markings, 160096995 edges, 59641 markings/sec, 265 secs
lola: 16873273 markings, 163122328 edges, 71924 markings/sec, 270 secs
lola: 17170976 markings, 165839642 edges, 59541 markings/sec, 275 secs
lola: 17452082 markings, 168535579 edges, 56221 markings/sec, 280 secs
lola: 17721017 markings, 171097266 edges, 53787 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((r_4_0 <= p_7_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((r_4_0 <= p_7_1))))))
lola: processed formula: A (F (G (X (F ((r_4_0 <= p_7_1))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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, 9 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p_40_2 <= p_24_2) U (p_48_1 <= r_45_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((p_40_2 <= p_24_2) U (p_48_1 <= r_45_1)))))
lola: processed formula: A (X (F (((p_40_2 <= p_24_2) U (p_48_1 <= r_45_1)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: 51 markings, 50 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= r_47_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= r_47_2)))
lola: processed formula: A (X ((3 <= r_47_2)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F ((r_11_0 <= r_33_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((r_11_0 <= r_33_0))))
lola: processed formula: A (G (F ((r_11_0 <= r_33_0))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: 121113 markings, 417376 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((3 <= p_24_0))) U F (G ((r_9_1 <= r_34_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((3 <= p_24_0))) U F (G ((r_9_1 <= r_34_2)))))
lola: processed formula: A ((F (X ((3 <= p_24_0))) U F (G ((r_9_1 <= r_34_2)))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: 563 markings, 767 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((r_21_0 <= r_5_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((r_21_0 <= r_5_0))))
lola: processed formula: A (X (X ((r_21_0 <= r_5_0))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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, 13 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= r_47_0) U (1 <= p_14_2)) U ((r_37_0 <= p_38_0) U (r_19_0 <= p_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= r_47_0) U (1 <= p_14_2)) U ((r_37_0 <= p_38_0) U (r_19_0 <= p_5_1))))
lola: processed formula: A ((((2 <= r_47_0) U (1 <= p_14_2)) U ((r_37_0 <= p_38_0) U (r_19_0 <= p_5_1))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p_25_2)))
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 20 bytes per marking, with 10 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 13 will run for 1080 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p_5_0) U G (G ((r_49_1 <= r_40_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p_5_0) U G (G ((r_49_1 <= r_40_0)))))
lola: processed formula: A (((3 <= p_5_0) U G (G ((r_49_1 <= r_40_0)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 7 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: 219 markings, 260 edges
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_4_1 <= r_35_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_4_1 <= r_35_2)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-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 15 will run for 3242 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= r_21_2))) U ((r_32_1 <= p_21_1) U (r_33_1 <= p_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= r_21_2)) U ((r_32_1 <= p_21_1) U (r_33_1 <= p_2_2))))
lola: processed formula: A ((F ((1 <= r_21_2)) U ((r_32_1 <= p_21_1) U (r_33_1 <= p_2_2))))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 300 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C050-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 8 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: RESULT
lola:
SUMMARY: no no no yes unknown no yes no no no no no no no yes no
FORMULA ResAllocation-PT-R003C050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C050-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="ResAllocation-PT-R003C050"
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/ResAllocation-PT-R003C050.tgz
mv ResAllocation-PT-R003C050 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 ResAllocation-PT-R003C050, 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 r186-qhx2-152732138700143"
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 ;