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.r182-oct2-158987914000538.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 itslola
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 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.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 146K 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-12-00
FORMULA_NAME BusinessProcesses-PT-12-01
FORMULA_NAME BusinessProcesses-PT-12-02
FORMULA_NAME BusinessProcesses-PT-12-03
FORMULA_NAME BusinessProcesses-PT-12-04
FORMULA_NAME BusinessProcesses-PT-12-05
FORMULA_NAME BusinessProcesses-PT-12-06
FORMULA_NAME BusinessProcesses-PT-12-07
FORMULA_NAME BusinessProcesses-PT-12-08
FORMULA_NAME BusinessProcesses-PT-12-09
FORMULA_NAME BusinessProcesses-PT-12-10
FORMULA_NAME BusinessProcesses-PT-12-11
FORMULA_NAME BusinessProcesses-PT-12-12
FORMULA_NAME BusinessProcesses-PT-12-13
FORMULA_NAME BusinessProcesses-PT-12-14
FORMULA_NAME BusinessProcesses-PT-12-15

=== Now, execution of the tool begins

BK_START 1591162213457

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:30:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:30:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:30:15] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-06-03 05:30:15] [INFO ] Transformed 586 places.
[2020-06-03 05:30:15] [INFO ] Transformed 525 transitions.
[2020-06-03 05:30:15] [INFO ] Found NUPN structural information;
[2020-06-03 05:30:15] [INFO ] Parsed PT model containing 586 places and 525 transitions in 110 ms.
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 735 resets, run finished after 278 ms. (steps per millisecond=359 ) properties seen :[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 521 rows 582 cols
[2020-06-03 05:30:16] [INFO ] Computed 98 place invariants in 54 ms
[2020-06-03 05:30:16] [INFO ] [Real]Absence check using 55 positive place invariants in 118 ms returned sat
[2020-06-03 05:30:16] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 28 ms returned sat
[2020-06-03 05:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:30:17] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2020-06-03 05:30:17] [INFO ] Deduced a trap composed of 20 places in 256 ms
[2020-06-03 05:30:18] [INFO ] Deduced a trap composed of 129 places in 371 ms
[2020-06-03 05:30:18] [INFO ] Deduced a trap composed of 122 places in 281 ms
[2020-06-03 05:30:18] [INFO ] Deduced a trap composed of 15 places in 164 ms
[2020-06-03 05:30:22] [INFO ] Deduced a trap composed of 22 places in 3163 ms
[2020-06-03 05:30:24] [INFO ] Deduced a trap composed of 114 places in 2708 ms
[2020-06-03 05:30:25] [INFO ] Deduced a trap composed of 20 places in 1043 ms
[2020-06-03 05:30:26] [INFO ] Deduced a trap composed of 23 places in 178 ms
[2020-06-03 05:30:26] [INFO ] Deduced a trap composed of 47 places in 188 ms
[2020-06-03 05:30:26] [INFO ] Deduced a trap composed of 16 places in 258 ms
[2020-06-03 05:30:26] [INFO ] Deduced a trap composed of 46 places in 233 ms
[2020-06-03 05:30:27] [INFO ] Deduced a trap composed of 25 places in 182 ms
[2020-06-03 05:30:27] [INFO ] Deduced a trap composed of 32 places in 166 ms
[2020-06-03 05:30:27] [INFO ] Deduced a trap composed of 22 places in 155 ms
[2020-06-03 05:30:27] [INFO ] Deduced a trap composed of 123 places in 214 ms
[2020-06-03 05:30:27] [INFO ] Deduced a trap composed of 123 places in 163 ms
[2020-06-03 05:30:28] [INFO ] Deduced a trap composed of 22 places in 178 ms
[2020-06-03 05:30:28] [INFO ] Deduced a trap composed of 35 places in 150 ms
[2020-06-03 05:30:28] [INFO ] Deduced a trap composed of 119 places in 161 ms
[2020-06-03 05:30:28] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-06-03 05:30:28] [INFO ] Deduced a trap composed of 123 places in 159 ms
[2020-06-03 05:30:29] [INFO ] Deduced a trap composed of 25 places in 138 ms
[2020-06-03 05:30:29] [INFO ] Deduced a trap composed of 125 places in 193 ms
[2020-06-03 05:30:29] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2020-06-03 05:30:29] [INFO ] Deduced a trap composed of 40 places in 137 ms
[2020-06-03 05:30:29] [INFO ] Deduced a trap composed of 126 places in 174 ms
[2020-06-03 05:30:30] [INFO ] Deduced a trap composed of 134 places in 308 ms
[2020-06-03 05:30:30] [INFO ] Deduced a trap composed of 124 places in 150 ms
[2020-06-03 05:30:30] [INFO ] Deduced a trap composed of 28 places in 199 ms
[2020-06-03 05:30:30] [INFO ] Deduced a trap composed of 125 places in 157 ms
[2020-06-03 05:30:30] [INFO ] Deduced a trap composed of 43 places in 158 ms
[2020-06-03 05:30:31] [INFO ] Deduced a trap composed of 30 places in 154 ms
[2020-06-03 05:30:31] [INFO ] Deduced a trap composed of 46 places in 179 ms
[2020-06-03 05:30:31] [INFO ] Deduced a trap composed of 122 places in 163 ms
[2020-06-03 05:30:31] [INFO ] Deduced a trap composed of 121 places in 152 ms
[2020-06-03 05:30:31] [INFO ] Deduced a trap composed of 123 places in 144 ms
[2020-06-03 05:30:32] [INFO ] Deduced a trap composed of 44 places in 142 ms
[2020-06-03 05:30:32] [INFO ] Deduced a trap composed of 125 places in 155 ms
[2020-06-03 05:30:32] [INFO ] Deduced a trap composed of 135 places in 183 ms
[2020-06-03 05:30:32] [INFO ] Deduced a trap composed of 117 places in 167 ms
[2020-06-03 05:30:33] [INFO ] Deduced a trap composed of 32 places in 446 ms
[2020-06-03 05:30:33] [INFO ] Deduced a trap composed of 32 places in 146 ms
[2020-06-03 05:30:34] [INFO ] Deduced a trap composed of 129 places in 780 ms
[2020-06-03 05:30:34] [INFO ] Deduced a trap composed of 140 places in 192 ms
[2020-06-03 05:30:34] [INFO ] Deduced a trap composed of 36 places in 194 ms
[2020-06-03 05:30:34] [INFO ] Deduced a trap composed of 27 places in 114 ms
[2020-06-03 05:30:34] [INFO ] Deduced a trap composed of 30 places in 113 ms
[2020-06-03 05:30:34] [INFO ] Deduced a trap composed of 122 places in 134 ms
[2020-06-03 05:30:35] [INFO ] Deduced a trap composed of 125 places in 123 ms
[2020-06-03 05:30:35] [INFO ] Deduced a trap composed of 26 places in 117 ms
[2020-06-03 05:30:35] [INFO ] Deduced a trap composed of 125 places in 130 ms
[2020-06-03 05:30:35] [INFO ] Deduced a trap composed of 31 places in 122 ms
[2020-06-03 05:30:35] [INFO ] Deduced a trap composed of 46 places in 117 ms
[2020-06-03 05:30:35] [INFO ] Deduced a trap composed of 34 places in 119 ms
[2020-06-03 05:30:36] [INFO ] Deduced a trap composed of 147 places in 392 ms
[2020-06-03 05:30:36] [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 s18 s19 s20 s21 s27 s28 s31 s32 s69 s72 s73 s77 s78 s79 s80 s81 s82 s83 s84 s85 s87 s88 s99 s100 s101 s114 s134 s135 s159 s160 s161 s191 s192 s193 s215 s216 s217 s223 s224 s279 s304 s308 s309 s310 s318 s319 s320 s323 s324 s325 s329 s334 s344 s349 s374 s379 s389 s399 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s430 s431 s437 s438 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s454 s458 s469 s488 s489 s490 s491 s492 s493 s494 s495 s496 s497 s502 s503 s506 s507 s508 s509 s510 s511 s512 s515 s516 s517 s518 s521 s522 s525 s526 s531 s532 s539 s540 s543 s551 s563 s579 s580 s581) 0)") while checking expression at index 0
[2020-06-03 05:30:36] [INFO ] [Real]Absence check using 55 positive place invariants in 39 ms returned sat
[2020-06-03 05:30:36] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:30:37] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2020-06-03 05:30:38] [INFO ] Deduced a trap composed of 13 places in 1284 ms
[2020-06-03 05:30:38] [INFO ] Deduced a trap composed of 16 places in 161 ms
[2020-06-03 05:30:38] [INFO ] Deduced a trap composed of 13 places in 171 ms
[2020-06-03 05:30:38] [INFO ] Deduced a trap composed of 12 places in 147 ms
[2020-06-03 05:30:40] [INFO ] Deduced a trap composed of 11 places in 1179 ms
[2020-06-03 05:30:40] [INFO ] Deduced a trap composed of 17 places in 166 ms
[2020-06-03 05:30:40] [INFO ] Deduced a trap composed of 19 places in 135 ms
[2020-06-03 05:30:40] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2020-06-03 05:30:40] [INFO ] Deduced a trap composed of 22 places in 148 ms
[2020-06-03 05:30:41] [INFO ] Deduced a trap composed of 20 places in 206 ms
[2020-06-03 05:30:41] [INFO ] Deduced a trap composed of 112 places in 171 ms
[2020-06-03 05:30:41] [INFO ] Deduced a trap composed of 119 places in 155 ms
[2020-06-03 05:30:41] [INFO ] Deduced a trap composed of 19 places in 153 ms
[2020-06-03 05:30:41] [INFO ] Deduced a trap composed of 114 places in 140 ms
[2020-06-03 05:30:42] [INFO ] Deduced a trap composed of 26 places in 133 ms
[2020-06-03 05:30:42] [INFO ] Deduced a trap composed of 126 places in 178 ms
[2020-06-03 05:30:42] [INFO ] Deduced a trap composed of 36 places in 165 ms
[2020-06-03 05:30:42] [INFO ] Deduced a trap composed of 26 places in 453 ms
[2020-06-03 05:30:43] [INFO ] Deduced a trap composed of 27 places in 279 ms
[2020-06-03 05:30:43] [INFO ] Deduced a trap composed of 38 places in 168 ms
[2020-06-03 05:30:43] [INFO ] Deduced a trap composed of 44 places in 244 ms
[2020-06-03 05:30:43] [INFO ] Deduced a trap composed of 31 places in 202 ms
[2020-06-03 05:30:44] [INFO ] Deduced a trap composed of 120 places in 757 ms
[2020-06-03 05:30:45] [INFO ] Deduced a trap composed of 119 places in 1191 ms
[2020-06-03 05:30:46] [INFO ] Deduced a trap composed of 40 places in 151 ms
[2020-06-03 05:30:46] [INFO ] Deduced a trap composed of 38 places in 359 ms
[2020-06-03 05:30:46] [INFO ] Deduced a trap composed of 24 places in 174 ms
[2020-06-03 05:30:46] [INFO ] Deduced a trap composed of 48 places in 258 ms
[2020-06-03 05:30:47] [INFO ] Deduced a trap composed of 130 places in 295 ms
[2020-06-03 05:30:47] [INFO ] Deduced a trap composed of 24 places in 287 ms
[2020-06-03 05:30:47] [INFO ] Deduced a trap composed of 35 places in 259 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 145 places in 511 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 138 places in 122 ms
[2020-06-03 05:30:48] [INFO ] Deduced a trap composed of 128 places in 118 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 130 places in 725 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 139 places in 125 ms
[2020-06-03 05:30:49] [INFO ] Deduced a trap composed of 140 places in 252 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 130 places in 124 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 139 places in 139 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 125 places in 248 ms
[2020-06-03 05:30:50] [INFO ] Deduced a trap composed of 133 places in 305 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 133 places in 149 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 128 places in 220 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 142 places in 121 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 131 places in 130 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 132 places in 114 ms
[2020-06-03 05:30:51] [INFO ] Deduced a trap composed of 127 places in 134 ms
[2020-06-03 05:30:52] [INFO ] Deduced a trap composed of 141 places in 116 ms
[2020-06-03 05:30:52] [INFO ] Deduced a trap composed of 142 places in 129 ms
[2020-06-03 05:30:52] [INFO ] Deduced a trap composed of 125 places in 175 ms
[2020-06-03 05:30:52] [INFO ] Deduced a trap composed of 124 places in 436 ms
[2020-06-03 05:30:53] [INFO ] Deduced a trap composed of 130 places in 191 ms
[2020-06-03 05:30:53] [INFO ] Deduced a trap composed of 127 places in 158 ms
[2020-06-03 05:30:53] [INFO ] Deduced a trap composed of 121 places in 239 ms
[2020-06-03 05:30:53] [INFO ] Deduced a trap composed of 128 places in 149 ms
[2020-06-03 05:30:54] [INFO ] Deduced a trap composed of 127 places in 191 ms
[2020-06-03 05:30:54] [INFO ] Deduced a trap composed of 131 places in 170 ms
[2020-06-03 05:30:54] [INFO ] Deduced a trap composed of 123 places in 324 ms
[2020-06-03 05:30:54] [INFO ] Deduced a trap composed of 145 places in 261 ms
[2020-06-03 05:30:55] [INFO ] Deduced a trap composed of 154 places in 136 ms
[2020-06-03 05:30:55] [INFO ] Deduced a trap composed of 129 places in 214 ms
[2020-06-03 05:30:55] [INFO ] Deduced a trap composed of 135 places in 122 ms
[2020-06-03 05:30:55] [INFO ] Deduced a trap composed of 138 places in 191 ms
[2020-06-03 05:30:55] [INFO ] Deduced a trap composed of 136 places in 123 ms
[2020-06-03 05:30:56] [INFO ] Deduced a trap composed of 123 places in 315 ms
[2020-06-03 05:30:56] [INFO ] Deduced a trap composed of 118 places in 224 ms
[2020-06-03 05:30:56] [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 s27 s28 s31 s32 s73 s75 s80 s83 s87 s88 s102 s108 s120 s121 s122 s134 s135 s145 s148 s149 s151 s152 s171 s172 s173 s176 s177 s185 s223 s224 s236 s239 s270 s275 s284 s289 s299 s304 s314 s319 s323 s324 s325 s329 s334 s339 s344 s364 s369 s374 s379 s384 s394 s399 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s435 s436 s437 s438 s439 s440 s441 s442 s443 s444 s447 s448 s449 s450 s451 s452 s454 s460 s469 s488 s489 s494 s495 s498 s499 s500 s501 s502 s503 s513 s514 s517 s518 s521 s522 s525 s526 s527 s528 s529 s530 s537 s538 s539 s540 s541 s542 s543 s551 s569) 0)") while checking expression at index 1
[2020-06-03 05:30:56] [INFO ] [Real]Absence check using 55 positive place invariants in 81 ms returned sat
[2020-06-03 05:30:56] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-06-03 05:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:30:57] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2020-06-03 05:30:57] [INFO ] Deduced a trap composed of 11 places in 398 ms
[2020-06-03 05:30:57] [INFO ] Deduced a trap composed of 16 places in 168 ms
[2020-06-03 05:30:58] [INFO ] Deduced a trap composed of 124 places in 470 ms
[2020-06-03 05:30:58] [INFO ] Deduced a trap composed of 18 places in 259 ms
[2020-06-03 05:30:58] [INFO ] Deduced a trap composed of 25 places in 161 ms
[2020-06-03 05:30:58] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-06-03 05:30:59] [INFO ] Deduced a trap composed of 28 places in 158 ms
[2020-06-03 05:30:59] [INFO ] Deduced a trap composed of 45 places in 173 ms
[2020-06-03 05:30:59] [INFO ] Deduced a trap composed of 40 places in 177 ms
[2020-06-03 05:30:59] [INFO ] Deduced a trap composed of 109 places in 300 ms
[2020-06-03 05:31:00] [INFO ] Deduced a trap composed of 20 places in 473 ms
[2020-06-03 05:31:00] [INFO ] Deduced a trap composed of 26 places in 283 ms
[2020-06-03 05:31:00] [INFO ] Deduced a trap composed of 134 places in 147 ms
[2020-06-03 05:31:00] [INFO ] Deduced a trap composed of 114 places in 149 ms
[2020-06-03 05:31:01] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-06-03 05:31:01] [INFO ] Deduced a trap composed of 28 places in 220 ms
[2020-06-03 05:31:01] [INFO ] Deduced a trap composed of 26 places in 361 ms
[2020-06-03 05:31:02] [INFO ] Deduced a trap composed of 122 places in 508 ms
[2020-06-03 05:31:02] [INFO ] Deduced a trap composed of 17 places in 154 ms
[2020-06-03 05:31:02] [INFO ] Deduced a trap composed of 20 places in 383 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 29 places in 329 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 114 places in 258 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 28 places in 142 ms
[2020-06-03 05:31:03] [INFO ] Deduced a trap composed of 27 places in 135 ms
[2020-06-03 05:31:04] [INFO ] Deduced a trap composed of 110 places in 135 ms
[2020-06-03 05:31:04] [INFO ] Deduced a trap composed of 31 places in 127 ms
[2020-06-03 05:31:04] [INFO ] Deduced a trap composed of 32 places in 253 ms
[2020-06-03 05:31:04] [INFO ] Deduced a trap composed of 26 places in 215 ms
[2020-06-03 05:31:04] [INFO ] Deduced a trap composed of 21 places in 253 ms
[2020-06-03 05:31:05] [INFO ] Deduced a trap composed of 114 places in 179 ms
[2020-06-03 05:31:05] [INFO ] Deduced a trap composed of 20 places in 231 ms
[2020-06-03 05:31:05] [INFO ] Deduced a trap composed of 37 places in 306 ms
[2020-06-03 05:31:05] [INFO ] Deduced a trap composed of 127 places in 163 ms
[2020-06-03 05:31:06] [INFO ] Deduced a trap composed of 117 places in 133 ms
[2020-06-03 05:31:06] [INFO ] Deduced a trap composed of 114 places in 127 ms
[2020-06-03 05:31:06] [INFO ] Deduced a trap composed of 27 places in 266 ms
[2020-06-03 05:31:06] [INFO ] Deduced a trap composed of 106 places in 140 ms
[2020-06-03 05:31:06] [INFO ] Deduced a trap composed of 102 places in 119 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 107 places in 145 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 107 places in 149 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 110 places in 138 ms
[2020-06-03 05:31:07] [INFO ] Deduced a trap composed of 28 places in 338 ms
[2020-06-03 05:31:08] [INFO ] Deduced a trap composed of 15 places in 298 ms
[2020-06-03 05:31:08] [INFO ] Deduced a trap composed of 111 places in 271 ms
[2020-06-03 05:31:08] [INFO ] Deduced a trap composed of 115 places in 179 ms
[2020-06-03 05:31:08] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2020-06-03 05:31:08] [INFO ] Deduced a trap composed of 26 places in 131 ms
[2020-06-03 05:31:09] [INFO ] Deduced a trap composed of 31 places in 145 ms
[2020-06-03 05:31:09] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-06-03 05:31:09] [INFO ] Deduced a trap composed of 33 places in 402 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 26 places in 290 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 123 places in 472 ms
[2020-06-03 05:31:10] [INFO ] Deduced a trap composed of 25 places in 356 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 129 places in 131 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 21 places in 306 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 126 places in 158 ms
[2020-06-03 05:31:11] [INFO ] Deduced a trap composed of 125 places in 337 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 127 places in 133 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 118 places in 271 ms
[2020-06-03 05:31:12] [INFO ] Deduced a trap composed of 31 places in 342 ms
[2020-06-03 05:31:13] [INFO ] Deduced a trap composed of 33 places in 562 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 26 places in 646 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 126 places in 142 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 132 places in 230 ms
[2020-06-03 05:31:14] [INFO ] Deduced a trap composed of 33 places in 145 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 140 places in 198 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 135 places in 478 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 133 places in 138 ms
[2020-06-03 05:31:15] [INFO ] Deduced a trap composed of 26 places in 198 ms
[2020-06-03 05:31:16] [INFO ] Deduced a trap composed of 136 places in 127 ms
[2020-06-03 05:31:16] [INFO ] Deduced a trap composed of 139 places in 253 ms
[2020-06-03 05:31:16] [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 s36 s37 s38 s66 s67 s68 s139 s140 s141 s159 s160 s161 s165 s166 s167 s171 s172 s173 s191 s192 s193 s215 s216 s217 s218 s219 s220 s294 s299 s308 s310 s318 s320 s328 s330 s334 s338 s339 s340 s344 s349 s364 s379 s388 s390 s404 s409 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s428 s429 s430 s431 s432 s433 s434 s435 s436 s439 s440 s441 s442 s443 s444 s445 s446 s447 s448 s453 s454 s456 s457 s458 s460 s461 s462 s463 s466 s467 s468 s469 s470 s471 s476 s477 s478 s479 s480 s481 s486 s487 s492 s493 s494 s495 s509 s510 s511 s512 s519 s520 s521 s522 s525 s526 s527 s528 s533 s534 s535 s536 s539 s540 s543 s551 s552 s553 s557 s563 s564 s565 s566 s579) 0)") while checking expression at index 2
[2020-06-03 05:31:16] [INFO ] [Real]Absence check using 55 positive place invariants in 210 ms returned sat
[2020-06-03 05:31:16] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 107 ms returned sat
[2020-06-03 05:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:17] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2020-06-03 05:31:17] [INFO ] Deduced a trap composed of 13 places in 148 ms
[2020-06-03 05:31:18] [INFO ] Deduced a trap composed of 26 places in 408 ms
[2020-06-03 05:31:19] [INFO ] Deduced a trap composed of 19 places in 743 ms
[2020-06-03 05:31:19] [INFO ] Deduced a trap composed of 117 places in 289 ms
[2020-06-03 05:31:19] [INFO ] Deduced a trap composed of 22 places in 313 ms
[2020-06-03 05:31:21] [INFO ] Deduced a trap composed of 30 places in 1264 ms
[2020-06-03 05:31:28] [INFO ] Deduced a trap composed of 127 places in 6895 ms
[2020-06-03 05:31:28] [INFO ] Deduced a trap composed of 18 places in 147 ms
[2020-06-03 05:31:28] [INFO ] Deduced a trap composed of 21 places in 138 ms
[2020-06-03 05:31:28] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2020-06-03 05:31:28] [INFO ] Deduced a trap composed of 22 places in 202 ms
[2020-06-03 05:31:28] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-06-03 05:31:29] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2020-06-03 05:31:29] [INFO ] Deduced a trap composed of 27 places in 148 ms
[2020-06-03 05:31:29] [INFO ] Deduced a trap composed of 17 places in 141 ms
[2020-06-03 05:31:29] [INFO ] Deduced a trap composed of 125 places in 124 ms
[2020-06-03 05:31:33] [INFO ] Deduced a trap composed of 128 places in 3441 ms
[2020-06-03 05:31:33] [INFO ] Deduced a trap composed of 20 places in 133 ms
[2020-06-03 05:31:33] [INFO ] Deduced a trap composed of 128 places in 124 ms
[2020-06-03 05:31:33] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-06-03 05:31:35] [INFO ] Deduced a trap composed of 21 places in 2191 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 31 places in 287 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 122 places in 167 ms
[2020-06-03 05:31:36] [INFO ] Deduced a trap composed of 38 places in 299 ms
[2020-06-03 05:31:36] [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 s228 s229 s230 s240 s270 s368 s369 s370 s374 s379 s383 s384 s385 s389 s394 s399 s404 s407 s409 s410 s411 s428 s429 s432 s513 s514 s517 s518 s521 s522 s525 s526 s529 s530 s535 s536) 0)") while checking expression at index 3
[2020-06-03 05:31:36] [INFO ] [Real]Absence check using 55 positive place invariants in 282 ms returned sat
[2020-06-03 05:31:36] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2020-06-03 05:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:37] [INFO ] [Real]Absence check using state equation in 476 ms returned unsat
[2020-06-03 05:31:37] [INFO ] [Real]Absence check using 55 positive place invariants in 35 ms returned sat
[2020-06-03 05:31:37] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:38] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2020-06-03 05:31:38] [INFO ] Deduced a trap composed of 20 places in 144 ms
[2020-06-03 05:31:38] [INFO ] Deduced a trap composed of 21 places in 431 ms
[2020-06-03 05:31:39] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2020-06-03 05:31:41] [INFO ] Deduced a trap composed of 29 places in 2103 ms
[2020-06-03 05:31:42] [INFO ] Deduced a trap composed of 36 places in 854 ms
[2020-06-03 05:31:42] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-06-03 05:31:42] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2020-06-03 05:31:42] [INFO ] Deduced a trap composed of 32 places in 85 ms
[2020-06-03 05:31:42] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-06-03 05:31:43] [INFO ] Deduced a trap composed of 26 places in 1015 ms
[2020-06-03 05:31:43] [INFO ] Deduced a trap composed of 34 places in 91 ms
[2020-06-03 05:31:43] [INFO ] Deduced a trap composed of 23 places in 99 ms
[2020-06-03 05:31:43] [INFO ] Deduced a trap composed of 28 places in 89 ms
[2020-06-03 05:31:45] [INFO ] Deduced a trap composed of 34 places in 1897 ms
[2020-06-03 05:31:47] [INFO ] Deduced a trap composed of 42 places in 1319 ms
[2020-06-03 05:31:47] [INFO ] Deduced a trap composed of 30 places in 173 ms
[2020-06-03 05:31:48] [INFO ] Deduced a trap composed of 28 places in 728 ms
[2020-06-03 05:31:49] [INFO ] Deduced a trap composed of 42 places in 1620 ms
[2020-06-03 05:31:49] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2020-06-03 05:31:49] [INFO ] Deduced a trap composed of 32 places in 79 ms
[2020-06-03 05:31:50] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-06-03 05:31:50] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 11839 ms
[2020-06-03 05:31:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:31:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 86 ms returned sat
[2020-06-03 05:31:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 45 ms returned sat
[2020-06-03 05:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:51] [INFO ] [Nat]Absence check using state equation in 1524 ms returned sat
[2020-06-03 05:31:52] [INFO ] Deduced a trap composed of 22 places in 482 ms
[2020-06-03 05:31:52] [INFO ] Deduced a trap composed of 17 places in 328 ms
[2020-06-03 05:31:53] [INFO ] Deduced a trap composed of 22 places in 594 ms
[2020-06-03 05:31:53] [INFO ] Deduced a trap composed of 29 places in 124 ms
[2020-06-03 05:31:53] [INFO ] Deduced a trap composed of 25 places in 306 ms
[2020-06-03 05:31:54] [INFO ] Deduced a trap composed of 128 places in 339 ms
[2020-06-03 05:31:54] [INFO ] Deduced a trap composed of 20 places in 300 ms
[2020-06-03 05:31:54] [INFO ] Deduced a trap composed of 29 places in 131 ms
[2020-06-03 05:31:54] [INFO ] Deduced a trap composed of 30 places in 80 ms
[2020-06-03 05:31:54] [INFO ] Deduced a trap composed of 38 places in 144 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 34 places in 192 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 40 places in 77 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 37 places in 86 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 24 places in 76 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 40 places in 62 ms
[2020-06-03 05:31:55] [INFO ] Deduced a trap composed of 43 places in 143 ms
[2020-06-03 05:31:56] [INFO ] Deduced a trap composed of 37 places in 375 ms
[2020-06-03 05:31:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4505 ms
[2020-06-03 05:31:56] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 55 ms.
[2020-06-03 05:31:58] [INFO ] Added : 262 causal constraints over 54 iterations in 2437 ms. Result :sat
[2020-06-03 05:31:59] [INFO ] [Real]Absence check using 55 positive place invariants in 185 ms returned sat
[2020-06-03 05:31:59] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 35 ms returned sat
[2020-06-03 05:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:31:59] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2020-06-03 05:32:00] [INFO ] Deduced a trap composed of 117 places in 348 ms
[2020-06-03 05:32:00] [INFO ] Deduced a trap composed of 13 places in 437 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 12 places in 484 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 39 places in 99 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 15 places in 96 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 28 places in 295 ms
[2020-06-03 05:32:01] [INFO ] Deduced a trap composed of 24 places in 96 ms
[2020-06-03 05:32:02] [INFO ] Deduced a trap composed of 21 places in 101 ms
[2020-06-03 05:32:02] [INFO ] Deduced a trap composed of 25 places in 95 ms
[2020-06-03 05:32:02] [INFO ] Deduced a trap composed of 21 places in 94 ms
[2020-06-03 05:32:02] [INFO ] Deduced a trap composed of 26 places in 143 ms
[2020-06-03 05:32:02] [INFO ] Deduced a trap composed of 25 places in 194 ms
[2020-06-03 05:32:02] [INFO ] Deduced a trap composed of 30 places in 187 ms
[2020-06-03 05:32:03] [INFO ] Deduced a trap composed of 22 places in 699 ms
[2020-06-03 05:32:03] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-03 05:32:05] [INFO ] Deduced a trap composed of 29 places in 1375 ms
[2020-06-03 05:32:05] [INFO ] Deduced a trap composed of 32 places in 82 ms
[2020-06-03 05:32:05] [INFO ] Deduced a trap composed of 32 places in 186 ms
[2020-06-03 05:32:06] [INFO ] Deduced a trap composed of 30 places in 526 ms
[2020-06-03 05:32:06] [INFO ] Deduced a trap composed of 115 places in 126 ms
[2020-06-03 05:32:06] [INFO ] Deduced a trap composed of 119 places in 287 ms
[2020-06-03 05:32:06] [INFO ] Deduced a trap composed of 43 places in 135 ms
[2020-06-03 05:32:07] [INFO ] Deduced a trap composed of 27 places in 334 ms
[2020-06-03 05:32:07] [INFO ] Deduced a trap composed of 39 places in 115 ms
[2020-06-03 05:32:07] [INFO ] Deduced a trap composed of 32 places in 206 ms
[2020-06-03 05:32:07] [INFO ] Deduced a trap composed of 20 places in 122 ms
[2020-06-03 05:32:07] [INFO ] Deduced a trap composed of 32 places in 151 ms
[2020-06-03 05:32:07] [INFO ] Deduced a trap composed of 24 places in 144 ms
[2020-06-03 05:32:08] [INFO ] Deduced a trap composed of 25 places in 148 ms
[2020-06-03 05:32:08] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-06-03 05:32:08] [INFO ] Deduced a trap composed of 21 places in 506 ms
[2020-06-03 05:32:08] [INFO ] Deduced a trap composed of 47 places in 104 ms
[2020-06-03 05:32:09] [INFO ] Deduced a trap composed of 41 places in 115 ms
[2020-06-03 05:32:09] [INFO ] Deduced a trap composed of 48 places in 72 ms
[2020-06-03 05:32:09] [INFO ] Deduced a trap composed of 52 places in 159 ms
[2020-06-03 05:32:09] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9535 ms
[2020-06-03 05:32:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:32:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 165 ms returned sat
[2020-06-03 05:32:09] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 26 ms returned sat
[2020-06-03 05:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:10] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2020-06-03 05:32:10] [INFO ] Deduced a trap composed of 12 places in 233 ms
[2020-06-03 05:32:10] [INFO ] Deduced a trap composed of 22 places in 180 ms
[2020-06-03 05:32:10] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-06-03 05:32:11] [INFO ] Deduced a trap composed of 21 places in 511 ms
[2020-06-03 05:32:11] [INFO ] Deduced a trap composed of 24 places in 140 ms
[2020-06-03 05:32:11] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2020-06-03 05:32:11] [INFO ] Deduced a trap composed of 21 places in 83 ms
[2020-06-03 05:32:12] [INFO ] Deduced a trap composed of 24 places in 207 ms
[2020-06-03 05:32:13] [INFO ] Deduced a trap composed of 24 places in 1646 ms
[2020-06-03 05:32:14] [INFO ] Deduced a trap composed of 32 places in 302 ms
[2020-06-03 05:32:14] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 05:32:14] [INFO ] Deduced a trap composed of 36 places in 436 ms
[2020-06-03 05:32:14] [INFO ] Deduced a trap composed of 46 places in 124 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 31 places in 116 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 43 places in 118 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 30 places in 110 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 26 places in 150 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 23 places in 82 ms
[2020-06-03 05:32:15] [INFO ] Deduced a trap composed of 33 places in 180 ms
[2020-06-03 05:32:16] [INFO ] Deduced a trap composed of 25 places in 113 ms
[2020-06-03 05:32:16] [INFO ] Deduced a trap composed of 29 places in 86 ms
[2020-06-03 05:32:16] [INFO ] Deduced a trap composed of 30 places in 90 ms
[2020-06-03 05:32:16] [INFO ] Deduced a trap composed of 32 places in 97 ms
[2020-06-03 05:32:16] [INFO ] Deduced a trap composed of 61 places in 86 ms
[2020-06-03 05:32:17] [INFO ] Deduced a trap composed of 81 places in 758 ms
[2020-06-03 05:32:17] [INFO ] Deduced a trap composed of 82 places in 152 ms
[2020-06-03 05:32:17] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7236 ms
[2020-06-03 05:32:17] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 39 ms.
[2020-06-03 05:32:21] [INFO ] Added : 352 causal constraints over 71 iterations in 4022 ms. Result :sat
[2020-06-03 05:32:21] [INFO ] Deduced a trap composed of 44 places in 70 ms
[2020-06-03 05:32:21] [INFO ] Deduced a trap composed of 43 places in 86 ms
[2020-06-03 05:32:21] [INFO ] Deduced a trap composed of 42 places in 55 ms
[2020-06-03 05:32:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2020-06-03 05:32:22] [INFO ] [Real]Absence check using 55 positive place invariants in 53 ms returned sat
[2020-06-03 05:32:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 39 ms returned sat
[2020-06-03 05:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:23] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2020-06-03 05:32:25] [INFO ] Deduced a trap composed of 15 places in 1641 ms
[2020-06-03 05:32:26] [INFO ] Deduced a trap composed of 18 places in 1502 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 12 places in 92 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 22 places in 304 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-06-03 05:32:27] [INFO ] Deduced a trap composed of 24 places in 132 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 22 places in 93 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 13 places in 100 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 36 places in 91 ms
[2020-06-03 05:32:28] [INFO ] Deduced a trap composed of 30 places in 73 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 39 places in 71 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 32 places in 66 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 45 places in 51 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 35 places in 48 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 25 places in 195 ms
[2020-06-03 05:32:29] [INFO ] Deduced a trap composed of 21 places in 229 ms
[2020-06-03 05:32:30] [INFO ] Deduced a trap composed of 64 places in 176 ms
[2020-06-03 05:32:30] [INFO ] Deduced a trap composed of 68 places in 193 ms
[2020-06-03 05:32:30] [INFO ] Deduced a trap composed of 32 places in 84 ms
[2020-06-03 05:32:30] [INFO ] Deduced a trap composed of 30 places in 73 ms
[2020-06-03 05:32:30] [INFO ] Deduced a trap composed of 28 places in 36 ms
[2020-06-03 05:32:30] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6992 ms
[2020-06-03 05:32:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:32:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 88 ms returned sat
[2020-06-03 05:32:31] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 172 ms returned sat
[2020-06-03 05:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:32] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2020-06-03 05:32:32] [INFO ] Deduced a trap composed of 19 places in 175 ms
[2020-06-03 05:32:34] [INFO ] Deduced a trap composed of 13 places in 1579 ms
[2020-06-03 05:32:34] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2020-06-03 05:32:35] [INFO ] Deduced a trap composed of 24 places in 306 ms
[2020-06-03 05:32:36] [INFO ] Deduced a trap composed of 111 places in 1475 ms
[2020-06-03 05:32:36] [INFO ] Deduced a trap composed of 21 places in 218 ms
[2020-06-03 05:32:36] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 12 places in 165 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 103 places in 167 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 34 places in 141 ms
[2020-06-03 05:32:37] [INFO ] Deduced a trap composed of 25 places in 272 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 22 places in 156 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 21 places in 281 ms
[2020-06-03 05:32:38] [INFO ] Deduced a trap composed of 19 places in 367 ms
[2020-06-03 05:32:39] [INFO ] Deduced a trap composed of 34 places in 290 ms
[2020-06-03 05:32:39] [INFO ] Deduced a trap composed of 33 places in 521 ms
[2020-06-03 05:32:40] [INFO ] Deduced a trap composed of 28 places in 507 ms
[2020-06-03 05:32:40] [INFO ] Deduced a trap composed of 43 places in 327 ms
[2020-06-03 05:32:40] [INFO ] Deduced a trap composed of 32 places in 274 ms
[2020-06-03 05:32:41] [INFO ] Deduced a trap composed of 28 places in 286 ms
[2020-06-03 05:32:41] [INFO ] Deduced a trap composed of 107 places in 147 ms
[2020-06-03 05:32:41] [INFO ] Deduced a trap composed of 43 places in 296 ms
[2020-06-03 05:32:41] [INFO ] Deduced a trap composed of 100 places in 266 ms
[2020-06-03 05:32:42] [INFO ] Deduced a trap composed of 43 places in 450 ms
[2020-06-03 05:32:42] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-06-03 05:32:42] [INFO ] Deduced a trap composed of 24 places in 287 ms
[2020-06-03 05:32:43] [INFO ] Deduced a trap composed of 35 places in 393 ms
[2020-06-03 05:32:43] [INFO ] Deduced a trap composed of 35 places in 143 ms
[2020-06-03 05:32:44] [INFO ] Deduced a trap composed of 28 places in 1194 ms
[2020-06-03 05:32:44] [INFO ] Deduced a trap composed of 33 places in 248 ms
[2020-06-03 05:32:45] [INFO ] Deduced a trap composed of 107 places in 129 ms
[2020-06-03 05:32:45] [INFO ] Deduced a trap composed of 34 places in 132 ms
[2020-06-03 05:32:45] [INFO ] Deduced a trap composed of 44 places in 132 ms
[2020-06-03 05:32:45] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-06-03 05:32:45] [INFO ] Deduced a trap composed of 41 places in 135 ms
[2020-06-03 05:32:46] [INFO ] Deduced a trap composed of 26 places in 260 ms
[2020-06-03 05:32:46] [INFO ] Deduced a trap composed of 54 places in 132 ms
[2020-06-03 05:32:46] [INFO ] Deduced a trap composed of 64 places in 177 ms
[2020-06-03 05:32:46] [INFO ] Deduced a trap composed of 112 places in 141 ms
[2020-06-03 05:32:46] [INFO ] Deduced a trap composed of 50 places in 142 ms
[2020-06-03 05:32:47] [INFO ] Deduced a trap composed of 26 places in 554 ms
[2020-06-03 05:32:47] [INFO ] Deduced a trap composed of 61 places in 451 ms
[2020-06-03 05:32:47] [INFO ] Deduced a trap composed of 33 places in 127 ms
[2020-06-03 05:32:48] [INFO ] Deduced a trap composed of 31 places in 687 ms
[2020-06-03 05:32:48] [INFO ] Deduced a trap composed of 60 places in 217 ms
[2020-06-03 05:32:49] [INFO ] Deduced a trap composed of 25 places in 270 ms
[2020-06-03 05:32:50] [INFO ] Deduced a trap composed of 110 places in 834 ms
[2020-06-03 05:32:50] [INFO ] Deduced a trap composed of 117 places in 135 ms
[2020-06-03 05:32:50] [INFO ] Deduced a trap composed of 120 places in 284 ms
[2020-06-03 05:32:51] [INFO ] Deduced a trap composed of 107 places in 1453 ms
[2020-06-03 05:32:51] [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 s66 s67 s68 s134 s135 s139 s140 s141 s145 s151 s152 s154 s155 s165 s166 s167 s176 s177 s185 s203 s204 s205 s209 s210 s211 s223 s224 s240 s270 s283 s284 s285 s288 s289 s290 s294 s309 s313 s314 s315 s318 s319 s320 s329 s334 s339 s344 s349 s374 s378 s379 s380 s384 s389 s394 s399 s404 s407 s409 s410 s411 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s432 s433 s434 s439 s440 s443 s444 s447 s448 s478 s479 s482 s483 s490 s491 s498 s499 s506 s507 s508 s511 s512 s513 s514 s517 s518 s529 s530 s539 s540 s543 s580 s581) 0)") while checking expression at index 7
[2020-06-03 05:32:52] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2020-06-03 05:32:52] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-06-03 05:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:32:53] [INFO ] [Real]Absence check using state equation in 1856 ms returned sat
[2020-06-03 05:32:56] [INFO ] Deduced a trap composed of 12 places in 2281 ms
[2020-06-03 05:32:56] [INFO ] Deduced a trap composed of 30 places in 144 ms
[2020-06-03 05:32:58] [INFO ] Deduced a trap composed of 24 places in 2324 ms
[2020-06-03 05:32:59] [INFO ] Deduced a trap composed of 31 places in 692 ms
[2020-06-03 05:32:59] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 05:32:59] [INFO ] Deduced a trap composed of 30 places in 228 ms
[2020-06-03 05:33:00] [INFO ] Deduced a trap composed of 23 places in 130 ms
[2020-06-03 05:33:01] [INFO ] Deduced a trap composed of 18 places in 1059 ms
[2020-06-03 05:33:01] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2020-06-03 05:33:01] [INFO ] Deduced a trap composed of 27 places in 544 ms
[2020-06-03 05:33:02] [INFO ] Deduced a trap composed of 23 places in 101 ms
[2020-06-03 05:33:02] [INFO ] Deduced a trap composed of 19 places in 85 ms
[2020-06-03 05:33:02] [INFO ] Deduced a trap composed of 25 places in 98 ms
[2020-06-03 05:33:02] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-06-03 05:33:02] [INFO ] Deduced a trap composed of 29 places in 79 ms
[2020-06-03 05:33:03] [INFO ] Deduced a trap composed of 13 places in 1254 ms
[2020-06-03 05:33:05] [INFO ] Deduced a trap composed of 24 places in 1755 ms
[2020-06-03 05:33:06] [INFO ] Deduced a trap composed of 34 places in 1075 ms
[2020-06-03 05:33:06] [INFO ] Deduced a trap composed of 24 places in 74 ms
[2020-06-03 05:33:06] [INFO ] Deduced a trap composed of 35 places in 102 ms
[2020-06-03 05:33:07] [INFO ] Deduced a trap composed of 24 places in 156 ms
[2020-06-03 05:33:10] [INFO ] Deduced a trap composed of 43 places in 3261 ms
[2020-06-03 05:33:10] [INFO ] Deduced a trap composed of 30 places in 287 ms
[2020-06-03 05:33:10] [INFO ] Deduced a trap composed of 35 places in 76 ms
[2020-06-03 05:33:10] [INFO ] Deduced a trap composed of 38 places in 91 ms
[2020-06-03 05:33:10] [INFO ] Deduced a trap composed of 25 places in 56 ms
[2020-06-03 05:33:11] [INFO ] Deduced a trap composed of 43 places in 42 ms
[2020-06-03 05:33:11] [INFO ] Deduced a trap composed of 42 places in 50 ms
[2020-06-03 05:33:11] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 17223 ms
[2020-06-03 05:33:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:33:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 62 ms returned sat
[2020-06-03 05:33:11] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-06-03 05:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:11] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2020-06-03 05:33:12] [INFO ] Deduced a trap composed of 21 places in 194 ms
[2020-06-03 05:33:12] [INFO ] Deduced a trap composed of 11 places in 122 ms
[2020-06-03 05:33:12] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-06-03 05:33:12] [INFO ] Deduced a trap composed of 19 places in 174 ms
[2020-06-03 05:33:12] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-06-03 05:33:13] [INFO ] Deduced a trap composed of 23 places in 551 ms
[2020-06-03 05:33:13] [INFO ] Deduced a trap composed of 14 places in 208 ms
[2020-06-03 05:33:13] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2020-06-03 05:33:13] [INFO ] Deduced a trap composed of 33 places in 107 ms
[2020-06-03 05:33:14] [INFO ] Deduced a trap composed of 20 places in 94 ms
[2020-06-03 05:33:14] [INFO ] Deduced a trap composed of 20 places in 339 ms
[2020-06-03 05:33:14] [INFO ] Deduced a trap composed of 25 places in 144 ms
[2020-06-03 05:33:14] [INFO ] Deduced a trap composed of 28 places in 188 ms
[2020-06-03 05:33:15] [INFO ] Deduced a trap composed of 28 places in 207 ms
[2020-06-03 05:33:15] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2020-06-03 05:33:15] [INFO ] Deduced a trap composed of 29 places in 140 ms
[2020-06-03 05:33:15] [INFO ] Deduced a trap composed of 25 places in 103 ms
[2020-06-03 05:33:15] [INFO ] Deduced a trap composed of 26 places in 216 ms
[2020-06-03 05:33:16] [INFO ] Deduced a trap composed of 30 places in 591 ms
[2020-06-03 05:33:16] [INFO ] Deduced a trap composed of 42 places in 158 ms
[2020-06-03 05:33:16] [INFO ] Deduced a trap composed of 34 places in 154 ms
[2020-06-03 05:33:16] [INFO ] Deduced a trap composed of 25 places in 87 ms
[2020-06-03 05:33:16] [INFO ] Deduced a trap composed of 30 places in 49 ms
[2020-06-03 05:33:17] [INFO ] Deduced a trap composed of 25 places in 715 ms
[2020-06-03 05:33:17] [INFO ] Deduced a trap composed of 40 places in 79 ms
[2020-06-03 05:33:17] [INFO ] Deduced a trap composed of 62 places in 214 ms
[2020-06-03 05:33:17] [INFO ] Deduced a trap composed of 27 places in 53 ms
[2020-06-03 05:33:18] [INFO ] Deduced a trap composed of 43 places in 59 ms
[2020-06-03 05:33:18] [INFO ] Deduced a trap composed of 42 places in 362 ms
[2020-06-03 05:33:18] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 6558 ms
[2020-06-03 05:33:18] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 35 ms.
[2020-06-03 05:33:22] [INFO ] Added : 328 causal constraints over 66 iterations in 3771 ms. Result :sat
[2020-06-03 05:33:22] [INFO ] [Real]Absence check using 55 positive place invariants in 194 ms returned sat
[2020-06-03 05:33:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 88 ms returned sat
[2020-06-03 05:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:23] [INFO ] [Real]Absence check using state equation in 782 ms returned unsat
[2020-06-03 05:33:23] [INFO ] [Real]Absence check using 55 positive place invariants in 102 ms returned sat
[2020-06-03 05:33:23] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 50 ms returned sat
[2020-06-03 05:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:24] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2020-06-03 05:33:25] [INFO ] Deduced a trap composed of 16 places in 570 ms
[2020-06-03 05:33:26] [INFO ] Deduced a trap composed of 24 places in 886 ms
[2020-06-03 05:33:26] [INFO ] Deduced a trap composed of 16 places in 395 ms
[2020-06-03 05:33:26] [INFO ] Deduced a trap composed of 22 places in 353 ms
[2020-06-03 05:33:27] [INFO ] Deduced a trap composed of 18 places in 305 ms
[2020-06-03 05:33:27] [INFO ] Deduced a trap composed of 20 places in 291 ms
[2020-06-03 05:33:27] [INFO ] Deduced a trap composed of 19 places in 290 ms
[2020-06-03 05:33:28] [INFO ] Deduced a trap composed of 20 places in 284 ms
[2020-06-03 05:33:28] [INFO ] Deduced a trap composed of 13 places in 258 ms
[2020-06-03 05:33:28] [INFO ] Deduced a trap composed of 25 places in 283 ms
[2020-06-03 05:33:29] [INFO ] Deduced a trap composed of 35 places in 541 ms
[2020-06-03 05:33:29] [INFO ] Deduced a trap composed of 117 places in 211 ms
[2020-06-03 05:33:30] [INFO ] Deduced a trap composed of 17 places in 380 ms
[2020-06-03 05:33:30] [INFO ] Deduced a trap composed of 127 places in 435 ms
[2020-06-03 05:33:30] [INFO ] Deduced a trap composed of 35 places in 309 ms
[2020-06-03 05:33:31] [INFO ] Deduced a trap composed of 23 places in 857 ms
[2020-06-03 05:33:32] [INFO ] Deduced a trap composed of 121 places in 571 ms
[2020-06-03 05:33:32] [INFO ] Deduced a trap composed of 41 places in 460 ms
[2020-06-03 05:33:33] [INFO ] Deduced a trap composed of 34 places in 262 ms
[2020-06-03 05:33:33] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-06-03 05:33:33] [INFO ] Deduced a trap composed of 46 places in 176 ms
[2020-06-03 05:33:33] [INFO ] Deduced a trap composed of 40 places in 143 ms
[2020-06-03 05:33:33] [INFO ] Deduced a trap composed of 126 places in 202 ms
[2020-06-03 05:33:34] [INFO ] Deduced a trap composed of 35 places in 264 ms
[2020-06-03 05:33:34] [INFO ] Deduced a trap composed of 41 places in 256 ms
[2020-06-03 05:33:34] [INFO ] Deduced a trap composed of 43 places in 309 ms
[2020-06-03 05:33:35] [INFO ] Deduced a trap composed of 130 places in 245 ms
[2020-06-03 05:33:35] [INFO ] Deduced a trap composed of 35 places in 126 ms
[2020-06-03 05:33:35] [INFO ] Deduced a trap composed of 122 places in 282 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 122 places in 703 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 132 places in 164 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 129 places in 127 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 40 places in 121 ms
[2020-06-03 05:33:36] [INFO ] Deduced a trap composed of 42 places in 128 ms
[2020-06-03 05:33:37] [INFO ] Deduced a trap composed of 88 places in 253 ms
[2020-06-03 05:33:37] [INFO ] Deduced a trap composed of 126 places in 634 ms
[2020-06-03 05:33:38] [INFO ] Deduced a trap composed of 134 places in 163 ms
[2020-06-03 05:33:38] [INFO ] Deduced a trap composed of 129 places in 115 ms
[2020-06-03 05:33:38] [INFO ] Deduced a trap composed of 50 places in 124 ms
[2020-06-03 05:33:38] [INFO ] Deduced a trap composed of 76 places in 142 ms
[2020-06-03 05:33:38] [INFO ] Deduced a trap composed of 129 places in 443 ms
[2020-06-03 05:33:39] [INFO ] Deduced a trap composed of 133 places in 131 ms
[2020-06-03 05:33:39] [INFO ] Deduced a trap composed of 37 places in 131 ms
[2020-06-03 05:33:39] [INFO ] Deduced a trap composed of 56 places in 127 ms
[2020-06-03 05:33:39] [INFO ] Deduced a trap composed of 30 places in 136 ms
[2020-06-03 05:33:39] [INFO ] Deduced a trap composed of 123 places in 147 ms
[2020-06-03 05:33:39] [INFO ] Deduced a trap composed of 126 places in 121 ms
[2020-06-03 05:33:40] [INFO ] Deduced a trap composed of 124 places in 139 ms
[2020-06-03 05:33:40] [INFO ] Deduced a trap composed of 123 places in 120 ms
[2020-06-03 05:33:40] [INFO ] Deduced a trap composed of 127 places in 189 ms
[2020-06-03 05:33:40] [INFO ] Deduced a trap composed of 123 places in 229 ms
[2020-06-03 05:33:41] [INFO ] Deduced a trap composed of 35 places in 332 ms
[2020-06-03 05:33:42] [INFO ] Deduced a trap composed of 125 places in 1899 ms
[2020-06-03 05:33:43] [INFO ] Deduced a trap composed of 56 places in 319 ms
[2020-06-03 05:33:44] [INFO ] Deduced a trap composed of 119 places in 1086 ms
[2020-06-03 05:33:44] [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 s60 s61 s62 s71 s80 s86 s87 s88 s96 s134 s135 s176 s177 s185 s191 s192 s193 s197 s198 s199 s209 s210 s211 s215 s216 s217 s228 s229 s230 s236 s239 s269 s270 s271 s275 s283 s285 s288 s290 s294 s299 s304 s318 s319 s320 s323 s324 s325 s329 s334 s339 s344 s349 s364 s369 s379 s389 s399 s413 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s428 s429 s432 s433 s434 s439 s440 s443 s444 s445 s446 s451 s452 s456 s458 s460 s466 s488 s489 s490 s491 s492 s493 s494 s495 s498 s499 s502 s503 s506 s507 s515 s516 s531 s532 s535 s536 s537 s538 s541 s542 s543 s557 s563 s566) 0)") while checking expression at index 10
[2020-06-03 05:33:44] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2020-06-03 05:33:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:33:45] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2020-06-03 05:33:45] [INFO ] Deduced a trap composed of 18 places in 528 ms
[2020-06-03 05:33:46] [INFO ] Deduced a trap composed of 13 places in 333 ms
[2020-06-03 05:33:48] [INFO ] Deduced a trap composed of 22 places in 1855 ms
[2020-06-03 05:33:48] [INFO ] Deduced a trap composed of 105 places in 698 ms
[2020-06-03 05:33:49] [INFO ] Deduced a trap composed of 20 places in 573 ms
[2020-06-03 05:33:49] [INFO ] Deduced a trap composed of 17 places in 276 ms
[2020-06-03 05:33:49] [INFO ] Deduced a trap composed of 11 places in 172 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 15 places in 305 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 13 places in 271 ms
[2020-06-03 05:33:50] [INFO ] Deduced a trap composed of 27 places in 210 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 99 places in 297 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 110 places in 443 ms
[2020-06-03 05:33:51] [INFO ] Deduced a trap composed of 20 places in 316 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 24 places in 320 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 26 places in 308 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 25 places in 83 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 28 places in 97 ms
[2020-06-03 05:33:52] [INFO ] Deduced a trap composed of 25 places in 69 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 33 places in 139 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 32 places in 186 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 36 places in 193 ms
[2020-06-03 05:33:53] [INFO ] Deduced a trap composed of 26 places in 161 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 21 places in 380 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 22 places in 100 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 28 places in 156 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 32 places in 144 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 32 places in 74 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-06-03 05:33:54] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2020-06-03 05:33:55] [INFO ] Deduced a trap composed of 43 places in 153 ms
[2020-06-03 05:33:55] [INFO ] Deduced a trap composed of 28 places in 169 ms
[2020-06-03 05:33:55] [INFO ] Deduced a trap composed of 24 places in 172 ms
[2020-06-03 05:33:55] [INFO ] Deduced a trap composed of 18 places in 160 ms
[2020-06-03 05:33:56] [INFO ] Deduced a trap composed of 39 places in 491 ms
[2020-06-03 05:33:56] [INFO ] Deduced a trap composed of 43 places in 72 ms
[2020-06-03 05:33:57] [INFO ] Deduced a trap composed of 31 places in 899 ms
[2020-06-03 05:33:57] [INFO ] Deduced a trap composed of 46 places in 256 ms
[2020-06-03 05:33:57] [INFO ] Deduced a trap composed of 49 places in 359 ms
[2020-06-03 05:33:58] [INFO ] Deduced a trap composed of 22 places in 432 ms
[2020-06-03 05:33:58] [INFO ] Deduced a trap composed of 56 places in 79 ms
[2020-06-03 05:33:58] [INFO ] Deduced a trap composed of 25 places in 71 ms
[2020-06-03 05:33:58] [INFO ] Deduced a trap composed of 66 places in 196 ms
[2020-06-03 05:33:58] [INFO ] Deduced a trap composed of 43 places in 120 ms
[2020-06-03 05:33:59] [INFO ] Deduced a trap composed of 59 places in 207 ms
[2020-06-03 05:33:59] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 13947 ms
[2020-06-03 05:33:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:33:59] [INFO ] [Nat]Absence check using 55 positive place invariants in 68 ms returned sat
[2020-06-03 05:33:59] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-06-03 05:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:02] [INFO ] [Nat]Absence check using state equation in 2875 ms returned sat
[2020-06-03 05:34:02] [INFO ] Deduced a trap composed of 26 places in 534 ms
[2020-06-03 05:34:03] [INFO ] Deduced a trap composed of 12 places in 280 ms
[2020-06-03 05:34:03] [INFO ] Deduced a trap composed of 11 places in 260 ms
[2020-06-03 05:34:03] [INFO ] Deduced a trap composed of 20 places in 242 ms
[2020-06-03 05:34:03] [INFO ] Deduced a trap composed of 17 places in 136 ms
[2020-06-03 05:34:04] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-06-03 05:34:04] [INFO ] Deduced a trap composed of 21 places in 132 ms
[2020-06-03 05:34:04] [INFO ] Deduced a trap composed of 104 places in 139 ms
[2020-06-03 05:34:04] [INFO ] Deduced a trap composed of 105 places in 257 ms
[2020-06-03 05:34:04] [INFO ] Deduced a trap composed of 104 places in 135 ms
[2020-06-03 05:34:05] [INFO ] Deduced a trap composed of 22 places in 127 ms
[2020-06-03 05:34:05] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2020-06-03 05:34:05] [INFO ] Deduced a trap composed of 109 places in 380 ms
[2020-06-03 05:34:05] [INFO ] Deduced a trap composed of 108 places in 183 ms
[2020-06-03 05:34:06] [INFO ] Deduced a trap composed of 110 places in 413 ms
[2020-06-03 05:34:06] [INFO ] Deduced a trap composed of 118 places in 254 ms
[2020-06-03 05:34:06] [INFO ] Deduced a trap composed of 40 places in 235 ms
[2020-06-03 05:34:09] [INFO ] Deduced a trap composed of 23 places in 3186 ms
[2020-06-03 05:34:10] [INFO ] Deduced a trap composed of 14 places in 357 ms
[2020-06-03 05:34:10] [INFO ] Deduced a trap composed of 104 places in 152 ms
[2020-06-03 05:34:10] [INFO ] Deduced a trap composed of 106 places in 130 ms
[2020-06-03 05:34:10] [INFO ] Deduced a trap composed of 28 places in 125 ms
[2020-06-03 05:34:10] [INFO ] Deduced a trap composed of 106 places in 122 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 28 places in 119 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 31 places in 120 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 24 places in 119 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 112 places in 128 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 27 places in 120 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2020-06-03 05:34:11] [INFO ] Deduced a trap composed of 19 places in 117 ms
[2020-06-03 05:34:12] [INFO ] Deduced a trap composed of 110 places in 135 ms
[2020-06-03 05:34:12] [INFO ] Deduced a trap composed of 29 places in 117 ms
[2020-06-03 05:34:12] [INFO ] Deduced a trap composed of 112 places in 129 ms
[2020-06-03 05:34:14] [INFO ] Deduced a trap composed of 116 places in 2473 ms
[2020-06-03 05:34:15] [INFO ] Deduced a trap composed of 15 places in 125 ms
[2020-06-03 05:34:15] [INFO ] Deduced a trap composed of 108 places in 116 ms
[2020-06-03 05:34:16] [INFO ] Deduced a trap composed of 35 places in 878 ms
[2020-06-03 05:34:16] [INFO ] Deduced a trap composed of 45 places in 267 ms
[2020-06-03 05:34:16] [INFO ] Deduced a trap composed of 24 places in 328 ms
[2020-06-03 05:34:16] [INFO ] Deduced a trap composed of 24 places in 132 ms
[2020-06-03 05:34:17] [INFO ] Deduced a trap composed of 45 places in 114 ms
[2020-06-03 05:34:17] [INFO ] Deduced a trap composed of 108 places in 164 ms
[2020-06-03 05:34:17] [INFO ] Deduced a trap composed of 33 places in 226 ms
[2020-06-03 05:34:17] [INFO ] Deduced a trap composed of 108 places in 325 ms
[2020-06-03 05:34:17] [INFO ] Deduced a trap composed of 111 places in 144 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 108 places in 142 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 108 places in 173 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 111 places in 140 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 111 places in 131 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 25 places in 121 ms
[2020-06-03 05:34:18] [INFO ] Deduced a trap composed of 40 places in 135 ms
[2020-06-03 05:34:19] [INFO ] Deduced a trap composed of 27 places in 128 ms
[2020-06-03 05:34:19] [INFO ] Deduced a trap composed of 109 places in 119 ms
[2020-06-03 05:34:19] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-06-03 05:34:19] [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 s240 s241 s242 s243 s244 s245 s246 s247 s343 s344 s345 s364 s369 s372 s374 s375 s376 s506 s507 s509 s510 s513 s514 s579) 0)") while checking expression at index 11
[2020-06-03 05:34:19] [INFO ] [Real]Absence check using 55 positive place invariants in 58 ms returned sat
[2020-06-03 05:34:19] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-06-03 05:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:20] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-06-03 05:34:20] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2020-06-03 05:34:20] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2020-06-03 05:34:20] [INFO ] Deduced a trap composed of 23 places in 164 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 24 places in 218 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 30 places in 274 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 17 places in 162 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 40 places in 222 ms
[2020-06-03 05:34:21] [INFO ] Deduced a trap composed of 40 places in 120 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 34 places in 134 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 27 places in 129 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 31 places in 171 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 35 places in 153 ms
[2020-06-03 05:34:22] [INFO ] Deduced a trap composed of 23 places in 137 ms
[2020-06-03 05:34:23] [INFO ] Deduced a trap composed of 33 places in 338 ms
[2020-06-03 05:34:23] [INFO ] Deduced a trap composed of 32 places in 105 ms
[2020-06-03 05:34:23] [INFO ] Deduced a trap composed of 30 places in 104 ms
[2020-06-03 05:34:23] [INFO ] Deduced a trap composed of 31 places in 107 ms
[2020-06-03 05:34:23] [INFO ] Deduced a trap composed of 24 places in 128 ms
[2020-06-03 05:34:23] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3316 ms
[2020-06-03 05:34:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 38 ms returned sat
[2020-06-03 05:34:23] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 45 ms returned sat
[2020-06-03 05:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:25] [INFO ] [Nat]Absence check using state equation in 1349 ms returned sat
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 16 places in 152 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 19 places in 178 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 28 places in 98 ms
[2020-06-03 05:34:25] [INFO ] Deduced a trap composed of 24 places in 169 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 15 places in 103 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 23 places in 93 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 26 places in 73 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 36 places in 72 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 36 places in 98 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 37 places in 154 ms
[2020-06-03 05:34:26] [INFO ] Deduced a trap composed of 21 places in 73 ms
[2020-06-03 05:34:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1514 ms
[2020-06-03 05:34:26] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 21 ms.
[2020-06-03 05:34:28] [INFO ] Added : 252 causal constraints over 51 iterations in 1965 ms. Result :sat
[2020-06-03 05:34:29] [INFO ] [Real]Absence check using 55 positive place invariants in 321 ms returned sat
[2020-06-03 05:34:29] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2020-06-03 05:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:29] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 11 places in 255 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 25 places in 155 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 18 places in 142 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 13 places in 80 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 11 places in 115 ms
[2020-06-03 05:34:30] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 30 places in 164 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 23 places in 152 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 16 places in 120 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2020-06-03 05:34:31] [INFO ] Deduced a trap composed of 36 places in 96 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 35 places in 141 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 35 places in 114 ms
[2020-06-03 05:34:32] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2020-06-03 05:34:32] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2611 ms
[2020-06-03 05:34:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:34:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 129 ms returned sat
[2020-06-03 05:34:32] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 37 ms returned sat
[2020-06-03 05:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:35] [INFO ] [Nat]Absence check using state equation in 2537 ms returned sat
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 11 places in 1033 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 12 places in 122 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-06-03 05:34:36] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 20 places in 119 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 126 places in 120 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 28 places in 66 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 34 places in 67 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 16 places in 65 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 28 places in 66 ms
[2020-06-03 05:34:37] [INFO ] Deduced a trap composed of 24 places in 64 ms
[2020-06-03 05:34:38] [INFO ] Deduced a trap composed of 38 places in 63 ms
[2020-06-03 05:34:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2754 ms
[2020-06-03 05:34:38] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 22 ms.
[2020-06-03 05:34:40] [INFO ] Added : 263 causal constraints over 53 iterations in 2193 ms. Result :sat
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using 55 positive place invariants in 83 ms returned sat
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:40] [INFO ] [Real]Absence check using state equation in 495 ms returned unsat
[2020-06-03 05:34:41] [INFO ] [Real]Absence check using 55 positive place invariants in 237 ms returned sat
[2020-06-03 05:34:41] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned sat
[2020-06-03 05:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:34:41] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2020-06-03 05:34:42] [INFO ] Deduced a trap composed of 11 places in 768 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 23 places in 202 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 26 places in 218 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 18 places in 259 ms
[2020-06-03 05:34:43] [INFO ] Deduced a trap composed of 17 places in 99 ms
[2020-06-03 05:34:45] [INFO ] Deduced a trap composed of 40 places in 1641 ms
[2020-06-03 05:34:45] [INFO ] Deduced a trap composed of 35 places in 378 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 37 places in 153 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 23 places in 87 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2020-06-03 05:34:46] [INFO ] Deduced a trap composed of 30 places in 84 ms
[2020-06-03 05:34:53] [INFO ] Deduced a trap composed of 30 places in 7376 ms
[2020-06-03 05:34:56] [INFO ] Deduced a trap composed of 33 places in 2286 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 46 places in 2744 ms
[2020-06-03 05:34:58] [INFO ] Deduced a trap composed of 29 places in 104 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 24 places in 99 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 39 places in 91 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 34 places in 175 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 39 places in 103 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 41 places in 83 ms
[2020-06-03 05:34:59] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 49 places in 85 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 29 places in 64 ms
[2020-06-03 05:35:00] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2020-06-03 05:35:00] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 18401 ms
[2020-06-03 05:35:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 41 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:01] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-06-03 05:35:01] [INFO ] Deduced a trap composed of 30 places in 155 ms
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 11 places in 1087 ms
[2020-06-03 05:35:02] [INFO ] Deduced a trap composed of 11 places in 322 ms
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 18 places in 314 ms
[2020-06-03 05:35:03] [INFO ] Deduced a trap composed of 24 places in 289 ms
[2020-06-03 05:35:04] [INFO ] Deduced a trap composed of 34 places in 519 ms
[2020-06-03 05:35:04] [INFO ] Deduced a trap composed of 35 places in 195 ms
[2020-06-03 05:35:04] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2020-06-03 05:35:04] [INFO ] Deduced a trap composed of 31 places in 175 ms
[2020-06-03 05:35:04] [INFO ] Deduced a trap composed of 121 places in 170 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 29 places in 174 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 23 places in 171 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 30 places in 167 ms
[2020-06-03 05:35:05] [INFO ] Deduced a trap composed of 16 places in 179 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 26 places in 324 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 25 places in 173 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 32 places in 172 ms
[2020-06-03 05:35:06] [INFO ] Deduced a trap composed of 36 places in 175 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 30 places in 172 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 37 places in 171 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 39 places in 152 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 60 places in 149 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 50 places in 146 ms
[2020-06-03 05:35:07] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 32 places in 157 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 116 places in 146 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 38 places in 152 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 41 places in 149 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 118 places in 150 ms
[2020-06-03 05:35:08] [INFO ] Deduced a trap composed of 124 places in 117 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 51 places in 146 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 110 places in 148 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 52 places in 147 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 33 places in 160 ms
[2020-06-03 05:35:09] [INFO ] Deduced a trap composed of 123 places in 162 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 29 places in 287 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 51 places in 250 ms
[2020-06-03 05:35:10] [INFO ] Deduced a trap composed of 28 places in 246 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 108 places in 168 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 144 places in 168 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 38 places in 284 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 35 places in 254 ms
[2020-06-03 05:35:11] [INFO ] Deduced a trap composed of 119 places in 161 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 20 places in 273 ms
[2020-06-03 05:35:12] [INFO ] Deduced a trap composed of 26 places in 458 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 139 places in 259 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 123 places in 286 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 124 places in 250 ms
[2020-06-03 05:35:13] [INFO ] Deduced a trap composed of 129 places in 240 ms
[2020-06-03 05:35:14] [INFO ] Deduced a trap composed of 131 places in 774 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 139 places in 674 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 139 places in 139 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 127 places in 141 ms
[2020-06-03 05:35:15] [INFO ] Deduced a trap composed of 142 places in 139 ms
[2020-06-03 05:35:16] [INFO ] Deduced a trap composed of 131 places in 404 ms
[2020-06-03 05:35:18] [INFO ] Deduced a trap composed of 129 places in 2645 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 129 places in 143 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 127 places in 124 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 125 places in 122 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 127 places in 122 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 40 places in 71 ms
[2020-06-03 05:35:19] [INFO ] Deduced a trap composed of 27 places in 69 ms
[2020-06-03 05:35:20] [INFO ] Deduced a trap composed of 35 places in 266 ms
[2020-06-03 05:35:21] [INFO ] Deduced a trap composed of 44 places in 1312 ms
[2020-06-03 05:35: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 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s126 s127 s128 s134 s135 s145 s154 s155 s165 s166 s167 s188 s308 s309 s310 s318 s319 s320 s324 s329 s334 s349 s359 s369 s488 s489 s509 s510 s513 s514 s572 s576) 0)") while checking expression at index 15
[2020-06-03 05:35:21] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2020-06-03 05:35:21] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2020-06-03 05:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:22] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 120 places in 197 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-06-03 05:35:22] [INFO ] Deduced a trap composed of 17 places in 137 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 34 places in 148 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 25 places in 133 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2020-06-03 05:35:23] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 22 places in 128 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 34 places in 126 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 111 places in 132 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 112 places in 125 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 37 places in 124 ms
[2020-06-03 05:35:24] [INFO ] Deduced a trap composed of 21 places in 123 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 121 places in 125 ms
[2020-06-03 05:35:25] [INFO ] Deduced a trap composed of 125 places in 789 ms
[2020-06-03 05:35:26] [INFO ] Deduced a trap composed of 109 places in 933 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 112 places in 2645 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2020-06-03 05:35:29] [INFO ] Deduced a trap composed of 128 places in 120 ms
[2020-06-03 05:35:30] [INFO ] Deduced a trap composed of 40 places in 657 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 22 places in 766 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 114 places in 512 ms
[2020-06-03 05:35:31] [INFO ] Deduced a trap composed of 118 places in 95 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 130 places in 100 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 117 places in 116 ms
[2020-06-03 05:35:32] [INFO ] Deduced a trap composed of 121 places in 103 ms
[2020-06-03 05:35:32] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 10250 ms
[2020-06-03 05:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:35:32] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:35] [INFO ] [Nat]Absence check using state equation in 3099 ms returned sat
[2020-06-03 05:35:38] [INFO ] Deduced a trap composed of 17 places in 3165 ms
[2020-06-03 05:35:38] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-06-03 05:35:39] [INFO ] Deduced a trap composed of 111 places in 276 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 21 places in 4619 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 108 places in 247 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2020-06-03 05:35:44] [INFO ] Deduced a trap composed of 112 places in 245 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 113 places in 277 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 25 places in 271 ms
[2020-06-03 05:35:45] [INFO ] Deduced a trap composed of 23 places in 260 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 23 places in 132 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 23 places in 136 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 23 places in 249 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 21 places in 113 ms
[2020-06-03 05:35:46] [INFO ] Deduced a trap composed of 106 places in 249 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-06-03 05:35:47] [INFO ] Deduced a trap composed of 29 places in 136 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 35 places in 4873 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 28 places in 418 ms
[2020-06-03 05:35: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 s7 s8 s9 s10 s31 s32 s191 s192 s193 s194 s197 s198 s199 s270 s368 s369 s370 s374 s384 s521 s522) 0)") while checking expression at index 16
[2020-06-03 05:35:52] [INFO ] [Real]Absence check using 55 positive place invariants in 318 ms returned sat
[2020-06-03 05:35:53] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 266 ms returned sat
[2020-06-03 05:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:54] [INFO ] [Real]Absence check using state equation in 1410 ms returned sat
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 12 places in 111 ms
[2020-06-03 05:35:54] [INFO ] Deduced a trap composed of 13 places in 86 ms
[2020-06-03 05:35:55] [INFO ] Deduced a trap composed of 14 places in 96 ms
[2020-06-03 05:35:55] [INFO ] Deduced a trap composed of 16 places in 158 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 21 places in 2067 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 11 places in 100 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 23 places in 105 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 21 places in 100 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 21 places in 98 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 27 places in 87 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 22 places in 83 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 23 places in 84 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 30 places in 218 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 25 places in 190 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 23 places in 170 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 38 places in 182 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 24 places in 77 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 31 places in 78 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 32 places in 78 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 42 places in 76 ms
[2020-06-03 05:35:59] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 24 places in 58 ms
[2020-06-03 05:36:00] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5393 ms
[2020-06-03 05:36:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:00] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:00] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-06-03 05:36:00] [INFO ] Deduced a trap composed of 17 places in 76 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 13 places in 86 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 20 places in 155 ms
[2020-06-03 05:36:02] [INFO ] Deduced a trap composed of 23 places in 1443 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 26 places in 144 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 40 places in 2534 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 15 places in 79 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 20 places in 62 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 57 places in 71 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 28 places in 63 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 26 places in 54 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 48 places in 54 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 25 places in 54 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 44 places in 52 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 31 places in 52 ms
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 05:36:06] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5805 ms
[2020-06-03 05:36:06] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 21 ms.
[2020-06-03 05:36:10] [INFO ] Added : 375 causal constraints over 76 iterations in 4113 ms. Result :sat
[2020-06-03 05:36:10] [INFO ] [Real]Absence check using 55 positive place invariants in 69 ms returned sat
[2020-06-03 05:36:10] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-06-03 05:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:13] [INFO ] [Real]Absence check using state equation in 2173 ms returned sat
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 27 places in 293 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 17 places in 267 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 12 places in 290 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 124 places in 146 ms
[2020-06-03 05:36:14] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2020-06-03 05:36:20] [INFO ] Deduced a trap composed of 115 places in 5798 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 15 places in 687 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 21 places in 211 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 20 places in 200 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 24 places in 199 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 38 places in 203 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 41 places in 137 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 28 places in 137 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 25 places in 113 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 37 places in 112 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 23 places in 110 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 109 places in 111 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 111 places in 108 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 28 places in 107 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 35 places in 124 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 116 places in 132 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 52 places in 137 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 112 places in 132 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 114 places in 133 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 26 places in 112 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 112 places in 114 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 26 places in 111 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 51 places in 112 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 136 places in 111 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 50 places in 127 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 133 places in 120 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 131 places in 111 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 69 places in 175 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 134 places in 124 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 113 places in 122 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 109 places in 115 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 127 places in 109 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 129 places in 108 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 127 places in 108 ms
[2020-06-03 05:36:27] [INFO ] Deduced a trap composed of 105 places in 108 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 38 places in 802 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 129 places in 886 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 111 places in 108 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 43 places in 104 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 27 places in 105 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 25 places in 1127 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 115 places in 137 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 45 places in 121 ms
[2020-06-03 05:36:30] [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 s31 s32 s145 s151 s152 s197 s198 s199 s223 s224 s228 s229 s230 s236 s239 s270 s333 s334 s335 s344 s364 s369 s374 s384 s389 s394 s398 s399 s400 s404 s409 s506 s507 s509 s510 s513 s514 s521 s522 s529 s530 s579) 0)") while checking expression at index 18
[2020-06-03 05:36:31] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2020-06-03 05:36:31] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-06-03 05:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:32] [INFO ] [Real]Absence check using state equation in 1378 ms returned sat
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 13 places in 1508 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 138 places in 2000 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 15 places in 145 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 17 places in 1782 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 26 places in 2023 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 25 places in 1988 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 35 places in 147 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 138 places in 168 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 14 places in 162 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 27 places in 237 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 138 places in 315 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 137 places in 307 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 24 places in 308 ms
[2020-06-03 05:36:44] [INFO ] Deduced a trap composed of 23 places in 300 ms
[2020-06-03 05:36:44] [INFO ] Deduced a trap composed of 24 places in 304 ms
[2020-06-03 05:36:44] [INFO ] Deduced a trap composed of 27 places in 299 ms
[2020-06-03 05:36:45] [INFO ] Deduced a trap composed of 32 places in 303 ms
[2020-06-03 05:36:45] [INFO ] Deduced a trap composed of 28 places in 302 ms
[2020-06-03 05:36:45] [INFO ] Deduced a trap composed of 44 places in 324 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 128 places in 1402 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 37 places in 139 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 22 places in 141 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 133 places in 352 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 49 places in 203 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 47 places in 219 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 28 places in 221 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 47 places in 230 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 123 places in 150 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 26 places in 160 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 30 places in 160 ms
[2020-06-03 05:36:49] [INFO ] Deduced a trap composed of 63 places in 162 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 127 places in 135 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 48 places in 980 ms
[2020-06-03 05:36:51] [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 s31 s32 s145 s148 s149 s197 s198 s199 s203 s204 s205 s215 s216 s217 s223 s224 s225 s270 s333 s334 s335 s339 s354 s369 s374 s384 s389 s394 s398 s399 s400 s404 s498 s499 s509 s510 s513 s514 s539 s540 s572 s573) 0)") while checking expression at index 19
[2020-06-03 05:36:51] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-06-03 05:36:51] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2020-06-03 05:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:51] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 15 places in 1826 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 27 places in 2194 ms
[2020-06-03 05:36:58] [INFO ] Deduced a trap composed of 22 places in 1976 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 20 places in 986 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 22 places in 203 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 29 places in 507 ms
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 31 places in 152 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 15 places in 154 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 26 places in 62 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 13 places in 82 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 22 places in 84 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 33 places in 80 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 23 places in 70 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 30 places in 550 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 41 places in 63 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 19 places in 83 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 30 places in 69 ms
[2020-06-03 05:37:01] [INFO ] Deduced a trap composed of 45 places in 57 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 33 places in 60 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 24 places in 62 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 47 places in 61 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 34 places in 60 ms
[2020-06-03 05:37:02] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 10332 ms
[2020-06-03 05:37:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:02] [INFO ] [Nat]Absence check using 55 positive place invariants in 266 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 143 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:05] [INFO ] [Nat]Absence check using state equation in 2541 ms returned sat
[2020-06-03 05:37:05] [INFO ] Deduced a trap composed of 32 places in 328 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 44 places in 4127 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 43 places in 176 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 24 places in 80 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 20 places in 458 ms
[2020-06-03 05:37:15] [INFO ] Deduced a trap composed of 22 places in 5166 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 34 places in 384 ms
[2020-06-03 05:37:21] [INFO ] Deduced a trap composed of 30 places in 5267 ms
[2020-06-03 05:37:22] [INFO ] Deduced a trap composed of 29 places in 739 ms
[2020-06-03 05:37:22] [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 s197 s198 s199 s215 s216 s217 s223 s224 s240 s378 s379 s380 s383 s384 s385 s389 s394 s399 s404 s407 s409 s410 s411 s525 s526 s539 s540) 0)") while checking expression at index 20
[2020-06-03 05:37:22] [INFO ] [Real]Absence check using 55 positive place invariants in 260 ms returned sat
[2020-06-03 05:37:22] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 36 ms returned sat
[2020-06-03 05:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:24] [INFO ] [Real]Absence check using state equation in 1457 ms returned sat
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 15 places in 182 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 132 places in 164 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 18 places in 166 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 29 places in 161 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 24 places in 161 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 120 places in 161 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 11 places in 178 ms
[2020-06-03 05:37:26] [INFO ] Deduced a trap composed of 15 places in 177 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 21 places in 2145 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 13 places in 158 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 17 places in 172 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 17 places in 196 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 120 places in 181 ms
[2020-06-03 05:37:30] [INFO ] Deduced a trap composed of 23 places in 1584 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 27 places in 1362 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 21 places in 361 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 22 places in 265 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 30 places in 136 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 28 places in 140 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 105 places in 148 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 23 places in 143 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 41 places in 144 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 104 places in 310 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 40 places in 301 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 105 places in 302 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 39 places in 303 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 112 places in 146 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 26 places in 143 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 48 places in 141 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 116 places in 139 ms
[2020-06-03 05:37:36] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2020-06-03 05:37:36] [INFO ] Deduced a trap composed of 125 places in 308 ms
[2020-06-03 05:37:36] [INFO ] Deduced a trap composed of 121 places in 289 ms
[2020-06-03 05:37:37] [INFO ] Deduced a trap composed of 128 places in 1246 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 131 places in 132 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 43 places in 134 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 24 places in 132 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 120 places in 143 ms
[2020-06-03 05:37:38] [INFO ] Deduced a trap composed of 48 places in 143 ms
[2020-06-03 05:37:39] [INFO ] Deduced a trap composed of 27 places in 133 ms
[2020-06-03 05:37:39] [INFO ] Deduced a trap composed of 46 places in 143 ms
[2020-06-03 05:37:39] [INFO ] Deduced a trap composed of 46 places in 307 ms
[2020-06-03 05:37:39] [INFO ] Deduced a trap composed of 55 places in 138 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 29 places in 235 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 60 places in 126 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 32 places in 127 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 115 places in 141 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 119 places in 146 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 105 places in 173 ms
[2020-06-03 05:37:40] [INFO ] Deduced a trap composed of 35 places in 125 ms
[2020-06-03 05:37:41] [INFO ] Deduced a trap composed of 31 places in 387 ms
[2020-06-03 05:37:41] [INFO ] Deduced a trap composed of 77 places in 140 ms
[2020-06-03 05:37:41] [INFO ] Deduced a trap composed of 49 places in 112 ms
[2020-06-03 05:37:41] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 27 places in 149 ms
[2020-06-03 05:37:42] [INFO ] Deduced a trap composed of 26 places in 191 ms
[2020-06-03 05:37:42] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 18017 ms
[2020-06-03 05:37:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:42] [INFO ] [Nat]Absence check using 55 positive place invariants in 267 ms returned sat
[2020-06-03 05:37:42] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 41 ms returned sat
[2020-06-03 05:37:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:44] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2020-06-03 05:37:46] [INFO ] Deduced a trap composed of 13 places in 2507 ms
[2020-06-03 05:37:46] [INFO ] Deduced a trap composed of 13 places in 311 ms
[2020-06-03 05:37:47] [INFO ] Deduced a trap composed of 26 places in 311 ms
[2020-06-03 05:37:50] [INFO ] Deduced a trap composed of 17 places in 3190 ms
[2020-06-03 05:37:50] [INFO ] Deduced a trap composed of 13 places in 273 ms
[2020-06-03 05:37:51] [INFO ] Deduced a trap composed of 27 places in 307 ms
[2020-06-03 05:37:51] [INFO ] Deduced a trap composed of 31 places in 308 ms
[2020-06-03 05:37:52] [INFO ] Deduced a trap composed of 26 places in 607 ms
[2020-06-03 05:37:52] [INFO ] Deduced a trap composed of 26 places in 209 ms
[2020-06-03 05:37:52] [INFO ] Deduced a trap composed of 11 places in 161 ms
[2020-06-03 05:37:52] [INFO ] Deduced a trap composed of 35 places in 258 ms
[2020-06-03 05:37:53] [INFO ] Deduced a trap composed of 31 places in 214 ms
[2020-06-03 05:37:53] [INFO ] Deduced a trap composed of 19 places in 306 ms
[2020-06-03 05:37:53] [INFO ] Deduced a trap composed of 22 places in 485 ms
[2020-06-03 05:37:55] [INFO ] Deduced a trap composed of 24 places in 1939 ms
[2020-06-03 05:37:56] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-06-03 05:37:56] [INFO ] Deduced a trap composed of 40 places in 139 ms
[2020-06-03 05:37:56] [INFO ] Deduced a trap composed of 26 places in 574 ms
[2020-06-03 05:37:57] [INFO ] Deduced a trap composed of 26 places in 224 ms
[2020-06-03 05:37:57] [INFO ] Deduced a trap composed of 22 places in 192 ms
[2020-06-03 05:37:57] [INFO ] Deduced a trap composed of 19 places in 131 ms
[2020-06-03 05:37:57] [INFO ] Deduced a trap composed of 17 places in 134 ms
[2020-06-03 05:37:57] [INFO ] Deduced a trap composed of 117 places in 149 ms
[2020-06-03 05:37:57] [INFO ] Deduced a trap composed of 132 places in 130 ms
[2020-06-03 05:37:58] [INFO ] Deduced a trap composed of 118 places in 155 ms
[2020-06-03 05:37:58] [INFO ] Deduced a trap composed of 121 places in 131 ms
[2020-06-03 05:37:58] [INFO ] Deduced a trap composed of 122 places in 526 ms
[2020-06-03 05:38:00] [INFO ] Deduced a trap composed of 36 places in 1679 ms
[2020-06-03 05:38:00] [INFO ] Deduced a trap composed of 123 places in 294 ms
[2020-06-03 05:38:01] [INFO ] Deduced a trap composed of 43 places in 247 ms
[2020-06-03 05:38:02] [INFO ] Deduced a trap composed of 31 places in 1305 ms
[2020-06-03 05:38: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 s3 s4 s5 s6 s7 s8 s27 s28 s31 s176 s177 s178 s179 s203 s204 s205 s206 s270 s353 s354 s355 s369 s374 s379 s513 s514 s525 s526) 0)") while checking expression at index 21
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-06-03 05:38:02] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 05:38:02] [INFO ] Flatten gal took : 143 ms
FORMULA BusinessProcesses-PT-12-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:38:02] [INFO ] Applying decomposition
[2020-06-03 05:38:02] [INFO ] Flatten gal took : 51 ms
[2020-06-03 05:38:02] [INFO ] Decomposing Gal with order
[2020-06-03 05:38:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 05:38:03] [INFO ] Removed a total of 117 redundant transitions.
[2020-06-03 05:38:03] [INFO ] Flatten gal took : 207 ms
[2020-06-03 05:38:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 200 ms.
[2020-06-03 05:38:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 26 ms.
[2020-06-03 05:38:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-12 @ 3570 seconds

FORMULA BusinessProcesses-PT-12-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-12-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLFireability @ BusinessProcesses-PT-12

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 05:38:04 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p581))) AND (X (G ((X (X (G (((p347 <= 0))))) AND ((1 <= p288))))) OR ((1 <= p581)))))",
"processed_size": 100,
"rewrites": 49
},
"result":
{
"edges": 263,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((((p436 <= 0)) R F ((((p396 <= 0)) AND ((p526 <= 0))))) U (X (F (((1 <= p526)))) U ((1 <= p396))))",
"processed_size": 99,
"rewrites": 49
},
"result":
{
"edges": 400,
"markings": 391,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (F ((X (F (((p442 <= 1) AND (1 <= p442)))) AND ((1 <= p175))))) OR ((1 <= p575)))))",
"processed_size": 92,
"rewrites": 49
},
"result":
{
"edges": 270,
"markings": 269,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X ((((1 <= p63) AND (1 <= p304) AND (1 <= p543) AND (1 <= p34)) OR G (((1 <= p34))))) OR F (((1 <= p361)))))",
"processed_size": 112,
"rewrites": 49
},
"result":
{
"edges": 1773,
"markings": 723,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((G (((p282 <= 0))) R X (G (((p173 <= 0))))) U (((1 <= p131)) OR ((1 <= p15))))",
"processed_size": 80,
"rewrites": 49
},
"result":
{
"edges": 263,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p171) AND (1 <= p345) AND (1 <= p506))))",
"processed_size": 53,
"rewrites": 49
},
"result":
{
"edges": 126,
"markings": 125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((1 <= p421)))",
"processed_size": 17,
"rewrites": 49
},
"result":
{
"edges": 263,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p550))",
"processed_size": 13,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (F (((1 <= p14)))))",
"processed_size": 24,
"rewrites": 49
},
"result":
{
"edges": 270,
"markings": 270,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p40 <= 0))",
"processed_size": 12,
"rewrites": 51
},
"result":
{
"edges": 125,
"markings": 125,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p7))))",
"processed_size": 19,
"rewrites": 49
},
"result":
{
"edges": 113,
"markings": 113,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p200 <= 0) OR (p270 <= 0) OR (p543 <= 0)))",
"processed_size": 49,
"rewrites": 49
},
"result":
{
"edges": 179,
"markings": 179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F ((((p110 <= 0)) OR (G (((1 <= p542))) AND F (((p110 <= 0)))))) AND (((1 <= p102)) AND (((1 <= p300)) AND ((1 <= p548))))))",
"processed_size": 128,
"rewrites": 49
},
"result":
{
"edges": 129,
"markings": 129,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 35492,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(**) AND (X(G((X(X(G(*))) AND **))) OR **))) : ((* R F(*)) U (X(F(**)) U **)) : F(G((X(F((X(F(**)) AND **))) OR **))) : F((X((** OR G(**))) OR F(**))) : ((G(*) R X(G(*))) U **) : G(*) : ((X(**) OR (X(F(**)) AND F(G(**)))) AND X((G(**) AND **))) : F(**) : G(F(**)) : (X(X(F(**))) OR (G(*) AND **)) : F((F((** OR (G(**) AND F(**)))) AND (** AND (** AND **))))"
},
"net":
{
"arcs": 1552,
"conflict_clusters": 437,
"places": 582,
"places_significant": 484,
"singleton_clusters": 0,
"transitions": 521
},
"result":
{
"preliminary_value": "no no no no no no no no no no no ",
"value": "no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 582
lola: finding significant places
lola: 582 places, 521 transitions, 484 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p581 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p581 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p526 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p526 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p175 <= 1)
lola: LP says that atomic proposition is always true: (p575 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p361 <= 1)
lola: LP says that atomic proposition is always true: (p282 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p345 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p543 <= 1)
lola: LP says that atomic proposition is always true: (p550 <= 1)
lola: LP says that atomic proposition is always true: (p542 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p300 <= 1)
lola: LP says that atomic proposition is always true: (p548 <= 1)
lola: X ((F (((1 <= p581))) AND (X (G ((X (NOT(X (F (((1 <= p347)))))) AND ((1 <= p288))))) OR ((1 <= p581))))) : (NOT((((1 <= p436)) U G ((((1 <= p396)) OR ((1 <= p526)))))) U (X (F ((((1 <= p436)) U ((1 <= p526))))) U ((1 <= p396)))) : F (X (F (G ((F ((X (F (X (((p442 <= 1) AND (1 <= p442))))) AND X (((1 <= p175))))) OR ((1 <= p575))))))) : F (((X (((1 <= p63) AND (1 <= p304) AND (1 <= p543) AND (1 <= p34))) OR X (G (((1 <= p34))))) OR F (((1 <= p361))))) : (NOT((F (((1 <= p282))) U F (X (((1 <= p173)))))) U (((1 <= p131)) OR ((1 <= p15)))) : G (NOT(((NOT(X (((1 <= p173)))) AND ((1 <= p210))) U F (((1 <= p200) AND (1 <= p270) AND (1 <= p543)))))) : ((F (G (((1 <= p171) AND (1 <= p345) AND (1 <= p506)))) U X (((1 <= p421)))) AND X ((G (((1 <= p421))) AND ((1 <= p428))))) : F (((1 <= p40))) : NOT(X (G (F (NOT(F (((1 <= p7)))))))) : (NOT(X (NOT(X (F (((1 <= p14))))))) OR (NOT(F (((1 <= p52) AND (1 <= p275) AND (1 <= p543)))) AND ((1 <= p550)))) : F ((((F ((G (((1 <= p542))) U ((p110 <= 0)))) AND ((1 <= p102))) AND ((1 <= p300))) AND ((1 <= p548))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p581))) AND (X (G ((X (X (G (((p347 <= 0))))) AND ((1 <= p288))))) OR ((1 <= p581)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p581))) AND (X (G ((X (X (G (((p347 <= 0))))) AND ((1 <= p288))))) OR ((1 <= p581)))))
lola: processed formula length: 100
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 263 markings, 263 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p436 <= 0)) R F ((((p396 <= 0)) AND ((p526 <= 0))))) U (X (F (((1 <= p526)))) U ((1 <= p396))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p436 <= 0)) R F ((((p396 <= 0)) AND ((p526 <= 0))))) U (X (F (((1 <= p526)))) U ((1 <= p396))))
lola: processed formula length: 99
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 391 markings, 400 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F ((X (F (((p442 <= 1) AND (1 <= p442)))) AND ((1 <= p175))))) OR ((1 <= p575)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F ((X (F (((p442 <= 1) AND (1 <= p442)))) AND ((1 <= p175))))) OR ((1 <= p575)))))
lola: processed formula length: 92
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 269 markings, 270 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((1 <= p63) AND (1 <= p304) AND (1 <= p543) AND (1 <= p34)) OR G (((1 <= p34))))) OR F (((1 <= p361)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((1 <= p63) AND (1 <= p304) AND (1 <= p543) AND (1 <= p34)) OR G (((1 <= p34))))) OR F (((1 <= p361)))))
lola: processed formula length: 112
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 723 markings, 1773 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p282 <= 0))) R X (G (((p173 <= 0))))) U (((1 <= p131)) OR ((1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((p282 <= 0))) R X (G (((p173 <= 0))))) U (((1 <= p131)) OR ((1 <= p15))))
lola: processed formula length: 80
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 263 markings, 263 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p421))) OR (X (F (((1 <= p421)))) AND F (G (((1 <= p171) AND (1 <= p345) AND (1 <= p506)))))) AND X ((G (((1 <= p421))) AND ((1 <= p428)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p171) AND (1 <= p345) AND (1 <= p506))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p171) AND (1 <= p345) AND (1 <= p506))))
lola: processed formula length: 53
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 125 markings, 126 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p421)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p421)))
lola: processed formula length: 17
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 263 markings, 263 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p14))))) OR (G (((p52 <= 0) OR (p275 <= 0) OR (p543 <= 0))) AND ((1 <= p550))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p550))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p550))
lola: processed formula length: 13
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p14)))))
lola: processed formula length: 24
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 270 markings, 270 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p40 <= 0))
lola: processed formula length: 12
lola: 51 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 125 markings, 125 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p7))))
lola: processed formula length: 19
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 113 markings, 113 edges
lola: ========================================
lola: subprocess 9 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p200 <= 0) OR (p270 <= 0) OR (p543 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p200 <= 0) OR (p270 <= 0) OR (p543 <= 0)))
lola: processed formula length: 49
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 179 markings, 179 edges
lola: ========================================
lola: subprocess 10 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((p110 <= 0)) OR (G (((1 <= p542))) AND F (((p110 <= 0)))))) AND (((1 <= p102)) AND (((1 <= p300)) AND ((1 <= p548))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((p110 <= 0)) OR (G (((1 <= p542))) AND F (((p110 <= 0)))))) AND (((1 <= p102)) AND (((1 <= p300)) AND ((1 <= p548))))))
lola: processed formula length: 128
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 129 markings, 129 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no
lola: memory consumption: 35492 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
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="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLFireability"
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 BusinessProcesses-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914000538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;