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 752K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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: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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 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 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.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 591K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CircularTrains-PT-768, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-152646358600045
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526465980128


BK_STOP 1526466217439

--------------------
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-768 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': 838505, 'Memory': 15950.61, 'Tool': 'lola'}, {'Time': 843998, 'Memory': 15946.14, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CircularTrains-PT-768...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
CircularTrains-PT-768: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ CircularTrains-PT-768 @ 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: 2304/65536 symbol table entries, 362 collisions
lola: preprocessing...
lola: finding significant places
lola: 1536 places, 768 transitions, 767 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1536 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-768-CTLCardinality.task
lola: A (G (((Section_597 <= 2) OR (F605 <= 2) OR (F61 <= 0) OR (3 <= F285)))) : E (G (A (F ((Section_66 <= 0))))) : NOT(A (G (E (G ((1 <= F737)))))) : E (X (((F559 <= F283) AND A (X ((1 <= Section_169)))))) : A (G (((F193 <= Section_425) OR (Section_191 <= F134) OR (Section_352 + 1 <= F125) OR (2 <= Section_389)))) : (((Section_323 <= 0) AND (F501 <= 2)) AND (NOT(E (G ((Section_550 <= Section_699)))) OR ((3 <= F229) OR (1 <= Section_515)))) : E ((((1 <= Section_516) AND (Section_36 <= 0)) U A (F ((F560 <= F597))))) : E (X (A (X (((1 <= Section_3) OR (3 <= F105)))))) : E ((((3 <= Section_765) OR (1 <= F698) OR (Section_506 <= 1)) U (2 <= F732))) : A (G (E (F ((Section_20 + 1 <= Section_461))))) : NOT(E (F (A (F ((3 <= Section_65)))))) : (E ((((Section_371 <= Section_462) AND (Section_439 <= F234)) U ((3 <= F520) AND (2 <= F465)))) OR (1 <= Section_139)) : E (F ((2 <= Section_212))) : ((E (X (((2 <= F417) OR (2 <= F488)))) AND ((2 <= Section_343) AND (F562 + 1 <= F702))) OR E (F (E (F ((3 <= Section_258)))))) : E (G (E (G (((Section_650 <= Section_241) OR (2 <= Section_279)))))) : A (F ((F587 <= 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: A (G (((Section_597 <= 2) OR (F605 <= 2) OR (F61 <= 0) OR (3 <= F285))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-768-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CircularTrains-PT-768-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((Section_66 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (Section_66 <= 0)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 49422 markings, 147880 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (G ((1 <= F737))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (F737 <= 0)))
lola: processed formula length: 31
lola: 7 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 49410 markings, 146697 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((F559 <= F283) AND A (X ((1 <= Section_169))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((F559 <= F283) AND AX((1 <= Section_169))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F193 <= Section_425) OR (Section_191 <= F134) OR (Section_352 + 1 <= F125) OR (2 <= Section_389))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircularTrains-PT-768-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Section_323 <= 0) AND (F501 <= 2)) AND (NOT(E (G ((Section_550 <= Section_699)))) OR ((3 <= F229) OR (1 <= Section_515))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Section_323 <= 0) AND (F501 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Section_323 <= 0) AND (F501 <= 2))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Section_699 + 1 <= Section_550)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Section_699 + 1 <= Section_550)))
lola: processed formula: A (F ((Section_699 + 1 <= Section_550)))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3072 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 49606 markings, 49606 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= F229) OR (1 <= Section_515))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= F229) OR (1 <= Section_515))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: processed formula with 2 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= Section_516) AND (Section_36 <= 0)) U A (F ((F560 <= F597)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= Section_516) AND (Section_36 <= 0)) U A(TRUE U (F560 <= F597)))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 1536 places; total mentions: 0
lola: closed formula file CircularTrains-PT-768-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3068 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: 625718 markings, 935089 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1262990 markings, 1919315 edges, 127454 markings/sec, 5 secs
lola: 1845926 markings, 2822864 edges, 116587 markings/sec, 10 secs
lola: 2399578 markings, 3713653 edges, 110730 markings/sec, 15 secs
lola: 2915236 markings, 4664391 edges, 103132 markings/sec, 20 secs
lola: 3438420 markings, 5615943 edges, 104637 markings/sec, 25 secs
lola: 3948680 markings, 6546647 edges, 102052 markings/sec, 30 secs
lola: 4427680 markings, 7412517 edges, 95800 markings/sec, 35 secs
lola: 4934631 markings, 8378209 edges, 101390 markings/sec, 40 secs
lola: 5342641 markings, 9160302 edges, 81602 markings/sec, 45 secs
lola: 5742782 markings, 9929744 edges, 80028 markings/sec, 50 secs
lola: 6190936 markings, 10789065 edges, 89631 markings/sec, 55 secs
lola: 6667341 markings, 11701090 edges, 95281 markings/sec, 60 secs
lola: 7198807 markings, 12678543 edges, 106293 markings/sec, 65 secs
lola: 7692459 markings, 13602341 edges, 98730 markings/sec, 70 secs
lola: 8151927 markings, 14453128 edges, 91894 markings/sec, 75 secs
lola: 8646662 markings, 15370708 edges, 98947 markings/sec, 80 secs
lola: 9134846 markings, 16265253 edges, 97637 markings/sec, 85 secs
lola: 9647487 markings, 17196697 edges, 102528 markings/sec, 90 secs
lola: 10158796 markings, 18132182 edges, 102262 markings/sec, 95 secs
lola: 10672928 markings, 19079111 edges, 102826 markings/sec, 100 secs
lola: 11178822 markings, 19996009 edges, 101179 markings/sec, 105 secs
lola: 11659677 markings, 20904821 edges, 96171 markings/sec, 110 secs
lola: 12120414 markings, 21800841 edges, 92147 markings/sec, 115 secs
lola: 12584299 markings, 22699828 edges, 92777 markings/sec, 120 secs
lola: 13011881 markings, 23531810 edges, 85516 markings/sec, 125 secs
lola: 13476416 markings, 24434433 edges, 92907 markings/sec, 130 secs
lola: 13961310 markings, 25362368 edges, 96979 markings/sec, 135 secs
lola: 14445962 markings, 26269537 edges, 96930 markings/sec, 140 secs
lola: 14930820 markings, 27173570 edges, 96972 markings/sec, 145 secs
lola: 15415262 markings, 28079723 edges, 96888 markings/sec, 150 secs
lola: 15897118 markings, 28973681 edges, 96371 markings/sec, 155 secs
lola: 16390450 markings, 29869697 edges, 98666 markings/sec, 160 secs
lola: 16877726 markings, 30770926 edges, 97455 markings/sec, 165 secs
lola: 17303361 markings, 31552411 edges, 85127 markings/sec, 170 secs
lola: 17303383 markings, 31552451 edges, 4 markings/sec, 175 secs
lola: 17304727 markings, 31554951 edges, 269 markings/sec, 180 secs
lola: 17305469 markings, 31556269 edges, 148 markings/sec, 185 secs
lola: 17305484 markings, 31556298 edges, 3 markings/sec, 190 secs
lola: 17305786 markings, 31556856 edges, 60 markings/sec, 195 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: '\ufffd'
Aborted (core dumped)
FORMULA CircularTrains-PT-768-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-768-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-768"
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-768.tgz
mv CircularTrains-PT-768 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-768, 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-152646358600045"
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 ;