fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r142-qhx2-152673584000361
Last Updated
June 26, 2018

About the Execution of M4M.full for ResAllocation-PT-R003C020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4590.500 347501.00 338783.00 1862.00 FFTT?TTFFFFTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........................
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 138K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is ResAllocation-PT-R003C020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673584000361
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527971354198


BK_STOP 1527971701699

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ResAllocation-PT-R003C020 as instance name.
Using ResAllocation 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
/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': 3788, 'Memory': 197.05, 'Tool': 'gspn'}, {'Time': 3828, 'Memory': 2206.85, 'Tool': 'marcie'}, {'Time': 4365, 'Memory': 2207.07, 'Tool': 'marcie'}, {'Time': 5882, 'Memory': 222.68, 'Tool': 'gspn'}, {'Time': 443130, 'Memory': 10101.26, 'Tool': 'lola'}, {'Time': 443388, 'Memory': 8936.38, 'Tool': 'lola'}, {'Time': 2813380, 'Memory': 15951.59, 'Tool': 'itstools'}, {'Time': 3368263, 'Memory': 15952.55, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 116.98257655755016x far from the best tool gspn.
CTLFireability lola ResAllocation-PT-R003C020...

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C020: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ ResAllocation-PT-R003C020 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 200/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 120 places, 80 transitions, 60 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 140 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C020-CTLFireability.task
lola: NOT((NOT(A (F (FIREABLE(t_4_2)))) AND E (X (NOT FIREABLE(t_16_0))))) : A (F (((A (G (FIREABLE(t_11_3))) AND (FIREABLE(t_19_2) AND FIREABLE(t_2_0) AND FIREABLE(t_4_3))) OR (NOT FIREABLE(t_8_0) AND FIREABLE(t_16_0))))) : E (((E (F (FIREABLE(t_5_0))) AND NOT FIREABLE(t_8_2)) U E (G (NOT FIREABLE(t_10_3))))) : E (G (NOT(A (X ((FIREABLE(t_4_2) AND FIREABLE(t_3_0))))))) : A (G (A (G (E (F (FIREABLE(t_17_0))))))) : NOT(A (((NOT FIREABLE(t_7_3) OR NOT FIREABLE(t_7_2)) U A (F (FIREABLE(t_17_2)))))) : E (G (E (((FIREABLE(t_17_3) AND FIREABLE(t_2_1)) U (FIREABLE(t_7_3) OR FIREABLE(t_15_0)))))) : NOT(E ((((FIREABLE(t_0_3) AND FIREABLE(t_18_2)) OR FIREABLE(t_3_0)) U E (G (FIREABLE(t_11_3)))))) : A ((E (X (FIREABLE(t_3_3))) U FIREABLE(t_14_1))) : ((((A (X (FIREABLE(t_13_3))) OR E (X (FIREABLE(t_9_1)))) OR (A (X (FIREABLE(t_19_1))) OR (FIREABLE(t_19_0) AND FIREABLE(t_18_0) AND (FIREABLE(t_0_2) OR FIREABLE(t_4_0))))) AND A (G (A (X (FIREABLE(t_19_3)))))) OR A (F (FIREABLE(t_5_1)))) : A (G (E (F ((FIREABLE(t_6_3) OR FIREABLE(t_13_3)))))) : NOT((A (F (E (X (FIREABLE(t_3_0))))) AND (E (X (NOT FIREABLE(t_14_1))) AND (NOT FIREABLE(t_3_1) OR A (G (FIREABLE(t_7_3))))))) : A (F (FIREABLE(t_9_2))) : (A (F ((((FIREABLE(t_19_3) AND FIREABLE(t_11_2)) OR (FIREABLE(t_9_1) AND FIREABLE(t_7_3))) AND (FIREABLE(t_4_0) OR NOT FIREABLE(t_5_0))))) OR A (G (A (F ((FIREABLE(t_16_3) AND FIREABLE(t_9_2))))))) : E (G (NOT((A (G (FIREABLE(t_18_2))) AND E (F (FIREABLE(t_3_3))))))) : A (G (NOT(E (G ((FIREABLE(t_16_0) AND FIREABLE(t_18_0)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(A (F (FIREABLE(t_4_2)))) AND E (X (NOT FIREABLE(t_16_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t_4_2)))
lola: processed formula: A (F (FIREABLE(t_4_2)))
lola: processed formula length: 23
lola: 10 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t_16_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t_16_0)))
lola: processed formula: A (X (FIREABLE(t_16_0)))
lola: processed formula length: 24
lola: 10 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((A (G (FIREABLE(t_11_3))) AND (FIREABLE(t_19_2) AND FIREABLE(t_2_0) AND FIREABLE(t_4_3))) OR (NOT FIREABLE(t_8_0) AND FIREABLE(t_16_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((A (G (FIREABLE(t_11_3))) AND (FIREABLE(t_19_2) AND FIREABLE(t_2_0) AND FIREABLE(t_4_3))) OR (NOT FIREABLE(t_8_0) AND FIREABLE(t_16_0)))))
lola: processed formula: A (F (((A (G (FIREABLE(t_11_3))) AND (FIREABLE(t_19_2) AND FIREABLE(t_2_0) AND FIREABLE(t_4_3))) OR (NOT FIREABLE(t_8_0) AND FIREABLE(t_16_0)))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 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: 91 markings, 97 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((E (F (FIREABLE(t_5_0))) AND NOT FIREABLE(t_8_2)) U E (G (NOT FIREABLE(t_10_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((E(TRUE U FIREABLE(t_5_0)) AND NOT FIREABLE(t_8_2)) U NOT(A(TRUE U FIREABLE(t_10_3))))
lola: processed formula length: 88
lola: 4 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((FIREABLE(t_4_2) AND FIREABLE(t_3_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((NOT FIREABLE(t_4_2) OR NOT FIREABLE(t_3_0))))))
lola: processed formula length: 69
lola: 5 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (G (E (F (FIREABLE(t_17_0)))))))
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(t_17_0)))))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 786559 markings, 3928973 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1494271 markings, 7900018 edges, 141542 markings/sec, 5 secs
lola: 2210399 markings, 11693426 edges, 143226 markings/sec, 10 secs
lola: 2874992 markings, 15378616 edges, 132919 markings/sec, 15 secs
lola: 3599234 markings, 19245039 edges, 144848 markings/sec, 20 secs
lola: 4297166 markings, 22987130 edges, 139586 markings/sec, 25 secs
lola: 5035986 markings, 27161845 edges, 147764 markings/sec, 30 secs
lola: 5703090 markings, 31252702 edges, 133421 markings/sec, 35 secs
lola: 6404924 markings, 35383781 edges, 140367 markings/sec, 40 secs
lola: 7073025 markings, 39428994 edges, 133620 markings/sec, 45 secs
lola: 7756969 markings, 43486870 edges, 136789 markings/sec, 50 secs
lola: 8386315 markings, 47057629 edges, 125869 markings/sec, 55 secs
lola: 9130266 markings, 51154122 edges, 148790 markings/sec, 60 secs
lola: 9838435 markings, 55105430 edges, 141634 markings/sec, 65 secs
lola: 10488009 markings, 59187561 edges, 129915 markings/sec, 70 secs
lola: 11196696 markings, 63144753 edges, 141737 markings/sec, 75 secs
lola: 11855944 markings, 67231315 edges, 131850 markings/sec, 80 secs
lola: 12497038 markings, 71206318 edges, 128219 markings/sec, 85 secs
lola: 13199528 markings, 75071775 edges, 140498 markings/sec, 90 secs
lola: 13858414 markings, 78936250 edges, 131777 markings/sec, 95 secs
lola: 14480690 markings, 82827886 edges, 124455 markings/sec, 100 secs
lola: 15143144 markings, 86418945 edges, 132491 markings/sec, 105 secs
lola: 15882982 markings, 90435415 edges, 147968 markings/sec, 110 secs
lola: 16565593 markings, 94262247 edges, 136522 markings/sec, 115 secs
lola: 17228258 markings, 98198737 edges, 132533 markings/sec, 120 secs
lola: 17880483 markings, 101674516 edges, 130445 markings/sec, 125 secs
lola: 18564114 markings, 105705687 edges, 136726 markings/sec, 130 secs
lola: 19202128 markings, 109565645 edges, 127603 markings/sec, 135 secs
lola: 19853598 markings, 113266821 edges, 130294 markings/sec, 140 secs
lola: 20513396 markings, 117250740 edges, 131960 markings/sec, 145 secs
lola: 21185375 markings, 121175928 edges, 134396 markings/sec, 150 secs
lola: 21831303 markings, 124516752 edges, 129186 markings/sec, 155 secs
lola: 22504428 markings, 128114181 edges, 134625 markings/sec, 160 secs
lola: 23172340 markings, 132042360 edges, 133582 markings/sec, 165 secs
lola: 23829293 markings, 135939689 edges, 131391 markings/sec, 170 secs
lola: 24479556 markings, 139866085 edges, 130053 markings/sec, 175 secs
lola: 25104747 markings, 143650771 edges, 125038 markings/sec, 180 secs
lola: 25745649 markings, 147501427 edges, 128180 markings/sec, 185 secs
lola: 26379332 markings, 151152226 edges, 126737 markings/sec, 190 secs
lola: 27029751 markings, 155176784 edges, 130084 markings/sec, 195 secs
lola: 27634925 markings, 159283884 edges, 121035 markings/sec, 200 secs
lola: 28243521 markings, 163231582 edges, 121719 markings/sec, 205 secs
lola: 28820874 markings, 167101507 edges, 115471 markings/sec, 210 secs
lola: 29405433 markings, 170789035 edges, 116912 markings/sec, 215 secs
lola: 30005138 markings, 174768491 edges, 119941 markings/sec, 220 secs
lola: 30647686 markings, 178420845 edges, 128510 markings/sec, 225 secs
lola: 31309329 markings, 182575875 edges, 132329 markings/sec, 230 secs
lola: 31961011 markings, 186616465 edges, 130336 markings/sec, 235 secs
lola: 32563098 markings, 190744061 edges, 120417 markings/sec, 240 secs
lola: 33221985 markings, 194784491 edges, 131777 markings/sec, 245 secs
lola: 33837869 markings, 198964656 edges, 123177 markings/sec, 250 secs
lola: 34439736 markings, 203012251 edges, 120373 markings/sec, 255 secs
lola: 35064692 markings, 206858688 edges, 124991 markings/sec, 260 secs
lola: 35700492 markings, 210783827 edges, 127160 markings/sec, 265 secs
lola: 36257873 markings, 214578938 edges, 111476 markings/sec, 270 secs
lola: 36817977 markings, 218135342 edges, 112021 markings/sec, 275 secs
lola: 37511502 markings, 222140417 edges, 138705 markings/sec, 280 secs
lola: 38153419 markings, 225968710 edges, 128383 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((NOT FIREABLE(t_7_3) OR NOT FIREABLE(t_7_2)) U A (F (FIREABLE(t_17_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((NOT FIREABLE(t_7_3) OR NOT FIREABLE(t_7_2)) U A(TRUE U FIREABLE(t_17_2))))
lola: processed formula length: 82
lola: 11 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 4 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((FIREABLE(t_17_3) AND FIREABLE(t_2_1)) U (FIREABLE(t_7_3) OR FIREABLE(t_15_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((FIREABLE(t_17_3) AND FIREABLE(t_2_1)) U (FIREABLE(t_7_3) OR FIREABLE(t_15_0))))))
lola: processed formula length: 102
lola: 2 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 31 markings, 62 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((FIREABLE(t_0_3) AND FIREABLE(t_18_2)) OR FIREABLE(t_3_0)) U E (G (FIREABLE(t_11_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((FIREABLE(t_0_3) AND FIREABLE(t_18_2)) OR FIREABLE(t_3_0)) U NOT(A(TRUE U NOT FIREABLE(t_11_3)))))
lola: processed formula length: 106
lola: 9 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X (FIREABLE(t_3_3))) U FIREABLE(t_14_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX(FIREABLE(t_3_3)) U FIREABLE(t_14_1))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((A (X (FIREABLE(t_13_3))) OR E (X (FIREABLE(t_9_1)))) OR (A (X (FIREABLE(t_19_1))) OR (FIREABLE(t_19_0) AND FIREABLE(t_18_0) AND (FIREABLE(t_0_2) OR FIREABLE(t_4_0))))) AND A (G (A (X (FIREABLE(t_19_3)))))) OR A (F (FIREABLE(t_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t_13_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t_13_3)))
lola: processed formula: A (X (FIREABLE(t_13_3)))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21 markings, 21 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(t_9_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(t_9_1))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t_19_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t_19_1)))
lola: processed formula: A (X (FIREABLE(t_19_1)))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t_19_0) AND FIREABLE(t_18_0) AND (FIREABLE(t_0_2) OR FIREABLE(t_4_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t_19_0) AND FIREABLE(t_18_0) AND (FIREABLE(t_0_2) OR FIREABLE(t_4_0)))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-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: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_5_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t_5_1)))
lola: processed formula: A (F (FIREABLE(t_5_1)))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((FIREABLE(t_6_3) OR FIREABLE(t_13_3))))))
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(t_6_3) OR FIREABLE(t_13_3))))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 101 markings, 225 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (E (X (FIREABLE(t_3_0))))) AND (E (X (NOT FIREABLE(t_14_1))) AND (NOT FIREABLE(t_3_1) OR A (G (FIREABLE(t_7_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (NOT FIREABLE(t_3_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(NOT FIREABLE(t_3_0)))))
lola: processed formula length: 43
lola: 17 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_9_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t_9_2)))
lola: processed formula: A (F (FIREABLE(t_9_2)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(t_19_3) AND FIREABLE(t_11_2)) OR (FIREABLE(t_9_1) AND FIREABLE(t_7_3))) AND (FIREABLE(t_4_0) OR NOT FIREABLE(t_5_0))))) OR A (G (A (F ((FIREABLE(t_16_3) AND FIREABLE(t_9_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(t_19_3) AND FIREABLE(t_11_2)) OR (FIREABLE(t_9_1) AND FIREABLE(t_7_3))) AND (FIREABLE(t_4_0) OR NOT FIREABLE(t_5_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((FIREABLE(t_19_3) AND FIREABLE(t_11_2)) OR (FIREABLE(t_9_1) AND FIREABLE(t_7_3))) AND (FIREABLE(t_4_0) OR NOT FIREABLE(t_5_0)))))
lola: processed formula: A (F ((((FIREABLE(t_19_3) AND FIREABLE(t_11_2)) OR (FIREABLE(t_9_1) AND FIREABLE(t_7_3))) AND (FIREABLE(t_4_0) OR NOT FIREABLE(t_5_0)))))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((FIREABLE(t_16_3) AND FIREABLE(t_9_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (FIREABLE(t_16_3) AND FIREABLE(t_9_2))))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 4 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT((A (G (FIREABLE(t_18_2))) AND E (F (FIREABLE(t_3_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U NOT FIREABLE(t_18_2))) AND E(TRUE U FIREABLE(t_3_3)))))
lola: processed formula length: 82
lola: 13 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((FIREABLE(t_16_0) AND FIREABLE(t_18_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (NOT FIREABLE(t_16_0) OR NOT FIREABLE(t_18_0))))))
lola: processed formula length: 77
lola: 5 rewrites
lola: formula mentions 0 of 120 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 4 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: 4 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes unknown yes yes no no no no yes no no yes no
FORMULA ResAllocation-PT-R003C020-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C020-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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C020"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C020.tgz
mv ResAllocation-PT-R003C020 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 mcc4mcc-full"
echo " Input is ResAllocation-PT-R003C020, 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 r142-qhx2-152673584000361"
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 ;