fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r263-csrt-152732587400122
Last Updated
June 26, 2018

About the Execution of M4M.struct for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3124.870 357614.00 369190.00 179.00 ???????????????? 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 592K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 427K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-csrt-152732587400122
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527830988732


BK_STOP 1527831346346

--------------------
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 Parking-PT-864 as instance name.
Using Parking as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 272439, 'Memory': 2858.29, 'Tool': 'lola'}, {'Time': 272479, 'Memory': 2863.94, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola Parking-PT-864...

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


checking for too many tokens
===========================================================================================
Parking-PT-864: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLFireability @ Parking-PT-864 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- 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: 2882/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 1185 places, 1697 transitions, 905 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1146 transition conflict sets
lola: TASK
lola: reading formula from Parking-PT-864-LTLFireability.task
lola: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229)))))) : A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397)))))) : A (X (FIREABLE(t1231))) : A (X (X (FIREABLE(t760)))) : A (X (G (G (X (F (FIREABLE(t1600))))))) : A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473)))))) : A (G (X (G (G (F (FIREABLE(t199))))))) : A (X (((FIREABLE(t1256) U FIREABLE(t1512)) U X (F (FIREABLE(t1618)))))) : A ((G (FIREABLE(t1244)) U F (G (X (FIREABLE(t1262)))))) : A (F (F ((G (FIREABLE(t646)) U FIREABLE(t431))))) : A (FIREABLE(t466)) : A (F ((F (G (FIREABLE(t932))) U X (X (FIREABLE(t463)))))) : A (F (X (X (FIREABLE(t274))))) : A (FIREABLE(t468)) : A (F (((FIREABLE(t1151) U FIREABLE(t917)) U X (FIREABLE(t1491))))) : A (FIREABLE(t431))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229))))))
lola: processed formula: A (G (((FIREABLE(t590) U FIREABLE(t978)) U F (G (FIREABLE(t229))))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 234 markings, 235 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397))))))
lola: processed formula: A (((G (FIREABLE(t965)) U FIREABLE(t753)) U X (X (X (FIREABLE(t1397))))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 25 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 18 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: 444 markings, 444 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t1231)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t1231)))
lola: processed formula: A (X (FIREABLE(t1231)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 443 markings, 443 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(t760))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (FIREABLE(t760))))
lola: processed formula: A (X (X (FIREABLE(t760))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 20 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: 449 markings, 455 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (X (F (FIREABLE(t1600)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (X (F (FIREABLE(t1600)))))))
lola: processed formula: A (X (G (G (X (F (FIREABLE(t1600)))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 443 markings, 443 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473))))))
lola: processed formula: A (X ((G (F (FIREABLE(t865))) U F (X (FIREABLE(t1473))))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 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: 443 markings, 443 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (G (F (FIREABLE(t199)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (G (F (FIREABLE(t199)))))))
lola: processed formula: A (G (X (G (G (F (FIREABLE(t199)))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 1185 places; total mentions: 0
lola: closed formula file Parking-PT-864-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 222925 markings, 1620639 edges, 44585 markings/sec, 0 secs
lola: 417489 markings, 3214024 edges, 38913 markings/sec, 5 secs
lola: 608851 markings, 4846721 edges, 38272 markings/sec, 10 secs
lola: 782785 markings, 6407930 edges, 34787 markings/sec, 15 secs
lola: 967521 markings, 8100625 edges, 36947 markings/sec, 20 secs
lola: 1172823 markings, 9930022 edges, 41060 markings/sec, 25 secs
lola: 1378969 markings, 11757130 edges, 41229 markings/sec, 30 secs
lola: 1559020 markings, 13552393 edges, 36010 markings/sec, 35 secs
lola: 1741389 markings, 15209537 edges, 36474 markings/sec, 40 secs
lola: 1901931 markings, 16820304 edges, 32108 markings/sec, 45 secs
lola: 2061347 markings, 18542943 edges, 31883 markings/sec, 50 secs
lola: 2257903 markings, 20215753 edges, 39311 markings/sec, 55 secs
lola: 2436945 markings, 21839876 edges, 35808 markings/sec, 60 secs
lola: 2607185 markings, 23524980 edges, 34048 markings/sec, 65 secs
lola: 2787869 markings, 25186869 edges, 36137 markings/sec, 70 secs
lola: 2945275 markings, 26763578 edges, 31481 markings/sec, 75 secs
lola: 3094231 markings, 28368371 edges, 29791 markings/sec, 80 secs
lola: 3281594 markings, 30147049 edges, 37473 markings/sec, 85 secs
lola: 3454583 markings, 31872067 edges, 34598 markings/sec, 90 secs
lola: 3605239 markings, 33481884 edges, 30131 markings/sec, 95 secs
lola: 3762283 markings, 35113738 edges, 31409 markings/sec, 100 secs
lola: 3911349 markings, 36744161 edges, 29813 markings/sec, 105 secs
lola: 4055385 markings, 38344123 edges, 28807 markings/sec, 110 secs
lola: 4201419 markings, 39936081 edges, 29207 markings/sec, 115 secs
lola: 4390751 markings, 41559904 edges, 37866 markings/sec, 120 secs
lola: 4567945 markings, 43185193 edges, 35439 markings/sec, 125 secs
lola: 4735917 markings, 44800059 edges, 33594 markings/sec, 130 secs
lola: 4917813 markings, 46556511 edges, 36379 markings/sec, 135 secs
lola: 5084391 markings, 48249003 edges, 33316 markings/sec, 140 secs
lola: 5241265 markings, 49885006 edges, 31375 markings/sec, 145 secs
lola: 5418245 markings, 51565999 edges, 35396 markings/sec, 150 secs
lola: 5576191 markings, 53167624 edges, 31589 markings/sec, 155 secs
lola: 5720103 markings, 54762045 edges, 28782 markings/sec, 160 secs
lola: 5879715 markings, 56359895 edges, 31922 markings/sec, 165 secs
lola: 6024417 markings, 57947329 edges, 28940 markings/sec, 170 secs
lola: 6175517 markings, 59686627 edges, 30220 markings/sec, 175 secs
lola: 6347897 markings, 61444499 edges, 34476 markings/sec, 180 secs
lola: 6525955 markings, 63206643 edges, 35612 markings/sec, 185 secs
lola: 6693727 markings, 64945386 edges, 33554 markings/sec, 190 secs
lola: 6858019 markings, 66665738 edges, 32858 markings/sec, 195 secs
lola: 7014191 markings, 68370125 edges, 31234 markings/sec, 200 secs
lola: 7169261 markings, 70086219 edges, 31014 markings/sec, 205 secs
lola: 7317551 markings, 71790371 edges, 29658 markings/sec, 210 secs
lola: 7482823 markings, 73514566 edges, 33054 markings/sec, 215 secs
lola: 7640813 markings, 75263013 edges, 31598 markings/sec, 220 secs
lola: 7787929 markings, 77009861 edges, 29423 markings/sec, 225 secs
lola: 7943917 markings, 78759679 edges, 31198 markings/sec, 230 secs
lola: 8085983 markings, 80458354 edges, 28413 markings/sec, 235 secs
lola: 8222731 markings, 82130658 edges, 27350 markings/sec, 240 secs
lola: 8366095 markings, 83778093 edges, 28673 markings/sec, 245 secs
lola: 8565579 markings, 85508928 edges, 39897 markings/sec, 250 secs
lola: 8756494 markings, 87257988 edges, 38183 markings/sec, 255 secs
lola: 8938081 markings, 88992087 edges, 36317 markings/sec, 260 secs
lola: 9102317 markings, 90638013 edges, 32847 markings/sec, 265 secs
lola: 9263371 markings, 92249987 edges, 32211 markings/sec, 270 secs
lola: 9420461 markings, 93862403 edges, 31418 markings/sec, 275 secs
lola: 9586338 markings, 95454433 edges, 33175 markings/sec, 280 secs
lola: 9744771 markings, 97065352 edges, 31687 markings/sec, 285 secs
lola: 9894563 markings, 98693194 edges, 29958 markings/sec, 290 secs
lola: 10050332 markings, 100273041 edges, 31154 markings/sec, 295 secs
lola: 10190209 markings, 101814146 edges, 27975 markings/sec, 300 secs
lola: 10332137 markings, 103438481 edges, 28386 markings/sec, 305 secs
lola: 10494897 markings, 105124977 edges, 32552 markings/sec, 310 secs
lola: 10662697 markings, 106807906 edges, 33560 markings/sec, 315 secs
lola: 10829603 markings, 108479192 edges, 33381 markings/sec, 320 secs
lola: 10986737 markings, 110154955 edges, 31427 markings/sec, 325 secs
lola: 11145361 markings, 111829993 edges, 31725 markings/sec, 330 secs
lola: 11294825 markings, 113489971 edges, 29893 markings/sec, 335 secs
lola: 11427789 markings, 115072525 edges, 26593 markings/sec, 340 secs
lola: 11582139 markings, 116671081 edges, 30870 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA Parking-PT-864-LTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Parking-PT-864-LTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="mcc4mcc-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/Parking-PT-864.tgz
mv Parking-PT-864 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-structural"
echo " Input is Parking-PT-864, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-csrt-152732587400122"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;