fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r021-oct2-158897699200578
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15782.240 3600000.00 4244662.00 239386.10 FFF????T??F????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200578.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 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 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 161K 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-17-00
FORMULA_NAME BusinessProcesses-PT-17-01
FORMULA_NAME BusinessProcesses-PT-17-02
FORMULA_NAME BusinessProcesses-PT-17-03
FORMULA_NAME BusinessProcesses-PT-17-04
FORMULA_NAME BusinessProcesses-PT-17-05
FORMULA_NAME BusinessProcesses-PT-17-06
FORMULA_NAME BusinessProcesses-PT-17-07
FORMULA_NAME BusinessProcesses-PT-17-08
FORMULA_NAME BusinessProcesses-PT-17-09
FORMULA_NAME BusinessProcesses-PT-17-10
FORMULA_NAME BusinessProcesses-PT-17-11
FORMULA_NAME BusinessProcesses-PT-17-12
FORMULA_NAME BusinessProcesses-PT-17-13
FORMULA_NAME BusinessProcesses-PT-17-14
FORMULA_NAME BusinessProcesses-PT-17-15

=== Now, execution of the tool begins

BK_START 1589256356381

[2020-05-12 04:05:59] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 04:05:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:05:59] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-05-12 04:05:59] [INFO ] Transformed 650 places.
[2020-05-12 04:05:59] [INFO ] Transformed 580 transitions.
[2020-05-12 04:05:59] [INFO ] Found NUPN structural information;
[2020-05-12 04:05:59] [INFO ] Parsed PT model containing 650 places and 580 transitions in 150 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 656 resets, run finished after 468 ms. (steps per millisecond=213 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 576 rows 646 cols
[2020-05-12 04:06:00] [INFO ] Computed 108 place invariants in 38 ms
[2020-05-12 04:06:01] [INFO ] [Real]Absence check using 62 positive place invariants in 74 ms returned sat
[2020-05-12 04:06:01] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 43 ms returned sat
[2020-05-12 04:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:06:03] [INFO ] [Real]Absence check using state equation in 2029 ms returned sat
[2020-05-12 04:06:05] [INFO ] Deduced a trap composed of 15 places in 2420 ms
[2020-05-12 04:06:06] [INFO ] Deduced a trap composed of 8 places in 817 ms
[2020-05-12 04:06:06] [INFO ] Deduced a trap composed of 28 places in 272 ms
[2020-05-12 04:06:07] [INFO ] Deduced a trap composed of 11 places in 880 ms
[2020-05-12 04:06:08] [INFO ] Deduced a trap composed of 24 places in 601 ms
[2020-05-12 04:06:08] [INFO ] Deduced a trap composed of 19 places in 410 ms
[2020-05-12 04:06:09] [INFO ] Deduced a trap composed of 29 places in 405 ms
[2020-05-12 04:06:10] [INFO ] Deduced a trap composed of 18 places in 1159 ms
[2020-05-12 04:06:14] [INFO ] Deduced a trap composed of 29 places in 3819 ms
[2020-05-12 04:06:15] [INFO ] Deduced a trap composed of 27 places in 735 ms
[2020-05-12 04:06:16] [INFO ] Deduced a trap composed of 129 places in 1217 ms
[2020-05-12 04:06:19] [INFO ] Deduced a trap composed of 131 places in 2998 ms
[2020-05-12 04:06:20] [INFO ] Deduced a trap composed of 26 places in 1075 ms
[2020-05-12 04:06:23] [INFO ] Deduced a trap composed of 27 places in 2738 ms
[2020-05-12 04:06:23] [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 s54 s55 s220 s221 s222 s241 s244 s245 s246 s247 s259 s262 s316 s317 s318 s431 s436 s441 s451 s456 s593 s594 s603 s604) 0)") while checking expression at index 0
[2020-05-12 04:06:23] [INFO ] [Real]Absence check using 62 positive place invariants in 58 ms returned sat
[2020-05-12 04:06:23] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-05-12 04:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:06:24] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2020-05-12 04:06:28] [INFO ] Deduced a trap composed of 27 places in 4098 ms
[2020-05-12 04:06:28] [INFO ] Deduced a trap composed of 25 places in 346 ms
[2020-05-12 04:06:29] [INFO ] Deduced a trap composed of 14 places in 522 ms
[2020-05-12 04:06:31] [INFO ] Deduced a trap composed of 23 places in 2084 ms
[2020-05-12 04:06:34] [INFO ] Deduced a trap composed of 32 places in 2936 ms
[2020-05-12 04:06:35] [INFO ] Deduced a trap composed of 125 places in 627 ms
[2020-05-12 04:06:36] [INFO ] Deduced a trap composed of 26 places in 1348 ms
[2020-05-12 04:06:43] [INFO ] Deduced a trap composed of 11 places in 6838 ms
[2020-05-12 04:06:49] [INFO ] Deduced a trap composed of 26 places in 5823 ms
[2020-05-12 04:06:49] [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 s92 s360 s361 s362) 0)") while checking expression at index 1
[2020-05-12 04:06:49] [INFO ] [Real]Absence check using 62 positive place invariants in 184 ms returned sat
[2020-05-12 04:06:49] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 175 ms returned sat
[2020-05-12 04:06:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:06:52] [INFO ] [Real]Absence check using state equation in 2778 ms returned sat
[2020-05-12 04:06:52] [INFO ] Deduced a trap composed of 10 places in 299 ms
[2020-05-12 04:06:53] [INFO ] Deduced a trap composed of 11 places in 427 ms
[2020-05-12 04:06:53] [INFO ] Deduced a trap composed of 8 places in 376 ms
[2020-05-12 04:06:54] [INFO ] Deduced a trap composed of 23 places in 394 ms
[2020-05-12 04:06:54] [INFO ] Deduced a trap composed of 18 places in 388 ms
[2020-05-12 04:06:54] [INFO ] Deduced a trap composed of 50 places in 394 ms
[2020-05-12 04:06:55] [INFO ] Deduced a trap composed of 36 places in 802 ms
[2020-05-12 04:06:58] [INFO ] Deduced a trap composed of 26 places in 2608 ms
[2020-05-12 04:07:04] [INFO ] Deduced a trap composed of 13 places in 6476 ms
[2020-05-12 04:07:10] [INFO ] Deduced a trap composed of 22 places in 5603 ms
[2020-05-12 04:07:10] [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 s232 s233 s234 s246 s247 s251 s252 s253 s259 s262 s425 s426 s427 s440 s441 s442 s446 s451 s456) 0)") while checking expression at index 2
[2020-05-12 04:07:10] [INFO ] [Real]Absence check using 62 positive place invariants in 172 ms returned sat
[2020-05-12 04:07:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 118 ms returned sat
[2020-05-12 04:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:13] [INFO ] [Real]Absence check using state equation in 2346 ms returned sat
[2020-05-12 04:07:13] [INFO ] Deduced a trap composed of 29 places in 174 ms
[2020-05-12 04:07:14] [INFO ] Deduced a trap composed of 141 places in 915 ms
[2020-05-12 04:07:17] [INFO ] Deduced a trap composed of 15 places in 3063 ms
[2020-05-12 04:07:18] [INFO ] Deduced a trap composed of 18 places in 540 ms
[2020-05-12 04:07:18] [INFO ] Deduced a trap composed of 20 places in 633 ms
[2020-05-12 04:07:20] [INFO ] Deduced a trap composed of 11 places in 2017 ms
[2020-05-12 04:07:22] [INFO ] Deduced a trap composed of 22 places in 1684 ms
[2020-05-12 04:07:22] [INFO ] Deduced a trap composed of 120 places in 159 ms
[2020-05-12 04:07:23] [INFO ] Deduced a trap composed of 31 places in 155 ms
[2020-05-12 04:07:23] [INFO ] Deduced a trap composed of 27 places in 149 ms
[2020-05-12 04:07:23] [INFO ] Deduced a trap composed of 19 places in 136 ms
[2020-05-12 04:07:23] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2020-05-12 04:07:23] [INFO ] Deduced a trap composed of 133 places in 151 ms
[2020-05-12 04:07:23] [INFO ] Deduced a trap composed of 115 places in 164 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 120 places in 132 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 119 places in 147 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 118 places in 217 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 37 places in 130 ms
[2020-05-12 04:07:24] [INFO ] Deduced a trap composed of 28 places in 192 ms
[2020-05-12 04:07:25] [INFO ] Deduced a trap composed of 29 places in 149 ms
[2020-05-12 04:07:25] [INFO ] Deduced a trap composed of 25 places in 220 ms
[2020-05-12 04:07:25] [INFO ] Deduced a trap composed of 73 places in 147 ms
[2020-05-12 04:07:25] [INFO ] Deduced a trap composed of 44 places in 217 ms
[2020-05-12 04:07:25] [INFO ] Deduced a trap composed of 49 places in 261 ms
[2020-05-12 04:07:26] [INFO ] Deduced a trap composed of 43 places in 154 ms
[2020-05-12 04:07:26] [INFO ] Deduced a trap composed of 54 places in 250 ms
[2020-05-12 04:07:26] [INFO ] Deduced a trap composed of 12 places in 138 ms
[2020-05-12 04:07:26] [INFO ] Deduced a trap composed of 118 places in 233 ms
[2020-05-12 04:07:27] [INFO ] Deduced a trap composed of 121 places in 150 ms
[2020-05-12 04:07:27] [INFO ] Deduced a trap composed of 124 places in 196 ms
[2020-05-12 04:07:27] [INFO ] Deduced a trap composed of 119 places in 220 ms
[2020-05-12 04:07:27] [INFO ] Deduced a trap composed of 66 places in 156 ms
[2020-05-12 04:07:28] [INFO ] Deduced a trap composed of 141 places in 387 ms
[2020-05-12 04:07:28] [INFO ] Deduced a trap composed of 146 places in 275 ms
[2020-05-12 04:07:28] [INFO ] Deduced a trap composed of 133 places in 261 ms
[2020-05-12 04:07:29] [INFO ] Deduced a trap composed of 50 places in 301 ms
[2020-05-12 04:07:29] [INFO ] Deduced a trap composed of 132 places in 175 ms
[2020-05-12 04:07:30] [INFO ] Deduced a trap composed of 136 places in 1218 ms
[2020-05-12 04:07:30] [INFO ] Deduced a trap composed of 138 places in 273 ms
[2020-05-12 04:07: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 s30 s31 s34 s35 s41 s42 s89 s90 s91 s94 s98 s100 s103 s109 s112 s113 s128 s137 s157 s158 s162 s163 s164 s182 s183 s184 s188 s189 s190 s214 s215 s216 s232 s233 s234 s263 s297 s306 s308 s317 s322 s330 s331 s332 s336 s340 s342 s351 s366 s381 s386 s396 s411 s416 s421 s426 s440 s441 s442 s446 s451 s454 s456 s457 s458 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s482 s483 s484 s485 s492 s493 s496 s497 s498 s503 s504 s505 s506 s511 s512 s513 s514 s520 s528 s529 s530 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s546 s547 s550 s551 s554 s555 s556 s557 s558 s559 s568 s569 s570 s571 s573 s574 s579 s580 s581 s582 s585 s586 s599 s600 s603 s604 s607 s618 s643) 0)") while checking expression at index 3
[2020-05-12 04:07:31] [INFO ] [Real]Absence check using 62 positive place invariants in 76 ms returned sat
[2020-05-12 04:07:31] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-05-12 04:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:32] [INFO ] [Real]Absence check using state equation in 1726 ms returned sat
[2020-05-12 04:07:33] [INFO ] Deduced a trap composed of 29 places in 354 ms
[2020-05-12 04:07:33] [INFO ] Deduced a trap composed of 141 places in 340 ms
[2020-05-12 04:07:33] [INFO ] Deduced a trap composed of 15 places in 340 ms
[2020-05-12 04:07:34] [INFO ] Deduced a trap composed of 18 places in 353 ms
[2020-05-12 04:07:34] [INFO ] Deduced a trap composed of 20 places in 386 ms
[2020-05-12 04:07:34] [INFO ] Deduced a trap composed of 11 places in 298 ms
[2020-05-12 04:07:35] [INFO ] Deduced a trap composed of 22 places in 800 ms
[2020-05-12 04:07:36] [INFO ] Deduced a trap composed of 120 places in 371 ms
[2020-05-12 04:07:37] [INFO ] Deduced a trap composed of 31 places in 813 ms
[2020-05-12 04:07:37] [INFO ] Deduced a trap composed of 27 places in 566 ms
[2020-05-12 04:07:37] [INFO ] Deduced a trap composed of 19 places in 178 ms
[2020-05-12 04:07:38] [INFO ] Deduced a trap composed of 32 places in 328 ms
[2020-05-12 04:07:38] [INFO ] Deduced a trap composed of 133 places in 389 ms
[2020-05-12 04:07:38] [INFO ] Deduced a trap composed of 115 places in 136 ms
[2020-05-12 04:07:39] [INFO ] Deduced a trap composed of 120 places in 389 ms
[2020-05-12 04:07:39] [INFO ] Deduced a trap composed of 119 places in 691 ms
[2020-05-12 04:07:40] [INFO ] Deduced a trap composed of 118 places in 248 ms
[2020-05-12 04:07:40] [INFO ] Deduced a trap composed of 37 places in 344 ms
[2020-05-12 04:07:40] [INFO ] Deduced a trap composed of 28 places in 257 ms
[2020-05-12 04:07:41] [INFO ] Deduced a trap composed of 29 places in 181 ms
[2020-05-12 04:07:41] [INFO ] Deduced a trap composed of 25 places in 182 ms
[2020-05-12 04:07:41] [INFO ] Deduced a trap composed of 73 places in 155 ms
[2020-05-12 04:07:41] [INFO ] Deduced a trap composed of 44 places in 307 ms
[2020-05-12 04:07:42] [INFO ] Deduced a trap composed of 49 places in 198 ms
[2020-05-12 04:07:42] [INFO ] Deduced a trap composed of 43 places in 680 ms
[2020-05-12 04:07:43] [INFO ] Deduced a trap composed of 54 places in 985 ms
[2020-05-12 04:07:44] [INFO ] Deduced a trap composed of 12 places in 316 ms
[2020-05-12 04:07:44] [INFO ] Deduced a trap composed of 118 places in 307 ms
[2020-05-12 04:07:44] [INFO ] Deduced a trap composed of 121 places in 305 ms
[2020-05-12 04:07:44] [INFO ] Deduced a trap composed of 124 places in 158 ms
[2020-05-12 04:07:45] [INFO ] Deduced a trap composed of 119 places in 169 ms
[2020-05-12 04:07:45] [INFO ] Deduced a trap composed of 66 places in 579 ms
[2020-05-12 04:07:45] [INFO ] Deduced a trap composed of 141 places in 141 ms
[2020-05-12 04:07:46] [INFO ] Deduced a trap composed of 146 places in 557 ms
[2020-05-12 04:07:46] [INFO ] Deduced a trap composed of 133 places in 171 ms
[2020-05-12 04:07:46] [INFO ] Deduced a trap composed of 50 places in 136 ms
[2020-05-12 04:07:47] [INFO ] Deduced a trap composed of 132 places in 148 ms
[2020-05-12 04:07:47] [INFO ] Deduced a trap composed of 136 places in 138 ms
[2020-05-12 04:07:47] [INFO ] Deduced a trap composed of 138 places in 178 ms
[2020-05-12 04:07:47] [INFO ] Deduced a trap composed of 135 places in 142 ms
[2020-05-12 04:07:47] [INFO ] Deduced a trap composed of 133 places in 186 ms
[2020-05-12 04:07:48] [INFO ] Deduced a trap composed of 139 places in 334 ms
[2020-05-12 04:07:48] [INFO ] Deduced a trap composed of 147 places in 246 ms
[2020-05-12 04:07:48] [INFO ] Deduced a trap composed of 137 places in 146 ms
[2020-05-12 04:07:48] [INFO ] Deduced a trap composed of 155 places in 137 ms
[2020-05-12 04:07:49] [INFO ] Deduced a trap composed of 163 places in 916 ms
[2020-05-12 04:07:50] [INFO ] Deduced a trap composed of 152 places in 283 ms
[2020-05-12 04:07:50] [INFO ] Deduced a trap composed of 66 places in 383 ms
[2020-05-12 04:07:50] [INFO ] Deduced a trap composed of 42 places in 163 ms
[2020-05-12 04:07:50] [INFO ] Deduced a trap composed of 48 places in 166 ms
[2020-05-12 04:07:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s199 s200 s208 s226 s227 s228 s232 s233 s234 s238 s239 s240 s263 s297 s317 s390 s391 s392 s411 s416 s421 s426 s435 s436 s437 s441 s446 s451 s454 s456 s457 s458 s479 s480 s481 s492 s493 s496 s570 s571 s577 s578 s599 s600 s603 s604) 0)") while checking expression at index 4
[2020-05-12 04:07:51] [INFO ] [Real]Absence check using 62 positive place invariants in 78 ms returned sat
[2020-05-12 04:07:51] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-05-12 04:07:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:53] [INFO ] [Real]Absence check using state equation in 2449 ms returned unsat
[2020-05-12 04:07:53] [INFO ] [Real]Absence check using 62 positive place invariants in 213 ms returned sat
[2020-05-12 04:07:54] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 178 ms returned sat
[2020-05-12 04:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:07:57] [INFO ] [Real]Absence check using state equation in 3010 ms returned sat
[2020-05-12 04:07:57] [INFO ] Deduced a trap composed of 11 places in 414 ms
[2020-05-12 04:08:01] [INFO ] Deduced a trap composed of 15 places in 3707 ms
[2020-05-12 04:08:03] [INFO ] Deduced a trap composed of 8 places in 2631 ms
[2020-05-12 04:08:04] [INFO ] Deduced a trap composed of 125 places in 372 ms
[2020-05-12 04:08:04] [INFO ] Deduced a trap composed of 44 places in 400 ms
[2020-05-12 04:08:05] [INFO ] Deduced a trap composed of 124 places in 375 ms
[2020-05-12 04:08:05] [INFO ] Deduced a trap composed of 41 places in 400 ms
[2020-05-12 04:08:06] [INFO ] Deduced a trap composed of 30 places in 386 ms
[2020-05-12 04:08:06] [INFO ] Deduced a trap composed of 22 places in 389 ms
[2020-05-12 04:08:06] [INFO ] Deduced a trap composed of 23 places in 377 ms
[2020-05-12 04:08:07] [INFO ] Deduced a trap composed of 31 places in 371 ms
[2020-05-12 04:08:07] [INFO ] Deduced a trap composed of 19 places in 376 ms
[2020-05-12 04:08:08] [INFO ] Deduced a trap composed of 121 places in 379 ms
[2020-05-12 04:08:08] [INFO ] Deduced a trap composed of 33 places in 379 ms
[2020-05-12 04:08:08] [INFO ] Deduced a trap composed of 25 places in 402 ms
[2020-05-12 04:08:09] [INFO ] Deduced a trap composed of 50 places in 384 ms
[2020-05-12 04:08:09] [INFO ] Deduced a trap composed of 19 places in 342 ms
[2020-05-12 04:08:10] [INFO ] Deduced a trap composed of 26 places in 340 ms
[2020-05-12 04:08:11] [INFO ] Deduced a trap composed of 23 places in 1733 ms
[2020-05-12 04:08:11] [INFO ] Deduced a trap composed of 131 places in 153 ms
[2020-05-12 04:08:12] [INFO ] Deduced a trap composed of 142 places in 260 ms
[2020-05-12 04:08:12] [INFO ] Deduced a trap composed of 25 places in 238 ms
[2020-05-12 04:08:13] [INFO ] Deduced a trap composed of 31 places in 1269 ms
[2020-05-12 04:08:13] [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 s168 s174 s175 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s375 s376 s377 s381 s391 s409 s411 s412 s413 s445 s446 s447 s552 s553 s570 s571) 0)") while checking expression at index 6
[2020-05-12 04:08:14] [INFO ] [Real]Absence check using 62 positive place invariants in 147 ms returned sat
[2020-05-12 04:08:14] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 219 ms returned sat
[2020-05-12 04:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:15] [INFO ] [Real]Absence check using state equation in 1361 ms returned sat
[2020-05-12 04:08:17] [INFO ] Deduced a trap composed of 14 places in 2055 ms
[2020-05-12 04:08:18] [INFO ] Deduced a trap composed of 25 places in 425 ms
[2020-05-12 04:08:18] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 26 places in 2623 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 13 places in 182 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 11 places in 134 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 17 places in 97 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 21 places in 111 ms
[2020-05-12 04:08:21] [INFO ] Deduced a trap composed of 50 places in 147 ms
[2020-05-12 04:08:22] [INFO ] Deduced a trap composed of 25 places in 101 ms
[2020-05-12 04:08:22] [INFO ] Deduced a trap composed of 52 places in 119 ms
[2020-05-12 04:08:22] [INFO ] Deduced a trap composed of 46 places in 119 ms
[2020-05-12 04:08:22] [INFO ] Deduced a trap composed of 22 places in 51 ms
[2020-05-12 04:08:22] [INFO ] Deduced a trap composed of 20 places in 66 ms
[2020-05-12 04:08:22] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 6888 ms
[2020-05-12 04:08:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:08:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 123 ms returned sat
[2020-05-12 04:08:22] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 33 ms returned sat
[2020-05-12 04:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:23] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2020-05-12 04:08:23] [INFO ] Deduced a trap composed of 18 places in 214 ms
[2020-05-12 04:08:24] [INFO ] Deduced a trap composed of 15 places in 412 ms
[2020-05-12 04:08:24] [INFO ] Deduced a trap composed of 17 places in 319 ms
[2020-05-12 04:08:25] [INFO ] Deduced a trap composed of 11 places in 322 ms
[2020-05-12 04:08:25] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-05-12 04:08:25] [INFO ] Deduced a trap composed of 124 places in 143 ms
[2020-05-12 04:08:25] [INFO ] Deduced a trap composed of 28 places in 315 ms
[2020-05-12 04:08:26] [INFO ] Deduced a trap composed of 14 places in 315 ms
[2020-05-12 04:08:26] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-05-12 04:08:26] [INFO ] Deduced a trap composed of 23 places in 291 ms
[2020-05-12 04:08:26] [INFO ] Deduced a trap composed of 20 places in 203 ms
[2020-05-12 04:08:27] [INFO ] Deduced a trap composed of 28 places in 140 ms
[2020-05-12 04:08:27] [INFO ] Deduced a trap composed of 25 places in 230 ms
[2020-05-12 04:08:27] [INFO ] Deduced a trap composed of 125 places in 331 ms
[2020-05-12 04:08:28] [INFO ] Deduced a trap composed of 130 places in 319 ms
[2020-05-12 04:08:28] [INFO ] Deduced a trap composed of 124 places in 530 ms
[2020-05-12 04:08:28] [INFO ] Deduced a trap composed of 49 places in 288 ms
[2020-05-12 04:08:29] [INFO ] Deduced a trap composed of 122 places in 521 ms
[2020-05-12 04:08:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5813 ms
[2020-05-12 04:08:29] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 40 ms.
[2020-05-12 04:08:34] [INFO ] Added : 411 causal constraints over 83 iterations in 5426 ms. Result :sat
[2020-05-12 04:08:35] [INFO ] Deduced a trap composed of 142 places in 231 ms
[2020-05-12 04:08:35] [INFO ] Deduced a trap composed of 145 places in 178 ms
[2020-05-12 04:08:35] [INFO ] Deduced a trap composed of 139 places in 247 ms
[2020-05-12 04:08:36] [INFO ] Deduced a trap composed of 146 places in 176 ms
[2020-05-12 04:08:36] [INFO ] Deduced a trap composed of 144 places in 131 ms
[2020-05-12 04:08:36] [INFO ] Deduced a trap composed of 147 places in 186 ms
[2020-05-12 04:08:36] [INFO ] Deduced a trap composed of 138 places in 237 ms
[2020-05-12 04:08:37] [INFO ] Deduced a trap composed of 147 places in 295 ms
[2020-05-12 04:08:37] [INFO ] Deduced a trap composed of 148 places in 137 ms
[2020-05-12 04:08:37] [INFO ] Deduced a trap composed of 148 places in 152 ms
[2020-05-12 04:08:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2913 ms
[2020-05-12 04:08:38] [INFO ] [Real]Absence check using 62 positive place invariants in 135 ms returned sat
[2020-05-12 04:08:38] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 88 ms returned sat
[2020-05-12 04:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:39] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2020-05-12 04:08:39] [INFO ] Deduced a trap composed of 27 places in 275 ms
[2020-05-12 04:08:39] [INFO ] Deduced a trap composed of 19 places in 346 ms
[2020-05-12 04:08:39] [INFO ] Deduced a trap composed of 8 places in 153 ms
[2020-05-12 04:08:40] [INFO ] Deduced a trap composed of 14 places in 362 ms
[2020-05-12 04:08:40] [INFO ] Deduced a trap composed of 132 places in 369 ms
[2020-05-12 04:08:41] [INFO ] Deduced a trap composed of 11 places in 296 ms
[2020-05-12 04:08:41] [INFO ] Deduced a trap composed of 15 places in 308 ms
[2020-05-12 04:08:41] [INFO ] Deduced a trap composed of 16 places in 187 ms
[2020-05-12 04:08:41] [INFO ] Deduced a trap composed of 37 places in 201 ms
[2020-05-12 04:08:42] [INFO ] Deduced a trap composed of 26 places in 160 ms
[2020-05-12 04:08:42] [INFO ] Deduced a trap composed of 35 places in 297 ms
[2020-05-12 04:08:42] [INFO ] Deduced a trap composed of 41 places in 404 ms
[2020-05-12 04:08:43] [INFO ] Deduced a trap composed of 40 places in 190 ms
[2020-05-12 04:08:43] [INFO ] Deduced a trap composed of 15 places in 185 ms
[2020-05-12 04:08:43] [INFO ] Deduced a trap composed of 28 places in 162 ms
[2020-05-12 04:08:43] [INFO ] Deduced a trap composed of 29 places in 268 ms
[2020-05-12 04:08:43] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-05-12 04:08:44] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2020-05-12 04:08:44] [INFO ] Deduced a trap composed of 45 places in 152 ms
[2020-05-12 04:08:44] [INFO ] Deduced a trap composed of 33 places in 149 ms
[2020-05-12 04:08:44] [INFO ] Deduced a trap composed of 47 places in 112 ms
[2020-05-12 04:08:44] [INFO ] Deduced a trap composed of 55 places in 109 ms
[2020-05-12 04:08:44] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2020-05-12 04:08:45] [INFO ] Deduced a trap composed of 58 places in 191 ms
[2020-05-12 04:08:45] [INFO ] Deduced a trap composed of 49 places in 183 ms
[2020-05-12 04:08:45] [INFO ] Deduced a trap composed of 18 places in 107 ms
[2020-05-12 04:08:45] [INFO ] Deduced a trap composed of 50 places in 244 ms
[2020-05-12 04:08:45] [INFO ] Deduced a trap composed of 53 places in 112 ms
[2020-05-12 04:08:45] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6759 ms
[2020-05-12 04:08:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:08:46] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2020-05-12 04:08:46] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2020-05-12 04:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:47] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2020-05-12 04:08:47] [INFO ] Deduced a trap composed of 8 places in 199 ms
[2020-05-12 04:08:47] [INFO ] Deduced a trap composed of 14 places in 170 ms
[2020-05-12 04:08:47] [INFO ] Deduced a trap composed of 18 places in 245 ms
[2020-05-12 04:08:48] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2020-05-12 04:08:48] [INFO ] Deduced a trap composed of 25 places in 170 ms
[2020-05-12 04:08:48] [INFO ] Deduced a trap composed of 11 places in 164 ms
[2020-05-12 04:08:48] [INFO ] Deduced a trap composed of 19 places in 197 ms
[2020-05-12 04:08:48] [INFO ] Deduced a trap composed of 29 places in 141 ms
[2020-05-12 04:08:48] [INFO ] Deduced a trap composed of 32 places in 159 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 21 places in 114 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 24 places in 178 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 36 places in 223 ms
[2020-05-12 04:08:49] [INFO ] Deduced a trap composed of 30 places in 134 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 40 places in 89 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 28 places in 100 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 44 places in 121 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2020-05-12 04:08:50] [INFO ] Deduced a trap composed of 44 places in 196 ms
[2020-05-12 04:08:50] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3539 ms
[2020-05-12 04:08:50] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 49 ms.
[2020-05-12 04:08:55] [INFO ] Added : 374 causal constraints over 76 iterations in 5124 ms. Result :sat
[2020-05-12 04:08:56] [INFO ] [Real]Absence check using 62 positive place invariants in 286 ms returned sat
[2020-05-12 04:08:56] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 98 ms returned sat
[2020-05-12 04:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:08:57] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2020-05-12 04:08:57] [INFO ] Deduced a trap composed of 22 places in 636 ms
[2020-05-12 04:08:58] [INFO ] Deduced a trap composed of 19 places in 363 ms
[2020-05-12 04:08:58] [INFO ] Deduced a trap composed of 8 places in 358 ms
[2020-05-12 04:08:59] [INFO ] Deduced a trap composed of 16 places in 711 ms
[2020-05-12 04:08:59] [INFO ] Deduced a trap composed of 19 places in 294 ms
[2020-05-12 04:09:00] [INFO ] Deduced a trap composed of 18 places in 358 ms
[2020-05-12 04:09:00] [INFO ] Deduced a trap composed of 31 places in 368 ms
[2020-05-12 04:09:03] [INFO ] Deduced a trap composed of 15 places in 2670 ms
[2020-05-12 04:09:03] [INFO ] Deduced a trap composed of 14 places in 185 ms
[2020-05-12 04:09:03] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-05-12 04:09:03] [INFO ] Deduced a trap composed of 30 places in 199 ms
[2020-05-12 04:09:04] [INFO ] Deduced a trap composed of 41 places in 198 ms
[2020-05-12 04:09:04] [INFO ] Deduced a trap composed of 122 places in 226 ms
[2020-05-12 04:09:04] [INFO ] Deduced a trap composed of 33 places in 337 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 46 places in 291 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 20 places in 357 ms
[2020-05-12 04:09:05] [INFO ] Deduced a trap composed of 29 places in 343 ms
[2020-05-12 04:09:06] [INFO ] Deduced a trap composed of 40 places in 363 ms
[2020-05-12 04:09:09] [INFO ] Deduced a trap composed of 39 places in 3373 ms
[2020-05-12 04:09:09] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2020-05-12 04:09:15] [INFO ] Deduced a trap composed of 40 places in 5976 ms
[2020-05-12 04:09:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s34 s35 s54 s55 s199 s200 s201 s202 s238 s239 s240 s241 s246 s247 s297 s317 s400 s401 s402 s416 s421 s431 s436 s441 s445 s446 s447 s577 s578 s581 s582 s585 s586) 0)") while checking expression at index 9
[2020-05-12 04:09:16] [INFO ] [Real]Absence check using 62 positive place invariants in 62 ms returned sat
[2020-05-12 04:09:16] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 34 ms returned sat
[2020-05-12 04:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:17] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2020-05-12 04:09:18] [INFO ] Deduced a trap composed of 8 places in 879 ms
[2020-05-12 04:09:19] [INFO ] Deduced a trap composed of 142 places in 172 ms
[2020-05-12 04:09:22] [INFO ] Deduced a trap composed of 15 places in 3460 ms
[2020-05-12 04:09:22] [INFO ] Deduced a trap composed of 126 places in 192 ms
[2020-05-12 04:09:24] [INFO ] Deduced a trap composed of 11 places in 2041 ms
[2020-05-12 04:09:25] [INFO ] Deduced a trap composed of 19 places in 181 ms
[2020-05-12 04:09:32] [INFO ] Deduced a trap composed of 47 places in 7054 ms
[2020-05-12 04:09:32] [INFO ] Deduced a trap composed of 33 places in 397 ms
[2020-05-12 04:09:33] [INFO ] Deduced a trap composed of 22 places in 754 ms
[2020-05-12 04:09:33] [INFO ] Deduced a trap composed of 33 places in 193 ms
[2020-05-12 04:09:33] [INFO ] Deduced a trap composed of 27 places in 345 ms
[2020-05-12 04:09:34] [INFO ] Deduced a trap composed of 144 places in 388 ms
[2020-05-12 04:09:34] [INFO ] Deduced a trap composed of 38 places in 464 ms
[2020-05-12 04:09:35] [INFO ] Deduced a trap composed of 34 places in 221 ms
[2020-05-12 04:09:35] [INFO ] Deduced a trap composed of 37 places in 321 ms
[2020-05-12 04:09:35] [INFO ] Deduced a trap composed of 22 places in 230 ms
[2020-05-12 04:09:35] [INFO ] Deduced a trap composed of 126 places in 177 ms
[2020-05-12 04:09:36] [INFO ] Deduced a trap composed of 26 places in 401 ms
[2020-05-12 04:09: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 s92 s360 s361 s362) 0)") while checking expression at index 10
[2020-05-12 04:09:36] [INFO ] [Real]Absence check using 62 positive place invariants in 70 ms returned sat
[2020-05-12 04:09:36] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2020-05-12 04:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:37] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2020-05-12 04:09:37] [INFO ] Deduced a trap composed of 14 places in 417 ms
[2020-05-12 04:09:38] [INFO ] Deduced a trap composed of 19 places in 445 ms
[2020-05-12 04:09:38] [INFO ] Deduced a trap composed of 16 places in 579 ms
[2020-05-12 04:09:39] [INFO ] Deduced a trap composed of 21 places in 273 ms
[2020-05-12 04:09:39] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-05-12 04:09:39] [INFO ] Deduced a trap composed of 28 places in 423 ms
[2020-05-12 04:09:40] [INFO ] Deduced a trap composed of 26 places in 648 ms
[2020-05-12 04:09:40] [INFO ] Deduced a trap composed of 12 places in 270 ms
[2020-05-12 04:09:41] [INFO ] Deduced a trap composed of 32 places in 348 ms
[2020-05-12 04:09:41] [INFO ] Deduced a trap composed of 120 places in 179 ms
[2020-05-12 04:09:41] [INFO ] Deduced a trap composed of 130 places in 292 ms
[2020-05-12 04:09:41] [INFO ] Deduced a trap composed of 125 places in 222 ms
[2020-05-12 04:09:42] [INFO ] Deduced a trap composed of 57 places in 260 ms
[2020-05-12 04:09:42] [INFO ] Deduced a trap composed of 35 places in 174 ms
[2020-05-12 04:09:42] [INFO ] Deduced a trap composed of 137 places in 174 ms
[2020-05-12 04:09:42] [INFO ] Deduced a trap composed of 50 places in 153 ms
[2020-05-12 04:09:43] [INFO ] Deduced a trap composed of 14 places in 154 ms
[2020-05-12 04:09:43] [INFO ] Deduced a trap composed of 58 places in 391 ms
[2020-05-12 04:09:43] [INFO ] Deduced a trap composed of 158 places in 338 ms
[2020-05-12 04:09:44] [INFO ] Deduced a trap composed of 157 places in 328 ms
[2020-05-12 04:09:44] [INFO ] Deduced a trap composed of 152 places in 165 ms
[2020-05-12 04:09:44] [INFO ] Deduced a trap composed of 144 places in 155 ms
[2020-05-12 04:09:44] [INFO ] Deduced a trap composed of 160 places in 180 ms
[2020-05-12 04:09:45] [INFO ] Deduced a trap composed of 161 places in 251 ms
[2020-05-12 04:09:45] [INFO ] Deduced a trap composed of 154 places in 167 ms
[2020-05-12 04:09:45] [INFO ] Deduced a trap composed of 151 places in 159 ms
[2020-05-12 04:09:45] [INFO ] Deduced a trap composed of 142 places in 454 ms
[2020-05-12 04:09:46] [INFO ] Deduced a trap composed of 151 places in 373 ms
[2020-05-12 04:09:46] [INFO ] Deduced a trap composed of 146 places in 174 ms
[2020-05-12 04:09:46] [INFO ] Deduced a trap composed of 154 places in 238 ms
[2020-05-12 04:09:46] [INFO ] Deduced a trap composed of 160 places in 174 ms
[2020-05-12 04:09:47] [INFO ] Deduced a trap composed of 152 places in 355 ms
[2020-05-12 04:09:47] [INFO ] Deduced a trap composed of 149 places in 172 ms
[2020-05-12 04:09:47] [INFO ] Deduced a trap composed of 157 places in 312 ms
[2020-05-12 04:09:48] [INFO ] Deduced a trap composed of 154 places in 331 ms
[2020-05-12 04:09:48] [INFO ] Deduced a trap composed of 162 places in 282 ms
[2020-05-12 04:09:48] [INFO ] Deduced a trap composed of 152 places in 313 ms
[2020-05-12 04:09:49] [INFO ] Deduced a trap composed of 158 places in 303 ms
[2020-05-12 04:09:49] [INFO ] Deduced a trap composed of 160 places in 181 ms
[2020-05-12 04:09:49] [INFO ] Deduced a trap composed of 52 places in 174 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 52 places in 314 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 147 places in 363 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 149 places in 307 ms
[2020-05-12 04:09:50] [INFO ] Deduced a trap composed of 143 places in 169 ms
[2020-05-12 04:09:51] [INFO ] Deduced a trap composed of 152 places in 145 ms
[2020-05-12 04:09:51] [INFO ] Deduced a trap composed of 153 places in 167 ms
[2020-05-12 04:09:51] [INFO ] Deduced a trap composed of 162 places in 140 ms
[2020-05-12 04:09:51] [INFO ] Deduced a trap composed of 146 places in 332 ms
[2020-05-12 04:09:52] [INFO ] Deduced a trap composed of 145 places in 171 ms
[2020-05-12 04:09:52] [INFO ] Deduced a trap composed of 146 places in 140 ms
[2020-05-12 04:09:53] [INFO ] Deduced a trap composed of 146 places in 1632 ms
[2020-05-12 04:09:55] [INFO ] Deduced a trap composed of 145 places in 1065 ms
[2020-05-12 04:09:55] [INFO ] Deduced a trap composed of 146 places in 737 ms
[2020-05-12 04:09:56] [INFO ] Deduced a trap composed of 146 places in 305 ms
[2020-05-12 04:09:56] [INFO ] Deduced a trap composed of 156 places in 164 ms
[2020-05-12 04:09: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 s3 s4 s5 s6 s7 s8 s9 s10 s11 s30 s31 s34 s35 s59 s60 s61 s92 s93 s94 s95 s98 s99 s100 s104 s105 s106 s109 s110 s111 s112 s116 s117 s118 s126 s127 s131 s135 s136 s137 s168 s171 s172 s174 s175 s177 s178 s188 s189 s190 s199 s200 s201 s202 s211 s220 s221 s222 s232 s233 s234 s238 s239 s240 s246 s247 s297 s302 s307 s312 s317 s326 s341 s345 s347 s351 s356 s361 s366 s371 s381 s396 s401 s416 s426 s431 s441 s446 s451 s456 s460 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s486 s487 s490 s491 s492 s493 s496 s497 s498 s503 s504 s505 s506 s507 s508 s515 s516 s520 s525 s526 s527 s538 s539 s542 s543 s548 s549 s550 s551 s552 s553 s560 s561 s562 s563 s568 s569 s570 s571 s577 s578 s583 s584 s585 s586 s591 s592 s603 s604 s607 s621) 0)") while checking expression at index 11
[2020-05-12 04:09:56] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2020-05-12 04:09:56] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 47 ms returned sat
[2020-05-12 04:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:09:57] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2020-05-12 04:09:57] [INFO ] Deduced a trap composed of 17 places in 172 ms
[2020-05-12 04:09:57] [INFO ] Deduced a trap composed of 18 places in 206 ms
[2020-05-12 04:09:58] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-05-12 04:09:58] [INFO ] Deduced a trap composed of 21 places in 358 ms
[2020-05-12 04:09:58] [INFO ] Deduced a trap composed of 17 places in 425 ms
[2020-05-12 04:09:59] [INFO ] Deduced a trap composed of 19 places in 155 ms
[2020-05-12 04:09:59] [INFO ] Deduced a trap composed of 17 places in 338 ms
[2020-05-12 04:10:00] [INFO ] Deduced a trap composed of 26 places in 1003 ms
[2020-05-12 04:10:00] [INFO ] Deduced a trap composed of 121 places in 342 ms
[2020-05-12 04:10:01] [INFO ] Deduced a trap composed of 21 places in 329 ms
[2020-05-12 04:10:01] [INFO ] Deduced a trap composed of 41 places in 268 ms
[2020-05-12 04:10:01] [INFO ] Deduced a trap composed of 50 places in 241 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 33 places in 202 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 12 places in 159 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 11 places in 263 ms
[2020-05-12 04:10:02] [INFO ] Deduced a trap composed of 119 places in 148 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 125 places in 328 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 15 places in 317 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 35 places in 304 ms
[2020-05-12 04:10:03] [INFO ] Deduced a trap composed of 29 places in 173 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 32 places in 322 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 120 places in 141 ms
[2020-05-12 04:10:04] [INFO ] Deduced a trap composed of 126 places in 432 ms
[2020-05-12 04:10:05] [INFO ] Deduced a trap composed of 132 places in 175 ms
[2020-05-12 04:10:05] [INFO ] Deduced a trap composed of 127 places in 137 ms
[2020-05-12 04:10:05] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-05-12 04:10:05] [INFO ] Deduced a trap composed of 124 places in 147 ms
[2020-05-12 04:10:05] [INFO ] Deduced a trap composed of 28 places in 213 ms
[2020-05-12 04:10:06] [INFO ] Deduced a trap composed of 33 places in 137 ms
[2020-05-12 04:10:06] [INFO ] Deduced a trap composed of 124 places in 396 ms
[2020-05-12 04:10:06] [INFO ] Deduced a trap composed of 40 places in 278 ms
[2020-05-12 04:10:07] [INFO ] Deduced a trap composed of 22 places in 312 ms
[2020-05-12 04:10:07] [INFO ] Deduced a trap composed of 20 places in 300 ms
[2020-05-12 04:10:07] [INFO ] Deduced a trap composed of 127 places in 291 ms
[2020-05-12 04:10:08] [INFO ] Deduced a trap composed of 38 places in 292 ms
[2020-05-12 04:10:08] [INFO ] Deduced a trap composed of 26 places in 293 ms
[2020-05-12 04:10:08] [INFO ] Deduced a trap composed of 26 places in 305 ms
[2020-05-12 04:10:08] [INFO ] Deduced a trap composed of 27 places in 205 ms
[2020-05-12 04:10:09] [INFO ] Deduced a trap composed of 26 places in 144 ms
[2020-05-12 04:10:09] [INFO ] Deduced a trap composed of 29 places in 161 ms
[2020-05-12 04:10:09] [INFO ] Deduced a trap composed of 39 places in 165 ms
[2020-05-12 04:10:09] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-12 04:10:09] [INFO ] Deduced a trap composed of 27 places in 175 ms
[2020-05-12 04:10:10] [INFO ] Deduced a trap composed of 40 places in 168 ms
[2020-05-12 04:10:10] [INFO ] Deduced a trap composed of 42 places in 175 ms
[2020-05-12 04:10:10] [INFO ] Deduced a trap composed of 36 places in 153 ms
[2020-05-12 04:10:10] [INFO ] Deduced a trap composed of 29 places in 180 ms
[2020-05-12 04:10:10] [INFO ] Deduced a trap composed of 57 places in 170 ms
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 42 places in 171 ms
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 45 places in 139 ms
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 42 places in 152 ms
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 21 places in 144 ms
[2020-05-12 04:10:11] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 43 places in 140 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 39 places in 147 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 26 places in 168 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 42 places in 184 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 43 places in 61 ms
[2020-05-12 04:10:12] [INFO ] Deduced a trap composed of 47 places in 65 ms
[2020-05-12 04:10:13] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-05-12 04:10:13] [INFO ] Deduced a trap composed of 44 places in 92 ms
[2020-05-12 04:10:15] [INFO ] Deduced a trap composed of 45 places in 2520 ms
[2020-05-12 04:10:15] [INFO ] Deduced a trap composed of 28 places in 140 ms
[2020-05-12 04:10:16] [INFO ] Deduced a trap composed of 56 places in 82 ms
[2020-05-12 04:10:16] [INFO ] Deduced a trap composed of 40 places in 684 ms
[2020-05-12 04:10: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 s7 s8 s9 s162 s163 s164 s168 s177 s178 s188 s189 s190 s199 s200 s201 s205 s223 s297 s375 s376 s377 s381 s396 s406 s416 s421 s479 s480 s481 s577 s578 s585 s586) 0)") while checking expression at index 12
[2020-05-12 04:10:16] [INFO ] [Real]Absence check using 62 positive place invariants in 49 ms returned sat
[2020-05-12 04:10:17] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 255 ms returned sat
[2020-05-12 04:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:10:18] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2020-05-12 04:10:18] [INFO ] Deduced a trap composed of 11 places in 480 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 22 places in 5571 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 30 places in 314 ms
[2020-05-12 04:10:24] [INFO ] Deduced a trap composed of 14 places in 366 ms
[2020-05-12 04:10:28] [INFO ] Deduced a trap composed of 12 places in 3106 ms
[2020-05-12 04:10:28] [INFO ] Deduced a trap composed of 17 places in 768 ms
[2020-05-12 04:10:29] [INFO ] Deduced a trap composed of 25 places in 863 ms
[2020-05-12 04:10:29] [INFO ] Deduced a trap composed of 36 places in 225 ms
[2020-05-12 04:10:30] [INFO ] Deduced a trap composed of 12 places in 503 ms
[2020-05-12 04:10:31] [INFO ] Deduced a trap composed of 11 places in 1216 ms
[2020-05-12 04:10:33] [INFO ] Deduced a trap composed of 27 places in 2023 ms
[2020-05-12 04:10:34] [INFO ] Deduced a trap composed of 136 places in 330 ms
[2020-05-12 04:10:36] [INFO ] Deduced a trap composed of 30 places in 2103 ms
[2020-05-12 04:10:36] [INFO ] Deduced a trap composed of 47 places in 474 ms
[2020-05-12 04:10: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 s34 s35 s54 s55 s162 s163 s164 s168 s171 s172 s220 s221 s222 s235 s238 s239 s240 s297 s317 s375 s376 s377 s381 s386 s401 s416 s421 s431 s436 s562 s563 s573 s574 s577 s578 s585 s586 s636 s637) 0)") while checking expression at index 13
[2020-05-12 04:10:36] [INFO ] [Real]Absence check using 62 positive place invariants in 83 ms returned sat
[2020-05-12 04:10:36] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-05-12 04:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:10:39] [INFO ] [Real]Absence check using state equation in 2311 ms returned sat
[2020-05-12 04:10:39] [INFO ] Deduced a trap composed of 126 places in 245 ms
[2020-05-12 04:10:39] [INFO ] Deduced a trap composed of 14 places in 340 ms
[2020-05-12 04:10:40] [INFO ] Deduced a trap composed of 12 places in 167 ms
[2020-05-12 04:10:40] [INFO ] Deduced a trap composed of 18 places in 166 ms
[2020-05-12 04:10:40] [INFO ] Deduced a trap composed of 12 places in 145 ms
[2020-05-12 04:10:40] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-05-12 04:10:40] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2020-05-12 04:10:41] [INFO ] Deduced a trap composed of 14 places in 141 ms
[2020-05-12 04:10:41] [INFO ] Deduced a trap composed of 25 places in 313 ms
[2020-05-12 04:10:41] [INFO ] Deduced a trap composed of 15 places in 295 ms
[2020-05-12 04:10:41] [INFO ] Deduced a trap composed of 24 places in 153 ms
[2020-05-12 04:10:42] [INFO ] Deduced a trap composed of 17 places in 289 ms
[2020-05-12 04:10:42] [INFO ] Deduced a trap composed of 27 places in 149 ms
[2020-05-12 04:10:42] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2020-05-12 04:10:42] [INFO ] Deduced a trap composed of 28 places in 321 ms
[2020-05-12 04:10:43] [INFO ] Deduced a trap composed of 25 places in 240 ms
[2020-05-12 04:10:43] [INFO ] Deduced a trap composed of 23 places in 249 ms
[2020-05-12 04:10:43] [INFO ] Deduced a trap composed of 26 places in 159 ms
[2020-05-12 04:10:43] [INFO ] Deduced a trap composed of 129 places in 144 ms
[2020-05-12 04:10:44] [INFO ] Deduced a trap composed of 31 places in 200 ms
[2020-05-12 04:10:44] [INFO ] Deduced a trap composed of 43 places in 162 ms
[2020-05-12 04:10:44] [INFO ] Deduced a trap composed of 46 places in 469 ms
[2020-05-12 04:10:44] [INFO ] Deduced a trap composed of 37 places in 127 ms
[2020-05-12 04:10:44] [INFO ] Deduced a trap composed of 36 places in 82 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 36 places in 207 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 28 places in 149 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 43 places in 74 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 38 places in 68 ms
[2020-05-12 04:10:45] [INFO ] Deduced a trap composed of 36 places in 144 ms
[2020-05-12 04:10:46] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2020-05-12 04:10:46] [INFO ] Deduced a trap composed of 134 places in 144 ms
[2020-05-12 04:10:46] [INFO ] Deduced a trap composed of 72 places in 166 ms
[2020-05-12 04:10:46] [INFO ] Deduced a trap composed of 46 places in 135 ms
[2020-05-12 04:10:46] [INFO ] Deduced a trap composed of 28 places in 179 ms
[2020-05-12 04:10:47] [INFO ] Deduced a trap composed of 133 places in 279 ms
[2020-05-12 04:10:47] [INFO ] Deduced a trap composed of 17 places in 146 ms
[2020-05-12 04:10:47] [INFO ] Deduced a trap composed of 57 places in 139 ms
[2020-05-12 04:10:47] [INFO ] Deduced a trap composed of 127 places in 291 ms
[2020-05-12 04:10:47] [INFO ] Deduced a trap composed of 131 places in 153 ms
[2020-05-12 04:10:48] [INFO ] Deduced a trap composed of 134 places in 316 ms
[2020-05-12 04:10:48] [INFO ] Deduced a trap composed of 45 places in 139 ms
[2020-05-12 04:10:48] [INFO ] Deduced a trap composed of 57 places in 230 ms
[2020-05-12 04:10:48] [INFO ] Deduced a trap composed of 119 places in 291 ms
[2020-05-12 04:10:49] [INFO ] Deduced a trap composed of 127 places in 296 ms
[2020-05-12 04:10:49] [INFO ] Deduced a trap composed of 125 places in 253 ms
[2020-05-12 04:10:49] [INFO ] Deduced a trap composed of 124 places in 172 ms
[2020-05-12 04:10:50] [INFO ] Deduced a trap composed of 125 places in 284 ms
[2020-05-12 04:10:50] [INFO ] Deduced a trap composed of 126 places in 138 ms
[2020-05-12 04:10:50] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2020-05-12 04:10:50] [INFO ] Deduced a trap composed of 47 places in 285 ms
[2020-05-12 04:10:51] [INFO ] Deduced a trap composed of 39 places in 293 ms
[2020-05-12 04:10:51] [INFO ] Deduced a trap composed of 135 places in 233 ms
[2020-05-12 04:10:51] [INFO ] Deduced a trap composed of 57 places in 294 ms
[2020-05-12 04:10:51] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 12381 ms
[2020-05-12 04:10:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:10:51] [INFO ] [Nat]Absence check using 62 positive place invariants in 101 ms returned sat
[2020-05-12 04:10:52] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 50 ms returned sat
[2020-05-12 04:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:10:53] [INFO ] [Nat]Absence check using state equation in 1845 ms returned sat
[2020-05-12 04:10:54] [INFO ] Deduced a trap composed of 18 places in 376 ms
[2020-05-12 04:10:54] [INFO ] Deduced a trap composed of 18 places in 337 ms
[2020-05-12 04:10:54] [INFO ] Deduced a trap composed of 21 places in 322 ms
[2020-05-12 04:10:55] [INFO ] Deduced a trap composed of 14 places in 327 ms
[2020-05-12 04:10:55] [INFO ] Deduced a trap composed of 18 places in 321 ms
[2020-05-12 04:10:56] [INFO ] Deduced a trap composed of 119 places in 339 ms
[2020-05-12 04:10:56] [INFO ] Deduced a trap composed of 12 places in 331 ms
[2020-05-12 04:10:56] [INFO ] Deduced a trap composed of 29 places in 231 ms
[2020-05-12 04:10:56] [INFO ] Deduced a trap composed of 26 places in 292 ms
[2020-05-12 04:10:57] [INFO ] Deduced a trap composed of 16 places in 219 ms
[2020-05-12 04:10:57] [INFO ] Deduced a trap composed of 21 places in 304 ms
[2020-05-12 04:10:58] [INFO ] Deduced a trap composed of 123 places in 573 ms
[2020-05-12 04:10:58] [INFO ] Deduced a trap composed of 26 places in 309 ms
[2020-05-12 04:10:58] [INFO ] Deduced a trap composed of 26 places in 324 ms
[2020-05-12 04:10:59] [INFO ] Deduced a trap composed of 31 places in 342 ms
[2020-05-12 04:11:02] [INFO ] Deduced a trap composed of 33 places in 3079 ms
[2020-05-12 04:11:02] [INFO ] Deduced a trap composed of 125 places in 437 ms
[2020-05-12 04:11:02] [INFO ] Deduced a trap composed of 130 places in 171 ms
[2020-05-12 04:11:03] [INFO ] Deduced a trap composed of 31 places in 181 ms
[2020-05-12 04:11:03] [INFO ] Deduced a trap composed of 59 places in 143 ms
[2020-05-12 04:11:03] [INFO ] Deduced a trap composed of 121 places in 144 ms
[2020-05-12 04:11:03] [INFO ] Deduced a trap composed of 43 places in 157 ms
[2020-05-12 04:11:03] [INFO ] Deduced a trap composed of 123 places in 141 ms
[2020-05-12 04:11:03] [INFO ] Deduced a trap composed of 54 places in 100 ms
[2020-05-12 04:11:04] [INFO ] Deduced a trap composed of 47 places in 150 ms
[2020-05-12 04:11:04] [INFO ] Deduced a trap composed of 119 places in 219 ms
[2020-05-12 04:11:04] [INFO ] Deduced a trap composed of 127 places in 147 ms
[2020-05-12 04:11:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10712 ms
[2020-05-12 04:11:04] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 24 ms.
[2020-05-12 04:11:09] [INFO ] Added : 419 causal constraints over 84 iterations in 4520 ms. Result :sat
[2020-05-12 04:11:11] [INFO ] Deduced a trap composed of 164 places in 2642 ms
[2020-05-12 04:11:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s30 s31 s34 s35 s50 s51 s54 s63 s64 s65 s66 s71 s72 s73 s74 s75 s76 s77 s78 s83 s84 s85 s94 s103 s119 s152 s155 s156 s182 s183 s184 s194 s195 s196 s199 s200 s208 s226 s227 s228 s246 s247 s251 s252 s253 s263 s264 s265 s266 s267 s268 s269 s270 s297 s306 s307 s308 s311 s312 s313 s317 s351 s366 s376 s386 s396 s416 s419 s421 s422 s423 s431 s436 s445 s447 s451 s456 s460 s461 s462 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s486 s487 s496 s497 s498 s499 s500 s501 s502 s503 s504 s509 s510 s513 s514 s515 s516 s517 s519 s520 s521 s522 s524 s525 s526 s528 s529 s530 s533 s534 s535 s536 s537 s538 s539 s548 s549 s552 s553 s554 s555 s556 s557 s558 s559 s566 s567 s568 s569 s572 s577 s578 s581 s582 s593 s594 s595 s596 s597 s598 s607 s610 s611 s618 s619 s620 s625 s626 s627 s633 s644 s645) 0)") while checking expression at index 14
[2020-05-12 04:11:11] [INFO ] [Real]Absence check using 62 positive place invariants in 49 ms returned sat
[2020-05-12 04:11:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-05-12 04:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:11:12] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2020-05-12 04:11:13] [INFO ] Deduced a trap composed of 29 places in 1081 ms
[2020-05-12 04:11:14] [INFO ] Deduced a trap composed of 14 places in 154 ms
[2020-05-12 04:11:14] [INFO ] Deduced a trap composed of 120 places in 153 ms
[2020-05-12 04:11:18] [INFO ] Deduced a trap composed of 31 places in 4139 ms
[2020-05-12 04:11:18] [INFO ] Deduced a trap composed of 129 places in 151 ms
[2020-05-12 04:11:18] [INFO ] Deduced a trap composed of 134 places in 147 ms
[2020-05-12 04:11:18] [INFO ] Deduced a trap composed of 131 places in 173 ms
[2020-05-12 04:11:19] [INFO ] Deduced a trap composed of 124 places in 289 ms
[2020-05-12 04:11:19] [INFO ] Deduced a trap composed of 12 places in 174 ms
[2020-05-12 04:11:19] [INFO ] Deduced a trap composed of 130 places in 191 ms
[2020-05-12 04:11:19] [INFO ] Deduced a trap composed of 25 places in 154 ms
[2020-05-12 04:11:20] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2020-05-12 04:11:20] [INFO ] Deduced a trap composed of 50 places in 176 ms
[2020-05-12 04:11:20] [INFO ] Deduced a trap composed of 28 places in 156 ms
[2020-05-12 04:11:20] [INFO ] Deduced a trap composed of 53 places in 267 ms
[2020-05-12 04:11:20] [INFO ] Deduced a trap composed of 26 places in 258 ms
[2020-05-12 04:11:21] [INFO ] Deduced a trap composed of 17 places in 250 ms
[2020-05-12 04:11:21] [INFO ] Deduced a trap composed of 58 places in 138 ms
[2020-05-12 04:11:21] [INFO ] Deduced a trap composed of 63 places in 139 ms
[2020-05-12 04:11:21] [INFO ] Deduced a trap composed of 17 places in 264 ms
[2020-05-12 04:11:22] [INFO ] Deduced a trap composed of 20 places in 301 ms
[2020-05-12 04:11:22] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2020-05-12 04:11:22] [INFO ] Deduced a trap composed of 24 places in 121 ms
[2020-05-12 04:11:22] [INFO ] Deduced a trap composed of 130 places in 242 ms
[2020-05-12 04:11:22] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-05-12 04:11:23] [INFO ] Deduced a trap composed of 124 places in 406 ms
[2020-05-12 04:11:23] [INFO ] Deduced a trap composed of 55 places in 132 ms
[2020-05-12 04:11:23] [INFO ] Deduced a trap composed of 127 places in 214 ms
[2020-05-12 04:11:24] [INFO ] Deduced a trap composed of 125 places in 230 ms
[2020-05-12 04:11:24] [INFO ] Deduced a trap composed of 126 places in 299 ms
[2020-05-12 04:11:24] [INFO ] Deduced a trap composed of 119 places in 212 ms
[2020-05-12 04:11:24] [INFO ] Deduced a trap composed of 127 places in 126 ms
[2020-05-12 04:11:25] [INFO ] Deduced a trap composed of 57 places in 280 ms
[2020-05-12 04:11:25] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 12413 ms
[2020-05-12 04:11:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:11:25] [INFO ] [Nat]Absence check using 62 positive place invariants in 157 ms returned sat
[2020-05-12 04:11:25] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 101 ms returned sat
[2020-05-12 04:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:11:26] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2020-05-12 04:11:27] [INFO ] Deduced a trap composed of 11 places in 450 ms
[2020-05-12 04:11:27] [INFO ] Deduced a trap composed of 17 places in 327 ms
[2020-05-12 04:11:27] [INFO ] Deduced a trap composed of 15 places in 226 ms
[2020-05-12 04:11:28] [INFO ] Deduced a trap composed of 17 places in 463 ms
[2020-05-12 04:11:28] [INFO ] Deduced a trap composed of 19 places in 197 ms
[2020-05-12 04:11:28] [INFO ] Deduced a trap composed of 20 places in 180 ms
[2020-05-12 04:11:28] [INFO ] Deduced a trap composed of 28 places in 192 ms
[2020-05-12 04:11:29] [INFO ] Deduced a trap composed of 12 places in 367 ms
[2020-05-12 04:11:29] [INFO ] Deduced a trap composed of 25 places in 270 ms
[2020-05-12 04:11:29] [INFO ] Deduced a trap composed of 129 places in 153 ms
[2020-05-12 04:11:30] [INFO ] Deduced a trap composed of 8 places in 435 ms
[2020-05-12 04:11:30] [INFO ] Deduced a trap composed of 21 places in 180 ms
[2020-05-12 04:11:30] [INFO ] Deduced a trap composed of 24 places in 286 ms
[2020-05-12 04:11:30] [INFO ] Deduced a trap composed of 47 places in 241 ms
[2020-05-12 04:11:31] [INFO ] Deduced a trap composed of 140 places in 253 ms
[2020-05-12 04:11:31] [INFO ] Deduced a trap composed of 128 places in 246 ms
[2020-05-12 04:11:31] [INFO ] Deduced a trap composed of 136 places in 314 ms
[2020-05-12 04:11:32] [INFO ] Deduced a trap composed of 134 places in 366 ms
[2020-05-12 04:11:32] [INFO ] Deduced a trap composed of 135 places in 181 ms
[2020-05-12 04:11:32] [INFO ] Deduced a trap composed of 129 places in 209 ms
[2020-05-12 04:11:33] [INFO ] Deduced a trap composed of 26 places in 313 ms
[2020-05-12 04:11:33] [INFO ] Deduced a trap composed of 127 places in 255 ms
[2020-05-12 04:11:33] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6711 ms
[2020-05-12 04:11:33] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 36 ms.
[2020-05-12 04:11:37] [INFO ] Added : 399 causal constraints over 80 iterations in 4608 ms. Result :sat
[2020-05-12 04:11:38] [INFO ] Deduced a trap composed of 137 places in 306 ms
[2020-05-12 04:11:38] [INFO ] Deduced a trap composed of 137 places in 277 ms
[2020-05-12 04:11:38] [INFO ] Deduced a trap composed of 135 places in 154 ms
[2020-05-12 04:11:39] [INFO ] Deduced a trap composed of 145 places in 143 ms
[2020-05-12 04:11:39] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-05-12 04:11:39] [INFO ] Deduced a trap composed of 142 places in 157 ms
[2020-05-12 04:11:39] [INFO ] Deduced a trap composed of 140 places in 205 ms
[2020-05-12 04:11:40] [INFO ] Deduced a trap composed of 142 places in 133 ms
[2020-05-12 04:11:40] [INFO ] Deduced a trap composed of 137 places in 196 ms
[2020-05-12 04:11:40] [INFO ] Deduced a trap composed of 138 places in 274 ms
[2020-05-12 04:11:40] [INFO ] Deduced a trap composed of 137 places in 126 ms
[2020-05-12 04:11:41] [INFO ] Deduced a trap composed of 145 places in 163 ms
[2020-05-12 04:11:41] [INFO ] Deduced a trap composed of 147 places in 131 ms
[2020-05-12 04:11:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3395 ms
[2020-05-12 04:11:41] [INFO ] [Real]Absence check using 62 positive place invariants in 61 ms returned sat
[2020-05-12 04:11:41] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-05-12 04:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:11:42] [INFO ] [Real]Absence check using state equation in 639 ms returned unsat
[2020-05-12 04:11:42] [INFO ] [Real]Absence check using 62 positive place invariants in 199 ms returned sat
[2020-05-12 04:11:42] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 51 ms returned sat
[2020-05-12 04:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:11:43] [INFO ] [Real]Absence check using state equation in 838 ms returned unsat
[2020-05-12 04:11:43] [INFO ] [Real]Absence check using 62 positive place invariants in 251 ms returned sat
[2020-05-12 04:11:43] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 21 ms returned sat
[2020-05-12 04:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:11:44] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2020-05-12 04:11:45] [INFO ] Deduced a trap composed of 17 places in 391 ms
[2020-05-12 04:11:45] [INFO ] Deduced a trap composed of 16 places in 147 ms
[2020-05-12 04:11:45] [INFO ] Deduced a trap composed of 19 places in 288 ms
[2020-05-12 04:11:45] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2020-05-12 04:11:45] [INFO ] Deduced a trap composed of 34 places in 163 ms
[2020-05-12 04:11:46] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-05-12 04:11:46] [INFO ] Deduced a trap composed of 27 places in 253 ms
[2020-05-12 04:11:46] [INFO ] Deduced a trap composed of 24 places in 275 ms
[2020-05-12 04:11:46] [INFO ] Deduced a trap composed of 24 places in 172 ms
[2020-05-12 04:11:47] [INFO ] Deduced a trap composed of 25 places in 169 ms
[2020-05-12 04:11:47] [INFO ] Deduced a trap composed of 12 places in 265 ms
[2020-05-12 04:11:47] [INFO ] Deduced a trap composed of 51 places in 257 ms
[2020-05-12 04:11:47] [INFO ] Deduced a trap composed of 55 places in 174 ms
[2020-05-12 04:11:48] [INFO ] Deduced a trap composed of 75 places in 276 ms
[2020-05-12 04:11:50] [INFO ] Deduced a trap composed of 152 places in 1823 ms
[2020-05-12 04:11:51] [INFO ] Deduced a trap composed of 18 places in 1433 ms
[2020-05-12 04:11:53] [INFO ] Deduced a trap composed of 141 places in 2105 ms
[2020-05-12 04:11:53] [INFO ] Deduced a trap composed of 22 places in 297 ms
[2020-05-12 04:11:54] [INFO ] Deduced a trap composed of 139 places in 749 ms
[2020-05-12 04:11:54] [INFO ] Deduced a trap composed of 48 places in 195 ms
[2020-05-12 04:11:55] [INFO ] Deduced a trap composed of 67 places in 158 ms
[2020-05-12 04:11:55] [INFO ] Deduced a trap composed of 147 places in 134 ms
[2020-05-12 04:11:55] [INFO ] Deduced a trap composed of 142 places in 157 ms
[2020-05-12 04:11:55] [INFO ] Deduced a trap composed of 44 places in 120 ms
[2020-05-12 04:11:55] [INFO ] Deduced a trap composed of 143 places in 113 ms
[2020-05-12 04:11:55] [INFO ] Deduced a trap composed of 15 places in 139 ms
[2020-05-12 04:11:56] [INFO ] Deduced a trap composed of 24 places in 215 ms
[2020-05-12 04:11:56] [INFO ] Deduced a trap composed of 148 places in 124 ms
[2020-05-12 04:11:56] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 11671 ms
[2020-05-12 04:11:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:11:56] [INFO ] [Nat]Absence check using 62 positive place invariants in 270 ms returned sat
[2020-05-12 04:11:56] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2020-05-12 04:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:11:57] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2020-05-12 04:11:57] [INFO ] Deduced a trap composed of 19 places in 443 ms
[2020-05-12 04:11:58] [INFO ] Deduced a trap composed of 19 places in 169 ms
[2020-05-12 04:11:58] [INFO ] Deduced a trap composed of 11 places in 187 ms
[2020-05-12 04:11:58] [INFO ] Deduced a trap composed of 22 places in 176 ms
[2020-05-12 04:11:58] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-05-12 04:11:58] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-05-12 04:11:59] [INFO ] Deduced a trap composed of 14 places in 178 ms
[2020-05-12 04:11:59] [INFO ] Deduced a trap composed of 22 places in 181 ms
[2020-05-12 04:11:59] [INFO ] Deduced a trap composed of 28 places in 290 ms
[2020-05-12 04:11:59] [INFO ] Deduced a trap composed of 26 places in 201 ms
[2020-05-12 04:12:00] [INFO ] Deduced a trap composed of 23 places in 161 ms
[2020-05-12 04:12:00] [INFO ] Deduced a trap composed of 25 places in 147 ms
[2020-05-12 04:12:00] [INFO ] Deduced a trap composed of 20 places in 147 ms
[2020-05-12 04:12:00] [INFO ] Deduced a trap composed of 18 places in 153 ms
[2020-05-12 04:12:00] [INFO ] Deduced a trap composed of 30 places in 205 ms
[2020-05-12 04:12:01] [INFO ] Deduced a trap composed of 17 places in 127 ms
[2020-05-12 04:12:01] [INFO ] Deduced a trap composed of 29 places in 189 ms
[2020-05-12 04:12:01] [INFO ] Deduced a trap composed of 135 places in 297 ms
[2020-05-12 04:12:01] [INFO ] Deduced a trap composed of 53 places in 322 ms
[2020-05-12 04:12:02] [INFO ] Deduced a trap composed of 130 places in 321 ms
[2020-05-12 04:12:04] [INFO ] Deduced a trap composed of 21 places in 2118 ms
[2020-05-12 04:12:04] [INFO ] Deduced a trap composed of 50 places in 404 ms
[2020-05-12 04:12:05] [INFO ] Deduced a trap composed of 152 places in 129 ms
[2020-05-12 04:12:05] [INFO ] Deduced a trap composed of 151 places in 136 ms
[2020-05-12 04:12:05] [INFO ] Deduced a trap composed of 134 places in 145 ms
[2020-05-12 04:12:05] [INFO ] Deduced a trap composed of 131 places in 268 ms
[2020-05-12 04:12:05] [INFO ] Deduced a trap composed of 129 places in 161 ms
[2020-05-12 04:12:06] [INFO ] Deduced a trap composed of 154 places in 196 ms
[2020-05-12 04:12:06] [INFO ] Deduced a trap composed of 152 places in 361 ms
[2020-05-12 04:12:06] [INFO ] Deduced a trap composed of 32 places in 238 ms
[2020-05-12 04:12:06] [INFO ] Deduced a trap composed of 17 places in 121 ms
[2020-05-12 04:12:06] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9376 ms
[2020-05-12 04:12:06] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 22 ms.
[2020-05-12 04:12:10] [INFO ] Added : 360 causal constraints over 72 iterations in 3891 ms. Result :sat
[2020-05-12 04:12:11] [INFO ] [Real]Absence check using 62 positive place invariants in 347 ms returned sat
[2020-05-12 04:12:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 22 ms returned sat
[2020-05-12 04:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:12:12] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2020-05-12 04:12:12] [INFO ] Deduced a trap composed of 15 places in 346 ms
[2020-05-12 04:12:12] [INFO ] Deduced a trap composed of 22 places in 317 ms
[2020-05-12 04:12:13] [INFO ] Deduced a trap composed of 21 places in 303 ms
[2020-05-12 04:12:13] [INFO ] Deduced a trap composed of 24 places in 315 ms
[2020-05-12 04:12:14] [INFO ] Deduced a trap composed of 12 places in 507 ms
[2020-05-12 04:12:14] [INFO ] Deduced a trap composed of 12 places in 166 ms
[2020-05-12 04:12:14] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2020-05-12 04:12:14] [INFO ] Deduced a trap composed of 24 places in 150 ms
[2020-05-12 04:12:14] [INFO ] Deduced a trap composed of 19 places in 123 ms
[2020-05-12 04:12:15] [INFO ] Deduced a trap composed of 28 places in 105 ms
[2020-05-12 04:12:15] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2020-05-12 04:12:15] [INFO ] Deduced a trap composed of 21 places in 101 ms
[2020-05-12 04:12:15] [INFO ] Deduced a trap composed of 48 places in 80 ms
[2020-05-12 04:12:15] [INFO ] Deduced a trap composed of 21 places in 123 ms
[2020-05-12 04:12:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3335 ms
[2020-05-12 04:12:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:12:15] [INFO ] [Nat]Absence check using 62 positive place invariants in 100 ms returned sat
[2020-05-12 04:12:15] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 40 ms returned sat
[2020-05-12 04:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:12:16] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2020-05-12 04:12:17] [INFO ] Deduced a trap composed of 11 places in 392 ms
[2020-05-12 04:12:17] [INFO ] Deduced a trap composed of 14 places in 321 ms
[2020-05-12 04:12:18] [INFO ] Deduced a trap composed of 15 places in 337 ms
[2020-05-12 04:12:18] [INFO ] Deduced a trap composed of 17 places in 291 ms
[2020-05-12 04:12:18] [INFO ] Deduced a trap composed of 23 places in 318 ms
[2020-05-12 04:12:19] [INFO ] Deduced a trap composed of 21 places in 313 ms
[2020-05-12 04:12:19] [INFO ] Deduced a trap composed of 21 places in 650 ms
[2020-05-12 04:12:20] [INFO ] Deduced a trap composed of 28 places in 358 ms
[2020-05-12 04:12:20] [INFO ] Deduced a trap composed of 20 places in 322 ms
[2020-05-12 04:12:20] [INFO ] Deduced a trap composed of 17 places in 335 ms
[2020-05-12 04:12:21] [INFO ] Deduced a trap composed of 130 places in 310 ms
[2020-05-12 04:12:21] [INFO ] Deduced a trap composed of 47 places in 305 ms
[2020-05-12 04:12:21] [INFO ] Deduced a trap composed of 47 places in 329 ms
[2020-05-12 04:12:22] [INFO ] Deduced a trap composed of 69 places in 283 ms
[2020-05-12 04:12:22] [INFO ] Deduced a trap composed of 143 places in 375 ms
[2020-05-12 04:12:22] [INFO ] Deduced a trap composed of 50 places in 287 ms
[2020-05-12 04:12:23] [INFO ] Deduced a trap composed of 71 places in 342 ms
[2020-05-12 04:12:23] [INFO ] Deduced a trap composed of 73 places in 302 ms
[2020-05-12 04:12:24] [INFO ] Deduced a trap composed of 24 places in 307 ms
[2020-05-12 04:12:24] [INFO ] Deduced a trap composed of 146 places in 298 ms
[2020-05-12 04:12:24] [INFO ] Deduced a trap composed of 144 places in 289 ms
[2020-05-12 04:12:24] [INFO ] Deduced a trap composed of 144 places in 318 ms
[2020-05-12 04:12:25] [INFO ] Deduced a trap composed of 142 places in 289 ms
[2020-05-12 04:12:25] [INFO ] Deduced a trap composed of 138 places in 291 ms
[2020-05-12 04:12:25] [INFO ] Deduced a trap composed of 139 places in 295 ms
[2020-05-12 04:12:26] [INFO ] Deduced a trap composed of 142 places in 274 ms
[2020-05-12 04:12:26] [INFO ] Deduced a trap composed of 139 places in 302 ms
[2020-05-12 04:12:26] [INFO ] Deduced a trap composed of 143 places in 294 ms
[2020-05-12 04:12:29] [INFO ] Deduced a trap composed of 142 places in 2873 ms
[2020-05-12 04:12:30] [INFO ] Deduced a trap composed of 143 places in 1058 ms
[2020-05-12 04:12:31] [INFO ] Deduced a trap composed of 143 places in 145 ms
[2020-05-12 04:12:31] [INFO ] Deduced a trap composed of 140 places in 167 ms
[2020-05-12 04:12:31] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 14351 ms
[2020-05-12 04:12:31] [INFO ] Computed and/alt/rep : 575/2602/575 causal constraints in 22 ms.
[2020-05-12 04:12:34] [INFO ] Added : 375 causal constraints over 75 iterations in 3490 ms. Result :sat
[2020-05-12 04:12:35] [INFO ] [Real]Absence check using 62 positive place invariants in 69 ms returned sat
[2020-05-12 04:12:35] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 39 ms returned sat
[2020-05-12 04:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:12:37] [INFO ] [Real]Absence check using state equation in 2863 ms returned sat
[2020-05-12 04:12:40] [INFO ] Deduced a trap composed of 11 places in 2311 ms
[2020-05-12 04:12:40] [INFO ] Deduced a trap composed of 19 places in 192 ms
[2020-05-12 04:12:40] [INFO ] Deduced a trap composed of 15 places in 403 ms
[2020-05-12 04:12:41] [INFO ] Deduced a trap composed of 119 places in 271 ms
[2020-05-12 04:12:41] [INFO ] Deduced a trap composed of 11 places in 381 ms
[2020-05-12 04:12:42] [INFO ] Deduced a trap composed of 18 places in 389 ms
[2020-05-12 04:12:42] [INFO ] Deduced a trap composed of 24 places in 167 ms
[2020-05-12 04:12:42] [INFO ] Deduced a trap composed of 21 places in 237 ms
[2020-05-12 04:12:42] [INFO ] Deduced a trap composed of 26 places in 181 ms
[2020-05-12 04:12:42] [INFO ] Deduced a trap composed of 22 places in 189 ms
[2020-05-12 04:12:43] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2020-05-12 04:12:43] [INFO ] Deduced a trap composed of 28 places in 208 ms
[2020-05-12 04:12:43] [INFO ] Deduced a trap composed of 142 places in 325 ms
[2020-05-12 04:12:44] [INFO ] Deduced a trap composed of 37 places in 530 ms
[2020-05-12 04:12:44] [INFO ] Deduced a trap composed of 143 places in 180 ms
[2020-05-12 04:12:44] [INFO ] Deduced a trap composed of 28 places in 162 ms
[2020-05-12 04:12:44] [INFO ] Deduced a trap composed of 130 places in 241 ms
[2020-05-12 04:12:45] [INFO ] Deduced a trap composed of 27 places in 189 ms
[2020-05-12 04:12:45] [INFO ] Deduced a trap composed of 128 places in 168 ms
[2020-05-12 04:12:45] [INFO ] Deduced a trap composed of 36 places in 365 ms
[2020-05-12 04:12:46] [INFO ] Deduced a trap composed of 50 places in 235 ms
[2020-05-12 04:12:46] [INFO ] Deduced a trap composed of 130 places in 209 ms
[2020-05-12 04:12:46] [INFO ] Deduced a trap composed of 124 places in 202 ms
[2020-05-12 04:12:46] [INFO ] Deduced a trap composed of 44 places in 173 ms
[2020-05-12 04:12:46] [INFO ] Deduced a trap composed of 57 places in 198 ms
[2020-05-12 04:12:47] [INFO ] Deduced a trap composed of 30 places in 156 ms
[2020-05-12 04:12:47] [INFO ] Deduced a trap composed of 30 places in 151 ms
[2020-05-12 04:12:47] [INFO ] Deduced a trap composed of 130 places in 239 ms
[2020-05-12 04:12:47] [INFO ] Deduced a trap composed of 43 places in 263 ms
[2020-05-12 04:12:48] [INFO ] Deduced a trap composed of 45 places in 183 ms
[2020-05-12 04:12:48] [INFO ] Deduced a trap composed of 146 places in 192 ms
[2020-05-12 04:12:48] [INFO ] Deduced a trap composed of 30 places in 163 ms
[2020-05-12 04:12:48] [INFO ] Deduced a trap composed of 26 places in 167 ms
[2020-05-12 04:12:48] [INFO ] Deduced a trap composed of 56 places in 183 ms
[2020-05-12 04:12:49] [INFO ] Deduced a trap composed of 144 places in 201 ms
[2020-05-12 04:12:49] [INFO ] Deduced a trap composed of 149 places in 170 ms
[2020-05-12 04:12:49] [INFO ] Deduced a trap composed of 29 places in 178 ms
[2020-05-12 04:12:49] [INFO ] Deduced a trap composed of 30 places in 156 ms
[2020-05-12 04:12:49] [INFO ] Deduced a trap composed of 155 places in 148 ms
[2020-05-12 04:12:50] [INFO ] Deduced a trap composed of 39 places in 153 ms
[2020-05-12 04:12:50] [INFO ] Deduced a trap composed of 146 places in 219 ms
[2020-05-12 04:12:50] [INFO ] Deduced a trap composed of 145 places in 147 ms
[2020-05-12 04:12:50] [INFO ] Deduced a trap composed of 150 places in 144 ms
[2020-05-12 04:12:50] [INFO ] Deduced a trap composed of 147 places in 239 ms
[2020-05-12 04:12:51] [INFO ] Deduced a trap composed of 36 places in 184 ms
[2020-05-12 04:12:51] [INFO ] Deduced a trap composed of 49 places in 148 ms
[2020-05-12 04:12:51] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2020-05-12 04:12:51] [INFO ] Deduced a trap composed of 160 places in 166 ms
[2020-05-12 04:12:51] [INFO ] Deduced a trap composed of 42 places in 144 ms
[2020-05-12 04:12:52] [INFO ] Deduced a trap composed of 141 places in 153 ms
[2020-05-12 04:12:52] [INFO ] Deduced a trap composed of 141 places in 147 ms
[2020-05-12 04:12:52] [INFO ] Deduced a trap composed of 148 places in 164 ms
[2020-05-12 04:12:52] [INFO ] Deduced a trap composed of 167 places in 149 ms
[2020-05-12 04:12:52] [INFO ] Deduced a trap composed of 144 places in 147 ms
[2020-05-12 04:12:53] [INFO ] Deduced a trap composed of 144 places in 151 ms
[2020-05-12 04:12:53] [INFO ] Deduced a trap composed of 144 places in 150 ms
[2020-05-12 04:12:53] [INFO ] Deduced a trap composed of 138 places in 149 ms
[2020-05-12 04:12:53] [INFO ] Deduced a trap composed of 138 places in 147 ms
[2020-05-12 04:12:53] [INFO ] Deduced a trap composed of 141 places in 156 ms
[2020-05-12 04:12:53] [INFO ] Deduced a trap composed of 143 places in 143 ms
[2020-05-12 04:12:54] [INFO ] Deduced a trap composed of 160 places in 209 ms
[2020-05-12 04:12:54] [INFO ] Deduced a trap composed of 145 places in 144 ms
[2020-05-12 04:12:54] [INFO ] Deduced a trap composed of 141 places in 150 ms
[2020-05-12 04:12:54] [INFO ] Deduced a trap composed of 143 places in 153 ms
[2020-05-12 04:12:54] [INFO ] Deduced a trap composed of 139 places in 132 ms
[2020-05-12 04:12:54] [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 s30 s31 s34 s35 s46 s47 s48 s59 s60 s61 s92 s94 s96 s98 s103 s104 s105 s106 s109 s110 s111 s119 s122 s131 s168 s174 s175 s177 s178 s188 s189 s190 s194 s195 s196 s214 s215 s216 s248 s251 s252 s253 s302 s307 s312 s317 s321 s322 s323 s331 s340 s342 s351 s361 s366 s371 s376 s381 s391 s396 s411 s416 s421 s431 s436 s441 s445 s446 s447 s451 s456 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s477 s478 s486 s487 s492 s493 s496 s497 s498 s499 s500 s505 s506 s509 s510 s511 s512 s513 s514 s515 s516 s524 s538 s539 s540 s541 s542 s543 s548 s549 s552 s553 s554 s555 s560 s561 s562 s563 s573 s574 s581 s582 s585 s586 s593 s594 s599 s600 s607 s633 s643) 0)") while checking expression at index 20
[2020-05-12 04:12:55] [INFO ] [Real]Absence check using 62 positive place invariants in 316 ms returned sat
[2020-05-12 04:12:55] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 184 ms returned sat
[2020-05-12 04:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:12:59] [INFO ] [Real]Absence check using state equation in 4330 ms returned sat
[2020-05-12 04:13:00] [INFO ] Deduced a trap composed of 8 places in 171 ms
[2020-05-12 04:13:00] [INFO ] Deduced a trap composed of 16 places in 154 ms
[2020-05-12 04:13:00] [INFO ] Deduced a trap composed of 121 places in 152 ms
[2020-05-12 04:13:00] [INFO ] Deduced a trap composed of 118 places in 151 ms
[2020-05-12 04:13:00] [INFO ] Deduced a trap composed of 19 places in 151 ms
[2020-05-12 04:13:01] [INFO ] Deduced a trap composed of 11 places in 1108 ms
[2020-05-12 04:13:02] [INFO ] Deduced a trap composed of 16 places in 348 ms
[2020-05-12 04:13:03] [INFO ] Deduced a trap composed of 139 places in 907 ms
[2020-05-12 04:13:03] [INFO ] Deduced a trap composed of 120 places in 211 ms
[2020-05-12 04:13:03] [INFO ] Deduced a trap composed of 19 places in 355 ms
[2020-05-12 04:13:04] [INFO ] Deduced a trap composed of 23 places in 327 ms
[2020-05-12 04:13:04] [INFO ] Deduced a trap composed of 21 places in 316 ms
[2020-05-12 04:13:04] [INFO ] Deduced a trap composed of 20 places in 380 ms
[2020-05-12 04:13:05] [INFO ] Deduced a trap composed of 26 places in 310 ms
[2020-05-12 04:13:05] [INFO ] Deduced a trap composed of 11 places in 299 ms
[2020-05-12 04:13:05] [INFO ] Deduced a trap composed of 29 places in 309 ms
[2020-05-12 04:13:06] [INFO ] Deduced a trap composed of 18 places in 309 ms
[2020-05-12 04:13:09] [INFO ] Deduced a trap composed of 21 places in 2740 ms
[2020-05-12 04:13:12] [INFO ] Deduced a trap composed of 129 places in 3462 ms
[2020-05-12 04:13:15] [INFO ] Deduced a trap composed of 32 places in 2762 ms
[2020-05-12 04:13:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s54 s55 s220 s221 s222 s232 s233 s234 s251 s252 s253 s259 s262 s316 s317 s318 s425 s426 s427 s431 s436 s441 s446 s451 s456 s593 s594 s599 s600) 0)") while checking expression at index 21
[2020-05-12 04:13:15] [INFO ] [Real]Absence check using 62 positive place invariants in 415 ms returned sat
[2020-05-12 04:13:15] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 76 ms returned sat
[2020-05-12 04:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:13:16] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2020-05-12 04:13:18] [INFO ] Deduced a trap composed of 14 places in 2094 ms
[2020-05-12 04:13:19] [INFO ] Deduced a trap composed of 23 places in 373 ms
[2020-05-12 04:13:19] [INFO ] Deduced a trap composed of 28 places in 265 ms
[2020-05-12 04:13:20] [INFO ] Deduced a trap composed of 11 places in 677 ms
[2020-05-12 04:13:20] [INFO ] Deduced a trap composed of 11 places in 153 ms
[2020-05-12 04:13:20] [INFO ] Deduced a trap composed of 129 places in 168 ms
[2020-05-12 04:13:20] [INFO ] Deduced a trap composed of 16 places in 107 ms
[2020-05-12 04:13:20] [INFO ] Deduced a trap composed of 28 places in 104 ms
[2020-05-12 04:13:21] [INFO ] Deduced a trap composed of 30 places in 176 ms
[2020-05-12 04:13:21] [INFO ] Deduced a trap composed of 25 places in 542 ms
[2020-05-12 04:13:21] [INFO ] Deduced a trap composed of 22 places in 158 ms
[2020-05-12 04:13:22] [INFO ] Deduced a trap composed of 19 places in 199 ms
[2020-05-12 04:13:22] [INFO ] Deduced a trap composed of 52 places in 327 ms
[2020-05-12 04:13:22] [INFO ] Deduced a trap composed of 21 places in 291 ms
[2020-05-12 04:13:22] [INFO ] Deduced a trap composed of 33 places in 194 ms
[2020-05-12 04:13:23] [INFO ] Deduced a trap composed of 29 places in 150 ms
[2020-05-12 04:13:23] [INFO ] Deduced a trap composed of 127 places in 201 ms
[2020-05-12 04:13:23] [INFO ] Deduced a trap composed of 26 places in 280 ms
[2020-05-12 04:13:24] [INFO ] Deduced a trap composed of 121 places in 288 ms
[2020-05-12 04:13:24] [INFO ] Deduced a trap composed of 121 places in 313 ms
[2020-05-12 04:13:24] [INFO ] Deduced a trap composed of 23 places in 268 ms
[2020-05-12 04:13:24] [INFO ] Deduced a trap composed of 20 places in 300 ms
[2020-05-12 04:13:25] [INFO ] Deduced a trap composed of 143 places in 265 ms
[2020-05-12 04:13:25] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2020-05-12 04:13:25] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-05-12 04:13:25] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2020-05-12 04:13:25] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 8922 ms
[2020-05-12 04:13:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:13:25] [INFO ] [Nat]Absence check using 62 positive place invariants in 100 ms returned sat
[2020-05-12 04:13:25] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2020-05-12 04:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:13:26] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2020-05-12 04:13:26] [INFO ] Deduced a trap composed of 14 places in 186 ms
[2020-05-12 04:13:27] [INFO ] Deduced a trap composed of 28 places in 174 ms
[2020-05-12 04:13:27] [INFO ] Deduced a trap composed of 11 places in 173 ms
[2020-05-12 04:13:27] [INFO ] Deduced a trap composed of 18 places in 295 ms
[2020-05-12 04:13:27] [INFO ] Deduced a trap composed of 29 places in 172 ms
[2020-05-12 04:13:28] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2020-05-12 04:13:28] [INFO ] Deduced a trap composed of 45 places in 205 ms
[2020-05-12 04:13:28] [INFO ] Deduced a trap composed of 44 places in 383 ms
[2020-05-12 04:13:29] [INFO ] Deduced a trap composed of 16 places in 281 ms
[2020-05-12 04:13:29] [INFO ] Deduced a trap composed of 25 places in 283 ms
[2020-05-12 04:13:29] [INFO ] Deduced a trap composed of 124 places in 290 ms
[2020-05-12 04:13:29] [INFO ] Deduced a trap composed of 17 places in 312 ms
[2020-05-12 04:13:30] [INFO ] Deduced a trap composed of 15 places in 325 ms
[2020-05-12 04:13:30] [INFO ] Deduced a trap composed of 21 places in 146 ms
[2020-05-12 04:13:30] [INFO ] Deduced a trap composed of 17 places in 311 ms
[2020-05-12 04:13:31] [INFO ] Deduced a trap composed of 20 places in 494 ms
[2020-05-12 04:13:31] [INFO ] Deduced a trap composed of 126 places in 269 ms
[2020-05-12 04:13:32] [INFO ] Deduced a trap composed of 22 places in 617 ms
[2020-05-12 04:13:33] [INFO ] Deduced a trap composed of 49 places in 923 ms
[2020-05-12 04:13:33] [INFO ] Deduced a trap composed of 129 places in 206 ms
[2020-05-12 04:13:33] [INFO ] Deduced a trap composed of 125 places in 292 ms
[2020-05-12 04:13:33] [INFO ] Deduced a trap composed of 46 places in 143 ms
[2020-05-12 04:13:34] [INFO ] Deduced a trap composed of 123 places in 130 ms
[2020-05-12 04:13:34] [INFO ] Deduced a trap composed of 137 places in 423 ms
[2020-05-12 04:13:34] [INFO ] Deduced a trap composed of 129 places in 167 ms
[2020-05-12 04:13:35] [INFO ] Deduced a trap composed of 124 places in 318 ms
[2020-05-12 04:13:35] [INFO ] Deduced a trap composed of 130 places in 329 ms
[2020-05-12 04:13:35] [INFO ] Deduced a trap composed of 122 places in 290 ms
[2020-05-12 04:13:36] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2020-05-12 04:13:36] [INFO ] Deduced a trap composed of 148 places in 290 ms
[2020-05-12 04:13:36] [INFO ] Deduced a trap composed of 130 places in 188 ms
[2020-05-12 04:13:36] [INFO ] Deduced a trap composed of 27 places in 206 ms
[2020-05-12 04:13:37] [INFO ] Deduced a trap composed of 62 places in 281 ms
[2020-05-12 04:13:37] [INFO ] Deduced a trap composed of 60 places in 134 ms
[2020-05-12 04:13:37] [INFO ] Deduced a trap composed of 135 places in 231 ms
[2020-05-12 04:13:37] [INFO ] Deduced a trap composed of 129 places in 200 ms
[2020-05-12 04:13:37] [INFO ] Deduced a trap composed of 132 places in 227 ms
[2020-05-12 04:13:38] [INFO ] Deduced a trap composed of 42 places in 151 ms
[2020-05-12 04:13:38] [INFO ] Deduced a trap composed of 129 places in 211 ms
[2020-05-12 04:13:39] [INFO ] Deduced a trap composed of 127 places in 662 ms
[2020-05-12 04:13:39] [INFO ] Deduced a trap composed of 128 places in 146 ms
[2020-05-12 04:13:39] [INFO ] Deduced a trap composed of 139 places in 305 ms
[2020-05-12 04:13:40] [INFO ] Deduced a trap composed of 129 places in 696 ms
[2020-05-12 04:13:40] [INFO ] Deduced a trap composed of 30 places in 128 ms
[2020-05-12 04:13:40] [INFO ] Deduced a trap composed of 139 places in 340 ms
[2020-05-12 04:13:41] [INFO ] Deduced a trap composed of 150 places in 624 ms
[2020-05-12 04:13:41] [INFO ] Deduced a trap composed of 146 places in 228 ms
[2020-05-12 04:13:42] [INFO ] Deduced a trap composed of 127 places in 571 ms
[2020-05-12 04:13:42] [INFO ] Deduced a trap composed of 140 places in 553 ms
[2020-05-12 04:13:44] [INFO ] Deduced a trap composed of 131 places in 1203 ms
[2020-05-12 04:13:44] [INFO ] Deduced a trap composed of 140 places in 199 ms
[2020-05-12 04:13:44] [INFO ] Deduced a trap composed of 132 places in 294 ms
[2020-05-12 04:13:45] [INFO ] Deduced a trap composed of 137 places in 283 ms
[2020-05-12 04:13:45] [INFO ] Deduced a trap composed of 134 places in 301 ms
[2020-05-12 04:13:45] [INFO ] Deduced a trap composed of 146 places in 329 ms
[2020-05-12 04:13:45] [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 s41 s42 s157 s158 s162 s163 s164 s168 s171 s172 s177 s178 s194 s195 s196 s197 s199 s200 s208 s220 s221 s222 s226 s227 s228 s251 s252 s253 s297 s302 s307 s311 s312 s313 s330 s332 s335 s336 s337 s345 s346 s347 s350 s352 s360 s361 s362 s365 s367 s371 s376 s391 s396 s421 s441 s446 s451 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s479 s480 s481 s490 s491 s492 s493 s494 s495 s496 s497 s498 s503 s504 s507 s508 s517 s521 s523 s531 s532 s544 s545 s556 s557 s560 s561 s562 s563 s566 s567 s572 s575 s576 s577 s578 s579 s580 s587 s588 s589 s590 s591 s592 s593 s594 s599 s600 s605 s606 s607 s616 s617 s628 s629 s634 s635 s644 s645) 0)") while checking expression at index 22
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2020-05-12 04:13:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-12 04:13:45] [INFO ] Flatten gal took : 76 ms
FORMULA BusinessProcesses-PT-17-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 04:13:46] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 04:13:46] [INFO ] Applying decomposition
[2020-05-12 04:13:46] [INFO ] Flatten gal took : 70 ms
[2020-05-12 04:13:46] [INFO ] Input system was already deterministic with 576 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10818949119399383000.txt, -o, /tmp/graph10818949119399383000.bin, -w, /tmp/graph10818949119399383000.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10818949119399383000.bin, -l, -1, -v, -w, /tmp/graph10818949119399383000.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 04:13:46] [INFO ] Decomposing Gal with order
[2020-05-12 04:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 576 rows 646 cols
[2020-05-12 04:13:46] [INFO ] Removed a total of 277 redundant transitions.
[2020-05-12 04:13:46] [INFO ] Computed 108 place invariants in 24 ms
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p388 + p389 + p390 + p391 + p392 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p403 + p404 + p405 + p406 + p407 = 1
inv : p94 + p98 + p100 + p109 + p119 + p131 + p137 - p522 - p526 - p528 - p537 - p619 - p631 - p637 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p303 + p304 + p305 + p306 + p307 = 1
inv : p214 + p215 + p216 - p581 - p582 = 0
inv : p157 + p158 - p552 - p553 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p197 + p198 + p203 + p204 + p577 + p578 - p642 - p643 + p647 + p648 + p649 = 1
inv : p59 + p60 + p61 - p505 - p506 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p433 + p434 + p435 + p436 + p437 = 1
inv : p188 + p189 + p190 - p570 - p571 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p338 + p339 + p340 + p341 + p342 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p211 + p212 + p213 + p581 + p582 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p32 + p33 + p479 + p480 + p483 + p484 + p485 = 1
inv : p0 + p1 + p266 + p267 + p453 + p454 + p455 + p456 + p457 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p368 + p369 + p370 + p371 + p372 = 1
inv : p128 + p129 + p130 - p131 - p132 - p133 = 0
inv : p634 + p635 + p636 - p637 - p638 - p639 = 0
inv : p162 + p163 + p164 - p556 - p557 = 0
inv : p112 + p113 + p114 + p115 - p119 - p120 - p121 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p197 + p198 + p206 + p207 + p577 + p578 - p645 - p646 + p647 + p648 + p649 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p398 + p399 + p400 + p401 + p402 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p348 + p349 + p350 + p351 + p352 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p185 + p186 + p187 + p570 + p571 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p241 + p242 + p243 + p244 + p245 + p603 + p604 = 1
inv : p46 + p47 + p48 - p494 - p495 = 0
inv : p94 + p96 + p100 + p106 + p112 + p116 + p125 - p135 - p136 + p137 + p138 + p139 - p522 - p524 - p528 - p534 - p612 - p616 - p625 + p635 + p636 - p637 - p638 - p639 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p333 + p334 + p335 + p336 + p337 = 1
inv : p182 + p183 + p184 - p566 - p567 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p383 + p384 + p385 + p386 + p387 = 1
inv : p0 + p110 + p111 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p619 + p620 + p621 + p625 + p626 + p627 + p631 + p632 + p633 + p637 + p638 + p639 + p647 + p648 + p649 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p191 + p192 + p193 + p574 + p575 = 1
inv : p143 + p144 + p145 - p542 - p543 = 0
inv : p612 + p616 + p617 + p618 - p619 - p620 - p621 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p56 + p57 + p58 + p505 + p506 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p223 + p224 + p225 + p589 + p590 = 1
inv : p0 + p1 + p266 + p458 + p459 + p460 + p461 + p462 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p378 + p379 + p380 + p381 + p382 = 1
inv : p171 + p172 - p177 - p178 - p277 - p279 - p280 - p388 - p389 - p391 - p392 + p398 + p399 + p401 + p402 - p403 - p404 - p406 - p407 + p408 + p409 + p411 + p412 + p566 + p567 - p570 - p571 - p642 - p643 + p645 + p646 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p443 + p444 + p445 + p446 + p447 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p318 + p319 + p320 + p321 + p322 = 1
inv : p89 + p90 + p91 - p519 - p520 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p408 + p409 + p410 + p411 + p412 = 1
inv : p174 + p175 - p177 - p178 + p276 - p279 - p393 - p394 - p396 - p397 + p398 + p399 + p401 + p402 + p408 + p409 + p411 + p412 - p413 - p414 - p416 - p417 - p570 - p571 + p574 + p575 + p645 + p646 - p648 - p649 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p373 + p374 + p375 + p376 + p377 = 1
inv : p622 + p623 + p624 - p625 - p626 - p627 = 0
inv : p94 + p96 + p98 + p103 - p114 - p115 + p119 + p120 + p121 + p122 - p129 - p130 + p131 + p132 + p133 - p522 - p524 - p526 - p531 - p612 - p613 + p623 + p624 - p625 - p626 - p627 + p629 + p630 - p631 - p632 - p633 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p165 + p166 + p167 + p168 + p176 + p177 + p178 = 1
inv : p0 + p1 + p2 + p262 + p263 + p264 + p265 = 1
inv : p194 + p195 + p196 - p574 - p575 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p197 + p198 + p209 + p210 + p577 + p578 + p647 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p152 + p153 + p154 + p155 + p156 + p552 + p553 = 1
inv : p83 + p84 + p85 - p515 - p516 = 0
inv : p232 + p233 + p234 - p593 - p594 = 0
inv : p0 + p1 + p2 + p3 + p4 + p254 = 1
inv : p199 + p200 + p201 + p205 - p577 - p578 + p645 + p646 - p647 - p648 - p649 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p418 + p419 + p420 + p421 + p422 = 1
inv : p612 + p613 + p614 + p615 - p619 - p620 - p621 = 0
inv : p0 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p619 + p620 + p621 + p625 + p626 + p627 + p631 + p632 + p633 + p637 + p638 + p639 + p647 + p648 + p649 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p92 + p93 + p95 + p96 + p97 + p99 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p120 + p121 + p125 + p126 + p127 + p132 + p133 + p138 + p139 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 - p523 - p524 - p525 - p527 - p529 - p530 - p531 - p532 - p533 - p534 - p535 - p536 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p559 - p560 - p561 - p562 - p563 - p564 - p565 - p566 - p567 - p568 - p569 - p570 - p571 - p572 - p573 - p574 - p575 - p576 - p577 - p578 - p579 - p580 - p581 - p582 - p583 - p584 - p585 - p586 - p587 - p588 - p589 - p590 - p591 - p592 - p593 - p594 - p595 - p596 - p597 - p598 - p599 - p600 - p601 - p602 - p603 - p604 - p605 - p606 - p607 - p608 - p609 - p610 - p611 - p620 - p621 - p625 - p626 - p627 - p632 - p633 - p638 - p639 - p647 - p648 - p649 = 0
inv : p246 + p247 - p603 - p604 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p235 + p236 + p237 + p597 + p598 = 1
inv : p640 + p644 + p645 + p646 - p647 - p648 - p649 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p248 + p249 + p250 + p607 + p608 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p43 + p44 + p45 + p494 + p495 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p146 + p147 + p148 + p546 + p547 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p313 + p314 + p315 + p316 + p317 = 1
inv : p149 + p150 + p151 - p546 - p547 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p358 + p359 + p360 + p361 + p362 = 1
inv : p41 + p42 - p490 - p491 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p229 + p230 + p231 + p593 + p594 = 1
inv : p50 + p51 + p54 + p55 - p496 - p497 - p500 - p501 - p502 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p140 + p141 + p142 + p542 + p543 = 1
inv : p0 + p1 + p266 + p267 + p268 + p448 + p449 + p450 + p451 + p452 = 1
inv : p640 + p641 + p642 + p643 - p647 - p648 - p649 = 0
inv : p628 + p629 + p630 - p631 - p632 - p633 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p353 + p354 + p355 + p356 + p357 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p165 + p166 + p167 + p168 + p169 + p170 + p177 + p178 + p277 + p279 + p280 + p388 + p389 + p391 + p392 - p398 - p399 - p401 - p402 + p403 + p404 + p406 + p407 - p408 - p409 - p411 - p412 - p566 - p567 + p570 + p571 + p642 + p643 - p645 - p646 = 1
inv : p199 + p200 + p208 - p577 - p578 - p647 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p328 + p330 + p331 + p332 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p423 + p424 + p425 + p426 + p427 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p343 + p344 + p345 + p346 + p347 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p363 + p364 + p365 + p366 + p367 = 1
inv : p226 + p227 + p228 - p589 - p590 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 = 1
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p92 + p93 - p94 + p95 + p97 - p98 + p99 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p114 + p115 - p119 + p123 + p124 + p129 + p130 - p131 + p138 + p139 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p470 - p471 - p472 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p480 - p481 - p482 - p483 - p484 - p485 - p486 - p487 - p488 - p489 - p490 - p491 - p492 - p493 - p494 - p495 - p496 - p497 - p498 - p499 - p500 - p501 - p502 - p503 - p504 - p505 - p506 - p507 - p508 - p509 - p510 - p511 - p512 - p513 - p514 - p515 - p516 - p517 - p518 - p519 - p520 - p521 + p522 - p523 - p525 + p526 - p527 - p529 - p530 - p532 - p533 - p534 - p535 - p536 - p540 - p541 - p542 - p543 - p544 - p545 - p546 - p547 - p548 - p549 - p550 - p551 - p552 - p553 - p554 - p555 - p556 - p557 - p558 - p559 - p560 - p561 - p562 - p563 - p564 - p565 - p566 - p567 - p568 - p569 - p570 - p571 - p572 - p573 - p574 - p575 - p576 - p577 - p578 - p579 - p580 - p581 - p582 - p583 - p584 - p585 - p586 - p587 - p588 - p589 - p590 - p591 - p592 - p593 - p594 - p595 - p596 - p597 - p598 - p599 - p600 - p601 - p602 - p603 - p604 - p605 - p606 - p607 - p608 - p609 - p610 - p611 + p612 + p613 - p620 - p621 - p623 - p624 - p629 - p630 + p631 - p638 - p639 - p647 - p648 - p649 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p438 + p439 + p440 + p441 + p442 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p428 + p429 + p430 + p431 + p432 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p36 + p37 + p38 + p39 + p40 + p490 + p491 = 1
inv : -p94 - p96 - p100 - p106 + p117 + p118 - p119 - p120 - p121 - p125 + p135 + p136 - p137 - p138 - p139 + p522 + p524 + p528 + p534 + p612 + p616 + p625 - p635 - p636 + p637 + p638 + p639 = 0
inv : p134 + p135 + p136 - p137 - p138 - p139 = 0
inv : p0 + p1 + p2 + p3 + p258 + p259 + p260 + p261 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p217 + p218 + p219 + p585 + p586 = 1
inv : p199 + p200 + p201 + p202 - p577 - p578 + p642 + p643 - p647 - p648 - p649 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p179 + p180 + p181 + p566 + p567 = 1
inv : p30 + p31 + p34 + p35 - p479 - p480 - p483 - p484 - p485 = 0
inv : p251 + p252 + p253 - p607 - p608 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p86 + p87 + p88 + p519 + p520 = 1
inv : p220 + p221 + p222 - p585 - p586 = 0
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p413 + p414 + p415 + p416 + p417 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p159 + p160 + p161 + p556 + p557 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p165 + p166 + p167 + p168 + p169 + p173 + p177 + p178 - p276 + p279 + p393 + p394 + p396 + p397 - p398 - p399 - p401 - p402 - p408 - p409 - p411 - p412 + p413 + p414 + p416 + p417 + p570 + p571 - p574 - p575 - p645 - p646 + p648 + p649 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p308 + p309 + p310 + p311 + p312 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p393 + p394 + p395 + p396 + p397 = 1
inv : p238 + p239 + p240 - p597 - p598 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p80 + p81 + p82 + p515 + p516 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p49 + p52 + p53 + p496 + p497 + p500 + p501 + p502 = 1
inv : p0 + p1 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p323 + p324 + p325 + p326 + p327 = 1
Total of 108 invariants.
[2020-05-12 04:13:46] [INFO ] Computed 108 place invariants in 30 ms
[2020-05-12 04:13:46] [INFO ] Flatten gal took : 210 ms
[2020-05-12 04:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2020-05-12 04:13:46] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-12 04:13:46] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((G((!(F("(i19.i0.i0.u160.p412==1)")))||(!(X(X("(i17.u72.p181!=1)")))))))
Formula 0 simplified : !G(!F"(i19.i0.i0.u160.p412==1)" | !XX"(i17.u72.p181!=1)")
built 64 ordering constraints for composite.
built 4 ordering constraints for composite.
built 16 ordering constraints for composite.
built 30 ordering constraints for composite.
built 49 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 27 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 81 ordering constraints for composite.
built 29 ordering constraints for composite.
built 20 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 25 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 29 ordering constraints for composite.
built 4 ordering constraints for composite.
built 89 ordering constraints for composite.
built 25 ordering constraints for composite.
[2020-05-12 04:13:48] [INFO ] Proved 646 variables to be positive in 2026 ms
[2020-05-12 04:13:48] [INFO ] Computing symmetric may disable matrix : 576 transitions.
[2020-05-12 04:13:48] [INFO ] Computation of disable matrix completed :0/576 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 04:13:48] [INFO ] Computation of Complete disable matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 04:13:48] [INFO ] Computing symmetric may enable matrix : 576 transitions.
[2020-05-12 04:13:48] [INFO ] Computation of Complete enable matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 04:13:51] [INFO ] Computing symmetric co enabling matrix : 576 transitions.
[2020-05-12 04:13:52] [INFO ] Computation of co-enabling matrix(0/576) took 1242 ms. Total solver calls (SAT/UNSAT): 288(288/0)
[2020-05-12 04:13:55] [INFO ] Computation of co-enabling matrix(3/576) took 4551 ms. Total solver calls (SAT/UNSAT): 1116(1116/0)
[2020-05-12 04:13:59] [INFO ] Computation of co-enabling matrix(10/576) took 8349 ms. Total solver calls (SAT/UNSAT): 2680(1454/1226)
[2020-05-12 04:14:03] [INFO ] Computation of co-enabling matrix(17/576) took 11900 ms. Total solver calls (SAT/UNSAT): 4830(1780/3050)
[2020-05-12 04:14:08] [INFO ] Computation of co-enabling matrix(22/576) took 17587 ms. Total solver calls (SAT/UNSAT): 6190(2045/4145)
[2020-05-12 04:14:15] [INFO ] Computation of co-enabling matrix(24/576) took 24625 ms. Total solver calls (SAT/UNSAT): 6729(2148/4581)
[2020-05-12 04:14:21] [INFO ] Computation of co-enabling matrix(26/576) took 30528 ms. Total solver calls (SAT/UNSAT): 7264(2250/5014)
[2020-05-12 04:14:27] [INFO ] Computation of co-enabling matrix(28/576) took 35914 ms. Total solver calls (SAT/UNSAT): 7791(2358/5433)
[2020-05-12 04:14:30] [INFO ] Computation of co-enabling matrix(29/576) took 39208 ms. Total solver calls (SAT/UNSAT): 8057(2405/5652)
[2020-05-12 04:14:35] [INFO ] Computation of co-enabling matrix(30/576) took 44146 ms. Total solver calls (SAT/UNSAT): 8318(2459/5859)
[2020-05-12 04:14:39] [INFO ] Computation of co-enabling matrix(31/576) took 47783 ms. Total solver calls (SAT/UNSAT): 8578(2513/6065)
[2020-05-12 04:14:44] [INFO ] Computation of co-enabling matrix(32/576) took 52748 ms. Total solver calls (SAT/UNSAT): 8841(2559/6282)
[2020-05-12 04:14:49] [INFO ] Computation of co-enabling matrix(33/576) took 58004 ms. Total solver calls (SAT/UNSAT): 9099(2613/6486)
[2020-05-12 04:14:53] [INFO ] Computation of co-enabling matrix(34/576) took 62497 ms. Total solver calls (SAT/UNSAT): 9356(2667/6689)
[2020-05-12 04:14:58] [INFO ] Computation of co-enabling matrix(35/576) took 67279 ms. Total solver calls (SAT/UNSAT): 9616(2712/6904)
[2020-05-12 04:15:02] [INFO ] Computation of co-enabling matrix(36/576) took 70673 ms. Total solver calls (SAT/UNSAT): 9871(2766/7105)
[2020-05-12 04:15:06] [INFO ] Computation of co-enabling matrix(37/576) took 74728 ms. Total solver calls (SAT/UNSAT): 10125(2820/7305)
[2020-05-12 04:15:09] [INFO ] Computation of co-enabling matrix(38/576) took 77996 ms. Total solver calls (SAT/UNSAT): 10389(2871/7518)
[2020-05-12 04:15:13] [INFO ] Computation of co-enabling matrix(39/576) took 81872 ms. Total solver calls (SAT/UNSAT): 10652(2922/7730)
[2020-05-12 04:15:20] [INFO ] Computation of co-enabling matrix(44/576) took 89159 ms. Total solver calls (SAT/UNSAT): 11305(3182/8123)
[2020-05-12 04:15:27] [INFO ] Computation of co-enabling matrix(45/576) took 96304 ms. Total solver calls (SAT/UNSAT): 11579(3246/8333)
[2020-05-12 04:15:31] [INFO ] Computation of co-enabling matrix(46/576) took 100149 ms. Total solver calls (SAT/UNSAT): 11827(3300/8527)
[2020-05-12 04:15:34] [INFO ] Computation of co-enabling matrix(51/576) took 103215 ms. Total solver calls (SAT/UNSAT): 13114(3599/9515)
[2020-05-12 04:15:37] [INFO ] Computation of co-enabling matrix(57/576) took 106243 ms. Total solver calls (SAT/UNSAT): 14551(3923/10628)
[2020-05-12 04:15:40] [INFO ] Computation of co-enabling matrix(62/576) took 109441 ms. Total solver calls (SAT/UNSAT): 15725(4178/11547)
[2020-05-12 04:15:44] [INFO ] Computation of co-enabling matrix(69/576) took 113004 ms. Total solver calls (SAT/UNSAT): 17330(4522/12808)
[2020-05-12 04:15:49] [INFO ] Computation of co-enabling matrix(76/576) took 117834 ms. Total solver calls (SAT/UNSAT): 18826(4828/13998)
[2020-05-12 04:15:52] [INFO ] Computation of co-enabling matrix(80/576) took 121096 ms. Total solver calls (SAT/UNSAT): 19688(5044/14644)
[2020-05-12 04:15:55] [INFO ] Computation of co-enabling matrix(82/576) took 124238 ms. Total solver calls (SAT/UNSAT): 20086(5125/14961)
[2020-05-12 04:15:58] [INFO ] Computation of co-enabling matrix(87/576) took 127484 ms. Total solver calls (SAT/UNSAT): 20951(5478/15473)
Reverse transition relation is NOT exact ! Due to transitions t76, t78, t300, t304, t312, t432, i0.t297, i0.t294, i0.t290, i0.t165, i0.t161, i0.t157, i0.t153, i0.u90.t307, i0.u97.t293, i0.u94.t299, i0.u174.t166, i0.u175.t162, i0.u178.t158, i0.u179.t154, i1.u99.t286, i2.u86.t315, i2.u88.t311, i3.t189, i3.u76.t331, i3.u78.t327, i3.u162.t190, i4.t201, i4.u74.t335, i4.u157.t202, i5.t435, i5.t269, i5.u16.t437, i5.u124.t270, i6.t417, i6.t413, i6.t411, i6.t409, i6.t407, i6.t404, i6.t402, i7.u67.t347, i8.t221, i8.t217, i8.t209, i8.t205, i8.t197, i8.u147.t222, i8.u149.t218, i8.u152.t210, i8.u154.t206, i8.u158.t198, i9.t249, i9.t245, i9.t233, i9.t229, i9.t225, i9.u132.t250, i9.u135.t246, i9.u140.t234, i9.u143.t230, i9.u145.t226, i10.t280, i10.t277, i10.t273, i10.t265, i10.u117.t281, i10.u120.t278, i10.u121.t274, i10.u125.t266, i11.t133, i11.u188.t129, i12.t442, i12.t427, i12.t422, i12.t418, i12.u14.t440, i12.u19.t431, i12.u22.t425, i12.u24.t421, i12.u15.t438, i12.u23.t423, i13.t115, i13.u194.t119, i14.t373, i14.t371, i14.t369, i14.t261, i14.t241, i14.t237, i14.u127.t262, i14.u39.t377, i14.u39.t381, i14.u39.t385, i14.u39.t391, i14.u136.t242, i14.u138.t238, i15.t253, i15.u130.t254, i16.u58.t365, i16.u35.t399, i16.u37.t395, i17.t355, i17.u60.t361, i17.u72.t339, i17.u62.t357, i18.t213, i18.u65.t351, i18.u150.t214, i19.i0.i0.u160.t193, i19.i0.i0.u160.t194, i19.i0.i1.t185, i19.i0.i1.u163.t186, i19.i1.i0.u84.t319, i19.i1.i1.t181, i19.i1.i1.u166.t182, i19.i1.i2.t177, i19.i1.i2.u168.t178, i20.t173, i20.t169, i20.u92.t303, i20.u170.t174, i20.u171.t170, i21.t147, i21.t140, i21.t135, i21.t131, i21.t127, i21.t125, i21.t122, i21.t117, i21.t113, i21.t110, i21.t108, i21.t106, i21.t104, i21.t101, i21.t73, i21.t70, i21.t67, i21.t65, i21.t62, i21.t59, i21.t57, i21.t55, i21.t53, i21.t50, i21.t47, i21.t37, i21.t34, i21.t31, i21.t28, i21.t25, i21.t22, i21.t20, i21.t17, i21.t14, i21.u249.t12, i21.u249.t44, i21.u249.t84, i21.u249.t88, i21.u249.t92, i21.u249.t98, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/376/163/575
[2020-05-12 04:16:04] [INFO ] Computation of co-enabling matrix(89/576) took 132836 ms. Total solver calls (SAT/UNSAT): 21372(5592/15780)
[2020-05-12 04:16:08] [INFO ] Computation of co-enabling matrix(90/576) took 137303 ms. Total solver calls (SAT/UNSAT): 21580(5648/15932)
[2020-05-12 04:16:15] [INFO ] Computation of co-enabling matrix(92/576) took 143747 ms. Total solver calls (SAT/UNSAT): 21974(5891/16083)
[2020-05-12 04:16:18] [INFO ] Computation of co-enabling matrix(93/576) took 147304 ms. Total solver calls (SAT/UNSAT): 22184(5907/16277)
Computing Next relation with stutter on 1312 deadlock states
[2020-05-12 04:16:21] [INFO ] Computation of co-enabling matrix(101/576) took 150315 ms. Total solver calls (SAT/UNSAT): 23401(6365/17036)
[2020-05-12 04:16:24] [INFO ] Computation of co-enabling matrix(109/576) took 153518 ms. Total solver calls (SAT/UNSAT): 24939(6754/18185)
[2020-05-12 04:16:28] [INFO ] Computation of co-enabling matrix(119/576) took 157548 ms. Total solver calls (SAT/UNSAT): 26812(7173/19639)
[2020-05-12 04:16:31] [INFO ] Computation of co-enabling matrix(126/576) took 160592 ms. Total solver calls (SAT/UNSAT): 28052(7491/20561)
[2020-05-12 04:16:36] [INFO ] Computation of co-enabling matrix(130/576) took 165084 ms. Total solver calls (SAT/UNSAT): 28750(7659/21091)
[2020-05-12 04:16:41] [INFO ] Computation of co-enabling matrix(132/576) took 169772 ms. Total solver calls (SAT/UNSAT): 29093(7743/21350)
[2020-05-12 04:16:46] [INFO ] Computation of co-enabling matrix(134/576) took 174764 ms. Total solver calls (SAT/UNSAT): 29432(7827/21605)
[2020-05-12 04:16:49] [INFO ] Computation of co-enabling matrix(136/576) took 177858 ms. Total solver calls (SAT/UNSAT): 29755(7963/21792)
[2020-05-12 04:16:52] [INFO ] Computation of co-enabling matrix(142/576) took 181134 ms. Total solver calls (SAT/UNSAT): 30700(8270/22430)
[2020-05-12 04:16:55] [INFO ] Computation of co-enabling matrix(144/576) took 184499 ms. Total solver calls (SAT/UNSAT): 31007(8405/22602)
[2020-05-12 04:16:59] [INFO ] Computation of co-enabling matrix(150/576) took 188192 ms. Total solver calls (SAT/UNSAT): 32124(8684/23440)
[2020-05-12 04:17:02] [INFO ] Computation of co-enabling matrix(190/576) took 191272 ms. Total solver calls (SAT/UNSAT): 34445(8795/25650)
[2020-05-12 04:17:06] [INFO ] Computation of co-enabling matrix(203/576) took 195509 ms. Total solver calls (SAT/UNSAT): 35573(9216/26357)
[2020-05-12 04:17:10] [INFO ] Computation of co-enabling matrix(208/576) took 198739 ms. Total solver calls (SAT/UNSAT): 35865(9340/26525)
[2020-05-12 04:17:14] [INFO ] Computation of co-enabling matrix(281/576) took 202853 ms. Total solver calls (SAT/UNSAT): 37813(9450/28363)
[2020-05-12 04:17:17] [INFO ] Computation of co-enabling matrix(283/576) took 206365 ms. Total solver calls (SAT/UNSAT): 38032(9511/28521)
[2020-05-12 04:17:23] [INFO ] Computation of co-enabling matrix(286/576) took 212347 ms. Total solver calls (SAT/UNSAT): 38250(9573/28677)
[2020-05-12 04:17:28] [INFO ] Computation of co-enabling matrix(291/576) took 217130 ms. Total solver calls (SAT/UNSAT): 38678(9701/28977)
[2020-05-12 04:17:31] [INFO ] Computation of co-enabling matrix(297/576) took 220338 ms. Total solver calls (SAT/UNSAT): 38902(9770/29132)
[2020-05-12 04:17:36] [INFO ] Computation of co-enabling matrix(309/576) took 224923 ms. Total solver calls (SAT/UNSAT): 39517(9989/29528)
[2020-05-12 04:17:42] [INFO ] Computation of co-enabling matrix(317/576) took 231468 ms. Total solver calls (SAT/UNSAT): 39912(10145/29767)
[2020-05-12 04:17:46] [INFO ] Computation of co-enabling matrix(325/576) took 235019 ms. Total solver calls (SAT/UNSAT): 40119(10240/29879)
[2020-05-12 04:17:50] [INFO ] Computation of co-enabling matrix(329/576) took 238701 ms. Total solver calls (SAT/UNSAT): 40307(10321/29986)
[2020-05-12 04:17:54] [INFO ] Computation of co-enabling matrix(333/576) took 242660 ms. Total solver calls (SAT/UNSAT): 40492(10404/30088)
[2020-05-12 04:17:57] [INFO ] Computation of co-enabling matrix(337/576) took 246305 ms. Total solver calls (SAT/UNSAT): 40674(10489/30185)
[2020-05-12 04:18:01] [INFO ] Computation of co-enabling matrix(345/576) took 250120 ms. Total solver calls (SAT/UNSAT): 40910(10626/30284)
142 unique states visited
142 strongly connected components in search stack
143 transitions explored
142 items max in DFS search stack
25819 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,258.274,2891900,1,0,3.91555e+06,918,4694,8.28693e+06,192,2304,5173915
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-17-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G("(i12.u14.p33==1)")))&&((X(G("(i14.u212.p535==1)")))U("(i12.u19.p45==1)"))))
Formula 1 simplified : !(XG"(i12.u14.p33==1)" & (XG"(i14.u212.p535==1)" U "(i12.u19.p45==1)"))
[2020-05-12 04:18:07] [INFO ] Computation of co-enabling matrix(355/576) took 255977 ms. Total solver calls (SAT/UNSAT): 41260(10801/30459)
[2020-05-12 04:18:12] [INFO ] Computation of co-enabling matrix(363/576) took 261044 ms. Total solver calls (SAT/UNSAT): 41583(10985/30598)
[2020-05-12 04:18:16] [INFO ] Computation of co-enabling matrix(365/576) took 265099 ms. Total solver calls (SAT/UNSAT): 41791(11097/30694)
[2020-05-12 04:18:20] [INFO ] Computation of co-enabling matrix(366/576) took 268779 ms. Total solver calls (SAT/UNSAT): 41902(11208/30694)
[2020-05-12 04:18:23] [INFO ] Computation of co-enabling matrix(367/576) took 271851 ms. Total solver calls (SAT/UNSAT): 42012(11318/30694)
[2020-05-12 04:18:26] [INFO ] Computation of co-enabling matrix(368/576) took 275020 ms. Total solver calls (SAT/UNSAT): 42121(11427/30694)
[2020-05-12 04:18:29] [INFO ] Computation of co-enabling matrix(369/576) took 278473 ms. Total solver calls (SAT/UNSAT): 42229(11535/30694)
[2020-05-12 04:18:34] [INFO ] Computation of co-enabling matrix(372/576) took 283224 ms. Total solver calls (SAT/UNSAT): 42492(11798/30694)
[2020-05-12 04:18:37] [INFO ] Computation of co-enabling matrix(374/576) took 286385 ms. Total solver calls (SAT/UNSAT): 42628(11934/30694)
[2020-05-12 04:18:40] [INFO ] Computation of co-enabling matrix(376/576) took 289439 ms. Total solver calls (SAT/UNSAT): 42843(12149/30694)
[2020-05-12 04:18:45] [INFO ] Computation of co-enabling matrix(378/576) took 293663 ms. Total solver calls (SAT/UNSAT): 43047(12353/30694)
Computing Next relation with stutter on 1312 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4052 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,298.803,2892304,1,0,3.91555e+06,918,5502,9.05307e+06,208,2758,5942111
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-17-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G((X("(((i10.u20.p46!=1)||(i10.u120.p306!=1))||(i12.u193.p494!=1))"))||(X(F((G("(((i10.u20.p46==1)&&(i10.u120.p306==1))&&(i12.u193.p494==1))"))||(("(i0.u98.p252==1)")U(F("(i3.u5.p12==1)"))))))))))
Formula 2 simplified : !FG(X"(((i10.u20.p46!=1)||(i10.u120.p306!=1))||(i12.u193.p494!=1))" | XF(G"(((i10.u20.p46==1)&&(i10.u120.p306==1))&&(i12.u193.p494==1))" | ("(i0.u98.p252==1)" U F"(i3.u5.p12==1)")))
Computing Next relation with stutter on 1312 deadlock states
267 unique states visited
229 strongly connected components in search stack
269 transitions explored
265 items max in DFS search stack
184 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,300.664,2892760,1,0,3.91555e+06,918,5653,9.33785e+06,210,2782,6226774
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-17-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((G(X("(i8.u159.p403==1)")))&&((!(("(i6.u33.p73!=1)")U("(i21.u249.p525==1)")))||("(i8.u159.p403!=1)")))U("((i14.u45.p110==1)&&(i14.u213.p538==1))")))
Formula 3 simplified : !((GX"(i8.u159.p403==1)" & ("(i8.u159.p403!=1)" | !("(i6.u33.p73!=1)" U "(i21.u249.p525==1)"))) U "((i14.u45.p110==1)&&(i14.u213.p538==1))")
Computing Next relation with stutter on 1312 deadlock states
[2020-05-12 04:18:49] [INFO ] Computation of co-enabling matrix(381/576) took 298228 ms. Total solver calls (SAT/UNSAT): 43326(12632/30694)
[2020-05-12 04:18:53] [INFO ] Computation of co-enabling matrix(384/576) took 301856 ms. Total solver calls (SAT/UNSAT): 43639(12945/30694)
[2020-05-12 04:18:56] [INFO ] Computation of co-enabling matrix(388/576) took 304964 ms. Total solver calls (SAT/UNSAT): 43882(13188/30694)
[2020-05-12 04:18:59] [INFO ] Computation of co-enabling matrix(461/576) took 308436 ms. Total solver calls (SAT/UNSAT): 44857(13359/31498)
[2020-05-12 04:19:02] [INFO ] Computation of co-enabling matrix(475/576) took 311480 ms. Total solver calls (SAT/UNSAT): 46182(13661/32521)
[2020-05-12 04:19:06] [INFO ] Computation of co-enabling matrix(489/576) took 314694 ms. Total solver calls (SAT/UNSAT): 47173(13948/33225)
[2020-05-12 04:19:09] [INFO ] Computation of co-enabling matrix(508/576) took 317877 ms. Total solver calls (SAT/UNSAT): 48415(14159/34256)
[2020-05-12 04:19:12] [INFO ] Computation of co-enabling matrix(531/576) took 321006 ms. Total solver calls (SAT/UNSAT): 49357(14469/34888)
[2020-05-12 04:19:15] [INFO ] Computation of co-enabling matrix(542/576) took 324340 ms. Total solver calls (SAT/UNSAT): 49670(14570/35100)
[2020-05-12 04:19:18] [INFO ] Computation of co-enabling matrix(570/576) took 327398 ms. Total solver calls (SAT/UNSAT): 50131(14811/35320)
[2020-05-12 04:19:18] [INFO ] Computation of Finished co-enabling matrix. took 327637 ms. Total solver calls (SAT/UNSAT): 50141(14812/35329)
[2020-05-12 04:19:19] [INFO ] Computing Do-Not-Accords matrix : 576 transitions.
[2020-05-12 04:19:19] [INFO ] Computation of Completed DNA matrix. took 564 ms. Total solver calls (SAT/UNSAT): 274(0/274)
[2020-05-12 04:19:19] [INFO ] Built C files in 333490ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 6038 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 52 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (( [](X((LTLAP9==true))) ) && ( ( !( ((LTLAP10==true))U((LTLAP11==true))) ) || ( (LTLAP12==true)) ))U((LTLAP13==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (( [](X((LTLAP9==true))) ) && ( ( !( ((LTLAP10==true))U((LTLAP11==true))) ) || ( (LTLAP12==true)) ))U((LTLAP13==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (( [](X((LTLAP9==true))) ) && ( ( !( ((LTLAP10==true))U((LTLAP11==true))) ) || ( (LTLAP12==true)) ))U((LTLAP13==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-12 04:36:23] [INFO ] Applying decomposition
[2020-05-12 04:36:23] [INFO ] Flatten gal took : 260 ms
[2020-05-12 04:36:24] [INFO ] Decomposing Gal with order
[2020-05-12 04:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 04:36:24] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 04:36:24] [INFO ] Flatten gal took : 496 ms
[2020-05-12 04:36:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 532 ms.
[2020-05-12 04:36:25] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 35 ms
[2020-05-12 04:36:25] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 12 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 11 LTL properties
Checking formula 0 : !((((G(X("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u128.p403==1)")))&&((!(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u34.p73!=1)")U("(i1.u222.p525==1)")))||("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u128.p403!=1)")))U("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u216.p110==1)&&(i1.u222.p538==1))")))
Formula 0 simplified : !((GX"(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u128.p403==1)" & ("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u128.p403!=1)" | !("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u34.p73!=1)" U "(i1.u222.p525==1)"))) U "((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u216.p110==1)&&(i1.u222.p538==1))")
built 2 ordering constraints for composite.
built 143 ordering constraints for composite.
built 78 ordering constraints for composite.
built 77 ordering constraints for composite.
built 76 ordering constraints for composite.
built 76 ordering constraints for composite.
built 74 ordering constraints for composite.
built 71 ordering constraints for composite.
built 69 ordering constraints for composite.
built 67 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 67 ordering constraints for composite.
built 65 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 59 ordering constraints for composite.
built 57 ordering constraints for composite.
built 55 ordering constraints for composite.
built 53 ordering constraints for composite.
built 51 ordering constraints for composite.
built 49 ordering constraints for composite.
built 47 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 31 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 21 ordering constraints for composite.
built 19 ordering constraints for composite.
built 17 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 88 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 04:59:02] [INFO ] Flatten gal took : 404 ms
[2020-05-12 04:59:04] [INFO ] Input system was already deterministic with 576 transitions.
[2020-05-12 04:59:04] [INFO ] Transformed 646 places.
[2020-05-12 04:59:04] [INFO ] Transformed 576 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-12 04:59:34] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 30 ms
[2020-05-12 04:59:34] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 11 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((G(X("(p403==1)")))&&((!(("(p73!=1)")U("(p525==1)")))||("(p403!=1)")))U("((p110==1)&&(p538==1))")))
Formula 0 simplified : !((GX"(p403==1)" & ("(p403!=1)" | !("(p73!=1)" U "(p525==1)"))) U "((p110==1)&&(p538==1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-17, 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 r021-oct2-158897699200578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 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 ;