Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900797.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DoubleExponent-PT-100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900797
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.9K Mar 31 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591242602838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:50:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:50:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:50:04] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2020-06-04 03:50:04] [INFO ] Transformed 5304 places.
[2020-06-04 03:50:04] [INFO ] Transformed 4998 transitions.
[2020-06-04 03:50:04] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 950 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 3 ms. (steps per millisecond=0 )
[2020-06-04 03:50:06] [INFO ] Flatten gal took : 453 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 4998 rows 5304 cols
[2020-06-04 03:50:06] [INFO ] Invariants computation overflowed in 244 ms
Support contains 16 out of 5304 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.22 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1192 Post agglomeration using F-continuation condition.Transition count delta: 1192
Iterating post reduction 0 with 1195 rules applied. Total rules applied 1196 place count 5297 transition count 3804
Reduce places removed 1192 places and 0 transitions.
Iterating post reduction 1 with 1192 rules applied. Total rules applied 2388 place count 4105 transition count 3804
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3603
Deduced a syphon composed of 201 places in 238 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3603
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 72 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 2 with 1792 rules applied. Total rules applied 4582 place count 3008 transition count 2707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 135 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4784 place count 2907 transition count 2707
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 56 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4978 place count 2810 transition count 2707
Free-agglomeration rule (complex) applied 393 times.
Iterating global reduction 2 with 393 rules applied. Total rules applied 5371 place count 2810 transition count 2314
Reduce places removed 393 places and 0 transitions.
Iterating post reduction 2 with 393 rules applied. Total rules applied 5764 place count 2417 transition count 2314
Partial Free-agglomeration rule applied 402 times.
Drop transitions removed 402 transitions
Iterating global reduction 3 with 402 rules applied. Total rules applied 6166 place count 2417 transition count 2314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6167 place count 2416 transition count 2313
Applied a total of 6167 rules in 2743 ms. Remains 2416 /5304 variables (removed 2888) and now considering 2313/4998 (removed 2685) transitions.
Finished structural reductions, in 1 iterations. Remains : 2416/5304 places, 2313/4998 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 2313 rows 2416 cols
[2020-06-04 03:50:09] [INFO ] Invariants computation overflowed in 61 ms
Support contains 16 out of 2416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2416/2416 places, 2313/2313 transitions.
Applied a total of 0 rules in 153 ms. Remains 2416 /2416 variables (removed 0) and now considering 2313/2313 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2416/2416 places, 2313/2313 transitions.
Starting structural reductions, iteration 0 : 2416/2416 places, 2313/2313 transitions.
Applied a total of 0 rules in 111 ms. Remains 2416 /2416 variables (removed 0) and now considering 2313/2313 (removed 0) transitions.
// Phase 1: matrix 2313 rows 2416 cols
[2020-06-04 03:50:09] [INFO ] Invariants computation overflowed in 41 ms
[2020-06-04 03:50:21] [INFO ] Implicit Places using invariants in 12013 ms returned []
// Phase 1: matrix 2313 rows 2416 cols
[2020-06-04 03:50:21] [INFO ] Invariants computation overflowed in 47 ms
[2020-06-04 03:50:39] [INFO ] Implicit Places using invariants and state equation in 17918 ms returned []
Implicit Place search using SMT with State Equation took 29941 ms to find 0 implicit places.
[2020-06-04 03:50:40] [INFO ] Redundant transitions in 278 ms returned []
// Phase 1: matrix 2313 rows 2416 cols
[2020-06-04 03:50:40] [INFO ] Invariants computation overflowed in 61 ms
[2020-06-04 03:50:47] [INFO ] Dead Transitions using invariants and state equation in 6971 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2416/2416 places, 2313/2313 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2416 transition count 2114
Deduced a syphon composed of 199 places in 55 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2217 transition count 2114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 399 place count 2217 transition count 2113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 400 place count 2216 transition count 2113
Applied a total of 400 rules in 429 ms. Remains 2216 /2416 variables (removed 200) and now considering 2113/2313 (removed 200) transitions.
// Phase 1: matrix 2113 rows 2216 cols
[2020-06-04 03:50:47] [INFO ] Invariants computation overflowed in 36 ms
[2020-06-04 03:50:47] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-04 03:50:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 57 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ DoubleExponent-PT-100 @ 3569 seconds
spx_run: Lost feasibility 10 times - iter 1202 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 1724 and 4 nodes.
spx_run: Lost feasibility 10 times - iter 4069 and 6 nodes.
spx_run: Lost feasibility 10 times - iter 6421 and 8 nodes.
spx_run: Lost feasibility 10 times - iter 8833 and 10 nodes.
spx_run: Lost feasibility 10 times - iter 9157 and 15 nodes.
spx_run: Lost feasibility 10 times - iter 11679 and 17 nodes.
spx_run: Lost feasibility 10 times - iter 11897 and 18 nodes.
spx_run: Lost feasibility 10 times - iter 12063 and 19 nodes.
spx_run: Lost feasibility 10 times - iter 14140 and 29 nodes.
spx_run: Lost feasibility 10 times - iter 14568 and 124 nodes.
spx_run: Lost feasibility 10 times - iter 14612 and 126 nodes.
spx_run: Lost feasibility 10 times - iter 15230 and 127 nodes.
spx_run: Lost feasibility 10 times - iter 15276 and 128 nodes.
spx_run: Lost feasibility 10 times - iter 15320 and 130 nodes.
spx_run: Lost feasibility 10 times - iter 15938 and 131 nodes.
spx_run: Lost feasibility 10 times - iter 15984 and 132 nodes.
spx_run: Lost feasibility 10 times - iter 16028 and 134 nodes.
spx_run: Lost feasibility 10 times - iter 16646 and 135 nodes.
spx_run: Lost feasibility 10 times - iter 16692 and 136 nodes.
spx_run: Lost feasibility 10 times - iter 16736 and 138 nodes.
spx_run: Lost feasibility 10 times - iter 17354 and 139 nodes.
spx_run: Lost feasibility 10 times - iter 17400 and 140 nodes.
spx_run: Lost feasibility 10 times - iter 17444 and 142 nodes.
spx_run: Lost feasibility 10 times - iter 18062 and 143 nodes.
spx_run: Lost feasibility 10 times - iter 18108 and 144 nodes.
spx_run: Lost feasibility 10 times - iter 18152 and 146 nodes.
spx_run: Lost feasibility 10 times - iter 18770 and 147 nodes.
spx_run: Lost feasibility 10 times - iter 18816 and 148 nodes.
spx_run: Lost feasibility 10 times - iter 18860 and 150 nodes.
spx_run: Lost feasibility 10 times - iter 19478 and 151 nodes.
spx_run: Lost feasibility 10 times - iter 19524 and 152 nodes.
spx_run: Lost feasibility 10 times - iter 19568 and 154 nodes.
spx_run: Lost feasibility 10 times - iter 20186 and 155 nodes.
spx_run: Lost feasibility 10 times - iter 20232 and 156 nodes.
spx_run: Lost feasibility 10 times - iter 20276 and 158 nodes.
spx_run: Lost feasibility 10 times - iter 20894 and 159 nodes.
spx_run: Lost feasibility 10 times - iter 20940 and 160 nodes.
spx_run: Lost feasibility 10 times - iter 20984 and 162 nodes.
spx_run: Lost feasibility 10 times - iter 21602 and 163 nodes.
spx_run: Lost feasibility 10 times - iter 21648 and 164 nodes.
spx_run: Lost feasibility 10 times - iter 21692 and 166 nodes.
spx_run: Lost feasibility 10 times - iter 22310 and 167 nodes.
spx_run: Lost feasibility 10 times - iter 22356 and 168 nodes.
spx_run: Lost feasibility 10 times - iter 22400 and 170 nodes.
spx_run: Lost feasibility 10 times - iter 23018 and 171 nodes.
spx_run: Lost feasibility 10 times - iter 23064 and 172 nodes.
spx_run: Lost feasibility 10 times - iter 23108 and 174 nodes.
spx_run: Lost feasibility 10 times - iter 23726 and 175 nodes.
spx_run: Lost feasibility 10 times - iter 23772 and 176 nodes.
spx_run: Lost feasibility 10 times - iter 23816 and 178 nodes.
spx_run: Lost feasibility 10 times - iter 24434 and 179 nodes.
spx_run: Lost feasibility 10 times - iter 24480 and 180 nodes.
spx_run: Lost feasibility 10 times - iter 24524 and 182 nodes.
spx_run: Lost feasibility 10 times - iter 25142 and 183 nodes.
spx_run: Lost feasibility 10 times - iter 25188 and 184 nodes.
spx_run: Lost feasibility 10 times - iter 25232 and 186 nodes.
spx_run: Lost feasibility 10 times - iter 25850 and 187 nodes.
spx_run: Lost feasibility 10 times - iter 25896 and 188 nodes.
spx_run: Lost feasibility 10 times - iter 25940 and 190 nodes.
spx_run: Lost feasibility 10 times - iter 26558 and 191 nodes.
spx_run: Lost feasibility 10 times - iter 26604 and 192 nodes.
spx_run: Lost feasibility 10 times - iter 26648 and 194 nodes.
spx_run: Lost feasibility 10 times - iter 27266 and 195 nodes.
spx_run: Lost feasibility 10 times - iter 27312 and 196 nodes.
spx_run: Lost feasibility 10 times - iter 27356 and 198 nodes.
spx_run: Lost feasibility 10 times - iter 27974 and 199 nodes.
spx_run: Lost feasibility 10 times - iter 28020 and 200 nodes.
spx_run: Lost feasibility 10 times - iter 28064 and 202 nodes.
spx_run: Lost feasibility 10 times - iter 28682 and 203 nodes.
spx_run: Lost feasibility 10 times - iter 28728 and 204 nodes.
spx_run: Lost feasibility 10 times - iter 28772 and 206 nodes.
spx_run: Lost feasibility 10 times - iter 29390 and 207 nodes.
spx_run: Lost feasibility 10 times - iter 29436 and 208 nodes.
spx_run: Lost feasibility 10 times - iter 29480 and 210 nodes.
spx_run: Lost feasibility 10 times - iter 30098 and 211 nodes.
spx_run: Lost feasibility 10 times - iter 30144 and 212 nodes.
spx_run: Lost feasibility 10 times - iter 30188 and 214 nodes.
spx_run: Lost feasibility 10 times - iter 30806 and 215 nodes.
spx_run: Lost feasibility 10 times - iter 30852 and 216 nodes.
spx_run: Lost feasibility 10 times - iter 30896 and 218 nodes.
spx_run: Lost feasibility 10 times - iter 31514 and 219 nodes.
spx_run: Lost feasibility 10 times - iter 31560 and 220 nodes.
spx_run: Lost feasibility 10 times - iter 31604 and 222 nodes.
spx_run: Lost feasibility 10 times - iter 32222 and 223 nodes.
spx_run: Lost feasibility 10 times - iter 32268 and 224 nodes.
spx_run: Lost feasibility 10 times - iter 32312 and 226 nodes.
spx_run: Lost feasibility 10 times - iter 32930 and 227 nodes.
spx_run: Lost feasibility 10 times - iter 32976 and 228 nodes.
spx_run: Lost feasibility 10 times - iter 33020 and 230 nodes.
spx_run: Lost feasibility 10 times - iter 33638 and 231 nodes.
spx_run: Lost feasibility 10 times - iter 33684 and 232 nodes.
spx_run: Lost feasibility 10 times - iter 33728 and 234 nodes.
spx_run: Lost feasibility 10 times - iter 34346 and 235 nodes.
spx_run: Lost feasibility 10 times - iter 34392 and 236 nodes.
spx_run: Lost feasibility 10 times - iter 34436 and 238 nodes.
spx_run: Lost feasibility 10 times - iter 35054 and 239 nodes.
spx_run: Lost feasibility 10 times - iter 35100 and 240 nodes.
spx_run: Lost feasibility 10 times - iter 35144 and 242 nodes.
spx_run: Lost feasibility 10 times - iter 35762 and 243 nodes.
spx_run: Lost feasibility 10 times - iter 35808 and 244 nodes.
spx_run: Lost feasibility 10 times - iter 35852 and 246 nodes.
spx_run: Lost feasibility 10 times - iter 36470 and 247 nodes.
spx_run: Lost feasibility 10 times - iter 36516 and 248 nodes.
spx_run: Lost feasibility 10 times - iter 36560 and 250 nodes.
spx_run: Lost feasibility 10 times - iter 37178 and 251 nodes.
spx_run: Lost feasibility 10 times - iter 37224 and 252 nodes.
spx_run: Lost feasibility 10 times - iter 37268 and 254 nodes.
spx_run: Lost feasibility 10 times - iter 37886 and 255 nodes.
spx_run: Lost feasibility 10 times - iter 37932 and 256 nodes.
spx_run: Lost feasibility 10 times - iter 37976 and 258 nodes.
spx_run: Lost feasibility 10 times - iter 38594 and 259 nodes.
spx_run: Lost feasibility 10 times - iter 38643 and 260 nodes.
spx_run: Lost feasibility 10 times - iter 38688 and 262 nodes.
spx_run: Lost feasibility 10 times - iter 38873 and 263 nodes.
spx_run: Lost feasibility 10 times - iter 38922 and 264 nodes.
spx_run: Lost feasibility 10 times - iter 38967 and 266 nodes.
spx_run: Lost feasibility 10 times - iter 39152 and 267 nodes.
spx_run: Lost feasibility 10 times - iter 39201 and 268 nodes.
spx_run: Lost feasibility 10 times - iter 39246 and 270 nodes.
spx_run: Lost feasibility 10 times - iter 39431 and 271 nodes.
spx_run: Lost feasibility 10 times - iter 39480 and 272 nodes.
spx_run: Lost feasibility 10 times - iter 39525 and 274 nodes.
spx_run: Lost feasibility 10 times - iter 39710 and 275 nodes.
spx_run: Lost feasibility 10 times - iter 39759 and 276 nodes.
spx_run: Lost feasibility 10 times - iter 39804 and 278 nodes.
spx_run: Lost feasibility 10 times - iter 39989 and 279 nodes.
spx_run: Lost feasibility 10 times - iter 40038 and 280 nodes.
spx_run: Lost feasibility 10 times - iter 40083 and 282 nodes.
spx_run: Lost feasibility 10 times - iter 40268 and 283 nodes.
spx_run: Lost feasibility 10 times - iter 40317 and 284 nodes.
spx_run: Lost feasibility 10 times - iter 40362 and 286 nodes.
spx_run: Lost feasibility 10 times - iter 40547 and 287 nodes.
spx_run: Lost feasibility 10 times - iter 40596 and 288 nodes.
spx_run: Lost feasibility 10 times - iter 40641 and 290 nodes.
spx_run: Lost feasibility 10 times - iter 40826 and 291 nodes.
spx_run: Lost feasibility 10 times - iter 43483 and 292 nodes.
spx_run: Lost feasibility 10 times - iter 43645 and 293 nodes.
spx_run: Lost feasibility 10 times - iter 43689 and 295 nodes.
spx_run: Lost feasibility 10 times - iter 43747 and 298 nodes.
spx_run: Lost feasibility 10 times - iter 43934 and 299 nodes.
spx_run: Lost feasibility 10 times - iter 44352 and 300 nodes.
spx_run: Lost feasibility 10 times - iter 44514 and 301 nodes.
spx_run: Lost feasibility 10 times - iter 44558 and 303 nodes.
spx_run: Lost feasibility 10 times - iter 44616 and 306 nodes.
spx_run: Lost feasibility 10 times - iter 44803 and 307 nodes.
spx_run: Lost feasibility 10 times - iter 45221 and 308 nodes.
spx_run: Lost feasibility 10 times - iter 45383 and 309 nodes.
spx_run: Lost feasibility 10 times - iter 45427 and 311 nodes.
spx_run: Lost feasibility 10 times - iter 45485 and 314 nodes.
spx_run: Lost feasibility 10 times - iter 45672 and 315 nodes.
spx_run: Lost feasibility 10 times - iter 46090 and 316 nodes.
spx_run: Lost feasibility 10 times - iter 46252 and 317 nodes.
spx_run: Lost feasibility 10 times - iter 46296 and 319 nodes.
spx_run: Lost feasibility 10 times - iter 46354 and 322 nodes.
spx_run: Lost feasibility 10 times - iter 46541 and 323 nodes.
spx_run: Lost feasibility 10 times - iter 46960 and 324 nodes.
spx_run: Lost feasibility 10 times - iter 47009 and 325 nodes.
spx_run: Lost feasibility 10 times - iter 47053 and 327 nodes.
spx_run: Lost feasibility 10 times - iter 49268 and 328 nodes.
spx_run: Lost feasibility 10 times - iter 49317 and 329 nodes.
spx_run: Lost feasibility 10 times - iter 49361 and 331 nodes.
spx_run: Lost feasibility 10 times - iter 51576 and 332 nodes.
spx_run: Lost feasibility 10 times - iter 51606 and 333 nodes.
spx_run: Lost feasibility 10 times - iter 51960 and 384 nodes.
spx_run: Lost feasibility 10 times - iter 52114 and 441 nodes.
spx_run: Lost feasibility 10 times - iter 54063 and 546 nodes.
spx_run: Lost feasibility 10 times - iter 54106 and 549 nodes.
spx_run: Lost feasibility 10 times - iter 54274 and 553 nodes.
spx_run: Lost feasibility 10 times - iter 54302 and 555 nodes.
spx_run: Lost feasibility 10 times - iter 54318 and 556 nodes.
spx_run: Lost feasibility 10 times - iter 54340 and 557 nodes.
spx_run: Lost feasibility 10 times - iter 54389 and 559 nodes.
spx_run: Lost feasibility 10 times - iter 54426 and 560 nodes.
spx_run: Lost feasibility 10 times - iter 55411 and 561 nodes.
spx_run: Lost feasibility 10 times - iter 57252 and 566 nodes.
spx_run: Lost feasibility 10 times - iter 57544 and 673 nodes.
spx_run: Lost feasibility 10 times - iter 57552 and 675 nodes.
spx_run: Lost feasibility 10 times - iter 57733 and 676 nodes.
spx_run: Lost feasibility 10 times - iter 57756 and 677 nodes.
spx_run: Lost feasibility 10 times - iter 57796 and 678 nodes.
spx_run: Lost feasibility 10 times - iter 60241 and 679 nodes.
spx_run: Lost feasibility 10 times - iter 62727 and 684 nodes.
spx_run: Lost feasibility 10 times - iter 62747 and 687 nodes.
spx_run: Lost feasibility 10 times - iter 62925 and 688 nodes.
spx_run: Lost feasibility 10 times - iter 62946 and 692 nodes.
spx_run: Lost feasibility 10 times - iter 63119 and 693 nodes.
spx_run: Lost feasibility 10 times - iter 63286 and 697 nodes.
spx_run: Lost feasibility 10 times - iter 63457 and 698 nodes.
spx_run: Lost feasibility 10 times - iter 63477 and 702 nodes.
spx_run: Lost feasibility 10 times - iter 63655 and 703 nodes.
spx_run: Lost feasibility 10 times - iter 63676 and 707 nodes.
spx_run: Lost feasibility 10 times - iter 63849 and 708 nodes.
spx_run: Lost feasibility 10 times - iter 64016 and 712 nodes.
spx_run: Lost feasibility 10 times - iter 64187 and 713 nodes.
spx_run: Lost feasibility 10 times - iter 64207 and 717 nodes.
spx_run: Lost feasibility 10 times - iter 64385 and 718 nodes.
spx_run: Lost feasibility 10 times - iter 64406 and 722 nodes.
spx_run: Lost feasibility 10 times - iter 64579 and 723 nodes.
spx_run: Lost feasibility 10 times - iter 64746 and 727 nodes.
spx_run: Lost feasibility 10 times - iter 64917 and 728 nodes.
spx_run: Lost feasibility 10 times - iter 64937 and 732 nodes.
spx_run: Lost feasibility 10 times - iter 65115 and 733 nodes.
spx_run: Lost feasibility 10 times - iter 65136 and 737 nodes.
spx_run: Lost feasibility 10 times - iter 65309 and 738 nodes.
spx_run: Lost feasibility 10 times - iter 65476 and 742 nodes.
spx_run: Lost feasibility 10 times - iter 65647 and 743 nodes.
spx_run: Lost feasibility 10 times - iter 65667 and 747 nodes.
spx_run: Lost feasibility 10 times - iter 65845 and 748 nodes.
spx_run: Lost feasibility 10 times - iter 65866 and 752 nodes.
spx_run: Lost feasibility 10 times - iter 66039 and 753 nodes.
spx_run: Lost feasibility 10 times - iter 66206 and 757 nodes.
spx_run: Lost feasibility 10 times - iter 66377 and 758 nodes.
spx_run: Lost feasibility 10 times - iter 66397 and 762 nodes.
spx_run: Lost feasibility 10 times - iter 66575 and 763 nodes.
spx_run: Lost feasibility 10 times - iter 66596 and 767 nodes.
spx_run: Lost feasibility 10 times - iter 66769 and 768 nodes.
spx_run: Lost feasibility 10 times - iter 66936 and 772 nodes.
spx_run: Lost feasibility 10 times - iter 67107 and 773 nodes.
spx_run: Lost feasibility 10 times - iter 67127 and 777 nodes.
spx_run: Lost feasibility 10 times - iter 67305 and 778 nodes.
spx_run: Lost feasibility 10 times - iter 67326 and 782 nodes.
spx_run: Lost feasibility 10 times - iter 67499 and 783 nodes.
spx_run: Lost feasibility 10 times - iter 67666 and 787 nodes.
spx_run: Lost feasibility 10 times - iter 67837 and 788 nodes.
spx_run: Lost feasibility 10 times - iter 67857 and 792 nodes.
spx_run: Lost feasibility 10 times - iter 68035 and 793 nodes.
spx_run: Lost feasibility 10 times - iter 68056 and 797 nodes.
spx_run: Lost feasibility 10 times - iter 68229 and 798 nodes.
spx_run: Lost feasibility 10 times - iter 68396 and 802 nodes.
spx_run: Lost feasibility 10 times - iter 68567 and 803 nodes.
spx_run: Lost feasibility 10 times - iter 68587 and 807 nodes.
spx_run: Lost feasibility 10 times - iter 68765 and 808 nodes.
spx_run: Lost feasibility 10 times - iter 68786 and 812 nodes.
spx_run: Lost feasibility 10 times - iter 68959 and 813 nodes.
spx_run: Lost feasibility 10 times - iter 69126 and 817 nodes.
spx_run: Lost feasibility 10 times - iter 69297 and 818 nodes.
spx_run: Lost feasibility 10 times - iter 69317 and 822 nodes.
spx_run: Lost feasibility 10 times - iter 69495 and 823 nodes.
spx_run: Lost feasibility 10 times - iter 69516 and 827 nodes.
spx_run: Lost feasibility 10 times - iter 69689 and 828 nodes.
spx_run: Lost feasibility 10 times - iter 69856 and 832 nodes.
spx_run: Lost feasibility 10 times - iter 70027 and 833 nodes.
spx_run: Lost feasibility 10 times - iter 70047 and 837 nodes.
spx_run: Lost feasibility 10 times - iter 70225 and 838 nodes.
spx_run: Lost feasibility 10 times - iter 70246 and 842 nodes.
spx_run: Lost feasibility 10 times - iter 70419 and 843 nodes.
spx_run: Lost feasibility 10 times - iter 70586 and 847 nodes.
spx_run: Lost feasibility 10 times - iter 70757 and 848 nodes.
spx_run: Lost feasibility 10 times - iter 70777 and 852 nodes.
spx_run: Lost feasibility 10 times - iter 70955 and 853 nodes.
spx_run: Lost feasibility 10 times - iter 70976 and 857 nodes.
spx_run: Lost feasibility 10 times - iter 71149 and 858 nodes.
spx_run: Lost feasibility 10 times - iter 71316 and 862 nodes.
spx_run: Lost feasibility 10 times - iter 71487 and 863 nodes.
spx_run: Lost feasibility 10 times - iter 71507 and 867 nodes.
spx_run: Lost feasibility 10 times - iter 71685 and 868 nodes.
spx_run: Lost feasibility 10 times - iter 71706 and 872 nodes.
spx_run: Lost feasibility 10 times - iter 71879 and 873 nodes.
spx_run: Lost feasibility 10 times - iter 72046 and 877 nodes.
spx_run: Lost feasibility 10 times - iter 72217 and 878 nodes.
spx_run: Lost feasibility 10 times - iter 72237 and 882 nodes.
spx_run: Lost feasibility 10 times - iter 72415 and 883 nodes.
spx_run: Lost feasibility 10 times - iter 72436 and 887 nodes.
spx_run: Lost feasibility 10 times - iter 72609 and 888 nodes.
spx_run: Lost feasibility 10 times - iter 72776 and 892 nodes.
spx_run: Lost feasibility 10 times - iter 72947 and 893 nodes.
spx_run: Lost feasibility 10 times - iter 72967 and 897 nodes.
spx_run: Lost feasibility 10 times - iter 73145 and 898 nodes.
spx_run: Lost feasibility 10 times - iter 73166 and 902 nodes.
spx_run: Lost feasibility 10 times - iter 73339 and 903 nodes.
spx_run: Lost feasibility 10 times - iter 73506 and 907 nodes.
spx_run: Lost feasibility 10 times - iter 73677 and 908 nodes.
spx_run: Lost feasibility 10 times - iter 73697 and 912 nodes.
spx_run: Lost feasibility 10 times - iter 73875 and 913 nodes.
spx_run: Lost feasibility 10 times - iter 73896 and 917 nodes.
spx_run: Lost feasibility 10 times - iter 74069 and
FORMULA DoubleExponent-PT-100-UpperBounds-03 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-UpperBounds-05 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-UpperBounds-06 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-UpperBounds-12 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-UpperBounds-15 0 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 11376116 kB
After kill :
MemTotal: 16427488 kB
MemFree: 16136592 kB

--------------------
content from 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="DoubleExponent-PT-100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itslola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882900797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;