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 460K
-rw-r--r-- 1 mcc users 3.7K 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 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 293K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CircularTrains-PT-384, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-152646358600038
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526465061963


BK_STOP 1526465283908

--------------------
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 CircularTrains-PT-384 as instance name.
Using CircularTrains as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': True, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 1217993, 'Memory': 15952.18, 'Tool': 'lola'}, {'Time': 1250151, 'Memory': 15952.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CircularTrains-PT-384...

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


checking for too many tokens
===========================================================================================
CircularTrains-PT-384: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ CircularTrains-PT-384 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1152/65536 symbol table entries, 116 collisions
lola: preprocessing...
lola: finding significant places
lola: 768 places, 384 transitions, 383 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 768 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-384-CTLCardinality.task
lola: (A (F (A (X ((2 <= F94))))) OR ((((Section_253 <= F210) AND (F165 <= F300)) OR (Section_243 <= Section_29) OR (F55 <= Section_214)) AND (((F173 + 1 <= Section_174) AND (F104 + 1 <= Section_55)) OR ((F153 <= F37) AND (Section_128 + 1 <= Section_197))))) : E (G (A (F (((F190 <= F343) AND (F103 <= F154)))))) : A ((A (G ((2 <= Section_1))) U A (F ((Section_87 <= F123))))) : ((A (X ((Section_283 <= 2))) AND A (F ((F280 <= Section_220)))) AND E (G (((Section_299 <= 0) OR (Section_277 <= 0))))) : A ((E (F ((2 <= Section_179))) U ((F298 <= Section_19) AND (F112 <= 2)))) : E (G (((F170 <= Section_168) OR (Section_205 <= F2)))) : (E (F ((3 <= F114))) OR A (G (((1 <= Section_208) AND (F230 + 1 <= F366))))) : A ((A (X ((Section_251 <= Section_278))) U (1 <= Section_302))) : A (G (A (G ((Section_382 <= 1))))) : A ((((Section_169 + 1 <= Section_113) AND (F372 <= 2)) U A (F ((2 <= Section_372))))) : E (F (A (G (((F10 <= Section_199) OR (Section_377 <= Section_99)))))) : ((3 <= Section_60) OR NOT(A (((Section_80 <= F171) U (3 <= F369))))) : (A (G (((F318 <= F280) OR ((F125 <= F14) AND (2 <= Section_162))))) AND A (X (((Section_212 <= F354) OR (Section_10 <= Section_167) OR (F161 <= 1))))) : A (F (((2 <= Section_28) OR A (G ((F178 <= Section_112)))))) : E (G ((Section_47 <= F318))) : A (F ((2 <= Section_16)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((2 <= F94))))) OR ((((Section_253 <= F210) AND (F165 <= F300)) OR (Section_243 <= Section_29) OR (F55 <= Section_214)) AND (((F173 + 1 <= Section_174) AND (F104 + 1 <= Section_55)) OR ((F153 <= F37) AND (Section_128 + 1 <= Section_197)))))
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 (A (X ((2 <= F94)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((2 <= F94)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 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: 12709 markings, 12709 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((Section_253 <= F210) AND (F165 <= F300)) OR (Section_243 <= Section_29) OR (F55 <= Section_214)) AND (((F173 + 1 <= Section_174) AND (F104 + 1 <= Section_55)) OR ((F153 <= F37) AND (Section_128 + 1 <= Section_197))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((Section_253 <= F210) AND (F165 <= F300)) OR (Section_243 <= Section_29) OR (F55 <= Section_214)) AND (((F173 + 1 <= Section_174) AND (F104 + 1 <= Section_55)) OR ((F153 <= F37) AND (Section_128 + 1 <= Section_197))))
lola: processed formula length: 223
lola: 0 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((F190 <= F343) AND (F103 <= F154))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((F190 <= F343) AND (F103 <= F154))))))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 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: 176304 markings, 186684 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((2 <= Section_1))) U A (F ((Section_87 <= F123)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (Section_1 <= 1))) U A(TRUE U (Section_87 <= F123)))
lola: processed formula length: 67
lola: 4 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10256 markings, 10256 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X ((Section_283 <= 2))) AND A (F ((F280 <= Section_220)))) AND E (G (((Section_299 <= 0) OR (Section_277 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Section_283 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Section_283 <= 2)))
lola: processed formula: A (X ((Section_283 <= 2)))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 129 markings, 128 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F280 <= Section_220)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F280 <= Section_220)))
lola: processed formula: A (F ((F280 <= Section_220)))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1536 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8987 markings, 8986 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((Section_299 <= 0) OR (Section_277 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= Section_299) AND (1 <= Section_277))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 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: 12443 markings, 12443 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= Section_179))) U ((F298 <= Section_19) AND (F112 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= Section_179)) U ((F298 <= Section_19) AND (F112 <= 2)))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 768 places; total mentions: 0
lola: closed formula file CircularTrains-PT-384-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1532 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: 1136937 markings, 1149072 edges, 2951535885549568000 markings/sec, 0 secs
lola: 2244052 markings, 2268883 edges, 221423 markings/sec, 5 secs
lola: 3399805 markings, 3438371 edges, 231151 markings/sec, 10 secs
lola: 4446430 markings, 4496842 edges, 209325 markings/sec, 15 secs
lola: 5439543 markings, 5501623 edges, 198623 markings/sec, 20 secs
lola: 6671253 markings, 6748100 edges, 246342 markings/sec, 25 secs
lola: 7859918 markings, 7950922 edges, 237733 markings/sec, 30 secs
lola: 8929555 markings, 9033425 edges, 213927 markings/sec, 35 secs
lola: 10029721 markings, 10147106 edges, 220033 markings/sec, 40 secs
lola: 10996245 markings, 11124869 edges, 193305 markings/sec, 45 secs
lola: 12117222 markings, 12259390 edges, 224195 markings/sec, 50 secs
lola: 13196648 markings, 13351555 edges, 215885 markings/sec, 55 secs
lola: 14355866 markings, 14525173 edges, 231844 markings/sec, 60 secs
lola: 15550063 markings, 15733948 edges, 238839 markings/sec, 65 secs
lola: 16493125 markings, 16688275 edges, 188612 markings/sec, 70 secs
lola: 17646921 markings, 17856366 edges, 230759 markings/sec, 75 secs
lola: 18744536 markings, 18967301 edges, 219523 markings/sec, 80 secs
lola: 19712861 markings, 19947201 edges, 193665 markings/sec, 85 secs
lola: 20771137 markings, 21018038 edges, 211655 markings/sec, 90 secs
lola: 21766180 markings, 22025407 edges, 199009 markings/sec, 95 secs
lola: 22747895 markings, 23018789 edges, 196343 markings/sec, 100 secs
lola: 23620414 markings, 23901622 edges, 174504 markings/sec, 105 secs
lola: 24640531 markings, 24934179 edges, 204023 markings/sec, 110 secs
lola: 25708842 markings, 26015271 edges, 213662 markings/sec, 115 secs
lola: 26851433 markings, 27172343 edges, 228518 markings/sec, 120 secs
lola: 27936317 markings, 28270535 edges, 216977 markings/sec, 125 secs
lola: 28834248 markings, 29179088 edges, 179586 markings/sec, 130 secs
lola: 29921053 markings, 30279722 edges, 217361 markings/sec, 135 secs
lola: 30947286 markings, 31318707 edges, 205247 markings/sec, 140 secs
lola: 31817910 markings, 32199573 edges, 174125 markings/sec, 145 secs
lola: 32718017 markings, 33110234 edges, 180021 markings/sec, 150 secs
lola: 33660292 markings, 34064185 edges, 188455 markings/sec, 155 secs
lola: 34274774 markings, 34686361 edges, 122896 markings/sec, 160 secs
lola: 34276446 markings, 34688055 edges, 334 markings/sec, 165 secs
lola: 34278990 markings, 34690628 edges, 509 markings/sec, 170 secs
lola: 34279187 markings, 34690828 edges, 39 markings/sec, 175 secs
lola: 34279985 markings, 34691636 edges, 160 markings/sec, 180 secs
lola: 34280199 markings, 34691850 edges, 43 markings/sec, 185 secs
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: '
'
Aborted (core dumped)
FORMULA CircularTrains-PT-384-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-384-CTLCardinality-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 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="CircularTrains-PT-384"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-384.tgz
mv CircularTrains-PT-384 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is CircularTrains-PT-384, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-152646358600038"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;