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 244K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 81K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Solitaire-PT-FrnNC7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-152705514100158
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527065393551


BK_STOP 1527065833171

--------------------
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-FrnNC7x7 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': 3540217, 'Memory': 15213.97, 'Tool': 'lola'}, {'Time': 3540437, 'Memory': 15164, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola Solitaire-PT-FrnNC7x7...

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


checking for too many tokens
===========================================================================================
Solitaire-PT-FrnNC7x7: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Solitaire-PT-FrnNC7x7 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 166/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 74 places, 92 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 184 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: E (((NOT FIREABLE(left56) AND NOT FIREABLE(down25) AND FIREABLE(left32)) U A (F (FIREABLE(right32))))) : A (F (A ((NOT FIREABLE(left32) U (FIREABLE(right74) OR FIREABLE(down41)))))) : E (F (A (G ((NOT FIREABLE(right65) OR NOT FIREABLE(right35)))))) : A (G (NOT(NOT(E (F (FIREABLE(up56))))))) : A (F (E (G (())))) : A (X (A (F (E (X (FIREABLE(right14))))))) : A (F (FIREABLE(left35))) : (NOT FIREABLE(right35) AND NOT(E (X (E (G (FIREABLE(right24))))))) : NOT(A (F ((E (G (FIREABLE(down55))) AND FIREABLE(down55))))) : A (F ((E ((FIREABLE(up43) U FIREABLE(down32))) OR (NOT FIREABLE(right32) AND (FIREABLE(left14) OR FIREABLE(down25)) AND FIREABLE(up23))))) : A (F (A (G (A (G (FIREABLE(up41))))))) : ((E (((FIREABLE(right34) OR FIREABLE(down25)) U (FIREABLE(down55) AND FIREABLE(right43)))) OR NOT(E (G (NOT FIREABLE(left46))))) OR A (G (FIREABLE(left42)))) : A ((NOT(A (G (FIREABLE(up23)))) U FIREABLE(left35))) : NOT(A (F ((((FIREABLE(right52) OR FIREABLE(up55)) AND FIREABLE(right52)) OR FIREABLE(left46))))) : A (((FIREABLE(left14) OR E (X (FIREABLE(left23)))) U E (G (NOT FIREABLE(down32))))) : A (F (FIREABLE(down54)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(left56) AND NOT FIREABLE(down25) AND FIREABLE(left32)) U A (F (FIREABLE(right32)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(left56) AND NOT FIREABLE(down25) AND FIREABLE(left32)) U A(TRUE U FIREABLE(right32)))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A ((NOT FIREABLE(left32) U (FIREABLE(right74) OR FIREABLE(down41))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A(NOT FIREABLE(left32) U (FIREABLE(right74) OR FIREABLE(down41))))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 27 markings, 76 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((NOT FIREABLE(right65) OR NOT FIREABLE(right35))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (FIREABLE(right65) AND FIREABLE(right35)))))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 69 markings, 119 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(NOT(E (F (FIREABLE(up56)))))))
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(up56)))))
lola: processed formula length: 44
lola: 8 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 326 markings, 580 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (E (X (FIREABLE(right14)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U EX(FIREABLE(right14))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(left35)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(left35)))
lola: processed formula: A (F (FIREABLE(left35)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(right35) AND NOT(E (X (E (G (FIREABLE(right24)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 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: 5 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (NOT FIREABLE(right24)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U NOT FIREABLE(right24)))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 1565812 markings, 2833389 edges, 3689320832170983424 markings/sec, 0 secs
lola: 3013147 markings, 5682949 edges, 289467 markings/sec, 5 secs
lola: 4390161 markings, 8409835 edges, 275403 markings/sec, 10 secs
lola: 5718421 markings, 11172407 edges, 265652 markings/sec, 15 secs
lola: 7117679 markings, 13907912 edges, 279852 markings/sec, 20 secs
lola: 8383785 markings, 16541195 edges, 253221 markings/sec, 25 secs
lola: 9586560 markings, 19093798 edges, 240555 markings/sec, 30 secs
lola: 10789600 markings, 21724188 edges, 240608 markings/sec, 35 secs
lola: 12100812 markings, 24368038 edges, 262242 markings/sec, 40 secs
lola: 13329269 markings, 26829933 edges, 245691 markings/sec, 45 secs
lola: 14500890 markings, 29313379 edges, 234324 markings/sec, 50 secs
lola: 15598660 markings, 31805107 edges, 219554 markings/sec, 55 secs
lola: 16773277 markings, 34357902 edges, 234923 markings/sec, 60 secs
lola: 17836929 markings, 36634023 edges, 212730 markings/sec, 65 secs
lola: 18882155 markings, 38947742 edges, 209045 markings/sec, 70 secs
lola: 19896612 markings, 41131181 edges, 202891 markings/sec, 75 secs
lola: 20841092 markings, 43319828 edges, 188896 markings/sec, 80 secs
lola: 21940459 markings, 45935686 edges, 219873 markings/sec, 85 secs
lola: 23066325 markings, 48357547 edges, 225173 markings/sec, 90 secs
lola: 24090689 markings, 50691130 edges, 204873 markings/sec, 95 secs
lola: 25131673 markings, 53109164 edges, 208197 markings/sec, 100 secs
lola: 26089593 markings, 55180525 edges, 191584 markings/sec, 105 secs
lola: 26882839 markings, 57099429 edges, 158649 markings/sec, 110 secs
lola: 27745955 markings, 59151596 edges, 172623 markings/sec, 115 secs
lola: 28743437 markings, 61471208 edges, 199496 markings/sec, 120 secs
lola: 29688476 markings, 63827220 edges, 189008 markings/sec, 125 secs
lola: 30696666 markings, 66203687 edges, 201638 markings/sec, 130 secs
lola: 31922700 markings, 68730755 edges, 245207 markings/sec, 135 secs
lola: 33017759 markings, 71209739 edges, 219012 markings/sec, 140 secs
lola: 34071794 markings, 73543542 edges, 210807 markings/sec, 145 secs
lola: 35116412 markings, 75915708 edges, 208924 markings/sec, 150 secs
lola: 36219158 markings, 78247346 edges, 220549 markings/sec, 155 secs
lola: 37267550 markings, 80599071 edges, 209678 markings/sec, 160 secs
lola: 38311683 markings, 83001062 edges, 208827 markings/sec, 165 secs
lola: 39291668 markings, 85427893 edges, 195997 markings/sec, 170 secs
lola: 40299784 markings, 87879386 edges, 201623 markings/sec, 175 secs
lola: 41344868 markings, 90232637 edges, 209017 markings/sec, 180 secs
lola: 42312956 markings, 92463384 edges, 193618 markings/sec, 185 secs
lola: 43221096 markings, 94690323 edges, 181628 markings/sec, 190 secs
lola: 44084110 markings, 96896515 edges, 172603 markings/sec, 195 secs
lola: 45049913 markings, 99286689 edges, 193161 markings/sec, 200 secs
lola: 46005685 markings, 101627084 edges, 191154 markings/sec, 205 secs
lola: 46931148 markings, 103960420 edges, 185093 markings/sec, 210 secs
lola: 47947033 markings, 106266424 edges, 203177 markings/sec, 215 secs
lola: 48895951 markings, 108527095 edges, 189784 markings/sec, 220 secs
lola: 49826903 markings, 110734431 edges, 186190 markings/sec, 225 secs
lola: 50711942 markings, 112935406 edges, 177008 markings/sec, 230 secs
lola: 51630988 markings, 115219559 edges, 183809 markings/sec, 235 secs
lola: 52512681 markings, 117380696 edges, 176339 markings/sec, 240 secs
lola: 53358138 markings, 119532561 edges, 169091 markings/sec, 245 secs
lola: 54265174 markings, 121857115 edges, 181407 markings/sec, 250 secs
lola: 55172531 markings, 124098673 edges, 181471 markings/sec, 255 secs
lola: 56114198 markings, 126321773 edges, 188333 markings/sec, 260 secs
lola: 57157066 markings, 128655926 edges, 208574 markings/sec, 265 secs
lola: 58347224 markings, 131095125 edges, 238032 markings/sec, 270 secs
lola: 59458134 markings, 133472837 edges, 222182 markings/sec, 275 secs
lola: 60509975 markings, 135796665 edges, 210368 markings/sec, 280 secs
lola: 61533780 markings, 138151171 edges, 204761 markings/sec, 285 secs
lola: 62494840 markings, 140446799 edges, 192212 markings/sec, 290 secs
lola: 63513188 markings, 142805639 edges, 203670 markings/sec, 295 secs
lola: 64471523 markings, 145138215 edges, 191667 markings/sec, 300 secs
lola: 65395946 markings, 147407198 edges, 184885 markings/sec, 305 secs
lola: 66307172 markings, 149660042 edges, 182245 markings/sec, 310 secs
lola: 67290217 markings, 151938709 edges, 196609 markings/sec, 315 secs
lola: 68269662 markings, 154266791 edges, 195889 markings/sec, 320 secs
lola: 69133663 markings, 156455730 edges, 172800 markings/sec, 325 secs
lola: 70044998 markings, 158705176 edges, 182267 markings/sec, 330 secs
lola: 70932029 markings, 160941179 edges, 177406 markings/sec, 335 secs
lola: 71853896 markings, 163169816 edges, 184373 markings/sec, 340 secs
lola: 72779290 markings, 165328436 edges, 185079 markings/sec, 345 secs
lola: 73585713 markings, 167492339 edges, 161285 markings/sec, 350 secs
lola: 74537525 markings, 169813994 edges, 190362 markings/sec, 355 secs
lola: 75464293 markings, 172174900 edges, 185354 markings/sec, 360 secs
lola: 76547227 markings, 174636740 edges, 216587 markings/sec, 365 secs
lola: 77597483 markings, 176973945 edges, 210051 markings/sec, 370 secs
lola: 78603902 markings, 179398151 edges, 201284 markings/sec, 375 secs
lola: 79573528 markings, 181691011 edges, 193925 markings/sec, 380 secs
lola: 80506058 markings, 183999529 edges, 186506 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((E (G (FIREABLE(down55))) AND FIREABLE(down55)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U NOT FIREABLE(down55))) AND FIREABLE(down55))))
lola: processed formula length: 73
lola: 11 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 22 markings, 43 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E ((FIREABLE(up43) U FIREABLE(down32))) OR (NOT FIREABLE(right32) AND (FIREABLE(left14) OR FIREABLE(down25)) AND FIREABLE(up23)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(FIREABLE(up43) U FIREABLE(down32)) OR (NOT FIREABLE(right32) AND (FIREABLE(left14) OR FIREABLE(down25)) AND FIREABLE(up23))))
lola: processed formula length: 138
lola: 2 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 22 markings, 43 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (A (G (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: 1 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: 30 markings, 31 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((FIREABLE(right34) OR FIREABLE(down25)) U (FIREABLE(down55) AND FIREABLE(right43)))) OR NOT(E (G (NOT FIREABLE(left46))))) OR A (G (FIREABLE(left42))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(right34) OR FIREABLE(down25)) U (FIREABLE(down55) AND FIREABLE(right43))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(right34) OR FIREABLE(down25)) U (FIREABLE(down55) AND FIREABLE(right43)))
lola: processed formula length: 86
lola: 5 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 786 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: 4 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(left42)))
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 148 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 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT(A (G (FIREABLE(up23)))) U FIREABLE(left35)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U NOT FIREABLE(up23)) U FIREABLE(left35))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 22 markings, 44 edges
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((((FIREABLE(right52) OR FIREABLE(up55)) AND FIREABLE(right52)) OR FIREABLE(left46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((FIREABLE(right52) OR FIREABLE(up55)) AND FIREABLE(right52)) OR FIREABLE(left46))))
lola: processed formula length: 100
lola: 5 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(left14) OR E (X (FIREABLE(left23)))) U E (G (NOT FIREABLE(down32)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(left14) OR EX(FIREABLE(left23))) U NOT(A(TRUE U FIREABLE(down32))))
lola: processed formula length: 79
lola: 4 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 148 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(down54)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(down54)))
lola: processed formula: A (F (FIREABLE(down54)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 74 places; total mentions: 0
lola: closed formula file Solitaire-PT-FrnNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: 29 markings, 29 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no unknown yes no no no no yes yes no
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnNC7x7-CTLFireability-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="Solitaire-PT-FrnNC7x7"
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-FrnNC7x7.tgz
mv Solitaire-PT-FrnNC7x7 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-FrnNC7x7, 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-152705514100158"
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 ;