About the Execution of M4M.full for RobotManipulation-PT-00200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13110.930 | 666981.00 | 633059.00 | 2134.30 | FT?FFTF?FTFFTFTT | 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 180K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is RobotManipulation-PT-00200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-smll-152685551600052
=====================================================================
--------------------
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 RobotManipulation-PT-00200-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526937899371
BK_STOP 1526938566352
--------------------
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 RobotManipulation-PT-00200 as instance name.
Using RobotManipulation 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': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 1777966, 'Memory': 15934.04, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola RobotManipulation-PT-00200...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
RobotManipulation-PT-00200: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
RobotManipulation-PT-00200: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ RobotManipulation-PT-00200 @ 3540 seconds
----- Start make result stderr -----
----- 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: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00200-CTLCardinality.task
lola: ((2 <= off) OR A (G ((((2 <= r_moving) AND (initialized <= p_i2)) OR (initialized + 1 <= r_stopped))))) : E (((p_rdy <= initialized) U ((3 <= p_rel) AND (3 <= r_moving) AND (p_rel <= p_m)))) : E (F (A (G (((1 <= initialize) OR (3 <= moved)))))) : A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1))))) : (A (G (((p_rel <= 2) OR (p_m + 1 <= p_i1)))) OR A (G (E (G ((initialized <= r_stopped)))))) : A (F ((1 <= r_active))) : NOT(E (F (A (X ((p_i1 <= initialized)))))) : A (G (E (F ((initialized <= 1))))) : NOT(NOT(((1 <= r_stopped) AND E (G ((initialized <= p_rel)))))) : (E (X (A (X ((moved <= p_rel))))) AND E (F (E (X ((r_stopped <= moved)))))) : A (G ((1 <= p_i1))) : E (X (A (G (((3 <= p_i1) AND (1 <= access)))))) : (E (X (E (F ((r_stopped <= p_i2))))) AND ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move)))) : A (G (A (((2 <= r_moving) U (r_moving <= p_i1))))) : A (G (E (F ((off <= 2))))) : A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= off) OR A (G ((((2 <= r_moving) AND (initialized <= p_i2)) OR (initialized + 1 <= r_stopped)))))
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: (2 <= off)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= off)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= r_moving) AND (initialized <= p_i2)) OR (initialized + 1 <= r_stopped))))
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 36 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 401 markings, 400 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p_rdy <= initialized) U ((3 <= p_rel) AND (3 <= r_moving) AND (p_rel <= p_m))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p_rdy <= initialized) U ((3 <= p_rel) AND (3 <= r_moving) AND (p_rel <= p_m)))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 93636 markings, 187777 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= initialize) OR (3 <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((initialize <= 0) AND (moved <= 2)))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 1559732 markings, 5882564 edges, 311946 markings/sec, 0 secs
lola: 2891192 markings, 11090402 edges, 266292 markings/sec, 5 secs
lola: 4175883 markings, 15906457 edges, 256938 markings/sec, 10 secs
lola: 5311296 markings, 20443160 edges, 227083 markings/sec, 15 secs
lola: 6541569 markings, 25061428 edges, 246055 markings/sec, 20 secs
lola: 7765646 markings, 29662423 edges, 244815 markings/sec, 25 secs
lola: 8838454 markings, 33972047 edges, 214562 markings/sec, 30 secs
lola: 10033504 markings, 38488852 edges, 239010 markings/sec, 35 secs
lola: 11095156 markings, 42736988 edges, 212330 markings/sec, 40 secs
lola: 12125153 markings, 46894919 edges, 205999 markings/sec, 45 secs
lola: 13311724 markings, 51364463 edges, 237314 markings/sec, 50 secs
lola: 14495218 markings, 55823815 edges, 236699 markings/sec, 55 secs
lola: 15513162 markings, 59935056 edges, 203589 markings/sec, 60 secs
lola: 16520052 markings, 64003159 edges, 201378 markings/sec, 65 secs
lola: 17682323 markings, 68392914 edges, 232454 markings/sec, 70 secs
lola: 18680029 markings, 72429193 edges, 199541 markings/sec, 75 secs
lola: 19682446 markings, 76476275 edges, 200483 markings/sec, 80 secs
lola: 20776630 markings, 80700220 edges, 218837 markings/sec, 85 secs
lola: 21818410 markings, 84814530 edges, 208356 markings/sec, 90 secs
lola: 22792715 markings, 88764416 edges, 194861 markings/sec, 95 secs
lola: 23782283 markings, 92759003 edges, 197914 markings/sec, 100 secs
lola: 24754464 markings, 96694174 edges, 194436 markings/sec, 105 secs
lola: 25722441 markings, 100616092 edges, 193595 markings/sec, 110 secs
lola: 26689791 markings, 104537615 edges, 193470 markings/sec, 115 secs
lola: 27651002 markings, 108432002 edges, 192242 markings/sec, 120 secs
lola: 28613407 markings, 112331287 edges, 192481 markings/sec, 125 secs
lola: 29567084 markings, 116202430 edges, 190735 markings/sec, 130 secs
lola: 30526420 markings, 120088821 edges, 191867 markings/sec, 135 secs
lola: 31399814 markings, 123629671 edges, 174679 markings/sec, 140 secs
lola: 32192501 markings, 126849867 edges, 158537 markings/sec, 145 secs
lola: 33193059 markings, 130604806 edges, 200112 markings/sec, 150 secs
lola: 33990314 markings, 133837179 edges, 159451 markings/sec, 155 secs
lola: 34807186 markings, 137119765 edges, 163374 markings/sec, 160 secs
lola: 35781727 markings, 140806568 edges, 194908 markings/sec, 165 secs
lola: 36577588 markings, 144034387 edges, 159172 markings/sec, 170 secs
lola: 37370742 markings, 147256860 edges, 158631 markings/sec, 175 secs
lola: 38147284 markings, 150415906 edges, 155308 markings/sec, 180 secs
lola: 38945406 markings, 153658054 edges, 159624 markings/sec, 185 secs
lola: 39738370 markings, 156880005 edges, 158593 markings/sec, 190 secs
lola: 40747217 markings, 160671571 edges, 201769 markings/sec, 195 secs
lola: 41542359 markings, 163900064 edges, 159028 markings/sec, 200 secs
lola: 42326843 markings, 167086628 edges, 156897 markings/sec, 205 secs
lola: 43303871 markings, 170962557 edges, 195406 markings/sec, 210 secs
lola: 44104943 markings, 174212780 edges, 160214 markings/sec, 215 secs
lola: 44911307 markings, 177482130 edges, 161273 markings/sec, 220 secs
lola: 45717902 markings, 180753651 edges, 161319 markings/sec, 225 secs
lola: 46508759 markings, 183971006 edges, 158171 markings/sec, 230 secs
lola: 47305100 markings, 187209621 edges, 159268 markings/sec, 235 secs
lola: 48106433 markings, 190469917 edges, 160267 markings/sec, 240 secs
lola: 48896672 markings, 193689283 edges, 158048 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1)))))
lola: processed formula: A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1)))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36372 markings, 68889 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p_rel <= 2) OR (p_m + 1 <= p_i1)))) OR A (G (E (G ((initialized <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rel <= 2) OR (p_m + 1 <= p_i1))))
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 36 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-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: 6038 markings, 7245 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((initialized <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (r_stopped + 1 <= initialized))))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2800 markings, 4005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= r_active)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= r_active)))
lola: processed formula: A (F ((1 <= r_active)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 403 markings, 402 edges
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((p_i1 <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((initialized + 1 <= p_i1)))))
lola: processed formula length: 49
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 401 markings, 400 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((initialized <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (initialized <= 1)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 1734361 markings, 6462369 edges, 3096157673607921664 markings/sec, 0 secs
lola: 3135120 markings, 12048014 edges, 280152 markings/sec, 5 secs
lola: 4472338 markings, 17312338 edges, 267444 markings/sec, 10 secs
lola: 5707746 markings, 22275919 edges, 247082 markings/sec, 15 secs
lola: 6924641 markings, 27182252 edges, 243379 markings/sec, 20 secs
lola: 8130959 markings, 32053543 edges, 241264 markings/sec, 25 secs
lola: 9325616 markings, 36884002 edges, 238931 markings/sec, 30 secs
lola: 10522275 markings, 41728346 edges, 239332 markings/sec, 35 secs
lola: 11706537 markings, 46530056 edges, 236852 markings/sec, 40 secs
lola: 12881444 markings, 51295688 edges, 234981 markings/sec, 45 secs
lola: 14054973 markings, 56054225 edges, 234706 markings/sec, 50 secs
lola: 15228872 markings, 60822681 edges, 234780 markings/sec, 55 secs
lola: 16396159 markings, 65558052 edges, 233457 markings/sec, 60 secs
lola: 17548831 markings, 70244141 edges, 230534 markings/sec, 65 secs
lola: 18709258 markings, 74957152 edges, 232085 markings/sec, 70 secs
lola: 19844803 markings, 79576225 edges, 227109 markings/sec, 75 secs
lola: 20957510 markings, 84104090 edges, 222541 markings/sec, 80 secs
lola: 22064692 markings, 88608965 edges, 221436 markings/sec, 85 secs
lola: 23158361 markings, 93055151 edges, 218734 markings/sec, 90 secs
lola: 24258934 markings, 97542146 edges, 220115 markings/sec, 95 secs
lola: 25347860 markings, 101974533 edges, 217785 markings/sec, 100 secs
lola: 26429064 markings, 106374442 edges, 216241 markings/sec, 105 secs
lola: 27509275 markings, 110773213 edges, 216042 markings/sec, 110 secs
lola: 28593335 markings, 115187576 edges, 216812 markings/sec, 115 secs
lola: 29667183 markings, 119567403 edges, 214770 markings/sec, 120 secs
lola: 30748694 markings, 123974591 edges, 216302 markings/sec, 125 secs
lola: 31810684 markings, 128302579 edges, 212398 markings/sec, 130 secs
lola: 32885309 markings, 132685622 edges, 214925 markings/sec, 135 secs
lola: 33949119 markings, 137021383 edges, 212762 markings/sec, 140 secs
lola: 35019431 markings, 141388689 edges, 214062 markings/sec, 145 secs
lola: 36081901 markings, 145719757 edges, 212494 markings/sec, 150 secs
lola: 37141806 markings, 150043216 edges, 211981 markings/sec, 155 secs
lola: 38204091 markings, 154374344 edges, 212457 markings/sec, 160 secs
lola: 39261563 markings, 158692839 edges, 211494 markings/sec, 165 secs
lola: 40316220 markings, 162997266 edges, 210931 markings/sec, 170 secs
lola: 41367033 markings, 167291867 edges, 210163 markings/sec, 175 secs
lola: 42418059 markings, 171576876 edges, 210205 markings/sec, 180 secs
lola: 43464964 markings, 175850430 edges, 209381 markings/sec, 185 secs
lola: 44523789 markings, 180168775 edges, 211765 markings/sec, 190 secs
lola: 45566043 markings, 184424257 edges, 208451 markings/sec, 195 secs
lola: 46622322 markings, 188732506 edges, 211256 markings/sec, 200 secs
lola: 47671979 markings, 193022164 edges, 209931 markings/sec, 205 secs
lola: 48730727 markings, 197344571 edges, 211750 markings/sec, 210 secs
lola: 49789286 markings, 201673974 edges, 211712 markings/sec, 215 secs
lola: 50841325 markings, 205968201 edges, 210408 markings/sec, 220 secs
lola: 51902037 markings, 210293081 edges, 212142 markings/sec, 225 secs
lola: 52983573 markings, 214707917 edges, 216307 markings/sec, 230 secs
lola: 54051798 markings, 219074122 edges, 213645 markings/sec, 235 secs
lola: 55127690 markings, 223474172 edges, 215178 markings/sec, 240 secs
lola: 56195580 markings, 227838162 edges, 213578 markings/sec, 245 secs
lola: 57264352 markings, 232209893 edges, 213754 markings/sec, 250 secs
lola: 58320946 markings, 236523517 edges, 211319 markings/sec, 255 secs
lola: 59405115 markings, 240951445 edges, 216834 markings/sec, 260 secs
lola: 60483087 markings, 245352911 edges, 215594 markings/sec, 265 secs
lola: 61546311 markings, 249703331 edges, 212645 markings/sec, 270 secs
lola: 62625930 markings, 254115484 edges, 215924 markings/sec, 275 secs
lola: 63696277 markings, 258484909 edges, 214069 markings/sec, 280 secs
lola: 64766242 markings, 262863937 edges, 213993 markings/sec, 285 secs
lola: 65835163 markings, 267237902 edges, 213784 markings/sec, 290 secs
lola: 66899046 markings, 271589547 edges, 212777 markings/sec, 295 secs
lola: 67976153 markings, 275986951 edges, 215421 markings/sec, 300 secs
lola: 69047964 markings, 280358537 edges, 214362 markings/sec, 305 secs
lola: 70122682 markings, 284765965 edges, 214944 markings/sec, 310 secs
lola: 71179582 markings, 289085055 edges, 211380 markings/sec, 315 secs
lola: 72237077 markings, 293413805 edges, 211499 markings/sec, 320 secs
lola: 73307707 markings, 297795333 edges, 214126 markings/sec, 325 secs
lola: 74356143 markings, 302084961 edges, 209687 markings/sec, 330 secs
lola: 75398786 markings, 306353952 edges, 208529 markings/sec, 335 secs
lola: 76439507 markings, 310598838 edges, 208144 markings/sec, 340 secs
lola: 77431969 markings, 314670314 edges, 198492 markings/sec, 345 secs
lola: 78498530 markings, 319033547 edges, 213312 markings/sec, 350 secs
lola: 79548166 markings, 323322880 edges, 209927 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(((1 <= r_stopped) AND E (G ((initialized <= p_rel))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= r_stopped)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= r_stopped)
lola: processed formula length: 16
lola: 10 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: processed formula with 1 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 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((initialized <= p_rel)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_rel + 1 <= initialized)))
lola: processed formula length: 41
lola: 12 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 403 markings, 402 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((moved <= p_rel))))) AND E (F (E (X ((r_stopped <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((moved <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((moved <= p_rel)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((r_stopped <= moved)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((r_stopped <= moved)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 801 markings, 800 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_i1)))
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 36 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 402 markings, 401 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((3 <= p_i1) AND (1 <= access))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((p_i1 <= 2) OR (access <= 0)))))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 399 markings, 398 edges
lola: ========================================
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((r_stopped <= p_i2))))) AND ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((r_stopped <= p_i2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (r_stopped <= p_i2)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 400 markings, 399 edges
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move)))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=-1)
sara: try reading problem file RobotManipulation-PT-00200-CTLCardinality-10.sara.
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= r_moving) U (r_moving <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((2 <= r_moving) U (r_moving <= p_i1)))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2003 markings, 4005 edges
lola: ========================================
lola: subprocess 14 will run for 1460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((off <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (off <= 2)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 643202 markings, 2159423 edges
lola: ========================================
lola: subprocess 15 will run for 2919 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: processed formula: A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 1202 markings, 1201 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no no yes no unknown no yes no no yes no yes yes
FORMULA RobotManipulation-PT-00200-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-15 TRUE 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="RobotManipulation-PT-00200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00200.tgz
mv RobotManipulation-PT-00200 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is RobotManipulation-PT-00200, 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 r154-smll-152685551600052"
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 '
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 ;