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 252K
-rw-r--r-- 1 mcc users 3.8K 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 2.7K 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 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 77K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Solitaire-PT-EngCT7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-152705514000137
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527060900834


BK_STOP 1527061271763

--------------------
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 Solitaire-PT-EngCT7x7 as instance name.
Using Solitaire as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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': None, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': None, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 3539408, 'Memory': 6202.64, 'Tool': 'lola'}, {'Time': 3540199, 'Memory': 6317.47, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola Solitaire-PT-EngCT7x7...

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


checking for too many tokens
===========================================================================================
Solitaire-PT-EngCT7x7: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ Solitaire-PT-EngCT7x7 @ 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: 143/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 67 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 77 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngCT7x7-CTLFireability.task
lola: A (F ((((FIREABLE(up42) AND FIREABLE(left46) AND FIREABLE(up44) AND FIREABLE(left55)) AND E (F (FIREABLE(right43)))) OR ((FIREABLE(right64) OR FIREABLE(right44) OR (FIREABLE(right24) AND FIREABLE(up42))) AND FIREABLE(left64))))) : NOT(NOT(A (F (FIREABLE(up43))))) : (NOT(((A (F (FIREABLE(up35))) OR FIREABLE(right35)) OR (FIREABLE(right46) AND A (G (FIREABLE(up44)))))) OR A ((A (G (FIREABLE(left24))) U (NOT FIREABLE(left43) AND (FIREABLE(down41) OR FIREABLE(down43)))))) : A (G ((A (F (FIREABLE(left42))) OR FIREABLE(left54)))) : E (F (A (X (E (G (FIREABLE(up43))))))) : E (F (E (G (A (G (FIREABLE(right55))))))) : A (G (E (F (((FIREABLE(down47) AND FIREABLE(right42)) OR (FIREABLE(right14) AND FIREABLE(right32))))))) : A (F (E (G ((FIREABLE(up64) OR FIREABLE(down35) OR (FIREABLE(left54) AND FIREABLE(left46))))))) : A (G (((A (F (FIREABLE(up24))) AND NOT FIREABLE(left74)) OR (((FIREABLE(up42) AND FIREABLE(right35)) OR NOT FIREABLE(down65)) OR A (G (FIREABLE(down35))))))) : E (G (NOT FIREABLE(up65))) : (E (X (A (F (FIREABLE(right54))))) OR ((A (G (NOT FIREABLE(left45))) AND ((FIREABLE(left52) OR (FIREABLE(down43) AND FIREABLE(right42))) AND FIREABLE(right74))) OR A (G ((NOT FIREABLE(up54) OR NOT FIREABLE(down42)))))) : A (F (NOT(E (F (NOT FIREABLE(up41)))))) : (A (F (FIREABLE(left46))) OR A (G (((FIREABLE(up63) AND FIREABLE(left46) AND FIREABLE(right56)) AND A (X (FIREABLE(up53))))))) : A (G ((E (X (NOT FIREABLE(right55))) AND ((FIREABLE(down25) OR FIREABLE(left56) OR NOT FIREABLE(right74)) OR E (F (FIREABLE(up55))))))) : E (G ((((NOT FIREABLE(right33) AND NOT FIREABLE(left53)) OR (NOT FIREABLE(left14) AND NOT FIREABLE(down42))) AND NOT FIREABLE(right44)))) : NOT(NOT((FIREABLE(up55) OR (A (F (FIREABLE(right44))) OR FIREABLE(left46)))))
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 ((((FIREABLE(up42) AND FIREABLE(left46) AND FIREABLE(up44) AND FIREABLE(left55)) AND E (F (FIREABLE(right43)))) OR ((FIREABLE(right64) OR FIREABLE(right44) OR (FIREABLE(right24) AND FIREABLE(up42))) AND FIREABLE(left64)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((FIREABLE(up42) AND FIREABLE(left46) AND FIREABLE(up44) AND FIREABLE(left55)) AND E(TRUE U FIREABLE(right43))) OR ((FIREABLE(right64) OR FIREABLE(right44) OR (FIREABLE(right24) AND FIREABLE(up42))) AND FIREABLE(left64))))
lola: processed formula length: 234
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (F (FIREABLE(up43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(up43)))
lola: processed formula: A (F (FIREABLE(up43)))
lola: processed formula length: 22
lola: 6 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(((A (F (FIREABLE(up35))) OR FIREABLE(right35)) OR (FIREABLE(right46) AND A (G (FIREABLE(up44)))))) OR A ((A (G (FIREABLE(left24))) U (NOT FIREABLE(left43) AND (FIREABLE(down41) OR FIREABLE(down43))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(up35)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(up35)))
lola: processed formula length: 29
lola: 14 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(right35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(right35)
lola: processed formula length: 21
lola: 12 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(right46)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(right46)
lola: processed formula length: 21
lola: 12 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F (FIREABLE(left42))) OR FIREABLE(left54))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U FIREABLE(left42))) AND NOT FIREABLE(left54))))
lola: processed formula length: 73
lola: 4 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (E (G (FIREABLE(up43)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(NOT(A(TRUE U NOT FIREABLE(up43)))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 761291 markings, 1276428 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (A (G (FIREABLE(right55)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U E(TRUE U NOT FIREABLE(right55)))))
lola: processed formula length: 56
lola: 5 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 599103 markings, 3865680 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1176714 markings, 7855940 edges, 115522 markings/sec, 5 secs
lola: 1732998 markings, 11809946 edges, 111257 markings/sec, 10 secs
lola: 2234875 markings, 15639111 edges, 100375 markings/sec, 15 secs
lola: 2725594 markings, 19410444 edges, 98144 markings/sec, 20 secs
lola: 3237395 markings, 23259668 edges, 102360 markings/sec, 25 secs
lola: 3706354 markings, 27028002 edges, 93792 markings/sec, 30 secs
lola: 4129929 markings, 30507933 edges, 84715 markings/sec, 35 secs
lola: 4515887 markings, 33681426 edges, 77192 markings/sec, 40 secs
lola: 4903948 markings, 36940984 edges, 77612 markings/sec, 45 secs
lola: 5267524 markings, 40014224 edges, 72715 markings/sec, 50 secs
lola: 5658851 markings, 43319008 edges, 78265 markings/sec, 55 secs
lola: 6009079 markings, 46446045 edges, 70046 markings/sec, 60 secs
lola: 6402808 markings, 49648653 edges, 78746 markings/sec, 65 secs
lola: 6846343 markings, 52971212 edges, 88707 markings/sec, 70 secs
lola: 7258204 markings, 56183579 edges, 82372 markings/sec, 75 secs
lola: 7655831 markings, 59396776 edges, 79525 markings/sec, 80 secs
lola: 8056233 markings, 62562903 edges, 80080 markings/sec, 85 secs
lola: 8426034 markings, 65576968 edges, 73960 markings/sec, 90 secs
lola: 8810908 markings, 68686970 edges, 76975 markings/sec, 95 secs
lola: 9205018 markings, 71874688 edges, 78822 markings/sec, 100 secs
lola: 9601195 markings, 75084275 edges, 79235 markings/sec, 105 secs
lola: 10023092 markings, 78537657 edges, 84379 markings/sec, 110 secs
lola: 10407050 markings, 81724426 edges, 76792 markings/sec, 115 secs
lola: 10757211 markings, 84892718 edges, 70032 markings/sec, 120 secs
lola: 11093113 markings, 87981895 edges, 67180 markings/sec, 125 secs
lola: 11457744 markings, 91032266 edges, 72926 markings/sec, 130 secs
lola: 11789214 markings, 93985940 edges, 66294 markings/sec, 135 secs
lola: 12157723 markings, 97138189 edges, 73702 markings/sec, 140 secs
lola: 12520429 markings, 100277377 edges, 72541 markings/sec, 145 secs
lola: 12857815 markings, 103358243 edges, 67477 markings/sec, 150 secs
lola: 13172462 markings, 106318438 edges, 62929 markings/sec, 155 secs
lola: 13487865 markings, 109222799 edges, 63081 markings/sec, 160 secs
lola: 13783954 markings, 112044923 edges, 59218 markings/sec, 165 secs
lola: 14079129 markings, 114887953 edges, 59035 markings/sec, 170 secs
lola: 14360227 markings, 117654075 edges, 56220 markings/sec, 175 secs
lola: 14691329 markings, 120560324 edges, 66220 markings/sec, 180 secs
lola: 15060159 markings, 123363820 edges, 73766 markings/sec, 185 secs
lola: 15428395 markings, 126202957 edges, 73647 markings/sec, 190 secs
lola: 15769845 markings, 129001940 edges, 68290 markings/sec, 195 secs
lola: 16143442 markings, 131925352 edges, 74719 markings/sec, 200 secs
lola: 16538897 markings, 134975091 edges, 79091 markings/sec, 205 secs
lola: 16905033 markings, 137833385 edges, 73227 markings/sec, 210 secs
lola: 17232406 markings, 140657808 edges, 65475 markings/sec, 215 secs
lola: 17575325 markings, 143578224 edges, 68584 markings/sec, 220 secs
lola: 17951496 markings, 146568537 edges, 75234 markings/sec, 225 secs
lola: 18287382 markings, 149441044 edges, 67177 markings/sec, 230 secs
lola: 18615890 markings, 152283261 edges, 65702 markings/sec, 235 secs
lola: 18947399 markings, 155118862 edges, 66302 markings/sec, 240 secs
lola: 19270166 markings, 157875662 edges, 64553 markings/sec, 245 secs
lola: 19580762 markings, 160542417 edges, 62119 markings/sec, 250 secs
lola: 19898236 markings, 163222089 edges, 63495 markings/sec, 255 secs
lola: 20220282 markings, 165951709 edges, 64409 markings/sec, 260 secs
lola: 20535299 markings, 168629741 edges, 63003 markings/sec, 265 secs
lola: 20822646 markings, 171178263 edges, 57469 markings/sec, 270 secs
lola: 21112208 markings, 173836855 edges, 57912 markings/sec, 275 secs
lola: 21385961 markings, 176474112 edges, 54751 markings/sec, 280 secs
lola: 21671330 markings, 179050293 edges, 57074 markings/sec, 285 secs
lola: 21939775 markings, 181649657 edges, 53689 markings/sec, 290 secs
lola: 22254454 markings, 184288734 edges, 62936 markings/sec, 295 secs
lola: 22561490 markings, 186906344 edges, 61407 markings/sec, 300 secs
lola: 22843426 markings, 189475203 edges, 56387 markings/sec, 305 secs
lola: 23114879 markings, 192101637 edges, 54291 markings/sec, 310 secs
lola: 23396460 markings, 194600656 edges, 56316 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((FIREABLE(down47) AND FIREABLE(right42)) OR (FIREABLE(right14) AND FIREABLE(right32)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((FIREABLE(down47) AND FIREABLE(right42)) OR (FIREABLE(right14) AND FIREABLE(right32)))))))
lola: processed formula length: 118
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 61023 markings, 213638 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((FIREABLE(up64) OR FIREABLE(down35) OR (FIREABLE(left54) AND FIREABLE(left46)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (NOT FIREABLE(up64) AND NOT FIREABLE(down35) AND (NOT FIREABLE(left54) OR NOT FIREABLE(left46))))))
lola: processed formula length: 122
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 45 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((A (F (FIREABLE(up24))) AND NOT FIREABLE(left74)) OR (((FIREABLE(up42) AND FIREABLE(right35)) OR NOT FIREABLE(down65)) OR A (G (FIREABLE(down35)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((NOT(A(TRUE U FIREABLE(up24))) OR FIREABLE(left74)) AND (((NOT FIREABLE(up42) OR NOT FIREABLE(right35)) AND FIREABLE(down65)) AND E(TRUE U NOT FIREABLE(down35))))))
lola: processed formula length: 179
lola: 10 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 37 markings, 69 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(up65)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(up65)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F (FIREABLE(right54))))) OR ((A (G (NOT FIREABLE(left45))) AND ((FIREABLE(left52) OR (FIREABLE(down43) AND FIREABLE(right42))) AND FIREABLE(right74))) OR A (G ((NOT FIREABLE(up54) OR NOT FIREABLE(down42))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (FIREABLE(right54)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U FIREABLE(right54)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 201 markings, 212 edges
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(left45)))
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 132 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(up54) OR NOT FIREABLE(down42))))
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 132 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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F (NOT FIREABLE(up41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (FIREABLE(up41)))))
lola: processed formula: A (F (A (G (FIREABLE(up41)))))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 24 markings, 25 edges
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(left46))) OR A (G (((FIREABLE(up63) AND FIREABLE(left46) AND FIREABLE(right56)) AND A (X (FIREABLE(up53)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(left46)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(left46)))
lola: processed formula: A (F (FIREABLE(left46)))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(up63) AND FIREABLE(left46) AND FIREABLE(right56))))
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 132 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (NOT FIREABLE(right55))) AND ((FIREABLE(down25) OR FIREABLE(left56) OR NOT FIREABLE(right74)) OR E (F (FIREABLE(up55)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(right55)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(right55)))))
lola: processed formula length: 45
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1608 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((NOT FIREABLE(right33) AND NOT FIREABLE(left53)) OR (NOT FIREABLE(left14) AND NOT FIREABLE(down42))) AND NOT FIREABLE(right44))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((FIREABLE(right33) OR FIREABLE(left53)) AND (FIREABLE(left14) OR FIREABLE(down42))) OR FIREABLE(right44))))
lola: processed formula length: 125
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 15 will run for 3216 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((FIREABLE(up55) OR (A (F (FIREABLE(right44))) OR FIREABLE(left46)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3216 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(up55)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(up55)
lola: processed formula length: 14
lola: 14 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(left46)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(left46)
lola: processed formula length: 16
lola: 14 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes unknown no no no yes no no no no yes unknown
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLFireability-15 CANNOT_COMPUTE 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="Solitaire-PT-EngCT7x7"
export BK_EXAMINATION="CTLFireability"
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/Solitaire-PT-EngCT7x7.tgz
mv Solitaire-PT-EngCT7x7 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 Solitaire-PT-EngCT7x7, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-152705514000137"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;