About the Execution of ITS-Tools for BusinessProcesses-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15716.110 | 484964.00 | 790301.00 | 3311.90 | FFTFTTTTTFTFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200532.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200532
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 141K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1589252985741
[2020-05-12 03:09:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:09:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:09:49] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2020-05-12 03:09:49] [INFO ] Transformed 567 places.
[2020-05-12 03:09:49] [INFO ] Transformed 508 transitions.
[2020-05-12 03:09:49] [INFO ] Found NUPN structural information;
[2020-05-12 03:09:49] [INFO ] Parsed PT model containing 567 places and 508 transitions in 235 ms.
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 79 ms.
Incomplete random walk after 100000 steps, including 753 resets, run finished after 577 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2020-05-12 03:09:50] [INFO ] Computed 95 place invariants in 45 ms
[2020-05-12 03:09:51] [INFO ] [Real]Absence check using 53 positive place invariants in 341 ms returned sat
[2020-05-12 03:09:51] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 49 ms returned sat
[2020-05-12 03:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:09:52] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2020-05-12 03:09:52] [INFO ] Deduced a trap composed of 12 places in 692 ms
[2020-05-12 03:09:53] [INFO ] Deduced a trap composed of 40 places in 663 ms
[2020-05-12 03:09:54] [INFO ] Deduced a trap composed of 27 places in 432 ms
[2020-05-12 03:09:58] [INFO ] Deduced a trap composed of 105 places in 4455 ms
[2020-05-12 03:09:58] [INFO ] Deduced a trap composed of 18 places in 247 ms
[2020-05-12 03:09:59] [INFO ] Deduced a trap composed of 107 places in 225 ms
[2020-05-12 03:10:00] [INFO ] Deduced a trap composed of 20 places in 1796 ms
[2020-05-12 03:10:03] [INFO ] Deduced a trap composed of 39 places in 2700 ms
[2020-05-12 03:10:07] [INFO ] Deduced a trap composed of 36 places in 3969 ms
[2020-05-12 03:10:08] [INFO ] Deduced a trap composed of 16 places in 405 ms
[2020-05-12 03:10:11] [INFO ] Deduced a trap composed of 103 places in 3657 ms
[2020-05-12 03:10:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s118 s119 s120 s151 s152 s153 s163 s164 s165 s168 s169 s170 s171 s207 s208 s209 s232 s233 s269 s271 s279 s280 s281 s284 s285 s286 s294 s296 s299 s301 s305 s310 s319 s320 s321 s324 s325 s326 s330 s335 s340 s355 s368 s370 s374 s387 s390 s391 s394 s398 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s417 s418 s419 s420 s429 s430 s450 s451 s452 s453 s454 s455 s462 s463 s470 s471 s472 s473 s480 s481 s491 s492 s493 s494 s495 s496 s501 s502 s503 s504 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s521) 0)") while checking expression at index 0
[2020-05-12 03:10:12] [INFO ] [Real]Absence check using 53 positive place invariants in 51 ms returned sat
[2020-05-12 03:10:12] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 59 ms returned sat
[2020-05-12 03:10:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:10:14] [INFO ] [Real]Absence check using state equation in 2658 ms returned sat
[2020-05-12 03:10:19] [INFO ] Deduced a trap composed of 11 places in 5200 ms
[2020-05-12 03:10:24] [INFO ] Deduced a trap composed of 23 places in 4423 ms
[2020-05-12 03:10:30] [INFO ] Deduced a trap composed of 14 places in 5681 ms
[2020-05-12 03:10:30] [INFO ] Deduced a trap composed of 18 places in 328 ms
[2020-05-12 03:10:30] [INFO ] Deduced a trap composed of 18 places in 305 ms
[2020-05-12 03:10:31] [INFO ] Deduced a trap composed of 20 places in 370 ms
[2020-05-12 03:10:31] [INFO ] Deduced a trap composed of 13 places in 352 ms
[2020-05-12 03:10:32] [INFO ] Deduced a trap composed of 11 places in 988 ms
[2020-05-12 03:10:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s228 s231 s388 s389 s390 s394 s517 s518) 0)") while checking expression at index 1
[2020-05-12 03:10:32] [INFO ] [Real]Absence check using 53 positive place invariants in 56 ms returned sat
[2020-05-12 03:10:32] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 185 ms returned sat
[2020-05-12 03:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:10:36] [INFO ] [Real]Absence check using state equation in 3357 ms returned sat
[2020-05-12 03:10:43] [INFO ] Deduced a trap composed of 11 places in 7485 ms
[2020-05-12 03:10:45] [INFO ] Deduced a trap composed of 23 places in 1743 ms
[2020-05-12 03:10:46] [INFO ] Deduced a trap composed of 16 places in 411 ms
[2020-05-12 03:10:46] [INFO ] Deduced a trap composed of 21 places in 784 ms
[2020-05-12 03:10:47] [INFO ] Deduced a trap composed of 12 places in 338 ms
[2020-05-12 03:10:48] [INFO ] Deduced a trap composed of 124 places in 827 ms
[2020-05-12 03:10:48] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-05-12 03:10:49] [INFO ] Deduced a trap composed of 97 places in 654 ms
[2020-05-12 03:10:49] [INFO ] Deduced a trap composed of 26 places in 165 ms
[2020-05-12 03:10:49] [INFO ] Deduced a trap composed of 14 places in 381 ms
[2020-05-12 03:10:49] [INFO ] Deduced a trap composed of 34 places in 159 ms
[2020-05-12 03:10:50] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-05-12 03:10:50] [INFO ] Deduced a trap composed of 16 places in 206 ms
[2020-05-12 03:10:50] [INFO ] Deduced a trap composed of 29 places in 165 ms
[2020-05-12 03:10:50] [INFO ] Deduced a trap composed of 25 places in 152 ms
[2020-05-12 03:10:52] [INFO ] Deduced a trap composed of 37 places in 2021 ms
[2020-05-12 03:10:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s189 s190 s191 s195 s196 s197 s210 s213 s214 s334 s335 s336 s345 s355 s360 s369 s374 s379 s480 s481 s487 s488 s491 s492 s507 s508 s513 s514 s550 s554) 0)") while checking expression at index 2
[2020-05-12 03:10:53] [INFO ] [Real]Absence check using 53 positive place invariants in 321 ms returned sat
[2020-05-12 03:10:53] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 154 ms returned sat
[2020-05-12 03:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:10:54] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2020-05-12 03:10:54] [INFO ] Deduced a trap composed of 16 places in 406 ms
[2020-05-12 03:10:55] [INFO ] Deduced a trap composed of 14 places in 384 ms
[2020-05-12 03:10:55] [INFO ] Deduced a trap composed of 115 places in 331 ms
[2020-05-12 03:10:55] [INFO ] Deduced a trap composed of 20 places in 318 ms
[2020-05-12 03:10:56] [INFO ] Deduced a trap composed of 15 places in 312 ms
[2020-05-12 03:10:56] [INFO ] Deduced a trap composed of 124 places in 320 ms
[2020-05-12 03:10:56] [INFO ] Deduced a trap composed of 27 places in 296 ms
[2020-05-12 03:10:58] [INFO ] Deduced a trap composed of 30 places in 1249 ms
[2020-05-12 03:10:58] [INFO ] Deduced a trap composed of 117 places in 296 ms
[2020-05-12 03:10:58] [INFO ] Deduced a trap composed of 11 places in 369 ms
[2020-05-12 03:11:00] [INFO ] Deduced a trap composed of 17 places in 1977 ms
[2020-05-12 03:11:02] [INFO ] Deduced a trap composed of 18 places in 1785 ms
[2020-05-12 03:11:05] [INFO ] Deduced a trap composed of 21 places in 2306 ms
[2020-05-12 03:11:05] [INFO ] Deduced a trap composed of 111 places in 161 ms
[2020-05-12 03:11:05] [INFO ] Deduced a trap composed of 20 places in 184 ms
[2020-05-12 03:11:05] [INFO ] Deduced a trap composed of 119 places in 160 ms
[2020-05-12 03:11:05] [INFO ] Deduced a trap composed of 116 places in 146 ms
[2020-05-12 03:11:06] [INFO ] Deduced a trap composed of 123 places in 157 ms
[2020-05-12 03:11:06] [INFO ] Deduced a trap composed of 22 places in 134 ms
[2020-05-12 03:11:06] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2020-05-12 03:11:06] [INFO ] Deduced a trap composed of 17 places in 176 ms
[2020-05-12 03:11:06] [INFO ] Deduced a trap composed of 25 places in 182 ms
[2020-05-12 03:11:06] [INFO ] Deduced a trap composed of 115 places in 139 ms
[2020-05-12 03:11:07] [INFO ] Deduced a trap composed of 18 places in 168 ms
[2020-05-12 03:11:07] [INFO ] Deduced a trap composed of 117 places in 150 ms
[2020-05-12 03:11:07] [INFO ] Deduced a trap composed of 24 places in 181 ms
[2020-05-12 03:11:08] [INFO ] Deduced a trap composed of 32 places in 1073 ms
[2020-05-12 03:11:08] [INFO ] Deduced a trap composed of 48 places in 151 ms
[2020-05-12 03:11:12] [INFO ] Deduced a trap composed of 34 places in 4068 ms
[2020-05-12 03:11:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s201 s202 s203 s210 s215 s216 s349 s350 s351 s355 s360 s364 s369 s374 s379 s384 s487 s488 s491 s492 s495 s496 s499 s500 s507 s508 s557) 0)") while checking expression at index 3
[2020-05-12 03:11:13] [INFO ] [Real]Absence check using 53 positive place invariants in 417 ms returned sat
[2020-05-12 03:11:13] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 77 ms returned sat
[2020-05-12 03:11:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:11:15] [INFO ] [Real]Absence check using state equation in 2276 ms returned sat
[2020-05-12 03:11:18] [INFO ] Deduced a trap composed of 17 places in 2205 ms
[2020-05-12 03:11:18] [INFO ] Deduced a trap composed of 12 places in 454 ms
[2020-05-12 03:11:19] [INFO ] Deduced a trap composed of 20 places in 897 ms
[2020-05-12 03:11:21] [INFO ] Deduced a trap composed of 17 places in 1708 ms
[2020-05-12 03:11:23] [INFO ] Deduced a trap composed of 20 places in 1814 ms
[2020-05-12 03:11:24] [INFO ] Deduced a trap composed of 15 places in 982 ms
[2020-05-12 03:11:24] [INFO ] Deduced a trap composed of 12 places in 846 ms
[2020-05-12 03:11:26] [INFO ] Deduced a trap composed of 22 places in 1250 ms
[2020-05-12 03:11:26] [INFO ] Deduced a trap composed of 22 places in 337 ms
[2020-05-12 03:11:27] [INFO ] Deduced a trap composed of 19 places in 353 ms
[2020-05-12 03:11:27] [INFO ] Deduced a trap composed of 23 places in 350 ms
[2020-05-12 03:11:27] [INFO ] Deduced a trap composed of 18 places in 346 ms
[2020-05-12 03:11:28] [INFO ] Deduced a trap composed of 22 places in 313 ms
[2020-05-12 03:11:28] [INFO ] Deduced a trap composed of 26 places in 362 ms
[2020-05-12 03:11:28] [INFO ] Deduced a trap composed of 31 places in 324 ms
[2020-05-12 03:11:29] [INFO ] Deduced a trap composed of 26 places in 1128 ms
[2020-05-12 03:11:30] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-05-12 03:11:30] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-05-12 03:11:30] [INFO ] Deduced a trap composed of 17 places in 153 ms
[2020-05-12 03:11:30] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2020-05-12 03:11:30] [INFO ] Deduced a trap composed of 24 places in 159 ms
[2020-05-12 03:11:31] [INFO ] Deduced a trap composed of 25 places in 159 ms
[2020-05-12 03:11:31] [INFO ] Deduced a trap composed of 34 places in 198 ms
[2020-05-12 03:11:31] [INFO ] Deduced a trap composed of 32 places in 169 ms
[2020-05-12 03:11:31] [INFO ] Deduced a trap composed of 29 places in 177 ms
[2020-05-12 03:11:31] [INFO ] Deduced a trap composed of 27 places in 183 ms
[2020-05-12 03:11:32] [INFO ] Deduced a trap composed of 39 places in 210 ms
[2020-05-12 03:11:32] [INFO ] Deduced a trap composed of 36 places in 192 ms
[2020-05-12 03:11:34] [INFO ] Deduced a trap composed of 41 places in 2343 ms
[2020-05-12 03:11:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s151 s152 s153 s220 s221 s222 s232 s324 s325 s326 s340 s355 s360 s364 s369 s374 s379 s384 s389 s392 s394 s395 s396 s487 s488 s491 s492 s495 s496 s499 s500 s503 s504 s507 s508 s513 s514 s550 s551) 0)") while checking expression at index 4
[2020-05-12 03:11:35] [INFO ] [Real]Absence check using 53 positive place invariants in 97 ms returned sat
[2020-05-12 03:11:35] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 51 ms returned sat
[2020-05-12 03:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:11:36] [INFO ] [Real]Absence check using state equation in 1398 ms returned sat
[2020-05-12 03:11:36] [INFO ] Deduced a trap composed of 15 places in 215 ms
[2020-05-12 03:11:37] [INFO ] Deduced a trap composed of 21 places in 343 ms
[2020-05-12 03:11:37] [INFO ] Deduced a trap composed of 21 places in 317 ms
[2020-05-12 03:11:37] [INFO ] Deduced a trap composed of 12 places in 323 ms
[2020-05-12 03:11:38] [INFO ] Deduced a trap composed of 114 places in 839 ms
[2020-05-12 03:11:39] [INFO ] Deduced a trap composed of 33 places in 405 ms
[2020-05-12 03:11:44] [INFO ] Deduced a trap composed of 18 places in 5267 ms
[2020-05-12 03:11:49] [INFO ] Deduced a trap composed of 101 places in 5147 ms
[2020-05-12 03:11:54] [INFO ] Deduced a trap composed of 26 places in 5162 ms
[2020-05-12 03:11:58] [INFO ] Deduced a trap composed of 22 places in 3972 ms
[2020-05-12 03:11:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s128 s319 s320 s321) 0)") while checking expression at index 5
[2020-05-12 03:11:58] [INFO ] [Real]Absence check using 53 positive place invariants in 25 ms returned unsat
[2020-05-12 03:11:59] [INFO ] [Real]Absence check using 53 positive place invariants in 124 ms returned sat
[2020-05-12 03:11:59] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 37 ms returned sat
[2020-05-12 03:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:00] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2020-05-12 03:12:03] [INFO ] Deduced a trap composed of 101 places in 3116 ms
[2020-05-12 03:12:07] [INFO ] Deduced a trap composed of 19 places in 3438 ms
[2020-05-12 03:12:12] [INFO ] Deduced a trap composed of 11 places in 5047 ms
[2020-05-12 03:12:18] [INFO ] Deduced a trap composed of 99 places in 6196 ms
[2020-05-12 03:12:24] [INFO ] Deduced a trap composed of 20 places in 5529 ms
[2020-05-12 03:12:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s215 s216 s217 s220 s221 s222 s364 s378 s379 s380 s384 s389 s503 s504) 0)") while checking expression at index 7
[2020-05-12 03:12:24] [INFO ] [Real]Absence check using 53 positive place invariants in 296 ms returned sat
[2020-05-12 03:12:24] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 128 ms returned sat
[2020-05-12 03:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:28] [INFO ] [Real]Absence check using state equation in 3719 ms returned sat
[2020-05-12 03:12:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:12:28] [INFO ] [Nat]Absence check using 53 positive place invariants in 333 ms returned sat
[2020-05-12 03:12:29] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 157 ms returned sat
[2020-05-12 03:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:33] [INFO ] [Nat]Absence check using state equation in 4195 ms returned sat
[2020-05-12 03:12:37] [INFO ] Deduced a trap composed of 17 places in 3643 ms
[2020-05-12 03:12:41] [INFO ] Deduced a trap composed of 117 places in 4113 ms
[2020-05-12 03:12:46] [INFO ] Deduced a trap composed of 11 places in 5001 ms
[2020-05-12 03:12:50] [INFO ] Deduced a trap composed of 16 places in 4135 ms
[2020-05-12 03:12:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s180 s359 s360 s361) 0)") while checking expression at index 8
[2020-05-12 03:12:50] [INFO ] [Real]Absence check using 53 positive place invariants in 350 ms returned sat
[2020-05-12 03:12:51] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 134 ms returned sat
[2020-05-12 03:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:53] [INFO ] [Real]Absence check using state equation in 2767 ms returned unsat
[2020-05-12 03:12:54] [INFO ] [Real]Absence check using 53 positive place invariants in 149 ms returned sat
[2020-05-12 03:12:54] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 172 ms returned sat
[2020-05-12 03:12:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:12:57] [INFO ] [Real]Absence check using state equation in 2999 ms returned sat
[2020-05-12 03:13:01] [INFO ] Deduced a trap composed of 15 places in 4258 ms
[2020-05-12 03:13:05] [INFO ] Deduced a trap composed of 21 places in 4333 ms
[2020-05-12 03:13:10] [INFO ] Deduced a trap composed of 14 places in 4782 ms
[2020-05-12 03:13:15] [INFO ] Deduced a trap composed of 103 places in 5123 ms
[2020-05-12 03:13:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s137 s143 s144 s163 s164 s165 s168 s169 s170 s171 s183 s184 s185 s195 s196 s197 s201 s202 s203 s228 s231 s269 s270 s271 s274 s275 s276 s280 s284 s285 s286 s294 s295 s296 s299 s301 s304 s305 s306 s310 s319 s321 s330 s335 s339 s340 s341 s373 s375 s394 s398 s399 s400 s401 s402 s403 s404 s407 s408 s409 s410 s417 s418 s421 s422 s429 s430 s450 s451 s456 s457 s462 s463 s468 s469 s472 s473 s480 s481 s489 s490 s497 s498 s501 s502 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s521) 0)") while checking expression at index 10
[2020-05-12 03:13:16] [INFO ] [Real]Absence check using 53 positive place invariants in 188 ms returned sat
[2020-05-12 03:13:16] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 85 ms returned sat
[2020-05-12 03:13:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:19] [INFO ] [Real]Absence check using state equation in 3344 ms returned sat
[2020-05-12 03:13:24] [INFO ] Deduced a trap composed of 12 places in 5044 ms
[2020-05-12 03:13:29] [INFO ] Deduced a trap composed of 16 places in 4955 ms
[2020-05-12 03:13:35] [INFO ] Deduced a trap composed of 17 places in 6246 ms
[2020-05-12 03:13:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s186 s368 s369 s370 s495 s496) 0)") while checking expression at index 11
[2020-05-12 03:13:36] [INFO ] [Real]Absence check using 53 positive place invariants in 118 ms returned sat
[2020-05-12 03:13:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 254 ms returned sat
[2020-05-12 03:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:39] [INFO ] [Real]Absence check using state equation in 2746 ms returned sat
[2020-05-12 03:13:39] [INFO ] Deduced a trap composed of 105 places in 509 ms
[2020-05-12 03:13:40] [INFO ] Deduced a trap composed of 20 places in 335 ms
[2020-05-12 03:13:40] [INFO ] Deduced a trap composed of 114 places in 326 ms
[2020-05-12 03:13:40] [INFO ] Deduced a trap composed of 12 places in 266 ms
[2020-05-12 03:13:41] [INFO ] Deduced a trap composed of 25 places in 257 ms
[2020-05-12 03:13:41] [INFO ] Deduced a trap composed of 21 places in 155 ms
[2020-05-12 03:13:43] [INFO ] Deduced a trap composed of 24 places in 2371 ms
[2020-05-12 03:13:45] [INFO ] Deduced a trap composed of 24 places in 1912 ms
[2020-05-12 03:13:45] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-05-12 03:13:45] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2020-05-12 03:13:46] [INFO ] Deduced a trap composed of 23 places in 151 ms
[2020-05-12 03:13:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 6883 ms
[2020-05-12 03:13:46] [INFO ] [Real]Absence check using 53 positive place invariants in 222 ms returned sat
[2020-05-12 03:13:46] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 138 ms returned sat
[2020-05-12 03:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:48] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2020-05-12 03:13:48] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-05-12 03:13:48] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-05-12 03:13:48] [INFO ] Deduced a trap composed of 19 places in 131 ms
[2020-05-12 03:13:48] [INFO ] Deduced a trap composed of 20 places in 97 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 11 places in 89 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 20 places in 100 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 15 places in 89 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 23 places in 83 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 18 places in 81 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 20 places in 73 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 23 places in 101 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 27 places in 87 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 19 places in 66 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 37 places in 83 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 25 places in 68 ms
[2020-05-12 03:13:50] [INFO ] Deduced a trap composed of 28 places in 68 ms
[2020-05-12 03:13:51] [INFO ] Deduced a trap composed of 31 places in 975 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 21 places in 143 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 29 places in 104 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 33 places in 77 ms
[2020-05-12 03:13:52] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4031 ms
[2020-05-12 03:13:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:13:52] [INFO ] [Nat]Absence check using 53 positive place invariants in 59 ms returned sat
[2020-05-12 03:13:52] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 27 ms returned sat
[2020-05-12 03:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:53] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2020-05-12 03:13:53] [INFO ] Deduced a trap composed of 15 places in 615 ms
[2020-05-12 03:13:54] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2020-05-12 03:13:54] [INFO ] Deduced a trap composed of 11 places in 95 ms
[2020-05-12 03:13:54] [INFO ] Deduced a trap composed of 19 places in 762 ms
[2020-05-12 03:13:55] [INFO ] Deduced a trap composed of 22 places in 208 ms
[2020-05-12 03:13:55] [INFO ] Deduced a trap composed of 18 places in 547 ms
[2020-05-12 03:13:56] [INFO ] Deduced a trap composed of 26 places in 176 ms
[2020-05-12 03:13:56] [INFO ] Deduced a trap composed of 22 places in 173 ms
[2020-05-12 03:13:56] [INFO ] Deduced a trap composed of 19 places in 175 ms
[2020-05-12 03:13:56] [INFO ] Deduced a trap composed of 21 places in 204 ms
[2020-05-12 03:13:56] [INFO ] Deduced a trap composed of 28 places in 85 ms
[2020-05-12 03:13:56] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 24 places in 79 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 37 places in 78 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 19 places in 76 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 29 places in 72 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2020-05-12 03:13:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4188 ms
[2020-05-12 03:13:57] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 36 ms.
[2020-05-12 03:14:00] [INFO ] Added : 264 causal constraints over 54 iterations in 3388 ms. Result :sat
[2020-05-12 03:14:01] [INFO ] Deduced a trap composed of 43 places in 343 ms
[2020-05-12 03:14:02] [INFO ] Deduced a trap composed of 43 places in 979 ms
[2020-05-12 03:14:02] [INFO ] Deduced a trap composed of 42 places in 570 ms
[2020-05-12 03:14:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2102 ms
[2020-05-12 03:14:03] [INFO ] [Real]Absence check using 53 positive place invariants in 224 ms returned sat
[2020-05-12 03:14:03] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2020-05-12 03:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:04] [INFO ] [Real]Absence check using state equation in 776 ms returned unsat
[2020-05-12 03:14:04] [INFO ] [Real]Absence check using 53 positive place invariants in 31 ms returned sat
[2020-05-12 03:14:04] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2020-05-12 03:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:05] [INFO ] [Real]Absence check using state equation in 1645 ms returned unsat
[2020-05-12 03:14:06] [INFO ] [Real]Absence check using 53 positive place invariants in 341 ms returned sat
[2020-05-12 03:14:06] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 46 ms returned sat
[2020-05-12 03:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:08] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 15 places in 685 ms
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 19 places in 346 ms
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 37 places in 352 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 97 places in 914 ms
[2020-05-12 03:14:12] [INFO ] Deduced a trap composed of 28 places in 1727 ms
[2020-05-12 03:14:12] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-05-12 03:14:12] [INFO ] Deduced a trap composed of 104 places in 177 ms
[2020-05-12 03:14:13] [INFO ] Deduced a trap composed of 19 places in 176 ms
[2020-05-12 03:14:13] [INFO ] Deduced a trap composed of 105 places in 178 ms
[2020-05-12 03:14:13] [INFO ] Deduced a trap composed of 22 places in 194 ms
[2020-05-12 03:14:13] [INFO ] Deduced a trap composed of 16 places in 186 ms
[2020-05-12 03:14:14] [INFO ] Deduced a trap composed of 30 places in 178 ms
[2020-05-12 03:14:17] [INFO ] Deduced a trap composed of 26 places in 3441 ms
[2020-05-12 03:14:17] [INFO ] Deduced a trap composed of 26 places in 175 ms
[2020-05-12 03:14:18] [INFO ] Deduced a trap composed of 29 places in 523 ms
[2020-05-12 03:14:18] [INFO ] Deduced a trap composed of 28 places in 460 ms
[2020-05-12 03:14:19] [INFO ] Deduced a trap composed of 16 places in 764 ms
[2020-05-12 03:14:21] [INFO ] Deduced a trap composed of 22 places in 2346 ms
[2020-05-12 03:14:22] [INFO ] Deduced a trap composed of 22 places in 363 ms
[2020-05-12 03:14:23] [INFO ] Deduced a trap composed of 30 places in 836 ms
[2020-05-12 03:14:25] [INFO ] Deduced a trap composed of 36 places in 2695 ms
[2020-05-12 03:14:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s207 s208 s209 s210 s213 s214 s215 s216 s324 s325 s326 s340 s355 s360 s369 s374 s379 s476 s477 s487 s488 s491 s492 s495 s496 s499 s500 s550 s551) 0)") while checking expression at index 16
[2020-05-12 03:14:26] [INFO ] [Real]Absence check using 53 positive place invariants in 66 ms returned sat
[2020-05-12 03:14:26] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 32 ms returned sat
[2020-05-12 03:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:28] [INFO ] [Real]Absence check using state equation in 2221 ms returned sat
[2020-05-12 03:14:28] [INFO ] Deduced a trap composed of 11 places in 255 ms
[2020-05-12 03:14:29] [INFO ] Deduced a trap composed of 11 places in 649 ms
[2020-05-12 03:14:32] [INFO ] Deduced a trap composed of 22 places in 2871 ms
[2020-05-12 03:14:32] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-05-12 03:14:32] [INFO ] Deduced a trap composed of 33 places in 150 ms
[2020-05-12 03:14:32] [INFO ] Deduced a trap composed of 26 places in 164 ms
[2020-05-12 03:14:32] [INFO ] Deduced a trap composed of 21 places in 150 ms
[2020-05-12 03:14:33] [INFO ] Deduced a trap composed of 22 places in 182 ms
[2020-05-12 03:14:33] [INFO ] Deduced a trap composed of 101 places in 160 ms
[2020-05-12 03:14:33] [INFO ] Deduced a trap composed of 27 places in 153 ms
[2020-05-12 03:14:33] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-05-12 03:14:34] [INFO ] Deduced a trap composed of 26 places in 742 ms
[2020-05-12 03:14:34] [INFO ] Deduced a trap composed of 29 places in 143 ms
[2020-05-12 03:14:34] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-05-12 03:14:35] [INFO ] Deduced a trap composed of 24 places in 139 ms
[2020-05-12 03:14:35] [INFO ] Deduced a trap composed of 16 places in 134 ms
[2020-05-12 03:14:35] [INFO ] Deduced a trap composed of 24 places in 147 ms
[2020-05-12 03:14:35] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2020-05-12 03:14:36] [INFO ] Deduced a trap composed of 35 places in 613 ms
[2020-05-12 03:14:36] [INFO ] Deduced a trap composed of 30 places in 159 ms
[2020-05-12 03:14:36] [INFO ] Deduced a trap composed of 106 places in 161 ms
[2020-05-12 03:14:36] [INFO ] Deduced a trap composed of 28 places in 226 ms
[2020-05-12 03:14:36] [INFO ] Deduced a trap composed of 34 places in 184 ms
[2020-05-12 03:14:37] [INFO ] Deduced a trap composed of 105 places in 136 ms
[2020-05-12 03:14:37] [INFO ] Deduced a trap composed of 101 places in 126 ms
[2020-05-12 03:14:37] [INFO ] Deduced a trap composed of 41 places in 236 ms
[2020-05-12 03:14:37] [INFO ] Deduced a trap composed of 36 places in 144 ms
[2020-05-12 03:14:37] [INFO ] Deduced a trap composed of 118 places in 148 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 99 places in 159 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 97 places in 189 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 43 places in 149 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 26 places in 61 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 34 places in 58 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2020-05-12 03:14:38] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2020-05-12 03:14:39] [INFO ] Deduced a trap composed of 38 places in 64 ms
[2020-05-12 03:14:39] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10665 ms
[2020-05-12 03:14:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:39] [INFO ] [Nat]Absence check using 53 positive place invariants in 308 ms returned sat
[2020-05-12 03:14:39] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 124 ms returned sat
[2020-05-12 03:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:41] [INFO ] [Nat]Absence check using state equation in 1717 ms returned sat
[2020-05-12 03:14:41] [INFO ] Deduced a trap composed of 11 places in 314 ms
[2020-05-12 03:14:41] [INFO ] Deduced a trap composed of 11 places in 322 ms
[2020-05-12 03:14:42] [INFO ] Deduced a trap composed of 18 places in 320 ms
[2020-05-12 03:14:42] [INFO ] Deduced a trap composed of 16 places in 228 ms
[2020-05-12 03:14:42] [INFO ] Deduced a trap composed of 18 places in 300 ms
[2020-05-12 03:14:43] [INFO ] Deduced a trap composed of 103 places in 155 ms
[2020-05-12 03:14:43] [INFO ] Deduced a trap composed of 25 places in 151 ms
[2020-05-12 03:14:43] [INFO ] Deduced a trap composed of 20 places in 148 ms
[2020-05-12 03:14:43] [INFO ] Deduced a trap composed of 28 places in 316 ms
[2020-05-12 03:14:43] [INFO ] Deduced a trap composed of 33 places in 147 ms
[2020-05-12 03:14:44] [INFO ] Deduced a trap composed of 30 places in 171 ms
[2020-05-12 03:14:44] [INFO ] Deduced a trap composed of 20 places in 157 ms
[2020-05-12 03:14:44] [INFO ] Deduced a trap composed of 42 places in 423 ms
[2020-05-12 03:14:45] [INFO ] Deduced a trap composed of 24 places in 338 ms
[2020-05-12 03:14:46] [INFO ] Deduced a trap composed of 22 places in 1788 ms
[2020-05-12 03:14:47] [INFO ] Deduced a trap composed of 19 places in 233 ms
[2020-05-12 03:14:47] [INFO ] Deduced a trap composed of 26 places in 437 ms
[2020-05-12 03:14:47] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-05-12 03:14:48] [INFO ] Deduced a trap composed of 101 places in 145 ms
[2020-05-12 03:14:48] [INFO ] Deduced a trap composed of 99 places in 147 ms
[2020-05-12 03:14:48] [INFO ] Deduced a trap composed of 37 places in 150 ms
[2020-05-12 03:14:48] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-05-12 03:14:48] [INFO ] Deduced a trap composed of 44 places in 154 ms
[2020-05-12 03:14:50] [INFO ] Deduced a trap composed of 29 places in 1847 ms
[2020-05-12 03:14:50] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-05-12 03:14:51] [INFO ] Deduced a trap composed of 35 places in 175 ms
[2020-05-12 03:14:51] [INFO ] Deduced a trap composed of 34 places in 150 ms
[2020-05-12 03:14:51] [INFO ] Deduced a trap composed of 38 places in 151 ms
[2020-05-12 03:14:51] [INFO ] Deduced a trap composed of 20 places in 184 ms
[2020-05-12 03:14:51] [INFO ] Deduced a trap composed of 18 places in 159 ms
[2020-05-12 03:14:51] [INFO ] Deduced a trap composed of 105 places in 162 ms
[2020-05-12 03:14:52] [INFO ] Deduced a trap composed of 29 places in 153 ms
[2020-05-12 03:14:52] [INFO ] Deduced a trap composed of 38 places in 148 ms
[2020-05-12 03:14:52] [INFO ] Deduced a trap composed of 105 places in 180 ms
[2020-05-12 03:14:52] [INFO ] Deduced a trap composed of 44 places in 142 ms
[2020-05-12 03:14:52] [INFO ] Deduced a trap composed of 109 places in 161 ms
[2020-05-12 03:14:53] [INFO ] Deduced a trap composed of 112 places in 165 ms
[2020-05-12 03:14:53] [INFO ] Deduced a trap composed of 39 places in 139 ms
[2020-05-12 03:14:53] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-05-12 03:14:53] [INFO ] Deduced a trap composed of 109 places in 165 ms
[2020-05-12 03:14:53] [INFO ] Deduced a trap composed of 35 places in 164 ms
[2020-05-12 03:14:54] [INFO ] Deduced a trap composed of 118 places in 333 ms
[2020-05-12 03:14:54] [INFO ] Deduced a trap composed of 78 places in 222 ms
[2020-05-12 03:14:56] [INFO ] Deduced a trap composed of 117 places in 2247 ms
[2020-05-12 03:14:56] [INFO ] Deduced a trap composed of 120 places in 132 ms
[2020-05-12 03:15:00] [INFO ] Deduced a trap composed of 123 places in 3602 ms
[2020-05-12 03:15:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s28 s29 s30 s58 s59 s60 s75 s118 s119 s120 s126 s127 s157 s158 s159 s163 s164 s165 s168 s169 s170 s174 s183 s184 s185 s195 s196 s197 s215 s216 s228 s231 s265 s279 s280 s281 s284 s285 s286 s290 s294 s296 s305 s310 s315 s325 s330 s335 s345 s355 s360 s364 s374 s379 s384 s389 s394 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s417 s418 s419 s420 s431 s432 s434 s436 s438 s439 s440 s441 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s466 s467 s468 s469 s470 s471 s472 s473 s476 s477 s493 s494 s495 s496 s503 s504 s507 s508 s517 s518 s521 s529 s530 s531 s535 s541 s547) 0)") while checking expression at index 17
[2020-05-12 03:15:00] [INFO ] [Real]Absence check using 53 positive place invariants in 138 ms returned sat
[2020-05-12 03:15:00] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 259 ms returned sat
[2020-05-12 03:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:03] [INFO ] [Real]Absence check using state equation in 2599 ms returned sat
[2020-05-12 03:15:04] [INFO ] Deduced a trap composed of 13 places in 547 ms
[2020-05-12 03:15:04] [INFO ] Deduced a trap composed of 106 places in 170 ms
[2020-05-12 03:15:04] [INFO ] Deduced a trap composed of 11 places in 215 ms
[2020-05-12 03:15:04] [INFO ] Deduced a trap composed of 16 places in 212 ms
[2020-05-12 03:15:06] [INFO ] Deduced a trap composed of 37 places in 1161 ms
[2020-05-12 03:15:07] [INFO ] Deduced a trap composed of 19 places in 1490 ms
[2020-05-12 03:15:07] [INFO ] Deduced a trap composed of 21 places in 260 ms
[2020-05-12 03:15:08] [INFO ] Deduced a trap composed of 96 places in 239 ms
[2020-05-12 03:15:08] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2020-05-12 03:15:08] [INFO ] Deduced a trap composed of 27 places in 151 ms
[2020-05-12 03:15:08] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-05-12 03:15:08] [INFO ] Deduced a trap composed of 28 places in 146 ms
[2020-05-12 03:15:09] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2020-05-12 03:15:09] [INFO ] Deduced a trap composed of 36 places in 147 ms
[2020-05-12 03:15:09] [INFO ] Deduced a trap composed of 37 places in 170 ms
[2020-05-12 03:15:09] [INFO ] Deduced a trap composed of 33 places in 137 ms
[2020-05-12 03:15:09] [INFO ] Deduced a trap composed of 17 places in 139 ms
[2020-05-12 03:15:10] [INFO ] Deduced a trap composed of 23 places in 140 ms
[2020-05-12 03:15:10] [INFO ] Deduced a trap composed of 17 places in 148 ms
[2020-05-12 03:15:10] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-05-12 03:15:10] [INFO ] Deduced a trap composed of 35 places in 139 ms
[2020-05-12 03:15:10] [INFO ] Deduced a trap composed of 25 places in 143 ms
[2020-05-12 03:15:10] [INFO ] Deduced a trap composed of 22 places in 158 ms
[2020-05-12 03:15:11] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2020-05-12 03:15:11] [INFO ] Deduced a trap composed of 44 places in 141 ms
[2020-05-12 03:15:11] [INFO ] Deduced a trap composed of 30 places in 139 ms
[2020-05-12 03:15:11] [INFO ] Deduced a trap composed of 39 places in 141 ms
[2020-05-12 03:15:11] [INFO ] Deduced a trap composed of 40 places in 138 ms
[2020-05-12 03:15:11] [INFO ] Deduced a trap composed of 106 places in 251 ms
[2020-05-12 03:15:12] [INFO ] Deduced a trap composed of 36 places in 930 ms
[2020-05-12 03:15:13] [INFO ] Deduced a trap composed of 41 places in 130 ms
[2020-05-12 03:15:14] [INFO ] Deduced a trap composed of 24 places in 1346 ms
[2020-05-12 03:15:15] [INFO ] Deduced a trap composed of 29 places in 573 ms
[2020-05-12 03:15:15] [INFO ] Deduced a trap composed of 30 places in 290 ms
[2020-05-12 03:15:16] [INFO ] Deduced a trap composed of 27 places in 750 ms
[2020-05-12 03:15:16] [INFO ] Deduced a trap composed of 26 places in 130 ms
[2020-05-12 03:15:16] [INFO ] Deduced a trap composed of 116 places in 125 ms
[2020-05-12 03:15:16] [INFO ] Deduced a trap composed of 41 places in 127 ms
[2020-05-12 03:15:16] [INFO ] Deduced a trap composed of 34 places in 118 ms
[2020-05-12 03:15:16] [INFO ] Deduced a trap composed of 129 places in 131 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 134 places in 127 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 49 places in 157 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 25 places in 178 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 26 places in 145 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 22 places in 117 ms
[2020-05-12 03:15:17] [INFO ] Deduced a trap composed of 123 places in 114 ms
[2020-05-12 03:15:18] [INFO ] Deduced a trap composed of 37 places in 118 ms
[2020-05-12 03:15:18] [INFO ] Deduced a trap composed of 129 places in 104 ms
[2020-05-12 03:15:18] [INFO ] Deduced a trap composed of 44 places in 131 ms
[2020-05-12 03:15:18] [INFO ] Deduced a trap composed of 123 places in 125 ms
[2020-05-12 03:15:21] [INFO ] Deduced a trap composed of 123 places in 2721 ms
[2020-05-12 03:15:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s58 s59 s60 s63 s65 s67 s72 s78 s79 s80 s88 s91 s97 s112 s113 s114 s126 s127 s131 s132 s133 s137 s140 s141 s183 s184 s185 s207 s208 s209 s232 s260 s261 s262 s265 s270 s280 s285 s290 s295 s300 s310 s315 s320 s325 s330 s340 s355 s360 s369 s384 s392 s395 s396 s398 s401 s402 s403 s404 s407 s408 s409 s410 s411 s412 s415 s416 s419 s420 s421 s422 s423 s424 s425 s426 s438 s442 s443 s444 s456 s457 s458 s459 s470 s471 s472 s473 s476 s477 s478 s479 s480 s481 s484 s485 s487 s488 s495 s496 s499 s500 s501 s502 s503 s504 s505 s506 s509 s510 s513 s514 s515 s516 s517 s518 s519 s520 s521 s544 s550 s551) 0)") while checking expression at index 18
[2020-05-12 03:15:21] [INFO ] [Real]Absence check using 53 positive place invariants in 45 ms returned sat
[2020-05-12 03:15:21] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 21 ms returned sat
[2020-05-12 03:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:23] [INFO ] [Real]Absence check using state equation in 1676 ms returned sat
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 12 places in 1956 ms
[2020-05-12 03:15:25] [INFO ] Deduced a trap composed of 11 places in 284 ms
[2020-05-12 03:15:26] [INFO ] Deduced a trap composed of 12 places in 1385 ms
[2020-05-12 03:15:27] [INFO ] Deduced a trap composed of 17 places in 427 ms
[2020-05-12 03:15:27] [INFO ] Deduced a trap composed of 13 places in 354 ms
[2020-05-12 03:15:29] [INFO ] Deduced a trap composed of 11 places in 1992 ms
[2020-05-12 03:15:32] [INFO ] Deduced a trap composed of 23 places in 2362 ms
[2020-05-12 03:15:32] [INFO ] Deduced a trap composed of 27 places in 866 ms
[2020-05-12 03:15:37] [INFO ] Deduced a trap composed of 42 places in 4868 ms
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 17 places in 180 ms
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-05-12 03:15:38] [INFO ] Deduced a trap composed of 117 places in 683 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 101 places in 750 ms
[2020-05-12 03:15:39] [INFO ] Deduced a trap composed of 22 places in 184 ms
[2020-05-12 03:15:40] [INFO ] Deduced a trap composed of 27 places in 313 ms
[2020-05-12 03:15:42] [INFO ] Deduced a trap composed of 121 places in 1746 ms
[2020-05-12 03:15:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s28 s29 s30 s34 s35 s38 s39 s44 s45 s69 s79 s80 s103 s118 s119 s120 s137 s146 s147 s189 s190 s191 s210 s213 s214 s215 s216 s261 s265 s274 s275 s276 s279 s281 s284 s285 s286 s290 s295 s304 s305 s306 s310 s319 s320 s321 s325 s335 s350 s359 s361 s364 s369 s379 s389 s394 s398 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s427 s428 s429 s430 s432 s434 s436 s439 s440 s441 s444 s447 s462 s463 s468 s469 s470 s471 s476 s477 s480 s481 s482 s483 s484 s485 s487 s488 s497 s498 s499 s500 s503 s504 s505 s506 s507 s508 s517 s518 s521 s529 s532 s538 s557) 0)") while checking expression at index 19
[2020-05-12 03:15:42] [INFO ] [Real]Absence check using 53 positive place invariants in 249 ms returned sat
[2020-05-12 03:15:42] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 38 ms returned sat
[2020-05-12 03:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:15:44] [INFO ] [Real]Absence check using state equation in 2208 ms returned sat
[2020-05-12 03:15:45] [INFO ] Deduced a trap composed of 31 places in 369 ms
[2020-05-12 03:15:45] [INFO ] Deduced a trap composed of 19 places in 272 ms
[2020-05-12 03:15:45] [INFO ] Deduced a trap composed of 28 places in 154 ms
[2020-05-12 03:15:46] [INFO ] Deduced a trap composed of 11 places in 644 ms
[2020-05-12 03:15:46] [INFO ] Deduced a trap composed of 113 places in 762 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 24 places in 150 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 106 places in 154 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 17 places in 192 ms
[2020-05-12 03:15:47] [INFO ] Deduced a trap composed of 26 places in 187 ms
[2020-05-12 03:15:48] [INFO ] Deduced a trap composed of 20 places in 317 ms
[2020-05-12 03:15:48] [INFO ] Deduced a trap composed of 18 places in 277 ms
[2020-05-12 03:15:52] [INFO ] Deduced a trap composed of 24 places in 4170 ms
[2020-05-12 03:15:53] [INFO ] Deduced a trap composed of 122 places in 1134 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 21 places in 340 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 25 places in 301 ms
[2020-05-12 03:15:54] [INFO ] Deduced a trap composed of 118 places in 302 ms
[2020-05-12 03:15:58] [INFO ] Deduced a trap composed of 31 places in 3666 ms
[2020-05-12 03:15:59] [INFO ] Deduced a trap composed of 29 places in 1255 ms
[2020-05-12 03:16:02] [INFO ] Deduced a trap composed of 119 places in 2447 ms
[2020-05-12 03:16:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s52 s53 s54 s58 s59 s60 s63 s65 s69 s79 s80 s88 s94 s106 s121 s124 s125 s126 s127 s137 s146 s147 s163 s164 s165 s168 s169 s177 s195 s196 s197 s207 s208 s209 s215 s216 s228 s231 s260 s261 s262 s269 s271 s279 s281 s285 s290 s300 s305 s309 s311 s315 s330 s335 s339 s340 s341 s355 s360 s364 s369 s379 s384 s394 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s419 s420 s423 s424 s427 s428 s436 s441 s444 s447 s452 s453 s466 s467 s468 s469 s470 s471 s480 s481 s486 s491 s492 s495 s496 s503 s504 s505 s506 s515 s516 s517 s518 s521 s541 s558 s559) 0)") while checking expression at index 20
[2020-05-12 03:16:02] [INFO ] [Real]Absence check using 53 positive place invariants in 32 ms returned sat
[2020-05-12 03:16:02] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2020-05-12 03:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:03] [INFO ] [Real]Absence check using state equation in 1311 ms returned unsat
[2020-05-12 03:16:04] [INFO ] [Real]Absence check using 53 positive place invariants in 376 ms returned sat
[2020-05-12 03:16:04] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 103 ms returned sat
[2020-05-12 03:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:05] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2020-05-12 03:16:08] [INFO ] Deduced a trap composed of 11 places in 3040 ms
[2020-05-12 03:16:09] [INFO ] Deduced a trap composed of 24 places in 1159 ms
[2020-05-12 03:16:10] [INFO ] Deduced a trap composed of 27 places in 338 ms
[2020-05-12 03:16:12] [INFO ] Deduced a trap composed of 27 places in 2745 ms
[2020-05-12 03:16:14] [INFO ] Deduced a trap composed of 36 places in 1313 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 29 places in 5004 ms
[2020-05-12 03:16:19] [INFO ] Deduced a trap composed of 104 places in 350 ms
[2020-05-12 03:16:22] [INFO ] Deduced a trap composed of 20 places in 2410 ms
[2020-05-12 03:16:23] [INFO ] Deduced a trap composed of 102 places in 958 ms
[2020-05-12 03:16:27] [INFO ] Deduced a trap composed of 108 places in 4375 ms
[2020-05-12 03:16:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s112 s113 s114 s168 s169 s177 s195 s196 s197 s215 s216 s220 s221 s222 s228 s231 s265 s270 s274 s276 s280 s294 s296 s299 s301 s309 s310 s311 s314 s316 s319 s321 s350 s359 s360 s361 s364 s379 s384 s389 s398 s399 s400 s401 s402 s403 s404 s407 s408 s409 s410 s415 s416 s417 s418 s421 s422 s423 s424 s425 s426 s429 s430 s431 s439 s440 s450 s451 s454 s455 s464 s465 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s493 s494 s495 s496 s503 s504 s505 s506 s507 s508 s519 s520 s521 s524 s525) 0)") while checking expression at index 22
[2020-05-12 03:16:27] [INFO ] [Real]Absence check using 53 positive place invariants in 208 ms returned sat
[2020-05-12 03:16:27] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 92 ms returned sat
[2020-05-12 03:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:28] [INFO ] [Real]Absence check using state equation in 1011 ms returned unsat
[2020-05-12 03:16:29] [INFO ] [Real]Absence check using 53 positive place invariants in 88 ms returned sat
[2020-05-12 03:16:29] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 124 ms returned sat
[2020-05-12 03:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:31] [INFO ] [Real]Absence check using state equation in 1763 ms returned sat
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 15 places in 195 ms
[2020-05-12 03:16:31] [INFO ] Deduced a trap composed of 25 places in 661 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 13 places in 2656 ms
[2020-05-12 03:16:34] [INFO ] Deduced a trap composed of 13 places in 278 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 12 places in 167 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 22 places in 166 ms
[2020-05-12 03:16:35] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 12 places in 648 ms
[2020-05-12 03:16:36] [INFO ] Deduced a trap composed of 20 places in 412 ms
[2020-05-12 03:16:37] [INFO ] Deduced a trap composed of 18 places in 313 ms
[2020-05-12 03:16:40] [INFO ] Deduced a trap composed of 18 places in 3040 ms
[2020-05-12 03:16:40] [INFO ] Deduced a trap composed of 20 places in 294 ms
[2020-05-12 03:16:44] [INFO ] Deduced a trap composed of 21 places in 3769 ms
[2020-05-12 03:16:50] [INFO ] Deduced a trap composed of 21 places in 5834 ms
[2020-05-12 03:16:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s154 s334 s335 s336 s480 s481) 0)") while checking expression at index 24
[2020-05-12 03:16:50] [INFO ] [Real]Absence check using 53 positive place invariants in 180 ms returned sat
[2020-05-12 03:16:50] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 123 ms returned sat
[2020-05-12 03:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:16:53] [INFO ] [Real]Absence check using state equation in 2948 ms returned sat
[2020-05-12 03:16:53] [INFO ] Deduced a trap composed of 13 places in 183 ms
[2020-05-12 03:16:54] [INFO ] Deduced a trap composed of 12 places in 293 ms
[2020-05-12 03:16:55] [INFO ] Deduced a trap composed of 12 places in 1617 ms
[2020-05-12 03:16:56] [INFO ] Deduced a trap composed of 16 places in 888 ms
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 24 places in 354 ms
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 18 places in 218 ms
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 21 places in 109 ms
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 15 places in 224 ms
[2020-05-12 03:16:57] [INFO ] Deduced a trap composed of 22 places in 216 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 29 places in 230 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 39 places in 239 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 23 places in 237 ms
[2020-05-12 03:16:58] [INFO ] Deduced a trap composed of 23 places in 219 ms
[2020-05-12 03:16:59] [INFO ] Deduced a trap composed of 28 places in 381 ms
[2020-05-12 03:16:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5888 ms
[2020-05-12 03:16:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:16:59] [INFO ] [Nat]Absence check using 53 positive place invariants in 41 ms returned sat
[2020-05-12 03:16:59] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 23 ms returned sat
[2020-05-12 03:16:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:17:00] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 23 places in 326 ms
[2020-05-12 03:17:00] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-05-12 03:17:04] [INFO ] Deduced a trap composed of 13 places in 4103 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 22 places in 2493 ms
[2020-05-12 03:17:07] [INFO ] Deduced a trap composed of 12 places in 185 ms
[2020-05-12 03:17:11] [INFO ] Deduced a trap composed of 35 places in 3331 ms
[2020-05-12 03:17:12] [INFO ] Deduced a trap composed of 37 places in 1627 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 20 places in 1541 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 11 places in 403 ms
[2020-05-12 03:17:14] [INFO ] Deduced a trap composed of 17 places in 169 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 19 places in 166 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 25 places in 204 ms
[2020-05-12 03:17:15] [INFO ] Deduced a trap composed of 27 places in 203 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 25 places in 541 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 20 places in 382 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 23 places in 189 ms
[2020-05-12 03:17:16] [INFO ] Deduced a trap composed of 30 places in 206 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 16 places in 185 ms
[2020-05-12 03:17:17] [INFO ] Deduced a trap composed of 30 places in 184 ms
[2020-05-12 03:17:17] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 17176 ms
[2020-05-12 03:17:17] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 22 ms.
[2020-05-12 03:17:19] [INFO ] Added : 185 causal constraints over 37 iterations in 2003 ms. Result :(error "Failed to check-sat")
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2020-05-12 03:17:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 03:17:20] [INFO ] Flatten gal took : 249 ms
[2020-05-12 03:17:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-12 03:17:20] [INFO ] Flatten gal took : 65 ms
FORMULA BusinessProcesses-PT-11-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 03:17:20] [INFO ] Applying decomposition
[2020-05-12 03:17:20] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph13318953692585914560.txt, -o, /tmp/graph13318953692585914560.bin, -w, /tmp/graph13318953692585914560.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph13318953692585914560.bin, -l, -1, -v, -w, /tmp/graph13318953692585914560.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 03:17:21] [INFO ] Decomposing Gal with order
[2020-05-12 03:17:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:17:21] [INFO ] Removed a total of 259 redundant transitions.
[2020-05-12 03:17:21] [INFO ] Flatten gal took : 213 ms
[2020-05-12 03:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 33 ms.
[2020-05-12 03:17:21] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 49 ms
[2020-05-12 03:17:21] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLFireability.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLFireability.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLFireability.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLFireability.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
built 49 ordering constraints for composite.
built 16 ordering constraints for composite.
built 24 ordering constraints for composite.
built 24 ordering constraints for composite.
built 29 ordering constraints for composite.
built 26 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 20 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 24 ordering constraints for composite.
built 13 ordering constraints for composite.
built 25 ordering constraints for composite.
built 70 ordering constraints for composite.
built 87 ordering constraints for composite.
built 29 ordering constraints for composite.
built 20 ordering constraints for composite.
built 10 ordering constraints for composite.
built 37 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.18189e+22,3.91392,124616,8631,92,212933,881,1154,646779,82,2238,0
Converting to forward existential form...Done !
original formula: (!(AX(((i0.u15.p38==1)||(i12.u69.p182==1)))) * !(EF((i6.i0.i0.u49.p127==1))))
=> equivalent forward existential formula: ([(Init * !(EX(!(((i0.u15.p38==1)||(i12.u69.p182==1))))))] = FALSE * [(FwdU(Init,TRUE) * (i6.i0.i0.u49.p127==1))] = FALSE)
(forward)formula 0,0,3.93139,124616,1,0,212933,881,1160,646779,85,2238,2441
FORMULA BusinessProcesses-PT-11-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(AX((i10.u172.p446==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((i10.u172.p446==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t76, t78, t250, t264, t278, t290, t298, t310, t314, t328, t354, i0.t379, i0.t375, i0.t373, i0.t371, i0.t369, i0.t366, i0.t364, i1.t302, i1.t193, i1.u50.t313, i1.u52.t309, i1.u123.t194, i2.t282, i2.t169, i2.u61.t293, i2.u63.t289, i2.u136.t170, i3.t133, i3.u82.t253, i3.u85.t246, i3.u154.t134, i4.t153, i4.u144.t154, i5.t185, i5.t181, i5.t177, i5.t173, i5.u128.t186, i5.u130.t182, i5.u132.t178, i5.u134.t174, i6.i0.i0.t317, i6.i0.i0.u47.t319, i6.i0.i1.t197, i6.i0.i1.u121.t198, i6.i1.i1.t213, i6.i1.i1.u113.t214, i6.i1.i2.t209, i6.i1.i2.u115.t210, i6.i1.i3.t205, i6.i1.i3.u117.t206, i6.i1.i4.t201, i6.i1.i4.u119.t202, i6.i1.i5.t189, i6.i1.i5.u126.t190, i7.t358, i7.t233, i7.u10.t382, i7.u21.t361, i7.u103.t234, i8.t229, i8.t225, i8.u105.t230, i8.u108.t226, i9.t324, i9.t320, i9.u43.t327, i9.u45.t323, i9.u23.t357, i10.t335, i10.t333, i10.t331, i10.t240, i10.t221, i10.t217, i10.u100.t241, i10.u109.t222, i10.u25.t339, i10.u25.t343, i10.u25.t347, i10.u25.t353, i10.u111.t218, i11.t294, i11.u57.t301, i11.u59.t297, i12.t274, i12.t165, i12.t161, i12.u69.t281, i12.u71.t277, i12.u73.t271, i12.u137.t166, i12.u140.t162, i13.i0.i1.t149, i13.i0.i1.u145.t150, i13.i0.i2.t145, i13.i0.i2.u148.t146, i13.i0.i3.t137, i13.i0.i3.u151.t138, i13.i1.t254, i13.i1.i0.t260, i13.i1.i0.u75.t267, i13.i1.i0.u77.t263, i13.i1.i1.t257, i13.i1.i1.u79.t259, i13.i1.i2.t141, i13.i1.i2.u150.t142, i14.t127, i14.t120, i14.t115, i14.t113, i14.t108, i14.t106, i14.t104, i14.t101, i14.t73, i14.t70, i14.t67, i14.t65, i14.t62, i14.t59, i14.t57, i14.t55, i14.t53, i14.t50, i14.t47, i14.t37, i14.t34, i14.t31, i14.t28, i14.t25, i14.t22, i14.t20, i14.t17, i14.t14, i14.u162.t12, i14.u162.t44, i14.u162.t84, i14.u162.t88, i14.u162.t92, i14.u162.t98, i14.u162.t110, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/321/143/500
(forward)formula 1,0,11.3956,406212,1,0,600872,895,7040,2.76803e+06,381,2572,1687860
FORMULA BusinessProcesses-PT-11-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((i0.u19.p47==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i0.u19.p47==1))] != FALSE
(forward)formula 2,1,11.4039,406476,1,0,600876,895,7042,2.76921e+06,381,2572,1690132
FORMULA BusinessProcesses-PT-11-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(!(EF(((((i10.u40.p106==1)&&(i10.u111.p297==1))&&(i10.u171.p554==1))||(i7.u22.p54==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((i10.u40.p106==1)&&(i10.u111.p297==1))&&(i10.u171.p554==1))||(i7.u22.p54==1)))))] != FALSE
(forward)formula 3,0,22.2478,678956,1,0,1.00993e+06,1013,8123,4.39084e+06,408,2915,2518924
FORMULA BusinessProcesses-PT-11-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((((((i11.u58.p151==1)&&(i6.i1.i5.u126.p332==1))&&(i11.u189.p483==1))||(((i10.u26.p91==1)&&(i10.u100.p267==1))&&(i10.u214.p539==1)))||(((i10.u31.p82==1)&&(i10.u100.p267==1))&&(i10.u172.p448==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((((i11.u58.p151==1)&&(i6.i1.i5.u126.p332==1))&&(i11.u189.p483==1))||(((i10.u26.p91==1)&&(i10.u100.p267==1))&&(i10.u214.p539==1)))||(((i10.u31.p82==1)&&(i10.u100.p267==1))&&(i10.u172.p448==1))))] != FALSE
(forward)formula 4,1,22.2633,679748,1,0,1.00998e+06,1013,8169,4.39108e+06,409,2915,2524418
FORMULA BusinessProcesses-PT-11-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF((i11.u58.p152==1)) + EX((((i10.u26.p91==1)&&(i10.u100.p267==1))&&(i10.u214.p539==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (i11.u58.p152==1))] != FALSE + [(EY(Init) * (((i10.u26.p91==1)&&(i10.u100.p267==1))&&(i10.u214.p539==1)))] != FALSE)
(forward)formula 5,1,22.2778,680276,1,0,1.00999e+06,1013,8169,4.39127e+06,409,2915,2527301
FORMULA BusinessProcesses-PT-11-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG((!(AG((i6.i1.i3.u118.p313==1))) + (i0.u12.p33==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i0.u12.p33==1))) * !(E(TRUE U !((i6.i1.i3.u118.p313==1)))))] = FALSE
(forward)formula 6,1,23.0095,707996,1,0,1.04844e+06,1016,8178,4.57504e+06,410,2934,2632964
FORMULA BusinessProcesses-PT-11-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF(((((i1.u54.p137==1)&&(i1.u123.p327==1))&&(i14.u156.p408==1))||(((i10.u28.p75==1)&&(i10.u109.p292==1))&&(i10.u173.p451==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((i1.u54.p137==1)&&(i1.u123.p327==1))&&(i14.u156.p408==1))||(((i10.u28.p75==1)&&(i10.u109.p292==1))&&(i10.u173.p451==1))))] != FALSE
(forward)formula 7,1,23.0297,708524,1,0,1.04846e+06,1016,8204,4.57526e+06,410,2934,2637552
FORMULA BusinessProcesses-PT-11-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF((i5.u131.p348==1)) * EF(((i12.u3.p10==1)||(i8.u98.p260==1))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (i5.u131.p348==1))),TRUE) * ((i12.u3.p10==1)||(i8.u98.p260==1)))] != FALSE
(forward)formula 8,1,26.0893,818612,1,0,1.23578e+06,1285,9510,5.16256e+06,445,4070,3067015
FORMULA BusinessProcesses-PT-11-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AF((EF((i10.u218.p550==1)) + AG((i14.u162.p440==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (i10.u218.p550==1)) + !(E(TRUE U !((i14.u162.p440==1)))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 9,1,27.2311,833924,1,0,1.2557e+06,1288,9835,5.27223e+06,481,4094,3083463
FORMULA BusinessProcesses-PT-11-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(EF((((i13.i1.i1.u81.p217==1)&&(i13.i1.i2.u150.p392==1))&&(i13.i1.i1.u207.p520==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((i13.i1.i1.u81.p217==1)&&(i13.i1.i2.u150.p392==1))&&(i13.i1.i1.u207.p520==1)))] = FALSE
(forward)formula 10,0,27.232,834188,1,0,1.25571e+06,1288,9860,5.27223e+06,481,4094,3083576
FORMULA BusinessProcesses-PT-11-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 11,1,27.232,834188,1,0,1.25571e+06,1288,9860,5.27224e+06,481,4094,3083576
FORMULA BusinessProcesses-PT-11-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EX(EF((i5.u133.p353==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (i5.u133.p353==1)))))] = FALSE
(forward)formula 12,0,27.427,837884,1,0,1.2634e+06,1288,9862,5.27953e+06,481,4094,3110239
FORMULA BusinessProcesses-PT-11-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((i10.u39.p102==1))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (i10.u39.p102==1))] != FALSE
(forward)formula 13,1,27.4664,838148,1,0,1.26341e+06,1288,9864,5.27954e+06,481,4094,3111460
FORMULA BusinessProcesses-PT-11-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(((((i11.u60.p157!=1)||(i5.u130.p342!=1))||(i11.u191.p487!=1))&&((i10.u30.p79!=1)||(i10.u175.p455!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((i11.u60.p157!=1)||(i5.u130.p342!=1))||(i11.u191.p487!=1))&&((i10.u30.p79!=1)||(i10.u175.p455!=1)))))] = FALSE
(forward)formula 14,0,27.5644,839204,1,0,1.26635e+06,1288,9884,5.287e+06,482,4094,3117693
FORMULA BusinessProcesses-PT-11-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1589253470705
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="BusinessProcesses-PT-11"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;