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-structural
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 r163-smll-152705514800158
=====================================================================

--------------------
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 1527065226817


BK_STOP 1527065666665

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Solitaire-PT-FrnNC7x7 as instance name.
Using Solitaire as model name.
Using algorithm or tool bmdt.
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}.
Known tools are: [{'Time': 3540217, 'Memory': 15213.97, 'Tool': 'lola'}, {'Time': 3540437, 'Memory': 15164, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLFireability lola Solitaire-PT-FrnNC7x7...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLFireability @ Solitaire-PT-FrnNC7x7 @ 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: 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: 1603515 markings, 2909300 edges, 3689320832170983424 markings/sec, 0 secs
lola: 3054650 markings, 5756306 edges, 290227 markings/sec, 5 secs
lola: 4431109 markings, 8494081 edges, 275292 markings/sec, 10 secs
lola: 5761347 markings, 11254931 edges, 266048 markings/sec, 15 secs
lola: 7163614 markings, 14007406 edges, 280453 markings/sec, 20 secs
lola: 8451029 markings, 16679469 edges, 257483 markings/sec, 25 secs
lola: 9650330 markings, 19246120 edges, 239860 markings/sec, 30 secs
lola: 10895650 markings, 21923715 edges, 249064 markings/sec, 35 secs
lola: 12215155 markings, 24581369 edges, 263901 markings/sec, 40 secs
lola: 13449166 markings, 27094684 edges, 246802 markings/sec, 45 secs
lola: 14646173 markings, 29622120 edges, 239401 markings/sec, 50 secs
lola: 15736685 markings, 32124095 edges, 218102 markings/sec, 55 secs
lola: 16928955 markings, 34658241 edges, 238454 markings/sec, 60 secs
lola: 18058366 markings, 37114448 edges, 225882 markings/sec, 65 secs
lola: 19198502 markings, 39583604 edges, 228027 markings/sec, 70 secs
lola: 20265159 markings, 42003490 edges, 213331 markings/sec, 75 secs
lola: 21414649 markings, 44648516 edges, 229898 markings/sec, 80 secs
lola: 22574284 markings, 47259453 edges, 231927 markings/sec, 85 secs
lola: 23668284 markings, 49714720 edges, 218800 markings/sec, 90 secs
lola: 24731309 markings, 52184140 edges, 212605 markings/sec, 95 secs
lola: 25834545 markings, 54602344 edges, 220647 markings/sec, 100 secs
lola: 26797892 markings, 56904283 edges, 192669 markings/sec, 105 secs
lola: 27831045 markings, 59354180 edges, 206631 markings/sec, 110 secs
lola: 28892327 markings, 61841229 edges, 212256 markings/sec, 115 secs
lola: 29825274 markings, 64149594 edges, 186589 markings/sec, 120 secs
lola: 30953010 markings, 66717031 edges, 225547 markings/sec, 125 secs
lola: 32177207 markings, 69293002 edges, 244839 markings/sec, 130 secs
lola: 33293870 markings, 71801843 edges, 223333 markings/sec, 135 secs
lola: 34352884 markings, 74196717 edges, 211803 markings/sec, 140 secs
lola: 35440752 markings, 76653217 edges, 217574 markings/sec, 145 secs
lola: 36582648 markings, 79045669 edges, 228379 markings/sec, 150 secs
lola: 37629289 markings, 81458064 edges, 209328 markings/sec, 155 secs
lola: 38694859 markings, 83901058 edges, 213114 markings/sec, 160 secs
lola: 39689976 markings, 86440495 edges, 199023 markings/sec, 165 secs
lola: 40782795 markings, 88934457 edges, 218564 markings/sec, 170 secs
lola: 41839877 markings, 91347927 edges, 211416 markings/sec, 175 secs
lola: 42809832 markings, 93648982 edges, 193991 markings/sec, 180 secs
lola: 43724633 markings, 95948358 edges, 182960 markings/sec, 185 secs
lola: 44607893 markings, 98210739 edges, 176652 markings/sec, 190 secs
lola: 45586813 markings, 100556925 edges, 195784 markings/sec, 195 secs
lola: 46496205 markings, 102903907 edges, 181878 markings/sec, 200 secs
lola: 47488362 markings, 105210744 edges, 198431 markings/sec, 205 secs
lola: 48455252 markings, 107416564 edges, 193378 markings/sec, 210 secs
lola: 49314967 markings, 109551159 edges, 171943 markings/sec, 215 secs
lola: 50209538 markings, 111674572 edges, 178914 markings/sec, 220 secs
lola: 51053881 markings, 113784784 edges, 168869 markings/sec, 225 secs
lola: 51932015 markings, 115996311 edges, 175627 markings/sec, 230 secs
lola: 52805066 markings, 118081993 edges, 174610 markings/sec, 235 secs
lola: 53632301 markings, 120198378 edges, 165447 markings/sec, 240 secs
lola: 54449968 markings, 122361431 edges, 163533 markings/sec, 245 secs
lola: 55318351 markings, 124452520 edges, 173677 markings/sec, 250 secs
lola: 56230598 markings, 126596644 edges, 182449 markings/sec, 255 secs
lola: 57260736 markings, 128866079 edges, 206028 markings/sec, 260 secs
lola: 58400212 markings, 131209452 edges, 227895 markings/sec, 265 secs
lola: 59424257 markings, 133397576 edges, 204809 markings/sec, 270 secs
lola: 60405130 markings, 135548719 edges, 196175 markings/sec, 275 secs
lola: 61345407 markings, 137717617 edges, 188055 markings/sec, 280 secs
lola: 62327146 markings, 140028650 edges, 196348 markings/sec, 285 secs
lola: 63338014 markings, 142385274 edges, 202174 markings/sec, 290 secs
lola: 64310613 markings, 144731947 edges, 194520 markings/sec, 295 secs
lola: 65242973 markings, 147039036 edges, 186472 markings/sec, 300 secs
lola: 66165853 markings, 149306259 edges, 184576 markings/sec, 305 secs
lola: 67138123 markings, 151597753 edges, 194454 markings/sec, 310 secs
lola: 68135921 markings, 153945566 edges, 199560 markings/sec, 315 secs
lola: 69020054 markings, 156161511 edges, 176827 markings/sec, 320 secs
lola: 69937673 markings, 158432408 edges, 183524 markings/sec, 325 secs
lola: 70832131 markings, 160683947 edges, 178892 markings/sec, 330 secs
lola: 71750084 markings, 162936498 edges, 183591 markings/sec, 335 secs
lola: 72693338 markings, 165111381 edges, 188651 markings/sec, 340 secs
lola: 73512010 markings, 167297261 edges, 163734 markings/sec, 345 secs
lola: 74468751 markings, 169639913 edges, 191348 markings/sec, 350 secs
lola: 75395034 markings, 171992053 edges, 185257 markings/sec, 355 secs
lola: 76485510 markings, 174489335 edges, 218095 markings/sec, 360 secs
lola: 77554956 markings, 176875481 edges, 213889 markings/sec, 365 secs
lola: 78582815 markings, 179341850 edges, 205572 markings/sec, 370 secs
lola: 79570152 markings, 181681607 edges, 197467 markings/sec, 375 secs
lola: 80515524 markings, 184020512 edges, 189074 markings/sec, 380 secs
lola: 81561987 markings, 186337458 edges, 209293 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 1049 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 1049 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 3147 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r163-smll-152705514800158"
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 ;