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 7.5M
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 5.8K May 15 18:50 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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 14K 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.9K 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 8 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 7.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Diffusion2D-PT-D50N010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949600290
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527411425975


BK_STOP 1527411736458

--------------------
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 Diffusion2D-PT-D50N010 as instance name.
Using Diffusion2D 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': True, 'Marked Graph': False, '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': 2122343, 'Memory': 8217.38, 'Tool': 'itstools'}, {'Time': 2151358, 'Memory': 11867.9, 'Tool': 'lola'}, {'Time': 2153570, 'Memory': 11190.05, 'Tool': 'lola'}, {'Time': 2253947, 'Memory': 8221.17, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0136712114865505x far from the best tool itstools.
CTLCardinality lola Diffusion2D-PT-D50N010...

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


checking for too many tokens
===========================================================================================
Diffusion2D-PT-D50N010: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ Diffusion2D-PT-D50N010 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 21904/65536 symbol table entries, 8280 collisions
lola: preprocessing...
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2500 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D50N010-CTLCardinality.task
lola: E (F ((3 <= cAMP__38_33_))) : (E (F ((cAMP__1_48_ + 1 <= cAMP__7_47_))) OR A (X ((3 <= cAMP__45_24_)))) : (A (F (((cAMP__50_29_ + 1 <= cAMP__28_31_) AND (cAMP__23_26_ + 1 <= cAMP__10_9_)))) OR ((cAMP__24_24_ <= cAMP__8_14_) AND A (G ((cAMP__8_19_ <= 2))))) : E ((((cAMP__49_48_ <= cAMP__16_27_) OR (cAMP__20_20_ <= cAMP__19_32_) OR (cAMP__28_14_ <= cAMP__30_7_) OR (cAMP__4_43_ <= cAMP__26_47_)) U ((3 <= cAMP__23_32_) AND (3 <= cAMP__2_42_) AND (cAMP__16_49_ <= 0)))) : (E (G (E (F ((1 <= cAMP__45_44_))))) OR (1 <= cAMP__9_37_)) : A (G ((E (F ((cAMP__10_47_ <= cAMP__43_22_))) OR (((2 <= cAMP__8_33_) AND (cAMP__47_15_ <= cAMP__1_28_)) OR (cAMP__6_30_ <= cAMP__48_11_))))) : ((E (F (((3 <= cAMP__12_18_) AND (cAMP__47_26_ <= cAMP__18_14_)))) AND E (G (((3 <= cAMP__4_38_) AND (cAMP__26_14_ <= cAMP__30_45_))))) OR (A (F ((1 <= cAMP__32_6_))) OR E (((cAMP__41_23_ <= cAMP__27_12_) U (3 <= cAMP__7_4_))))) : E ((E (X ((cAMP__43_32_ <= cAMP__34_22_))) U ((2 <= cAMP__4_29_) AND (1 <= cAMP__24_17_) AND (3 <= cAMP__48_15_)))) : A (G (((cAMP__47_38_ <= cAMP__23_7_) AND (cAMP__28_20_ <= cAMP__1_36_)))) : A (G (A (X ((cAMP__2_39_ <= 0))))) : (E (F ((2 <= cAMP__49_16_))) OR E (X (E (G ((2 <= cAMP__11_21_)))))) : A (G (A (G (((cAMP__11_29_ <= cAMP__44_10_) OR (2 <= cAMP__32_12_)))))) : (E (F (E (X ((1 <= cAMP__9_18_))))) AND NOT(E (X (((3 <= cAMP__22_32_) OR (3 <= cAMP__15_50_)))))) : (E (F (((1 <= cAMP__49_42_) AND (2 <= cAMP__19_46_) AND (1 <= cAMP__2_24_) AND (cAMP__6_35_ <= cAMP__43_8_)))) OR (A (((cAMP__50_32_ <= cAMP__12_47_) U (2 <= cAMP__30_41_))) AND (A (F ((1 <= cAMP__34_15_))) AND ((cAMP__37_33_ + 1 <= cAMP__4_26_) OR (cAMP__1_32_ <= 2))))) : E ((E (F ((3 <= cAMP__15_10_))) U E (X ((1 <= cAMP__23_41_))))) : A (G ((cAMP__3_45_ <= cAMP__8_50_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__38_33_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 9996 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 Diffusion2D-PT-D50N010-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-CTLCardinality.sara.
lola: sara is running 0 secs || 5629 markings, 20093 edges, 1126 markings/sec, 0 secs
lola: sara is running 5 secs || 11183 markings, 39899 edges, 1111 markings/sec, 5 secs
lola: sara is running 10 secs || 16866 markings, 60345 edges, 1137 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17832 markings, 63652 edges
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((cAMP__1_48_ + 1 <= cAMP__7_47_))) OR A (X ((3 <= cAMP__45_24_))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__1_48_ + 1 <= cAMP__7_47_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 9996 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 Diffusion2D-PT-D50N010-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((cAMP__50_29_ + 1 <= cAMP__28_31_) AND (cAMP__23_26_ + 1 <= cAMP__10_9_)))) OR ((cAMP__24_24_ <= cAMP__8_14_) AND A (G ((cAMP__8_19_ <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((cAMP__50_29_ + 1 <= cAMP__28_31_) AND (cAMP__23_26_ + 1 <= cAMP__10_9_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((cAMP__50_29_ + 1 <= cAMP__28_31_) AND (cAMP__23_26_ + 1 <= cAMP__10_9_))))
lola: processed formula: A (F (((cAMP__50_29_ + 1 <= cAMP__28_31_) AND (cAMP__23_26_ + 1 <= cAMP__10_9_))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 2500 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D50N010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 10000 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (cAMP__24_24_ <= cAMP__8_14_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__24_24_ <= cAMP__8_14_)
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 2500 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D50N010-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 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__8_19_ <= 2)))
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 9996 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 Diffusion2D-PT-D50N010-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N010-CTLCardinality-4.sara.
lola: sara is running 0 secs || 5663 markings, 19552 edges, 1133 markings/sec, 0 secs
lola: sara is running 5 secs || 11341 markings, 39323 edges, 1136 markings/sec, 5 secs
lola: sara is running 10 secs || 16989 markings, 58884 edges, 1130 markings/sec, 10 secs
lola: sara is running 15 secs || 22605 markings, 78925 edges, 1123 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25118 markings, 87129 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((cAMP__49_48_ <= cAMP__16_27_) OR (cAMP__20_20_ <= cAMP__19_32_) OR (cAMP__28_14_ <= cAMP__30_7_) OR (cAMP__4_43_ <= cAMP__26_47_)) U ((3 <= cAMP__23_32_) AND (3 <= cAMP__2_42_) AND (cAMP__16_49_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((cAMP__49_48_ <= cAMP__16_27_) OR (cAMP__20_20_ <= cAMP__19_32_) OR (cAMP__28_14_ <= cAMP__30_7_) OR (cAMP__4_43_ <= cAMP__26_47_)) U ((3 <= cAMP__23_32_) AND (3 <= cAMP__2_42_) AND (cAMP__16_49_ <= 0)))
lola: processed formula length: 209
lola: 1 rewrites
lola: formula mentions 0 of 2500 places; total mentions: 0
lola: closed formula file Diffusion2D-PT-D50N010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 9996 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: 191301 markings, 480466 edges, 38247 markings/sec, 0 secs
lola: 355770 markings, 919873 edges, 32894 markings/sec, 5 secs
lola: 508481 markings, 1334953 edges, 30542 markings/sec, 10 secs
lola: 655438 markings, 1739255 edges, 29391 markings/sec, 15 secs
lola: 794872 markings, 2122913 edges, 27887 markings/sec, 20 secs
lola: 925429 markings, 2491825 edges, 26111 markings/sec, 25 secs
lola: 1052535 markings, 2844667 edges, 25421 markings/sec, 30 secs
lola: 1178100 markings, 3199402 edges, 25113 markings/sec, 35 secs
lola: 1298968 markings, 3542848 edges, 24174 markings/sec, 40 secs
lola: 1418267 markings, 3877810 edges, 23860 markings/sec, 45 secs
lola: 1535142 markings, 4205370 edges, 23375 markings/sec, 50 secs
lola: 1651013 markings, 4538231 edges, 23174 markings/sec, 55 secs
lola: 1763600 markings, 4862854 edges, 22517 markings/sec, 60 secs
lola: 1875600 markings, 5185117 edges, 22400 markings/sec, 65 secs
lola: 1984845 markings, 5491951 edges, 21849 markings/sec, 70 secs
lola: 2091501 markings, 5793247 edges, 21331 markings/sec, 75 secs
lola: 2195730 markings, 6096433 edges, 20846 markings/sec, 80 secs
lola: 2301661 markings, 6397198 edges, 21186 markings/sec, 85 secs
lola: 2405601 markings, 6691909 edges, 20788 markings/sec, 90 secs
lola: 2507226 markings, 6977790 edges, 20325 markings/sec, 95 secs
lola: 2609095 markings, 7269958 edges, 20374 markings/sec, 100 secs
lola: 2704957 markings, 7532583 edges, 19172 markings/sec, 105 secs
lola: 2807150 markings, 7824243 edges, 20439 markings/sec, 110 secs
lola: 2906222 markings, 8108432 edges, 19814 markings/sec, 115 secs
lola: 3005115 markings, 8393309 edges, 19779 markings/sec, 120 secs
lola: 3106191 markings, 8676347 edges, 20215 markings/sec, 125 secs
lola: 3201656 markings, 8948019 edges, 19093 markings/sec, 130 secs
lola: 3298639 markings, 9228344 edges, 19397 markings/sec, 135 secs
lola: 3394226 markings, 9511371 edges, 19117 markings/sec, 140 secs
lola: 3487958 markings, 9784403 edges, 18746 markings/sec, 145 secs
lola: 3582360 markings, 10059480 edges, 18880 markings/sec, 150 secs
lola: 3674477 markings, 10326937 edges, 18423 markings/sec, 155 secs
lola: 3766934 markings, 10586930 edges, 18491 markings/sec, 160 secs
lola: 3859586 markings, 10857450 edges, 18530 markings/sec, 165 secs
lola: 3947617 markings, 11102985 edges, 17606 markings/sec, 170 secs
lola: 4039944 markings, 11372137 edges, 18465 markings/sec, 175 secs
lola: 4131591 markings, 11632232 edges, 18329 markings/sec, 180 secs
lola: 4221075 markings, 11891140 edges, 17897 markings/sec, 185 secs
lola: 4312808 markings, 12161427 edges, 18347 markings/sec, 190 secs
lola: 4403552 markings, 12427224 edges, 18149 markings/sec, 195 secs
lola: 4492480 markings, 12685108 edges, 17786 markings/sec, 200 secs
lola: 4582300 markings, 12944134 edges, 17964 markings/sec, 205 secs
lola: 4669555 markings, 13201885 edges, 17451 markings/sec, 210 secs
lola: 4756618 markings, 13448670 edges, 17413 markings/sec, 215 secs
lola: 4845305 markings, 13706731 edges, 17737 markings/sec, 220 secs
lola: 4930693 markings, 13949756 edges, 17078 markings/sec, 225 secs
lola: 5017250 markings, 14204568 edges, 17311 markings/sec, 230 secs
lola: 5101299 markings, 14438685 edges, 16810 markings/sec, 235 secs
lola: 5186611 markings, 14684834 edges, 17062 markings/sec, 240 secs
lola: 5277764 markings, 14943237 edges, 18231 markings/sec, 245 secs
lola: 5365777 markings, 15198068 edges, 17603 markings/sec, 250 secs
lola: 5454192 markings, 15451777 edges, 17683 markings/sec, 255 secs
lola: 5535841 markings, 15682533 edges, 16330 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N010-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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D50N010"
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/Diffusion2D-PT-D50N010.tgz
mv Diffusion2D-PT-D50N010 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 Diffusion2D-PT-D50N010, 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 r082-blw3-152649949600290"
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 ;