MCC'2020 - Execution of r066-tajo-158922814800790

About the Execution of ITS-Tools for DoubleExponent-PT-020

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15742.570	3600000.00	8144841.00	1111.10	??TT??T???F?F?F?	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 4.0K Mar 31 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590136540920

[2020-05-22 08:35:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-22 08:35:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:35:43] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2020-05-22 08:35:43] [INFO ] Transformed 1064 places.
[2020-05-22 08:35:43] [INFO ] Transformed 998 transitions.
[2020-05-22 08:35:43] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 90 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 321 resets, run finished after 133 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 297 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 3164663 steps, run timeout after 30001 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 3164663 steps, saw 1582039 distinct states, run finished after 30002 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 998 rows 1064 cols
[2020-05-22 08:36:14] [INFO ] Computed 104 place invariants in 237 ms
[2020-05-22 08:36:14] [INFO ] [Real]Absence check using 2 positive place invariants in 49 ms returned sat
[2020-05-22 08:36:14] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 198 ms returned sat
[2020-05-22 08:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:18] [INFO ] [Real]Absence check using state equation in 3917 ms returned sat
[2020-05-22 08:36:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:36:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-22 08:36:19] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 161 ms returned sat
[2020-05-22 08:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:23] [INFO ] [Nat]Absence check using state equation in 4632 ms returned sat
[2020-05-22 08:36:24] [INFO ] Deduced a trap composed of 8 places in 921 ms
[2020-05-22 08:36:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s77 s143 s176 s276 s310) 0)") while checking expression at index 0
[2020-05-22 08:36:24] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2020-05-22 08:36:24] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 93 ms returned sat
[2020-05-22 08:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:28] [INFO ] [Real]Absence check using state equation in 3479 ms returned sat
[2020-05-22 08:36:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:36:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 46 ms returned sat
[2020-05-22 08:36:28] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 174 ms returned sat
[2020-05-22 08:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:32] [INFO ] [Nat]Absence check using state equation in 3660 ms returned sat
[2020-05-22 08:36:33] [INFO ] Deduced a trap composed of 79 places in 720 ms
[2020-05-22 08:36:34] [INFO ] Deduced a trap composed of 149 places in 797 ms
[2020-05-22 08:36:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s110 s121 s132 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s154 s165 s176 s177 s188 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s221 s232 s258 s259 s260 s261 s262 s263 s264 s266 s267 s268 s269 s270 s287 s317 s318 s319 s320 s322 s323 s324 s325 s326 s327 s328 s329 s375 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s388 s398 s435 s436 s437 s438 s439 s440 s441 s442 s444 s445 s446 s447 s493 s494 s495 s496 s497 s499 s500 s501 s502 s503 s504 s505 s509 s552 s553 s555 s556 s557 s558 s605 s614 s615 s616 s617 s618 s620 s625 s626 s627 s628 s630 s631 s632 s643 s654 s665 s676 s687 s698 s709 s713 s714 s715 s716 s720 s731 s732 s743 s754) 0)") while checking expression at index 1
[2020-05-22 08:36:34] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2020-05-22 08:36:34] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 112 ms returned unsat
[2020-05-22 08:36:34] [INFO ] [Real]Absence check using 2 positive place invariants in 35 ms returned sat
[2020-05-22 08:36:34] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 125 ms returned unsat
[2020-05-22 08:36:34] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-05-22 08:36:35] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 180 ms returned sat
[2020-05-22 08:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:38] [INFO ] [Real]Absence check using state equation in 3038 ms returned sat
[2020-05-22 08:36:39] [INFO ] Deduced a trap composed of 423 places in 942 ms
[2020-05-22 08:36:39] [INFO ] Deduced a trap composed of 395 places in 634 ms
[2020-05-22 08:36:39] [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 s9 s10 s11 s19 s20 s21 s22 s23 s29 s30 s31 s44 s57 s58 s59 s60 s67 s68 s69 s70 s71 s74 s80 s82 s83 s84 s85 s88 s92 s93 s94 s101 s102 s103 s104 s105 s107 s110 s120 s121 s122 s123 s130 s133 s137 s140 s141 s150 s151 s152 s166 s172 s173 s174 s175 s176 s178 s180 s181 s182 s183 s184 s190 s191 s192 s196 s200 s201 s209 s210 s211 s212 s221 s225 s231 s232 s233 s234 s235 s236 s238 s239 s240 s248 s249 s250 s255 s258 s259 s268 s270 s283 s284 s285 s286 s287 s289 s290 s291 s292 s293 s294 s295 s297 s298 s300 s307 s308 s309 s314 s317 s318 s327 s328 s329 s342 s349 s350 s351 s352 s353 s356 s357 s358 s365 s366 s368 s372 s375 s377 s385 s386 s388 s398 s402 s408 s409 s411 s412 s413 s415 s416 s417 s425 s426 s427 s431 s435 s436 s443 s445 s447 s454 s460 s461 s462 s463 s464 s466 s467 s468 s469 s470 s471 s473 s474 s475 s483 s484 s485 s490 s492 s493 s494 s498 s503 s504 s505 s509 s519 s521 s527 s528 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s545 s550 s552 s553 s554 s555 s556 s562 s563 s564 s571 s572 s573 s574 s575 s578 s591 s592 s593 s598 s601 s602 s603 s607 s611 s612 s620 s622 s624 s632 s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s650 s651 s652 s653 s655 s660 s661 s662 s668 s670 s671 s672 s673 s680 s681 s682 s689 s690 s691 s692 s693 s695 s708 s710 s711 s718 s721 s722 s725 s728 s729 s731 s732 s739 s740 s741 s754 s755 s759 s762 s768 s769 s770 s771 s772 s778 s779 s780 s788 s789 s790 s791 s792 s797 s799 s800 s813 s826 s827 s828 s836 s837 s838 s839 s841 s844 s847 s848 s857 s859 s866 s867 s868 s869 s870 s872 s873 s874 s875 s877 s879 s880 s883 s885 s886 s887 s888 s889 s890 s891 s892 s895 s896 s897 s898 s900 s903 s905 s906 s907 s908 s909 s915 s916 s917 s920 s922 s925 s930 s931 s942 s944 s946 s953 s954 s955 s957 s961 s964 s965 s966 s974 s975 s976 s977 s987 s990 s996 s997 s998 s999 s1000 s1001 s1003 s1004 s1005 s1006 s1007 s1013 s1014 s1015 s1016 s1019 s1020 s1023 s1024 s1031 s1033 s1034 s1035 s1042 s1048 s1052 s1056 s1061 s1062 s1063) 0)") while checking expression at index 4
[2020-05-22 08:36:39] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:36:40] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 90 ms returned sat
[2020-05-22 08:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:43] [INFO ] [Real]Absence check using state equation in 3486 ms returned sat
[2020-05-22 08:36:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:36:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:36:43] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 144 ms returned sat
[2020-05-22 08:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:47] [INFO ] [Nat]Absence check using state equation in 3992 ms returned sat
[2020-05-22 08:36:48] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 74 ms.
[2020-05-22 08:36:48] [INFO ] Added : 40 causal constraints over 8 iterations in 614 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 08:36:48] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:36:48] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 153 ms returned sat
[2020-05-22 08:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:52] [INFO ] [Real]Absence check using state equation in 3508 ms returned sat
[2020-05-22 08:36:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-22 08:36:52] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 148 ms returned unsat
[2020-05-22 08:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:36:52] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 105 ms returned sat
[2020-05-22 08:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:36:55] [INFO ] [Real]Absence check using state equation in 2806 ms returned sat
[2020-05-22 08:36:56] [INFO ] Deduced a trap composed of 55 places in 537 ms
[2020-05-22 08:36:56] [INFO ] Deduced a trap composed of 62 places in 536 ms
[2020-05-22 08:36:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1196 ms
[2020-05-22 08:36:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:36:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:36:57] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 122 ms returned sat
[2020-05-22 08:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:00] [INFO ] [Nat]Absence check using state equation in 3290 ms returned sat
[2020-05-22 08:37:01] [INFO ] Deduced a trap composed of 55 places in 645 ms
[2020-05-22 08:37:01] [INFO ] Deduced a trap composed of 62 places in 548 ms
[2020-05-22 08:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1344 ms
[2020-05-22 08:37:01] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 75 ms.
[2020-05-22 08:37:02] [INFO ] Added : 5 causal constraints over 1 iterations in 141 ms. Result :unknown
[2020-05-22 08:37:02] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:37:02] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 144 ms returned sat
[2020-05-22 08:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:06] [INFO ] [Real]Absence check using state equation in 4290 ms returned sat
[2020-05-22 08:37:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:37:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:37:06] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 198 ms returned sat
[2020-05-22 08:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:10] [INFO ] [Nat]Absence check using state equation in 3419 ms returned sat
[2020-05-22 08:37:11] [INFO ] Deduced a trap composed of 394 places in 679 ms
[2020-05-22 08:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 985 ms
[2020-05-22 08:37:11] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 67 ms.
[2020-05-22 08:37: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: Broken pipe (=> (> t18 0) (and (or (and (> t19 0) (< o19 o18)) (and (> t22 0) (< o22 o18)) (and (> t500 0) (< o500 o18))) (and (> t17 0) (< o17 o18))))") while checking expression at index 8
[2020-05-22 08:37:11] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:37:11] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 132 ms returned sat
[2020-05-22 08:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:15] [INFO ] [Real]Absence check using state equation in 3442 ms returned sat
[2020-05-22 08:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:37:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:37:15] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 96 ms returned sat
[2020-05-22 08:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:18] [INFO ] [Nat]Absence check using state equation in 3386 ms returned sat
[2020-05-22 08:37:19] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 110 ms.
[2020-05-22 08:37:20] [INFO ] Added : 60 causal constraints over 12 iterations in 1269 ms. Result :(error "Failed to check-sat")
[2020-05-22 08:37:20] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-05-22 08:37:20] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 183 ms returned unsat
[2020-05-22 08:37:20] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2020-05-22 08:37:21] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 164 ms returned sat
[2020-05-22 08:37:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:24] [INFO ] [Real]Absence check using state equation in 3465 ms returned sat
[2020-05-22 08:37:25] [INFO ] Deduced a trap composed of 53 places in 595 ms
[2020-05-22 08:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
[2020-05-22 08:37:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:37:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2020-05-22 08:37:25] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 148 ms returned sat
[2020-05-22 08:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:28] [INFO ] [Nat]Absence check using state equation in 3102 ms returned sat
[2020-05-22 08:37:29] [INFO ] Deduced a trap composed of 404 places in 592 ms
[2020-05-22 08:37:30] [INFO ] Deduced a trap composed of 89 places in 379 ms
[2020-05-22 08:37:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1295 ms
[2020-05-22 08:37:30] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 49 ms.
[2020-05-22 08:37:30] [INFO ] Added : 35 causal constraints over 7 iterations in 337 ms. Result :unknown
[2020-05-22 08:37:30] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2020-05-22 08:37:30] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 45 ms returned unsat
[2020-05-22 08:37:30] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:37:30] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 99 ms returned sat
[2020-05-22 08:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:33] [INFO ] [Real]Absence check using state equation in 2373 ms returned sat
[2020-05-22 08:37:33] [INFO ] Deduced a trap composed of 53 places in 578 ms
[2020-05-22 08:37:34] [INFO ] Deduced a trap composed of 363 places in 484 ms
[2020-05-22 08:37:35] [INFO ] Deduced a trap composed of 396 places in 501 ms
[2020-05-22 08:37:35] [INFO ] Deduced a trap composed of 378 places in 469 ms
[2020-05-22 08:37:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 08:37:36] [INFO ] Deduced a trap composed of 8 places in 491 ms
[2020-05-22 08:37: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 s77 s143 s176 s276 s310) 0)") while checking expression at index 13
[2020-05-22 08:37:36] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-05-22 08:37:36] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 88 ms returned unsat
[2020-05-22 08:37:36] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-22 08:37:36] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 87 ms returned sat
[2020-05-22 08:37:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:39] [INFO ] [Real]Absence check using state equation in 2716 ms returned sat
[2020-05-22 08:37:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:37:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-22 08:37:39] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 103 ms returned sat
[2020-05-22 08:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:37:42] [INFO ] [Nat]Absence check using state equation in 2902 ms returned sat
[2020-05-22 08:37:42] [INFO ] Deduced a trap composed of 133 places in 424 ms
[2020-05-22 08:37:43] [INFO ] Deduced a trap composed of 430 places in 571 ms
[2020-05-22 08:37:43] [INFO ] Deduced a trap composed of 418 places in 420 ms
[2020-05-22 08:37:44] [INFO ] Deduced a trap composed of 89 places in 492 ms
[2020-05-22 08:37:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s82 s83 s84 s85 s86 s87 s89 s90 s91 s92 s93 s94 s110 s121 s132 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s154 s165 s176 s177 s188 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s221 s232 s258 s259 s260 s261 s262 s263 s287 s312 s320 s322 s323 s324 s325 s330 s331 s333 s334 s336 s337 s398 s419 s420 s422 s423 s509 s620 s632 s643 s654 s665 s676 s687 s698 s709 s720 s731 s732 s743 s754) 0)") while checking expression at index 15
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-020-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 5848200 steps, including 208463 resets, run finished after 12591 ms. (steps per millisecond=464 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 399900 steps, including 14422 resets, run finished after 705 ms. (steps per millisecond=567 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 33 out of 1064 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1064/1064 places, 998/998 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.21 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 216 Post agglomeration using F-continuation condition.Transition count delta: 216
Iterating post reduction 0 with 219 rules applied. Total rules applied 220 place count 1057 transition count 780
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 436 place count 841 transition count 780
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 436 place count 841 transition count 740
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 516 place count 801 transition count 740
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 3 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 866 place count 626 transition count 565
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 26 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 934 place count 592 transition count 565
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 935 place count 592 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 936 place count 591 transition count 564
Free-agglomeration rule (complex) applied 86 times.
Iterating global reduction 3 with 86 rules applied. Total rules applied 1022 place count 591 transition count 478
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 1108 place count 505 transition count 478
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 4 with 77 rules applied. Total rules applied 1185 place count 505 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1186 place count 504 transition count 477
Applied a total of 1186 rules in 670 ms. Remains 504 /1064 variables (removed 560) and now considering 477/998 (removed 521) transitions.
Finished structural reductions, in 1 iterations. Remains : 504/1064 places, 477/998 transitions.
Incomplete random walk after 1000000 steps, including 127381 resets, run finished after 2227 ms. (steps per millisecond=449 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84303 resets, run finished after 1644 ms. (steps per millisecond=608 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84406 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84289 resets, run finished after 1568 ms. (steps per millisecond=637 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84220 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84259 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84061 resets, run finished after 1624 ms. (steps per millisecond=615 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84256 resets, run finished after 1364 ms. (steps per millisecond=733 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84018 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84077 resets, run finished after 1921 ms. (steps per millisecond=520 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84243 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 4602142 steps, run timeout after 30001 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 4602142 steps, saw 2300719 distinct states, run finished after 30001 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 477 rows 504 cols
[2020-05-22 08:38:47] [INFO ] Computed 100 place invariants in 86 ms
[2020-05-22 08:38:47] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:38:47] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 142 ms returned sat
[2020-05-22 08:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:38:48] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2020-05-22 08:38:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:38:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:38:48] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 94 ms returned sat
[2020-05-22 08:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:38:49] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2020-05-22 08:38:49] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-22 08:38:49] [INFO ] [Nat]Added 71 Read/Feed constraints in 93 ms returned sat
[2020-05-22 08:38:49] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 49 ms.
[2020-05-22 08:38:58] [INFO ] Added : 354 causal constraints over 71 iterations in 8708 ms. Result :sat
[2020-05-22 08:38:58] [INFO ] Deduced a trap composed of 11 places in 402 ms
[2020-05-22 08:38:59] [INFO ] Deduced a trap composed of 12 places in 292 ms
[2020-05-22 08:38:59] [INFO ] Deduced a trap composed of 12 places in 235 ms
[2020-05-22 08:38:59] [INFO ] Deduced a trap composed of 23 places in 205 ms
[2020-05-22 08:38:59] [INFO ] Deduced a trap composed of 15 places in 240 ms
[2020-05-22 08:39:00] [INFO ] Deduced a trap composed of 14 places in 213 ms
[2020-05-22 08:39:00] [INFO ] Deduced a trap composed of 16 places in 395 ms
[2020-05-22 08:39:01] [INFO ] Deduced a trap composed of 8 places in 449 ms
[2020-05-22 08:39:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2851 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-05-22 08:39:01] [INFO ] [Real]Absence check using 2 positive place invariants in 37 ms returned sat
[2020-05-22 08:39:01] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 117 ms returned sat
[2020-05-22 08:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:39:02] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2020-05-22 08:39:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:39:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-05-22 08:39:02] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 127 ms returned sat
[2020-05-22 08:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:39:03] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2020-05-22 08:39:03] [INFO ] [Nat]Added 71 Read/Feed constraints in 122 ms returned sat
[2020-05-22 08:39:04] [INFO ] Deduced a trap composed of 36 places in 247 ms
[2020-05-22 08:39:04] [INFO ] Deduced a trap composed of 33 places in 132 ms
[2020-05-22 08:39:04] [INFO ] Deduced a trap composed of 30 places in 165 ms
[2020-05-22 08:39:04] [INFO ] Deduced a trap composed of 34 places in 135 ms
[2020-05-22 08:39:04] [INFO ] Deduced a trap composed of 34 places in 115 ms
[2020-05-22 08:39:04] [INFO ] Deduced a trap composed of 36 places in 97 ms
[2020-05-22 08:39:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1041 ms
[2020-05-22 08:39:05] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 23 ms.
[2020-05-22 08:39:18] [INFO ] Added : 437 causal constraints over 88 iterations in 13440 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-05-22 08:39:18] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:39:18] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 73 ms returned sat
[2020-05-22 08:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:39:19] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2020-05-22 08:39:19] [INFO ] [Real]Added 71 Read/Feed constraints in 102 ms returned sat
[2020-05-22 08:39:19] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 63 ms.
[2020-05-22 08:39:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:39:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-05-22 08:39:19] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 176 ms returned sat
[2020-05-22 08:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:39:20] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2020-05-22 08:39:21] [INFO ] [Nat]Added 71 Read/Feed constraints in 248 ms returned sat
[2020-05-22 08:39:21] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2020-05-22 08:39:22] [INFO ] Deduced a trap composed of 27 places in 628 ms
[2020-05-22 08:39:22] [INFO ] Deduced a trap composed of 24 places in 269 ms
[2020-05-22 08:39:22] [INFO ] Deduced a trap composed of 34 places in 267 ms
[2020-05-22 08:39:22] [INFO ] Deduced a trap composed of 114 places in 242 ms
[2020-05-22 08:39:23] [INFO ] Deduced a trap composed of 116 places in 397 ms
[2020-05-22 08:39:23] [INFO ] Deduced a trap composed of 108 places in 121 ms
[2020-05-22 08:39:23] [INFO ] Deduced a trap composed of 106 places in 132 ms
[2020-05-22 08:39:23] [INFO ] Deduced a trap composed of 97 places in 148 ms
[2020-05-22 08:39:23] [INFO ] Deduced a trap composed of 108 places in 168 ms
[2020-05-22 08:39:24] [INFO ] Deduced a trap composed of 105 places in 132 ms
[2020-05-22 08:39:24] [INFO ] Deduced a trap composed of 111 places in 139 ms
[2020-05-22 08:39:24] [INFO ] Deduced a trap composed of 119 places in 140 ms
[2020-05-22 08:39:24] [INFO ] Deduced a trap composed of 110 places in 113 ms
[2020-05-22 08:39:24] [INFO ] Deduced a trap composed of 107 places in 107 ms
[2020-05-22 08:39:24] [INFO ] Deduced a trap composed of 34 places in 124 ms
[2020-05-22 08:39:25] [INFO ] Deduced a trap composed of 115 places in 140 ms
[2020-05-22 08:39:25] [INFO ] Deduced a trap composed of 103 places in 105 ms
[2020-05-22 08:39:25] [INFO ] Deduced a trap composed of 121 places in 177 ms
[2020-05-22 08:39:25] [INFO ] Deduced a trap composed of 137 places in 176 ms
[2020-05-22 08:39:25] [INFO ] Deduced a trap composed of 119 places in 174 ms
[2020-05-22 08:39:25] [INFO ] Deduced a trap composed of 134 places in 131 ms
[2020-05-22 08:39:26] [INFO ] Deduced a trap composed of 120 places in 116 ms
[2020-05-22 08:39:26] [INFO ] Deduced a trap composed of 118 places in 104 ms
[2020-05-22 08:39:26] [INFO ] Deduced a trap composed of 133 places in 123 ms
[2020-05-22 08:39:26] [INFO ] Deduced a trap composed of 119 places in 140 ms
[2020-05-22 08:39:26] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5351 ms
[2020-05-22 08:39:26] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 21 ms.
[2020-05-22 08:39:42] [INFO ] Added : 429 causal constraints over 86 iterations in 16082 ms. Result :sat
[2020-05-22 08:39:42] [INFO ] Deduced a trap composed of 8 places in 289 ms
[2020-05-22 08:39:43] [INFO ] Deduced a trap composed of 17 places in 258 ms
[2020-05-22 08:39:43] [INFO ] Deduced a trap composed of 12 places in 196 ms
[2020-05-22 08:39:43] [INFO ] Deduced a trap composed of 4 places in 191 ms
[2020-05-22 08:39:43] [INFO ] Deduced a trap composed of 4 places in 208 ms
[2020-05-22 08:39:44] [INFO ] Deduced a trap composed of 153 places in 224 ms
[2020-05-22 08:39:44] [INFO ] Deduced a trap composed of 148 places in 201 ms
[2020-05-22 08:39:44] [INFO ] Deduced a trap composed of 11 places in 188 ms
[2020-05-22 08:39:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2279 ms
Attempting to minimize the solution found.
Minimization took 57 ms.
[2020-05-22 08:39:45] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2020-05-22 08:39:45] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 73 ms returned sat
[2020-05-22 08:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:39:45] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2020-05-22 08:39:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:39:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:39:45] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 72 ms returned sat
[2020-05-22 08:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:39:46] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2020-05-22 08:39:47] [INFO ] [Nat]Added 71 Read/Feed constraints in 87 ms returned sat
[2020-05-22 08:39:47] [INFO ] Deduced a trap composed of 16 places in 213 ms
[2020-05-22 08:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2020-05-22 08:39:47] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 44 ms.
[2020-05-22 08:40:00] [INFO ] Added : 450 causal constraints over 90 iterations in 12751 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-05-22 08:40:00] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:40:00] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 73 ms returned sat
[2020-05-22 08:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:01] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2020-05-22 08:40:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:40:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:40:01] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 60 ms returned sat
[2020-05-22 08:40:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:02] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2020-05-22 08:40:02] [INFO ] [Nat]Added 71 Read/Feed constraints in 509 ms returned sat
[2020-05-22 08:40:02] [INFO ] Deduced a trap composed of 59 places in 145 ms
[2020-05-22 08:40:02] [INFO ] Deduced a trap composed of 54 places in 125 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 89 places in 130 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 104 places in 113 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 121 places in 121 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 104 places in 119 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 117 places in 105 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 90 places in 109 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 119 places in 105 ms
[2020-05-22 08:40:03] [INFO ] Deduced a trap composed of 100 places in 109 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 90 places in 114 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 24 places in 91 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 64 places in 62 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 81 places in 110 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 104 places in 72 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 112 places in 58 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 115 places in 58 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 101 places in 65 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 103 places in 59 ms
[2020-05-22 08:40:04] [INFO ] Deduced a trap composed of 103 places in 56 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 112 places in 68 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 108 places in 71 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 103 places in 68 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 112 places in 72 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 104 places in 56 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 110 places in 58 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 114 places in 57 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 116 places in 57 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 113 places in 72 ms
[2020-05-22 08:40:05] [INFO ] Deduced a trap composed of 121 places in 68 ms
[2020-05-22 08:40:05] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3204 ms
[2020-05-22 08:40:05] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 22 ms.
[2020-05-22 08:40:15] [INFO ] Added : 350 causal constraints over 70 iterations in 9520 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-05-22 08:40:15] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:40:15] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 82 ms returned sat
[2020-05-22 08:40:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:16] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2020-05-22 08:40:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:40:16] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 103 ms returned sat
[2020-05-22 08:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:17] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2020-05-22 08:40:17] [INFO ] [Nat]Added 71 Read/Feed constraints in 52 ms returned sat
[2020-05-22 08:40:17] [INFO ] Deduced a trap composed of 68 places in 86 ms
[2020-05-22 08:40:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2020-05-22 08:40:17] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 48 ms.
[2020-05-22 08:40:33] [INFO ] Added : 463 causal constraints over 93 iterations in 15488 ms. Result :sat
[2020-05-22 08:40:33] [INFO ] Deduced a trap composed of 16 places in 178 ms
[2020-05-22 08:40:33] [INFO ] Deduced a trap composed of 4 places in 204 ms
[2020-05-22 08:40:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 719 ms
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-05-22 08:40:33] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-05-22 08:40:34] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 115 ms returned sat
[2020-05-22 08:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:35] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2020-05-22 08:40:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:40:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:40:35] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 88 ms returned sat
[2020-05-22 08:40:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:36] [INFO ] [Nat]Absence check using state equation in 876 ms returned sat
[2020-05-22 08:40:36] [INFO ] [Nat]Added 71 Read/Feed constraints in 45 ms returned sat
[2020-05-22 08:40:36] [INFO ] Deduced a trap composed of 151 places in 279 ms
[2020-05-22 08:40:36] [INFO ] Deduced a trap composed of 127 places in 288 ms
[2020-05-22 08:40:37] [INFO ] Deduced a trap composed of 134 places in 279 ms
[2020-05-22 08:40:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 942 ms
[2020-05-22 08:40:37] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 29 ms.
[2020-05-22 08:40:55] [INFO ] Added : 473 causal constraints over 95 iterations in 18339 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-05-22 08:40:55] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:40:55] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 96 ms returned sat
[2020-05-22 08:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:56] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2020-05-22 08:40:56] [INFO ] [Real]Added 71 Read/Feed constraints in 12 ms returned sat
[2020-05-22 08:40:56] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 35 ms.
[2020-05-22 08:40:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:40:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:40:57] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 96 ms returned sat
[2020-05-22 08:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:40:57] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2020-05-22 08:40:58] [INFO ] [Nat]Added 71 Read/Feed constraints in 286 ms returned sat
[2020-05-22 08:40:58] [INFO ] Deduced a trap composed of 18 places in 211 ms
[2020-05-22 08:40:58] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2020-05-22 08:40:58] [INFO ] Deduced a trap composed of 59 places in 100 ms
[2020-05-22 08:40:58] [INFO ] Deduced a trap composed of 73 places in 83 ms
[2020-05-22 08:40:59] [INFO ] Deduced a trap composed of 103 places in 90 ms
[2020-05-22 08:40:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 855 ms
[2020-05-22 08:40:59] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 29 ms.
[2020-05-22 08:41:11] [INFO ] Added : 435 causal constraints over 87 iterations in 12831 ms. Result :sat
[2020-05-22 08:41:12] [INFO ] Deduced a trap composed of 4 places in 295 ms
[2020-05-22 08:41:12] [INFO ] Deduced a trap composed of 133 places in 224 ms
[2020-05-22 08:41:12] [INFO ] Deduced a trap composed of 12 places in 309 ms
[2020-05-22 08:41:13] [INFO ] Deduced a trap composed of 11 places in 288 ms
[2020-05-22 08:41:13] [INFO ] Deduced a trap composed of 8 places in 284 ms
[2020-05-22 08:41:14] [INFO ] Deduced a trap composed of 4 places in 272 ms
[2020-05-22 08:41:14] [INFO ] Deduced a trap composed of 21 places in 265 ms
[2020-05-22 08:41:14] [INFO ] Deduced a trap composed of 114 places in 266 ms
[2020-05-22 08:41:15] [INFO ] Deduced a trap composed of 152 places in 289 ms
[2020-05-22 08:41:15] [INFO ] Deduced a trap composed of 123 places in 267 ms
[2020-05-22 08:41:15] [INFO ] Deduced a trap composed of 114 places in 270 ms
[2020-05-22 08:41:16] [INFO ] Deduced a trap composed of 118 places in 263 ms
[2020-05-22 08:41:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4426 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-05-22 08:41:16] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:41:16] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 52 ms returned sat
[2020-05-22 08:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:41:17] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2020-05-22 08:41:17] [INFO ] [Real]Added 71 Read/Feed constraints in 33 ms returned sat
[2020-05-22 08:41:17] [INFO ] Deduced a trap composed of 12 places in 237 ms
[2020-05-22 08:41:17] [INFO ] Deduced a trap composed of 12 places in 235 ms
[2020-05-22 08:41:18] [INFO ] Deduced a trap composed of 18 places in 198 ms
[2020-05-22 08:41:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 732 ms
[2020-05-22 08:41:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:41:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 08:41:18] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 49 ms returned sat
[2020-05-22 08:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:41:18] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2020-05-22 08:41:19] [INFO ] [Nat]Added 71 Read/Feed constraints in 292 ms returned sat
[2020-05-22 08:41:19] [INFO ] Deduced a trap composed of 175 places in 245 ms
[2020-05-22 08:41:19] [INFO ] Deduced a trap composed of 179 places in 220 ms
[2020-05-22 08:41:19] [INFO ] Deduced a trap composed of 184 places in 291 ms
[2020-05-22 08:41:20] [INFO ] Deduced a trap composed of 170 places in 190 ms
[2020-05-22 08:41:20] [INFO ] Deduced a trap composed of 182 places in 170 ms
[2020-05-22 08:41:20] [INFO ] Deduced a trap composed of 186 places in 174 ms
[2020-05-22 08:41:20] [INFO ] Deduced a trap composed of 172 places in 151 ms
[2020-05-22 08:41:20] [INFO ] Deduced a trap composed of 34 places in 135 ms
[2020-05-22 08:41:21] [INFO ] Deduced a trap composed of 77 places in 160 ms
[2020-05-22 08:41:21] [INFO ] Deduced a trap composed of 73 places in 171 ms
[2020-05-22 08:41:21] [INFO ] Deduced a trap composed of 162 places in 194 ms
[2020-05-22 08:41:21] [INFO ] Deduced a trap composed of 158 places in 169 ms
[2020-05-22 08:41:21] [INFO ] Deduced a trap composed of 150 places in 195 ms
[2020-05-22 08:41:22] [INFO ] Deduced a trap composed of 159 places in 190 ms
[2020-05-22 08:41:22] [INFO ] Deduced a trap composed of 152 places in 196 ms
[2020-05-22 08:41:22] [INFO ] Deduced a trap composed of 168 places in 157 ms
[2020-05-22 08:41:22] [INFO ] Deduced a trap composed of 152 places in 182 ms
[2020-05-22 08:41:22] [INFO ] Deduced a trap composed of 162 places in 144 ms
[2020-05-22 08:41:23] [INFO ] Deduced a trap composed of 165 places in 141 ms
[2020-05-22 08:41:23] [INFO ] Deduced a trap composed of 177 places in 140 ms
[2020-05-22 08:41:23] [INFO ] Deduced a trap composed of 172 places in 137 ms
[2020-05-22 08:41:23] [INFO ] Deduced a trap composed of 158 places in 138 ms
[2020-05-22 08:41:23] [INFO ] Deduced a trap composed of 150 places in 144 ms
[2020-05-22 08:41:23] [INFO ] Deduced a trap composed of 157 places in 145 ms
[2020-05-22 08:41:24] [INFO ] Deduced a trap composed of 153 places in 146 ms
[2020-05-22 08:41:24] [INFO ] Deduced a trap composed of 171 places in 166 ms
[2020-05-22 08:41:24] [INFO ] Deduced a trap composed of 50 places in 158 ms
[2020-05-22 08:41:24] [INFO ] Deduced a trap composed of 68 places in 142 ms
[2020-05-22 08:41:24] [INFO ] Deduced a trap composed of 46 places in 153 ms
[2020-05-22 08:41:24] [INFO ] Deduced a trap composed of 62 places in 142 ms
[2020-05-22 08:41:25] [INFO ] Deduced a trap composed of 172 places in 153 ms
[2020-05-22 08:41:25] [INFO ] Deduced a trap composed of 56 places in 140 ms
[2020-05-22 08:41:25] [INFO ] Deduced a trap composed of 84 places in 152 ms
[2020-05-22 08:41:25] [INFO ] Deduced a trap composed of 66 places in 161 ms
[2020-05-22 08:41:25] [INFO ] Deduced a trap composed of 187 places in 143 ms
[2020-05-22 08:41:25] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6586 ms
[2020-05-22 08:41:25] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 22 ms.
[2020-05-22 08:41:45] [INFO ] Added : 390 causal constraints over 78 iterations in 19406 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-05-22 08:41:45] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:41:45] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 80 ms returned sat
[2020-05-22 08:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:41:46] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2020-05-22 08:41:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 20 ms returned sat
[2020-05-22 08:41:46] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 73 ms returned sat
[2020-05-22 08:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:41:47] [INFO ] [Nat]Absence check using state equation in 1145 ms returned sat
[2020-05-22 08:41:48] [INFO ] [Nat]Added 71 Read/Feed constraints in 155 ms returned sat
[2020-05-22 08:41:48] [INFO ] Deduced a trap composed of 48 places in 117 ms
[2020-05-22 08:41:48] [INFO ] Deduced a trap composed of 50 places in 86 ms
[2020-05-22 08:41:48] [INFO ] Deduced a trap composed of 44 places in 115 ms
[2020-05-22 08:41:48] [INFO ] Deduced a trap composed of 42 places in 150 ms
[2020-05-22 08:41:48] [INFO ] Deduced a trap composed of 46 places in 110 ms
[2020-05-22 08:41:48] [INFO ] Deduced a trap composed of 60 places in 96 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 56 places in 78 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 78 places in 87 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 62 places in 112 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 77 places in 122 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 88 places in 90 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 56 places in 137 ms
[2020-05-22 08:41:49] [INFO ] Deduced a trap composed of 40 places in 132 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 99 places in 103 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 94 places in 103 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 60 places in 104 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 91 places in 105 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 94 places in 87 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 93 places in 131 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 105 places in 107 ms
[2020-05-22 08:41:50] [INFO ] Deduced a trap composed of 99 places in 81 ms
[2020-05-22 08:41:51] [INFO ] Deduced a trap composed of 99 places in 96 ms
[2020-05-22 08:41:51] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3079 ms
[2020-05-22 08:41:51] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 40 ms.
[2020-05-22 08:42:08] [INFO ] Added : 469 causal constraints over 95 iterations in 17107 ms. Result :sat
[2020-05-22 08:42:08] [INFO ] Deduced a trap composed of 13 places in 246 ms
[2020-05-22 08:42:08] [INFO ] Deduced a trap composed of 16 places in 221 ms
[2020-05-22 08:42:09] [INFO ] Deduced a trap composed of 20 places in 222 ms
[2020-05-22 08:42:09] [INFO ] Deduced a trap composed of 4 places in 202 ms
[2020-05-22 08:42:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1318 ms
Attempting to minimize the solution found.
Minimization took 67 ms.
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 10673076 steps, including 1612095 resets, run timeout after 30001 ms. (steps per millisecond=355 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 5755300 steps, including 869463 resets, run finished after 14472 ms. (steps per millisecond=397 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 11391922 steps, including 1720463 resets, run timeout after 30001 ms. (steps per millisecond=379 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12446964 steps, including 1880356 resets, run timeout after 30001 ms. (steps per millisecond=414 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12405318 steps, including 1873964 resets, run timeout after 30001 ms. (steps per millisecond=413 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12803863 steps, including 1934253 resets, run timeout after 30001 ms. (steps per millisecond=426 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12784702 steps, including 1931346 resets, run timeout after 30001 ms. (steps per millisecond=426 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12947511 steps, including 1956207 resets, run timeout after 30001 ms. (steps per millisecond=431 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 290700 steps, including 44016 resets, run finished after 755 ms. (steps per millisecond=385 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 33 out of 504 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 504/504 places, 477/477 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 477/477 transitions.
Starting structural reductions, iteration 0 : 504/504 places, 477/477 transitions.
Applied a total of 0 rules in 13 ms. Remains 504 /504 variables (removed 0) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 504 cols
[2020-05-22 08:45:55] [INFO ] Computed 100 place invariants in 68 ms
[2020-05-22 08:45:57] [INFO ] Implicit Places using invariants in 2053 ms returned [14, 19, 47, 53, 73, 78, 129, 135, 157, 162, 163, 186, 191, 212, 219, 226, 240, 245, 276, 299, 305, 355, 360, 386, 392, 413, 415, 419, 439, 445, 470, 475, 479, 496, 502]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 2057 ms to find 35 implicit places.
[2020-05-22 08:45:57] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 477 rows 469 cols
[2020-05-22 08:45:57] [INFO ] Computed 66 place invariants in 35 ms
[2020-05-22 08:45:57] [INFO ] Dead Transitions using invariants and state equation in 845 ms returned []
Starting structural reductions, iteration 1 : 469/504 places, 477/477 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 476
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 468 transition count 462
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 30 place count 454 transition count 462
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 454 transition count 462
Applied a total of 36 rules in 81 ms. Remains 454 /469 variables (removed 15) and now considering 462/477 (removed 15) transitions.
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:45:58] [INFO ] Computed 66 place invariants in 56 ms
[2020-05-22 08:45:58] [INFO ] Implicit Places using invariants in 762 ms returned []
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:45:58] [INFO ] Computed 66 place invariants in 39 ms
[2020-05-22 08:45:59] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-22 08:46:03] [INFO ] Implicit Places using invariants and state equation in 5210 ms returned []
Implicit Place search using SMT with State Equation took 5982 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 454/504 places, 462/477 transitions.
Incomplete random walk after 1000000 steps, including 143060 resets, run finished after 2024 ms. (steps per millisecond=494 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 90829 resets, run finished after 1355 ms. (steps per millisecond=738 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91022 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90913 resets, run finished after 1327 ms. (steps per millisecond=753 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90867 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 91171 resets, run finished after 1329 ms. (steps per millisecond=752 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91070 resets, run finished after 1368 ms. (steps per millisecond=730 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90852 resets, run finished after 1335 ms. (steps per millisecond=749 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90934 resets, run finished after 1372 ms. (steps per millisecond=728 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91076 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 90714 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5287300 steps, run timeout after 30001 ms. (steps per millisecond=176 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5287300 steps, saw 2643221 distinct states, run finished after 30001 ms. (steps per millisecond=176 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:46:49] [INFO ] Computed 66 place invariants in 38 ms
[2020-05-22 08:46:49] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:46:49] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 58 ms returned sat
[2020-05-22 08:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:46:50] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2020-05-22 08:46:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:46:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-05-22 08:46:50] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-05-22 08:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:46:51] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2020-05-22 08:46:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-22 08:46:51] [INFO ] [Nat]Added 71 Read/Feed constraints in 62 ms returned sat
[2020-05-22 08:46:51] [INFO ] Deduced a trap composed of 4 places in 175 ms
[2020-05-22 08:46:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2020-05-22 08:46:51] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 42 ms.
[2020-05-22 08:47:04] [INFO ] Added : 415 causal constraints over 83 iterations in 12495 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-22 08:47:04] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:47:04] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 30 ms returned sat
[2020-05-22 08:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:47:04] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2020-05-22 08:47:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:47:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:47:05] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 41 ms returned sat
[2020-05-22 08:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:47:05] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2020-05-22 08:47:06] [INFO ] [Nat]Added 71 Read/Feed constraints in 125 ms returned sat
[2020-05-22 08:47:06] [INFO ] Deduced a trap composed of 24 places in 189 ms
[2020-05-22 08:47:06] [INFO ] Deduced a trap composed of 11 places in 149 ms
[2020-05-22 08:47:06] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-05-22 08:47:06] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-05-22 08:47:06] [INFO ] Deduced a trap composed of 28 places in 112 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 28 places in 124 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 34 places in 100 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 38 places in 107 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 44 places in 88 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 46 places in 85 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 38 places in 92 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 34 places in 93 ms
[2020-05-22 08:47:07] [INFO ] Deduced a trap composed of 39 places in 80 ms
[2020-05-22 08:47:08] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2020-05-22 08:47:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1989 ms
[2020-05-22 08:47:08] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 20 ms.
[2020-05-22 08:47:21] [INFO ] Added : 413 causal constraints over 84 iterations in 13752 ms. Result :sat
[2020-05-22 08:47:22] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-05-22 08:47:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-05-22 08:47:22] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-05-22 08:47:22] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 42 ms returned sat
[2020-05-22 08:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:47:23] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2020-05-22 08:47:23] [INFO ] [Real]Added 71 Read/Feed constraints in 43 ms returned sat
[2020-05-22 08:47:23] [INFO ] Deduced a trap composed of 17 places in 235 ms
[2020-05-22 08:47:23] [INFO ] Deduced a trap composed of 122 places in 216 ms
[2020-05-22 08:47:24] [INFO ] Deduced a trap composed of 119 places in 249 ms
[2020-05-22 08:47:24] [INFO ] Deduced a trap composed of 119 places in 219 ms
[2020-05-22 08:47:24] [INFO ] Deduced a trap composed of 41 places in 242 ms
[2020-05-22 08:47:24] [INFO ] Deduced a trap composed of 92 places in 193 ms
[2020-05-22 08:47:25] [INFO ] Deduced a trap composed of 138 places in 195 ms
[2020-05-22 08:47:25] [INFO ] Deduced a trap composed of 126 places in 186 ms
[2020-05-22 08:47:25] [INFO ] Deduced a trap composed of 118 places in 163 ms
[2020-05-22 08:47:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2131 ms
[2020-05-22 08:47:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:47:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-05-22 08:47:25] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 27 ms returned sat
[2020-05-22 08:47:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:47:26] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2020-05-22 08:47:26] [INFO ] [Nat]Added 71 Read/Feed constraints in 152 ms returned sat
[2020-05-22 08:47:26] [INFO ] Deduced a trap composed of 4 places in 193 ms
[2020-05-22 08:47:26] [INFO ] Deduced a trap composed of 129 places in 186 ms
[2020-05-22 08:47:26] [INFO ] Deduced a trap composed of 140 places in 178 ms
[2020-05-22 08:47:27] [INFO ] Deduced a trap composed of 144 places in 192 ms
[2020-05-22 08:47:27] [INFO ] Deduced a trap composed of 139 places in 146 ms
[2020-05-22 08:47:27] [INFO ] Deduced a trap composed of 135 places in 129 ms
[2020-05-22 08:47:27] [INFO ] Deduced a trap composed of 124 places in 146 ms
[2020-05-22 08:47:27] [INFO ] Deduced a trap composed of 125 places in 134 ms
[2020-05-22 08:47:27] [INFO ] Deduced a trap composed of 134 places in 133 ms
[2020-05-22 08:47:28] [INFO ] Deduced a trap composed of 134 places in 140 ms
[2020-05-22 08:47:28] [INFO ] Deduced a trap composed of 138 places in 137 ms
[2020-05-22 08:47:28] [INFO ] Deduced a trap composed of 134 places in 171 ms
[2020-05-22 08:47:28] [INFO ] Deduced a trap composed of 136 places in 148 ms
[2020-05-22 08:47:28] [INFO ] Deduced a trap composed of 121 places in 167 ms
[2020-05-22 08:47:29] [INFO ] Deduced a trap composed of 133 places in 188 ms
[2020-05-22 08:47:29] [INFO ] Deduced a trap composed of 131 places in 144 ms
[2020-05-22 08:47:29] [INFO ] Deduced a trap composed of 110 places in 147 ms
[2020-05-22 08:47:29] [INFO ] Deduced a trap composed of 133 places in 193 ms
[2020-05-22 08:47:29] [INFO ] Deduced a trap composed of 138 places in 138 ms
[2020-05-22 08:47:29] [INFO ] Deduced a trap composed of 134 places in 139 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 137 places in 153 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 131 places in 158 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 144 places in 135 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 136 places in 124 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 139 places in 124 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 146 places in 129 ms
[2020-05-22 08:47:30] [INFO ] Deduced a trap composed of 138 places in 132 ms
[2020-05-22 08:47:31] [INFO ] Deduced a trap composed of 143 places in 131 ms
[2020-05-22 08:47:31] [INFO ] Deduced a trap composed of 147 places in 129 ms
[2020-05-22 08:47:31] [INFO ] Deduced a trap composed of 138 places in 132 ms
[2020-05-22 08:47:31] [INFO ] Deduced a trap composed of 151 places in 125 ms
[2020-05-22 08:47:31] [INFO ] Deduced a trap composed of 134 places in 123 ms
[2020-05-22 08:47:31] [INFO ] Deduced a trap composed of 123 places in 129 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 147 places in 131 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 150 places in 140 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 138 places in 130 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 138 places in 140 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 143 places in 138 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 142 places in 133 ms
[2020-05-22 08:47:32] [INFO ] Deduced a trap composed of 136 places in 129 ms
[2020-05-22 08:47:33] [INFO ] Deduced a trap composed of 156 places in 139 ms
[2020-05-22 08:47:33] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 6759 ms
[2020-05-22 08:47:33] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 18 ms.
[2020-05-22 08:47:52] [INFO ] Added : 399 causal constraints over 80 iterations in 19095 ms. Result :sat
[2020-05-22 08:47:52] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-05-22 08:47:52] [INFO ] Deduced a trap composed of 147 places in 280 ms
[2020-05-22 08:47:53] [INFO ] Deduced a trap composed of 148 places in 247 ms
[2020-05-22 08:47:53] [INFO ] Deduced a trap composed of 143 places in 230 ms
[2020-05-22 08:47:53] [INFO ] Deduced a trap composed of 139 places in 228 ms
[2020-05-22 08:47:54] [INFO ] Deduced a trap composed of 146 places in 171 ms
[2020-05-22 08:47:54] [INFO ] Deduced a trap composed of 21 places in 220 ms
[2020-05-22 08:47:54] [INFO ] Deduced a trap composed of 150 places in 173 ms
[2020-05-22 08:47:54] [INFO ] Deduced a trap composed of 135 places in 200 ms
[2020-05-22 08:47:55] [INFO ] Deduced a trap composed of 134 places in 172 ms
[2020-05-22 08:47:55] [INFO ] Deduced a trap composed of 140 places in 144 ms
[2020-05-22 08:47:55] [INFO ] Deduced a trap composed of 152 places in 145 ms
[2020-05-22 08:47:55] [INFO ] Deduced a trap composed of 149 places in 153 ms
[2020-05-22 08:47:55] [INFO ] Deduced a trap composed of 149 places in 166 ms
[2020-05-22 08:47:56] [INFO ] Deduced a trap composed of 148 places in 213 ms
[2020-05-22 08:47:56] [INFO ] Deduced a trap composed of 141 places in 231 ms
[2020-05-22 08:47:56] [INFO ] Deduced a trap composed of 157 places in 188 ms
[2020-05-22 08:47:56] [INFO ] Deduced a trap composed of 11 places in 193 ms
[2020-05-22 08:47:57] [INFO ] Deduced a trap composed of 155 places in 145 ms
[2020-05-22 08:47:57] [INFO ] Deduced a trap composed of 142 places in 187 ms
[2020-05-22 08:47:57] [INFO ] Deduced a trap composed of 168 places in 172 ms
[2020-05-22 08:47:57] [INFO ] Deduced a trap composed of 143 places in 210 ms
[2020-05-22 08:47:58] [INFO ] Deduced a trap composed of 146 places in 176 ms
[2020-05-22 08:47:58] [INFO ] Deduced a trap composed of 156 places in 164 ms
[2020-05-22 08:47:58] [INFO ] Deduced a trap composed of 155 places in 151 ms
[2020-05-22 08:47:58] [INFO ] Deduced a trap composed of 160 places in 155 ms
[2020-05-22 08:47:58] [INFO ] Deduced a trap composed of 151 places in 146 ms
[2020-05-22 08:47:59] [INFO ] Deduced a trap composed of 142 places in 169 ms
[2020-05-22 08:47:59] [INFO ] Deduced a trap composed of 162 places in 151 ms
[2020-05-22 08:47:59] [INFO ] Deduced a trap composed of 156 places in 134 ms
[2020-05-22 08:47:59] [INFO ] Deduced a trap composed of 158 places in 175 ms
[2020-05-22 08:48:00] [INFO ] Deduced a trap composed of 152 places in 198 ms
[2020-05-22 08:48:00] [INFO ] Deduced a trap composed of 167 places in 171 ms
[2020-05-22 08:48:00] [INFO ] Deduced a trap composed of 160 places in 155 ms
[2020-05-22 08:48:00] [INFO ] Deduced a trap composed of 149 places in 151 ms
[2020-05-22 08:48:00] [INFO ] Deduced a trap composed of 147 places in 166 ms
[2020-05-22 08:48:01] [INFO ] Deduced a trap composed of 14 places in 192 ms
[2020-05-22 08:48:01] [INFO ] Deduced a trap composed of 21 places in 143 ms
[2020-05-22 08:48:02] [INFO ] Deduced a trap composed of 153 places in 199 ms
[2020-05-22 08:48:02] [INFO ] Deduced a trap composed of 137 places in 177 ms
[2020-05-22 08:48:02] [INFO ] Deduced a trap composed of 135 places in 151 ms
[2020-05-22 08:48:02] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 10402 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-05-22 08:48:02] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:48:02] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 56 ms returned sat
[2020-05-22 08:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:48:03] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2020-05-22 08:48:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:48:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 29 ms returned sat
[2020-05-22 08:48:03] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 42 ms returned sat
[2020-05-22 08:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:48:04] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2020-05-22 08:48:04] [INFO ] [Nat]Added 71 Read/Feed constraints in 121 ms returned sat
[2020-05-22 08:48:04] [INFO ] Deduced a trap composed of 34 places in 143 ms
[2020-05-22 08:48:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2020-05-22 08:48:04] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 26 ms.
[2020-05-22 08:48:24] [INFO ] Added : 426 causal constraints over 86 iterations in 20050 ms. Result :sat
[2020-05-22 08:48:25] [INFO ] Deduced a trap composed of 21 places in 206 ms
[2020-05-22 08:48:25] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2020-05-22 08:48:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-22 08:48:25] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-05-22 08:48:25] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 61 ms returned sat
[2020-05-22 08:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:48:26] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2020-05-22 08:48:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:48:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-05-22 08:48:26] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 39 ms returned sat
[2020-05-22 08:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:48:26] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2020-05-22 08:48:27] [INFO ] [Nat]Added 71 Read/Feed constraints in 361 ms returned sat
[2020-05-22 08:48:27] [INFO ] Deduced a trap composed of 4 places in 212 ms
[2020-05-22 08:48:27] [INFO ] Deduced a trap composed of 130 places in 181 ms
[2020-05-22 08:48:27] [INFO ] Deduced a trap composed of 122 places in 168 ms
[2020-05-22 08:48:27] [INFO ] Deduced a trap composed of 145 places in 193 ms
[2020-05-22 08:48:28] [INFO ] Deduced a trap composed of 137 places in 149 ms
[2020-05-22 08:48:28] [INFO ] Deduced a trap composed of 140 places in 154 ms
[2020-05-22 08:48:28] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-05-22 08:48:28] [INFO ] Deduced a trap composed of 144 places in 140 ms
[2020-05-22 08:48:28] [INFO ] Deduced a trap composed of 137 places in 167 ms
[2020-05-22 08:48:28] [INFO ] Deduced a trap composed of 146 places in 166 ms
[2020-05-22 08:48:29] [INFO ] Deduced a trap composed of 140 places in 140 ms
[2020-05-22 08:48:29] [INFO ] Deduced a trap composed of 134 places in 140 ms
[2020-05-22 08:48:29] [INFO ] Deduced a trap composed of 136 places in 144 ms
[2020-05-22 08:48:29] [INFO ] Deduced a trap composed of 134 places in 167 ms
[2020-05-22 08:48:29] [INFO ] Deduced a trap composed of 137 places in 137 ms
[2020-05-22 08:48:29] [INFO ] Deduced a trap composed of 139 places in 156 ms
[2020-05-22 08:48:30] [INFO ] Deduced a trap composed of 136 places in 164 ms
[2020-05-22 08:48:30] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-05-22 08:48:30] [INFO ] Deduced a trap composed of 135 places in 132 ms
[2020-05-22 08:48:30] [INFO ] Deduced a trap composed of 137 places in 161 ms
[2020-05-22 08:48:30] [INFO ] Deduced a trap composed of 151 places in 150 ms
[2020-05-22 08:48:30] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3756 ms
[2020-05-22 08:48:30] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 18 ms.
[2020-05-22 08:48:38] [INFO ] Added : 255 causal constraints over 51 iterations in 8029 ms. Result :sat
[2020-05-22 08:48:39] [INFO ] Deduced a trap composed of 8 places in 237 ms
[2020-05-22 08:48:39] [INFO ] Deduced a trap composed of 131 places in 221 ms
[2020-05-22 08:48:39] [INFO ] Deduced a trap composed of 136 places in 266 ms
[2020-05-22 08:48:39] [INFO ] Deduced a trap composed of 24 places in 171 ms
[2020-05-22 08:48:40] [INFO ] Deduced a trap composed of 132 places in 185 ms
[2020-05-22 08:48:40] [INFO ] Deduced a trap composed of 138 places in 170 ms
[2020-05-22 08:48:40] [INFO ] Deduced a trap composed of 140 places in 168 ms
[2020-05-22 08:48:40] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-05-22 08:48:40] [INFO ] Deduced a trap composed of 130 places in 182 ms
[2020-05-22 08:48:41] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2020-05-22 08:48:41] [INFO ] Deduced a trap composed of 18 places in 189 ms
[2020-05-22 08:48:41] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-05-22 08:48:41] [INFO ] Deduced a trap composed of 15 places in 209 ms
[2020-05-22 08:48:42] [INFO ] Deduced a trap composed of 24 places in 214 ms
[2020-05-22 08:48:42] [INFO ] Deduced a trap composed of 130 places in 156 ms
[2020-05-22 08:48:42] [INFO ] Deduced a trap composed of 142 places in 220 ms
[2020-05-22 08:48:43] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-05-22 08:48:43] [INFO ] Deduced a trap composed of 151 places in 179 ms
[2020-05-22 08:48:43] [INFO ] Deduced a trap composed of 140 places in 160 ms
[2020-05-22 08:48:43] [INFO ] Deduced a trap composed of 135 places in 162 ms
[2020-05-22 08:48:43] [INFO ] Deduced a trap composed of 128 places in 168 ms
[2020-05-22 08:48:44] [INFO ] Deduced a trap composed of 146 places in 162 ms
[2020-05-22 08:48:44] [INFO ] Deduced a trap composed of 118 places in 154 ms
[2020-05-22 08:48:45] [INFO ] Deduced a trap composed of 11 places in 231 ms
[2020-05-22 08:48:45] [INFO ] Deduced a trap composed of 134 places in 181 ms
[2020-05-22 08:48:45] [INFO ] Deduced a trap composed of 111 places in 193 ms
[2020-05-22 08:48:45] [INFO ] Deduced a trap composed of 23 places in 243 ms
[2020-05-22 08:48:46] [INFO ] Deduced a trap composed of 135 places in 243 ms
[2020-05-22 08:48:46] [INFO ] Deduced a trap composed of 142 places in 178 ms
[2020-05-22 08:48:46] [INFO ] Deduced a trap composed of 125 places in 208 ms
[2020-05-22 08:48:47] [INFO ] Deduced a trap composed of 120 places in 183 ms
[2020-05-22 08:48:49] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 10204 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-22 08:48:49] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:48:49] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 56 ms returned sat
[2020-05-22 08:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:48:50] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2020-05-22 08:48:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:48:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:48:50] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 45 ms returned sat
[2020-05-22 08:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:48:51] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2020-05-22 08:48:51] [INFO ] [Nat]Added 71 Read/Feed constraints in 130 ms returned sat
[2020-05-22 08:48:51] [INFO ] Deduced a trap composed of 122 places in 228 ms
[2020-05-22 08:48:51] [INFO ] Deduced a trap composed of 29 places in 198 ms
[2020-05-22 08:48:51] [INFO ] Deduced a trap composed of 142 places in 191 ms
[2020-05-22 08:48:52] [INFO ] Deduced a trap composed of 143 places in 203 ms
[2020-05-22 08:48:52] [INFO ] Deduced a trap composed of 131 places in 170 ms
[2020-05-22 08:48:52] [INFO ] Deduced a trap composed of 134 places in 157 ms
[2020-05-22 08:48:52] [INFO ] Deduced a trap composed of 141 places in 131 ms
[2020-05-22 08:48:52] [INFO ] Deduced a trap composed of 139 places in 163 ms
[2020-05-22 08:48:53] [INFO ] Deduced a trap composed of 143 places in 150 ms
[2020-05-22 08:48:53] [INFO ] Deduced a trap composed of 139 places in 150 ms
[2020-05-22 08:48:53] [INFO ] Deduced a trap composed of 133 places in 146 ms
[2020-05-22 08:48:53] [INFO ] Deduced a trap composed of 144 places in 171 ms
[2020-05-22 08:48:53] [INFO ] Deduced a trap composed of 146 places in 128 ms
[2020-05-22 08:48:53] [INFO ] Deduced a trap composed of 151 places in 137 ms
[2020-05-22 08:48:54] [INFO ] Deduced a trap composed of 150 places in 125 ms
[2020-05-22 08:48:54] [INFO ] Deduced a trap composed of 137 places in 136 ms
[2020-05-22 08:48:54] [INFO ] Deduced a trap composed of 141 places in 149 ms
[2020-05-22 08:48:54] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3131 ms
[2020-05-22 08:48:54] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 32 ms.
[2020-05-22 08:49:08] [INFO ] Added : 395 causal constraints over 79 iterations in 13934 ms. Result :sat
[2020-05-22 08:49:08] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-22 08:49:08] [INFO ] Deduced a trap composed of 12 places in 162 ms
[2020-05-22 08:49:08] [INFO ] Deduced a trap composed of 11 places in 174 ms
[2020-05-22 08:49:09] [INFO ] Deduced a trap composed of 3 places in 179 ms
[2020-05-22 08:49:09] [INFO ] Deduced a trap composed of 11 places in 152 ms
[2020-05-22 08:49:09] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-05-22 08:49:09] [INFO ] Deduced a trap composed of 30 places in 138 ms
[2020-05-22 08:49:09] [INFO ] Deduced a trap composed of 49 places in 95 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 69 places in 112 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 28 places in 102 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 35 places in 93 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 65 places in 57 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 56 places in 55 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 80 places in 46 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 60 places in 46 ms
[2020-05-22 08:49:10] [INFO ] Deduced a trap composed of 76 places in 58 ms
[2020-05-22 08:49:11] [INFO ] Deduced a trap composed of 76 places in 70 ms
[2020-05-22 08:49:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2909 ms
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-05-22 08:49:11] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:49:11] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 36 ms returned sat
[2020-05-22 08:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:49:12] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2020-05-22 08:49:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:49:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-05-22 08:49:12] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 34 ms returned sat
[2020-05-22 08:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:49:12] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2020-05-22 08:49:12] [INFO ] [Nat]Added 71 Read/Feed constraints in 35 ms returned sat
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 101 places in 197 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 57 places in 113 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 53 places in 111 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 29 places in 118 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 55 places in 62 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 62 places in 84 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 65 places in 75 ms
[2020-05-22 08:49:13] [INFO ] Deduced a trap composed of 58 places in 54 ms
[2020-05-22 08:49:14] [INFO ] Deduced a trap composed of 56 places in 41 ms
[2020-05-22 08:49:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1056 ms
[2020-05-22 08:49:14] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 20 ms.
[2020-05-22 08:49:34] [INFO ] Added : 435 causal constraints over 87 iterations in 20702 ms.(timeout) Result :sat
[2020-05-22 08:49:35] [INFO ] Deduced a trap composed of 7 places in 212 ms
[2020-05-22 08:49:35] [INFO ] Deduced a trap composed of 9 places in 228 ms
[2020-05-22 08:49:35] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-05-22 08:49:35] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2020-05-22 08:49:36] [INFO ] Deduced a trap composed of 21 places in 200 ms
[2020-05-22 08:49:36] [INFO ] Deduced a trap composed of 156 places in 184 ms
[2020-05-22 08:49:36] [INFO ] Deduced a trap composed of 145 places in 199 ms
[2020-05-22 08:49:37] [INFO ] Deduced a trap composed of 149 places in 183 ms
[2020-05-22 08:49:37] [INFO ] Deduced a trap composed of 145 places in 208 ms
[2020-05-22 08:49:37] [INFO ] Deduced a trap composed of 157 places in 183 ms
[2020-05-22 08:49:37] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-05-22 08:49:38] [INFO ] Deduced a trap composed of 12 places in 181 ms
[2020-05-22 08:49:38] [INFO ] Deduced a trap composed of 141 places in 188 ms
[2020-05-22 08:49:38] [INFO ] Deduced a trap composed of 141 places in 187 ms
[2020-05-22 08:49:38] [INFO ] Deduced a trap composed of 149 places in 189 ms
[2020-05-22 08:49:39] [INFO ] Deduced a trap composed of 153 places in 181 ms
[2020-05-22 08:49:39] [INFO ] Deduced a trap composed of 34 places in 173 ms
[2020-05-22 08:49:39] [INFO ] Deduced a trap composed of 160 places in 183 ms
[2020-05-22 08:49:39] [INFO ] Deduced a trap composed of 158 places in 185 ms
[2020-05-22 08:49:40] [INFO ] Deduced a trap composed of 160 places in 194 ms
[2020-05-22 08:49:40] [INFO ] Deduced a trap composed of 144 places in 193 ms
[2020-05-22 08:49:40] [INFO ] Deduced a trap composed of 155 places in 177 ms
[2020-05-22 08:49:40] [INFO ] Deduced a trap composed of 163 places in 159 ms
[2020-05-22 08:49:41] [INFO ] Deduced a trap composed of 157 places in 191 ms
[2020-05-22 08:49:41] [INFO ] Deduced a trap composed of 40 places in 156 ms
[2020-05-22 08:49:41] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-05-22 08:49:42] [INFO ] Deduced a trap composed of 18 places in 183 ms
[2020-05-22 08:49:42] [INFO ] Deduced a trap composed of 30 places in 200 ms
[2020-05-22 08:49:42] [INFO ] Deduced a trap composed of 156 places in 220 ms
[2020-05-22 08:49:43] [INFO ] Deduced a trap composed of 162 places in 192 ms
[2020-05-22 08:49:43] [INFO ] Deduced a trap composed of 148 places in 207 ms
[2020-05-22 08:49:43] [INFO ] Deduced a trap composed of 153 places in 196 ms
[2020-05-22 08:49:44] [INFO ] Deduced a trap composed of 142 places in 190 ms
[2020-05-22 08:49:44] [INFO ] Deduced a trap composed of 48 places in 185 ms
[2020-05-22 08:49:44] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9797 ms
Attempting to minimize the solution found.
Minimization took 39 ms.
[2020-05-22 08:49:44] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-05-22 08:49:44] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 50 ms returned sat
[2020-05-22 08:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:49:45] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2020-05-22 08:49:45] [INFO ] [Real]Added 71 Read/Feed constraints in 11 ms returned sat
[2020-05-22 08:49:45] [INFO ] Deduced a trap composed of 12 places in 202 ms
[2020-05-22 08:49:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2020-05-22 08:49:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:49:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:49:45] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 45 ms returned sat
[2020-05-22 08:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:49:46] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2020-05-22 08:49:46] [INFO ] [Nat]Added 71 Read/Feed constraints in 230 ms returned sat
[2020-05-22 08:49:46] [INFO ] Deduced a trap composed of 4 places in 141 ms
[2020-05-22 08:49:46] [INFO ] Deduced a trap composed of 14 places in 142 ms
[2020-05-22 08:49:46] [INFO ] Deduced a trap composed of 11 places in 127 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 18 places in 104 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 15 places in 105 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 24 places in 94 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 28 places in 97 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 89 places in 103 ms
[2020-05-22 08:49:47] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-05-22 08:49:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1328 ms
[2020-05-22 08:49:47] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 42 ms.
[2020-05-22 08:49:55] [INFO ] Added : 347 causal constraints over 70 iterations in 8033 ms. Result :sat
[2020-05-22 08:49:56] [INFO ] Deduced a trap composed of 21 places in 262 ms
[2020-05-22 08:49:56] [INFO ] Deduced a trap composed of 141 places in 212 ms
[2020-05-22 08:49:56] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-05-22 08:49:56] [INFO ] Deduced a trap composed of 154 places in 184 ms
[2020-05-22 08:49:57] [INFO ] Deduced a trap composed of 105 places in 170 ms
[2020-05-22 08:49:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1465 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-22 08:49:57] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:49:57] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 46 ms returned sat
[2020-05-22 08:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:49:58] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-05-22 08:49:58] [INFO ] [Real]Added 71 Read/Feed constraints in 22 ms returned sat
[2020-05-22 08:49:58] [INFO ] Deduced a trap composed of 11 places in 194 ms
[2020-05-22 08:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2020-05-22 08:49:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:49:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-05-22 08:49:58] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 28 ms returned sat
[2020-05-22 08:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:49:59] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-05-22 08:49:59] [INFO ] [Nat]Added 71 Read/Feed constraints in 179 ms returned sat
[2020-05-22 08:49:59] [INFO ] Deduced a trap composed of 4 places in 200 ms
[2020-05-22 08:49:59] [INFO ] Deduced a trap composed of 129 places in 167 ms
[2020-05-22 08:49:59] [INFO ] Deduced a trap composed of 21 places in 179 ms
[2020-05-22 08:50:00] [INFO ] Deduced a trap composed of 136 places in 172 ms
[2020-05-22 08:50:00] [INFO ] Deduced a trap composed of 21 places in 147 ms
[2020-05-22 08:50:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 990 ms
[2020-05-22 08:50:00] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 21 ms.
[2020-05-22 08:50:08] [INFO ] Added : 330 causal constraints over 66 iterations in 8735 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-05-22 08:50:09] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:50:09] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 50 ms returned sat
[2020-05-22 08:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:50:09] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2020-05-22 08:50:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:50:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:50:09] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 41 ms returned sat
[2020-05-22 08:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:50:10] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2020-05-22 08:50:10] [INFO ] [Nat]Added 71 Read/Feed constraints in 159 ms returned sat
[2020-05-22 08:50:10] [INFO ] Deduced a trap composed of 143 places in 195 ms
[2020-05-22 08:50:11] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2020-05-22 08:50:11] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2020-05-22 08:50:11] [INFO ] Deduced a trap composed of 149 places in 180 ms
[2020-05-22 08:50:11] [INFO ] Deduced a trap composed of 146 places in 173 ms
[2020-05-22 08:50:11] [INFO ] Deduced a trap composed of 142 places in 143 ms
[2020-05-22 08:50:12] [INFO ] Deduced a trap composed of 145 places in 131 ms
[2020-05-22 08:50:12] [INFO ] Deduced a trap composed of 146 places in 169 ms
[2020-05-22 08:50:12] [INFO ] Deduced a trap composed of 11 places in 151 ms
[2020-05-22 08:50:12] [INFO ] Deduced a trap composed of 141 places in 152 ms
[2020-05-22 08:50:12] [INFO ] Deduced a trap composed of 141 places in 158 ms
[2020-05-22 08:50:12] [INFO ] Deduced a trap composed of 144 places in 161 ms
[2020-05-22 08:50:13] [INFO ] Deduced a trap composed of 146 places in 144 ms
[2020-05-22 08:50:13] [INFO ] Deduced a trap composed of 11 places in 129 ms
[2020-05-22 08:50:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2560 ms
[2020-05-22 08:50:13] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 21 ms.
[2020-05-22 08:50:34] [INFO ] Added : 415 causal constraints over 83 iterations in 20947 ms.(timeout) Result :sat
[2020-05-22 08:50:34] [INFO ] Deduced a trap composed of 19 places in 272 ms
[2020-05-22 08:50:34] [INFO ] Deduced a trap composed of 3 places in 154 ms
[2020-05-22 08:50:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
Interrupted Parikh walk after 11660530 steps, including 1944263 resets, run timeout after 30002 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 209700 steps, including 34923 resets, run finished after 707 ms. (steps per millisecond=296 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1831300 steps, including 305468 resets, run finished after 4823 ms. (steps per millisecond=379 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 11641789 steps, including 1941264 resets, run timeout after 30001 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 3137300 steps, including 522889 resets, run finished after 8089 ms. (steps per millisecond=387 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 11814020 steps, including 1969983 resets, run timeout after 30001 ms. (steps per millisecond=393 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 6133900 steps, including 1022344 resets, run finished after 15912 ms. (steps per millisecond=385 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 11815042 steps, including 1969285 resets, run timeout after 30001 ms. (steps per millisecond=393 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 427000 steps, including 71276 resets, run finished after 994 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 33 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 462/462 transitions.
Applied a total of 0 rules in 27 ms. Remains 454 /454 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 454/454 places, 462/462 transitions.
Starting structural reductions, iteration 0 : 454/454 places, 462/462 transitions.
Applied a total of 0 rules in 26 ms. Remains 454 /454 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:53:05] [INFO ] Computed 66 place invariants in 66 ms
[2020-05-22 08:53:06] [INFO ] Implicit Places using invariants in 949 ms returned []
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:53:06] [INFO ] Computed 66 place invariants in 39 ms
[2020-05-22 08:53:07] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-22 08:53:11] [INFO ] Implicit Places using invariants and state equation in 4770 ms returned []
Implicit Place search using SMT with State Equation took 5738 ms to find 0 implicit places.
[2020-05-22 08:53:11] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:53:11] [INFO ] Computed 66 place invariants in 53 ms
[2020-05-22 08:53:12] [INFO ] Dead Transitions using invariants and state equation in 1089 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/454 places, 462/462 transitions.
Incomplete random walk after 100000 steps, including 14338 resets, run finished after 202 ms. (steps per millisecond=495 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:53:12] [INFO ] Computed 66 place invariants in 38 ms
[2020-05-22 08:53:12] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-05-22 08:53:12] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 58 ms returned sat
[2020-05-22 08:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:53:13] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2020-05-22 08:53:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:53:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:53:13] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 45 ms returned sat
[2020-05-22 08:53:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:53:14] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2020-05-22 08:53:14] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-05-22 08:53:14] [INFO ] [Nat]Added 71 Read/Feed constraints in 98 ms returned sat
[2020-05-22 08:53:14] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-05-22 08:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2020-05-22 08:53:14] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 33 ms.
[2020-05-22 08:53:26] [INFO ] Added : 415 causal constraints over 83 iterations in 11537 ms. Result :sat
[2020-05-22 08:53:26] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2020-05-22 08:53:26] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 44 ms returned sat
[2020-05-22 08:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:53:27] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-05-22 08:53:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:53:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:53:27] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 42 ms returned sat
[2020-05-22 08:53:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:53:28] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2020-05-22 08:53:28] [INFO ] [Nat]Added 71 Read/Feed constraints in 153 ms returned sat
[2020-05-22 08:53:28] [INFO ] Deduced a trap composed of 24 places in 225 ms
[2020-05-22 08:53:28] [INFO ] Deduced a trap composed of 11 places in 153 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 27 places in 97 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 28 places in 105 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 28 places in 88 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 34 places in 107 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 38 places in 90 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 44 places in 101 ms
[2020-05-22 08:53:29] [INFO ] Deduced a trap composed of 46 places in 90 ms
[2020-05-22 08:53:30] [INFO ] Deduced a trap composed of 38 places in 101 ms
[2020-05-22 08:53:30] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2020-05-22 08:53:30] [INFO ] Deduced a trap composed of 34 places in 94 ms
[2020-05-22 08:53:30] [INFO ] Deduced a trap composed of 39 places in 92 ms
[2020-05-22 08:53:30] [INFO ] Deduced a trap composed of 32 places in 90 ms
[2020-05-22 08:53:30] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2023 ms
[2020-05-22 08:53:30] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 19 ms.
[2020-05-22 08:53:43] [INFO ] Added : 413 causal constraints over 84 iterations in 12711 ms. Result :sat
[2020-05-22 08:53:43] [INFO ] Deduced a trap composed of 11 places in 181 ms
[2020-05-22 08:53:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2020-05-22 08:53:43] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:53:43] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-05-22 08:53:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:53:44] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2020-05-22 08:53:44] [INFO ] [Real]Added 71 Read/Feed constraints in 40 ms returned sat
[2020-05-22 08:53:44] [INFO ] Deduced a trap composed of 17 places in 242 ms
[2020-05-22 08:53:45] [INFO ] Deduced a trap composed of 122 places in 212 ms
[2020-05-22 08:53:45] [INFO ] Deduced a trap composed of 119 places in 213 ms
[2020-05-22 08:53:45] [INFO ] Deduced a trap composed of 119 places in 164 ms
[2020-05-22 08:53:45] [INFO ] Deduced a trap composed of 41 places in 192 ms
[2020-05-22 08:53:45] [INFO ] Deduced a trap composed of 92 places in 170 ms
[2020-05-22 08:53:46] [INFO ] Deduced a trap composed of 138 places in 169 ms
[2020-05-22 08:53:46] [INFO ] Deduced a trap composed of 126 places in 167 ms
[2020-05-22 08:53:46] [INFO ] Deduced a trap composed of 118 places in 177 ms
[2020-05-22 08:53:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1966 ms
[2020-05-22 08:53:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:53:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-05-22 08:53:46] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 28 ms returned sat
[2020-05-22 08:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:53:47] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2020-05-22 08:53:47] [INFO ] [Nat]Added 71 Read/Feed constraints in 149 ms returned sat
[2020-05-22 08:53:47] [INFO ] Deduced a trap composed of 4 places in 132 ms
[2020-05-22 08:53:47] [INFO ] Deduced a trap composed of 129 places in 186 ms
[2020-05-22 08:53:47] [INFO ] Deduced a trap composed of 140 places in 169 ms
[2020-05-22 08:53:48] [INFO ] Deduced a trap composed of 144 places in 264 ms
[2020-05-22 08:53:48] [INFO ] Deduced a trap composed of 139 places in 163 ms
[2020-05-22 08:53:48] [INFO ] Deduced a trap composed of 135 places in 160 ms
[2020-05-22 08:53:48] [INFO ] Deduced a trap composed of 124 places in 177 ms
[2020-05-22 08:53:48] [INFO ] Deduced a trap composed of 125 places in 183 ms
[2020-05-22 08:53:49] [INFO ] Deduced a trap composed of 134 places in 161 ms
[2020-05-22 08:53:49] [INFO ] Deduced a trap composed of 134 places in 161 ms
[2020-05-22 08:53:49] [INFO ] Deduced a trap composed of 138 places in 166 ms
[2020-05-22 08:53:49] [INFO ] Deduced a trap composed of 134 places in 147 ms
[2020-05-22 08:53:49] [INFO ] Deduced a trap composed of 136 places in 138 ms
[2020-05-22 08:53:49] [INFO ] Deduced a trap composed of 121 places in 132 ms
[2020-05-22 08:53:50] [INFO ] Deduced a trap composed of 133 places in 170 ms
[2020-05-22 08:53:50] [INFO ] Deduced a trap composed of 131 places in 157 ms
[2020-05-22 08:53:50] [INFO ] Deduced a trap composed of 110 places in 154 ms
[2020-05-22 08:53:50] [INFO ] Deduced a trap composed of 133 places in 149 ms
[2020-05-22 08:53:50] [INFO ] Deduced a trap composed of 138 places in 149 ms
[2020-05-22 08:53:50] [INFO ] Deduced a trap composed of 134 places in 154 ms
[2020-05-22 08:53:51] [INFO ] Deduced a trap composed of 137 places in 174 ms
[2020-05-22 08:53:51] [INFO ] Deduced a trap composed of 131 places in 159 ms
[2020-05-22 08:53:51] [INFO ] Deduced a trap composed of 144 places in 161 ms
[2020-05-22 08:53:51] [INFO ] Deduced a trap composed of 136 places in 134 ms
[2020-05-22 08:53:51] [INFO ] Deduced a trap composed of 139 places in 157 ms
[2020-05-22 08:53:52] [INFO ] Deduced a trap composed of 146 places in 175 ms
[2020-05-22 08:53:52] [INFO ] Deduced a trap composed of 138 places in 142 ms
[2020-05-22 08:53:52] [INFO ] Deduced a trap composed of 143 places in 165 ms
[2020-05-22 08:53:52] [INFO ] Deduced a trap composed of 147 places in 141 ms
[2020-05-22 08:53:52] [INFO ] Deduced a trap composed of 138 places in 161 ms
[2020-05-22 08:53:52] [INFO ] Deduced a trap composed of 151 places in 162 ms
[2020-05-22 08:53:53] [INFO ] Deduced a trap composed of 134 places in 161 ms
[2020-05-22 08:53:53] [INFO ] Deduced a trap composed of 123 places in 175 ms
[2020-05-22 08:53:53] [INFO ] Deduced a trap composed of 147 places in 166 ms
[2020-05-22 08:53:53] [INFO ] Deduced a trap composed of 150 places in 148 ms
[2020-05-22 08:53:53] [INFO ] Deduced a trap composed of 138 places in 136 ms
[2020-05-22 08:53:53] [INFO ] Deduced a trap composed of 138 places in 138 ms
[2020-05-22 08:53:54] [INFO ] Deduced a trap composed of 143 places in 149 ms
[2020-05-22 08:53:54] [INFO ] Deduced a trap composed of 142 places in 178 ms
[2020-05-22 08:53:54] [INFO ] Deduced a trap composed of 136 places in 140 ms
[2020-05-22 08:53:54] [INFO ] Deduced a trap composed of 156 places in 155 ms
[2020-05-22 08:53:54] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7339 ms
[2020-05-22 08:53:54] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 17 ms.
[2020-05-22 08:54:06] [INFO ] Added : 340 causal constraints over 68 iterations in 11884 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-22 08:54:06] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-05-22 08:54:06] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 37 ms returned sat
[2020-05-22 08:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:54:07] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2020-05-22 08:54:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:54:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-05-22 08:54:07] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 39 ms returned sat
[2020-05-22 08:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:54:08] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2020-05-22 08:54:08] [INFO ] [Nat]Added 71 Read/Feed constraints in 70 ms returned sat
[2020-05-22 08:54:08] [INFO ] Deduced a trap composed of 34 places in 141 ms
[2020-05-22 08:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2020-05-22 08:54:08] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 24 ms.
[2020-05-22 08:54:27] [INFO ] Added : 425 causal constraints over 85 iterations in 18963 ms. Result :unknown
[2020-05-22 08:54:27] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:54:27] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-05-22 08:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:54:28] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2020-05-22 08:54:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:54:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:54:28] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 28 ms returned sat
[2020-05-22 08:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:54:28] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2020-05-22 08:54:29] [INFO ] [Nat]Added 71 Read/Feed constraints in 371 ms returned sat
[2020-05-22 08:54:29] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-05-22 08:54:29] [INFO ] Deduced a trap composed of 130 places in 203 ms
[2020-05-22 08:54:29] [INFO ] Deduced a trap composed of 122 places in 187 ms
[2020-05-22 08:54:30] [INFO ] Deduced a trap composed of 145 places in 199 ms
[2020-05-22 08:54:30] [INFO ] Deduced a trap composed of 137 places in 156 ms
[2020-05-22 08:54:30] [INFO ] Deduced a trap composed of 140 places in 164 ms
[2020-05-22 08:54:30] [INFO ] Deduced a trap composed of 140 places in 151 ms
[2020-05-22 08:54:30] [INFO ] Deduced a trap composed of 144 places in 182 ms
[2020-05-22 08:54:31] [INFO ] Deduced a trap composed of 137 places in 158 ms
[2020-05-22 08:54:31] [INFO ] Deduced a trap composed of 146 places in 169 ms
[2020-05-22 08:54:31] [INFO ] Deduced a trap composed of 140 places in 155 ms
[2020-05-22 08:54:31] [INFO ] Deduced a trap composed of 134 places in 158 ms
[2020-05-22 08:54:31] [INFO ] Deduced a trap composed of 136 places in 170 ms
[2020-05-22 08:54:31] [INFO ] Deduced a trap composed of 134 places in 168 ms
[2020-05-22 08:54:32] [INFO ] Deduced a trap composed of 137 places in 149 ms
[2020-05-22 08:54:32] [INFO ] Deduced a trap composed of 139 places in 148 ms
[2020-05-22 08:54:32] [INFO ] Deduced a trap composed of 136 places in 148 ms
[2020-05-22 08:54:32] [INFO ] Deduced a trap composed of 140 places in 172 ms
[2020-05-22 08:54:32] [INFO ] Deduced a trap composed of 135 places in 148 ms
[2020-05-22 08:54:33] [INFO ] Deduced a trap composed of 137 places in 163 ms
[2020-05-22 08:54:33] [INFO ] Deduced a trap composed of 151 places in 160 ms
[2020-05-22 08:54:33] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3947 ms
[2020-05-22 08:54:33] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 18 ms.
[2020-05-22 08:54:41] [INFO ] Added : 255 causal constraints over 51 iterations in 8125 ms. Result :sat
[2020-05-22 08:54:41] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-05-22 08:54:41] [INFO ] Deduced a trap composed of 15 places in 243 ms
[2020-05-22 08:54:42] [INFO ] Deduced a trap composed of 18 places in 230 ms
[2020-05-22 08:54:42] [INFO ] Deduced a trap composed of 136 places in 192 ms
[2020-05-22 08:54:42] [INFO ] Deduced a trap composed of 11 places in 185 ms
[2020-05-22 08:54:42] [INFO ] Deduced a trap composed of 24 places in 199 ms
[2020-05-22 08:54:43] [INFO ] Deduced a trap composed of 21 places in 207 ms
[2020-05-22 08:54:43] [INFO ] Deduced a trap composed of 132 places in 192 ms
[2020-05-22 08:54:43] [INFO ] Deduced a trap composed of 138 places in 207 ms
[2020-05-22 08:54:43] [INFO ] Deduced a trap composed of 155 places in 187 ms
[2020-05-22 08:54:44] [INFO ] Deduced a trap composed of 21 places in 206 ms
[2020-05-22 08:54:44] [INFO ] Deduced a trap composed of 145 places in 188 ms
[2020-05-22 08:54:44] [INFO ] Deduced a trap composed of 137 places in 165 ms
[2020-05-22 08:54:44] [INFO ] Deduced a trap composed of 135 places in 191 ms
[2020-05-22 08:54:45] [INFO ] Deduced a trap composed of 137 places in 209 ms
[2020-05-22 08:54:45] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3736 ms
[2020-05-22 08:54:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:54:45] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 36 ms returned sat
[2020-05-22 08:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:54:45] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2020-05-22 08:54:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:54:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:54:45] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 33 ms returned sat
[2020-05-22 08:54:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:54:46] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2020-05-22 08:54:46] [INFO ] [Nat]Added 71 Read/Feed constraints in 159 ms returned sat
[2020-05-22 08:54:47] [INFO ] Deduced a trap composed of 122 places in 213 ms
[2020-05-22 08:54:47] [INFO ] Deduced a trap composed of 29 places in 207 ms
[2020-05-22 08:54:47] [INFO ] Deduced a trap composed of 142 places in 184 ms
[2020-05-22 08:54:47] [INFO ] Deduced a trap composed of 143 places in 174 ms
[2020-05-22 08:54:47] [INFO ] Deduced a trap composed of 131 places in 145 ms
[2020-05-22 08:54:47] [INFO ] Deduced a trap composed of 134 places in 138 ms
[2020-05-22 08:54:48] [INFO ] Deduced a trap composed of 141 places in 137 ms
[2020-05-22 08:54:48] [INFO ] Deduced a trap composed of 139 places in 146 ms
[2020-05-22 08:54:48] [INFO ] Deduced a trap composed of 143 places in 129 ms
[2020-05-22 08:54:48] [INFO ] Deduced a trap composed of 139 places in 138 ms
[2020-05-22 08:54:48] [INFO ] Deduced a trap composed of 133 places in 124 ms
[2020-05-22 08:54:48] [INFO ] Deduced a trap composed of 144 places in 138 ms
[2020-05-22 08:54:49] [INFO ] Deduced a trap composed of 146 places in 128 ms
[2020-05-22 08:54:49] [INFO ] Deduced a trap composed of 151 places in 134 ms
[2020-05-22 08:54:49] [INFO ] Deduced a trap composed of 150 places in 154 ms
[2020-05-22 08:54:49] [INFO ] Deduced a trap composed of 137 places in 127 ms
[2020-05-22 08:54:49] [INFO ] Deduced a trap composed of 141 places in 136 ms
[2020-05-22 08:54:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2915 ms
[2020-05-22 08:54:49] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 44 ms.
[2020-05-22 08:55:02] [INFO ] Added : 395 causal constraints over 79 iterations in 13116 ms. Result :sat
[2020-05-22 08:55:03] [INFO ] Deduced a trap composed of 14 places in 197 ms
[2020-05-22 08:55:03] [INFO ] Deduced a trap composed of 18 places in 189 ms
[2020-05-22 08:55:03] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-05-22 08:55:03] [INFO ] Deduced a trap composed of 11 places in 152 ms
[2020-05-22 08:55:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1058 ms
[2020-05-22 08:55:03] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:55:03] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 33 ms returned sat
[2020-05-22 08:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:04] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2020-05-22 08:55:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:55:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-05-22 08:55:04] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 41 ms returned sat
[2020-05-22 08:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:05] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2020-05-22 08:55:05] [INFO ] [Nat]Added 71 Read/Feed constraints in 36 ms returned sat
[2020-05-22 08:55:05] [INFO ] Deduced a trap composed of 101 places in 218 ms
[2020-05-22 08:55:05] [INFO ] Deduced a trap composed of 57 places in 115 ms
[2020-05-22 08:55:05] [INFO ] Deduced a trap composed of 53 places in 116 ms
[2020-05-22 08:55:06] [INFO ] Deduced a trap composed of 29 places in 123 ms
[2020-05-22 08:55:06] [INFO ] Deduced a trap composed of 55 places in 63 ms
[2020-05-22 08:55:06] [INFO ] Deduced a trap composed of 62 places in 66 ms
[2020-05-22 08:55:06] [INFO ] Deduced a trap composed of 65 places in 55 ms
[2020-05-22 08:55:06] [INFO ] Deduced a trap composed of 58 places in 49 ms
[2020-05-22 08:55:06] [INFO ] Deduced a trap composed of 56 places in 55 ms
[2020-05-22 08:55:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1045 ms
[2020-05-22 08:55:06] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 22 ms.
[2020-05-22 08:55:24] [INFO ] Added : 430 causal constraints over 86 iterations in 18176 ms. Result :unknown
[2020-05-22 08:55:24] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:55:24] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 59 ms returned sat
[2020-05-22 08:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:25] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2020-05-22 08:55:25] [INFO ] [Real]Added 71 Read/Feed constraints in 10 ms returned sat
[2020-05-22 08:55:25] [INFO ] Deduced a trap composed of 12 places in 221 ms
[2020-05-22 08:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2020-05-22 08:55:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:55:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:55:25] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-05-22 08:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:26] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2020-05-22 08:55:26] [INFO ] [Nat]Added 71 Read/Feed constraints in 232 ms returned sat
[2020-05-22 08:55:26] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-05-22 08:55:26] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-05-22 08:55:26] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 15 places in 129 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 24 places in 83 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 28 places in 101 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 29 places in 97 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2020-05-22 08:55:27] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2020-05-22 08:55:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1344 ms
[2020-05-22 08:55:27] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 19 ms.
[2020-05-22 08:55:35] [INFO ] Added : 347 causal constraints over 70 iterations in 7185 ms. Result :sat
[2020-05-22 08:55:35] [INFO ] Deduced a trap composed of 21 places in 241 ms
[2020-05-22 08:55:35] [INFO ] Deduced a trap composed of 141 places in 233 ms
[2020-05-22 08:55:35] [INFO ] Deduced a trap composed of 26 places in 218 ms
[2020-05-22 08:55:36] [INFO ] Deduced a trap composed of 154 places in 227 ms
[2020-05-22 08:55:36] [INFO ] Deduced a trap composed of 105 places in 181 ms
[2020-05-22 08:55:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1503 ms
[2020-05-22 08:55:36] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-05-22 08:55:36] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-05-22 08:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:37] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2020-05-22 08:55:37] [INFO ] [Real]Added 71 Read/Feed constraints in 9 ms returned sat
[2020-05-22 08:55:37] [INFO ] Deduced a trap composed of 11 places in 159 ms
[2020-05-22 08:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2020-05-22 08:55:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:55:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2020-05-22 08:55:37] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 28 ms returned sat
[2020-05-22 08:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:38] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2020-05-22 08:55:38] [INFO ] [Nat]Added 71 Read/Feed constraints in 272 ms returned sat
[2020-05-22 08:55:38] [INFO ] Deduced a trap composed of 4 places in 219 ms
[2020-05-22 08:55:38] [INFO ] Deduced a trap composed of 129 places in 228 ms
[2020-05-22 08:55:39] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-05-22 08:55:39] [INFO ] Deduced a trap composed of 136 places in 191 ms
[2020-05-22 08:55:39] [INFO ] Deduced a trap composed of 21 places in 150 ms
[2020-05-22 08:55:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1094 ms
[2020-05-22 08:55:39] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 18 ms.
[2020-05-22 08:55:48] [INFO ] Added : 341 causal constraints over 69 iterations in 8871 ms. Result :sat
[2020-05-22 08:55:48] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:55:48] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 35 ms returned sat
[2020-05-22 08:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:49] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-05-22 08:55:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:55:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-05-22 08:55:49] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 29 ms returned sat
[2020-05-22 08:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:55:49] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2020-05-22 08:55:50] [INFO ] [Nat]Added 71 Read/Feed constraints in 228 ms returned sat
[2020-05-22 08:55:50] [INFO ] Deduced a trap composed of 143 places in 238 ms
[2020-05-22 08:55:50] [INFO ] Deduced a trap composed of 11 places in 229 ms
[2020-05-22 08:55:50] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-05-22 08:55:51] [INFO ] Deduced a trap composed of 149 places in 188 ms
[2020-05-22 08:55:51] [INFO ] Deduced a trap composed of 146 places in 143 ms
[2020-05-22 08:55:51] [INFO ] Deduced a trap composed of 142 places in 161 ms
[2020-05-22 08:55:51] [INFO ] Deduced a trap composed of 145 places in 164 ms
[2020-05-22 08:55:51] [INFO ] Deduced a trap composed of 146 places in 154 ms
[2020-05-22 08:55:52] [INFO ] Deduced a trap composed of 11 places in 139 ms
[2020-05-22 08:55:52] [INFO ] Deduced a trap composed of 141 places in 179 ms
[2020-05-22 08:55:52] [INFO ] Deduced a trap composed of 141 places in 155 ms
[2020-05-22 08:55:52] [INFO ] Deduced a trap composed of 144 places in 139 ms
[2020-05-22 08:55:52] [INFO ] Deduced a trap composed of 146 places in 137 ms
[2020-05-22 08:55:52] [INFO ] Deduced a trap composed of 11 places in 132 ms
[2020-05-22 08:55:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2668 ms
[2020-05-22 08:55:52] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 20 ms.
[2020-05-22 08:56:09] [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: Broken pipe (=> (> t411 0) (and (or (and (> t203 0) (< o203 o411)) (and (> t204 0) (< o204 o411)) (and (> t205 0) (< o205 o411)) (and (> t206 0) (< o206 o411))) (or (and (> t90 0) (< o90 o411)) (and (> t211 0) (< o211 o411)) (and (> t212 0) (< o212 o411)) (and (> t359 0) (< o359 o411))) (and (> t144 0) (< o144 o411))))") while checking expression at index 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 454 transition count 460
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 452 transition count 460
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 4 place count 452 transition count 430
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 64 place count 422 transition count 430
Symmetric choice reduction at 2 with 13 rule applications. Total rules 77 place count 422 transition count 430
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 103 place count 409 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 408 transition count 416
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 408 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 407 transition count 415
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 407 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 406 transition count 414
Applied a total of 109 rules in 130 ms. Remains 406 /454 variables (removed 48) and now considering 414/462 (removed 48) transitions.
// Phase 1: matrix 414 rows 406 cols
[2020-05-22 08:56:09] [INFO ] Computed 66 place invariants in 33 ms
[2020-05-22 08:56:09] [INFO ] [Real]Absence check using 6 positive place invariants in 34 ms returned sat
[2020-05-22 08:56:09] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 59 ms returned sat
[2020-05-22 08:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:10] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2020-05-22 08:56:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:56:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-05-22 08:56:10] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 40 ms returned sat
[2020-05-22 08:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:10] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2020-05-22 08:56:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-22 08:56:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 5 places in 138 ms
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 15 places in 109 ms
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 11 places in 85 ms
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 71 places in 42 ms
[2020-05-22 08:56:11] [INFO ] Deduced a trap composed of 69 places in 40 ms
[2020-05-22 08:56:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 755 ms
[2020-05-22 08:56:11] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 20 ms.
[2020-05-22 08:56:15] [INFO ] Added : 205 causal constraints over 42 iterations in 3635 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-22 08:56:15] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-22 08:56:15] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 34 ms returned sat
[2020-05-22 08:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:16] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2020-05-22 08:56:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:56:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-05-22 08:56:16] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 23 ms returned sat
[2020-05-22 08:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:16] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2020-05-22 08:56:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 69 ms returned sat
[2020-05-22 08:56:16] [INFO ] Deduced a trap composed of 11 places in 175 ms
[2020-05-22 08:56:17] [INFO ] Deduced a trap composed of 15 places in 134 ms
[2020-05-22 08:56:17] [INFO ] Deduced a trap composed of 100 places in 110 ms
[2020-05-22 08:56:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2020-05-22 08:56:17] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 20 ms.
[2020-05-22 08:56:29] [INFO ] Added : 381 causal constraints over 77 iterations in 12536 ms. Result :sat
[2020-05-22 08:56:29] [INFO ] Deduced a trap composed of 17 places in 173 ms
[2020-05-22 08:56:30] [INFO ] Deduced a trap composed of 5 places in 157 ms
[2020-05-22 08:56:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-22 08:56:30] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-22 08:56:30] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 30 ms returned sat
[2020-05-22 08:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:31] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-05-22 08:56:31] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:56:31] [INFO ] Deduced a trap composed of 16 places in 188 ms
[2020-05-22 08:56:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2020-05-22 08:56:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:56:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-05-22 08:56:31] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 30 ms returned sat
[2020-05-22 08:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:32] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2020-05-22 08:56:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 135 ms returned sat
[2020-05-22 08:56:32] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-22 08:56:32] [INFO ] Deduced a trap composed of 152 places in 209 ms
[2020-05-22 08:56:32] [INFO ] Deduced a trap composed of 35 places in 81 ms
[2020-05-22 08:56:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 585 ms
[2020-05-22 08:56:32] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 21 ms.
[2020-05-22 08:56:43] [INFO ] Added : 360 causal constraints over 72 iterations in 10516 ms. Result :sat
[2020-05-22 08:56:43] [INFO ] Deduced a trap composed of 17 places in 198 ms
[2020-05-22 08:56:43] [INFO ] Deduced a trap composed of 25 places in 165 ms
[2020-05-22 08:56:44] [INFO ] Deduced a trap composed of 22 places in 209 ms
[2020-05-22 08:56:44] [INFO ] Deduced a trap composed of 10 places in 154 ms
[2020-05-22 08:56:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1096 ms
Attempting to minimize the solution found.
Minimization took 39 ms.
[2020-05-22 08:56:44] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-22 08:56:44] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 31 ms returned sat
[2020-05-22 08:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:45] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2020-05-22 08:56:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:56:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2020-05-22 08:56:45] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 33 ms returned sat
[2020-05-22 08:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:45] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2020-05-22 08:56:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2020-05-22 08:56:45] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 25 ms.
[2020-05-22 08:56:58] [INFO ] Added : 389 causal constraints over 78 iterations in 13074 ms. Result :sat
[2020-05-22 08:56:59] [INFO ] Deduced a trap composed of 11 places in 154 ms
[2020-05-22 08:56:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-22 08:56:59] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-05-22 08:56:59] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 31 ms returned sat
[2020-05-22 08:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:56:59] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2020-05-22 08:56:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:56:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-22 08:56:59] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 22 ms returned sat
[2020-05-22 08:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:00] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2020-05-22 08:57:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 221 ms returned sat
[2020-05-22 08:57:00] [INFO ] Deduced a trap composed of 22 places in 200 ms
[2020-05-22 08:57:00] [INFO ] Deduced a trap composed of 20 places in 165 ms
[2020-05-22 08:57:01] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2020-05-22 08:57:01] [INFO ] Deduced a trap composed of 147 places in 157 ms
[2020-05-22 08:57:01] [INFO ] Deduced a trap composed of 106 places in 139 ms
[2020-05-22 08:57:01] [INFO ] Deduced a trap composed of 56 places in 146 ms
[2020-05-22 08:57:01] [INFO ] Deduced a trap composed of 49 places in 123 ms
[2020-05-22 08:57:01] [INFO ] Deduced a trap composed of 45 places in 143 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 161 places in 144 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 106 places in 132 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 110 places in 143 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 153 places in 160 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 150 places in 130 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 146 places in 107 ms
[2020-05-22 08:57:02] [INFO ] Deduced a trap composed of 148 places in 123 ms
[2020-05-22 08:57:03] [INFO ] Deduced a trap composed of 155 places in 142 ms
[2020-05-22 08:57:03] [INFO ] Deduced a trap composed of 156 places in 125 ms
[2020-05-22 08:57:03] [INFO ] Deduced a trap composed of 153 places in 125 ms
[2020-05-22 08:57:03] [INFO ] Deduced a trap composed of 157 places in 120 ms
[2020-05-22 08:57:03] [INFO ] Deduced a trap composed of 150 places in 122 ms
[2020-05-22 08:57:03] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3198 ms
[2020-05-22 08:57:03] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 18 ms.
[2020-05-22 08:57:14] [INFO ] Added : 368 causal constraints over 74 iterations in 10853 ms. Result :sat
[2020-05-22 08:57:14] [INFO ] Deduced a trap composed of 7 places in 200 ms
[2020-05-22 08:57:15] [INFO ] Deduced a trap composed of 10 places in 205 ms
[2020-05-22 08:57:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
Attempting to minimize the solution found.
Minimization took 44 ms.
[2020-05-22 08:57:15] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-22 08:57:15] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 45 ms returned sat
[2020-05-22 08:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:15] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2020-05-22 08:57:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-05-22 08:57:16] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 41 ms returned sat
[2020-05-22 08:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:16] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2020-05-22 08:57:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2020-05-22 08:57:16] [INFO ] Deduced a trap composed of 160 places in 211 ms
[2020-05-22 08:57:16] [INFO ] Deduced a trap composed of 5 places in 142 ms
[2020-05-22 08:57:17] [INFO ] Deduced a trap composed of 22 places in 131 ms
[2020-05-22 08:57:17] [INFO ] Deduced a trap composed of 156 places in 167 ms
[2020-05-22 08:57:17] [INFO ] Deduced a trap composed of 157 places in 141 ms
[2020-05-22 08:57:17] [INFO ] Deduced a trap composed of 31 places in 136 ms
[2020-05-22 08:57:17] [INFO ] Deduced a trap composed of 157 places in 147 ms
[2020-05-22 08:57:17] [INFO ] Deduced a trap composed of 157 places in 142 ms
[2020-05-22 08:57:18] [INFO ] Deduced a trap composed of 152 places in 150 ms
[2020-05-22 08:57:18] [INFO ] Deduced a trap composed of 158 places in 163 ms
[2020-05-22 08:57:18] [INFO ] Deduced a trap composed of 155 places in 139 ms
[2020-05-22 08:57:18] [INFO ] Deduced a trap composed of 158 places in 112 ms
[2020-05-22 08:57:18] [INFO ] Deduced a trap composed of 152 places in 153 ms
[2020-05-22 08:57:18] [INFO ] Deduced a trap composed of 151 places in 121 ms
[2020-05-22 08:57:19] [INFO ] Deduced a trap composed of 151 places in 121 ms
[2020-05-22 08:57:19] [INFO ] Deduced a trap composed of 11 places in 163 ms
[2020-05-22 08:57:19] [INFO ] Deduced a trap composed of 154 places in 129 ms
[2020-05-22 08:57:19] [INFO ] Deduced a trap composed of 15 places in 113 ms
[2020-05-22 08:57:19] [INFO ] Deduced a trap composed of 154 places in 137 ms
[2020-05-22 08:57:19] [INFO ] Deduced a trap composed of 164 places in 138 ms
[2020-05-22 08:57:19] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3238 ms
[2020-05-22 08:57:19] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 16 ms.
[2020-05-22 08:57:39] [INFO ] Added : 402 causal constraints over 81 iterations in 19211 ms. Result :sat
[2020-05-22 08:57:39] [INFO ] Deduced a trap composed of 9 places in 151 ms
[2020-05-22 08:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-05-22 08:57:39] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-05-22 08:57:39] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 37 ms returned sat
[2020-05-22 08:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:40] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2020-05-22 08:57:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:57:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-05-22 08:57:40] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 32 ms returned sat
[2020-05-22 08:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:40] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2020-05-22 08:57:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-05-22 08:57:40] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2020-05-22 08:57:41] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-05-22 08:57:41] [INFO ] Deduced a trap composed of 57 places in 59 ms
[2020-05-22 08:57:41] [INFO ] Deduced a trap composed of 69 places in 59 ms
[2020-05-22 08:57:41] [INFO ] Deduced a trap composed of 71 places in 51 ms
[2020-05-22 08:57:41] [INFO ] Deduced a trap composed of 66 places in 44 ms
[2020-05-22 08:57:41] [INFO ] Deduced a trap composed of 56 places in 46 ms
[2020-05-22 08:57:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 617 ms
[2020-05-22 08:57:41] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 18 ms.
[2020-05-22 08:57:57] [INFO ] Added : 408 causal constraints over 82 iterations in 16276 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-22 08:57:57] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-05-22 08:57:57] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 37 ms returned sat
[2020-05-22 08:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:58] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2020-05-22 08:57:58] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:57:58] [INFO ] Deduced a trap composed of 11 places in 170 ms
[2020-05-22 08:57:58] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2020-05-22 08:57:59] [INFO ] Deduced a trap composed of 5 places in 127 ms
[2020-05-22 08:57:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 495 ms
[2020-05-22 08:57:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:57:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-05-22 08:57:59] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 30 ms returned sat
[2020-05-22 08:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:57:59] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2020-05-22 08:57:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 141 ms returned sat
[2020-05-22 08:57:59] [INFO ] Deduced a trap composed of 15 places in 188 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 7 places in 145 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 31 places in 146 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 179 places in 128 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 179 places in 129 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 29 places in 112 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 181 places in 105 ms
[2020-05-22 08:58:00] [INFO ] Deduced a trap composed of 180 places in 117 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 168 places in 124 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 69 places in 107 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 189 places in 99 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 189 places in 109 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 185 places in 117 ms
[2020-05-22 08:58:01] [INFO ] Deduced a trap composed of 165 places in 125 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 167 places in 112 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 167 places in 118 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 168 places in 122 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 169 places in 138 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 168 places in 126 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 169 places in 129 ms
[2020-05-22 08:58:02] [INFO ] Deduced a trap composed of 171 places in 146 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 170 places in 121 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 173 places in 116 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 171 places in 130 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 177 places in 108 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 170 places in 100 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 173 places in 125 ms
[2020-05-22 08:58:03] [INFO ] Deduced a trap composed of 175 places in 130 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 176 places in 130 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 177 places in 115 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 174 places in 105 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 170 places in 98 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 178 places in 97 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 175 places in 115 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 167 places in 97 ms
[2020-05-22 08:58:04] [INFO ] Deduced a trap composed of 177 places in 108 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 177 places in 104 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 171 places in 120 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 169 places in 106 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 175 places in 104 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 175 places in 129 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 175 places in 116 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 170 places in 110 ms
[2020-05-22 08:58:05] [INFO ] Deduced a trap composed of 174 places in 119 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 174 places in 126 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 174 places in 121 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 174 places in 95 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 175 places in 109 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 175 places in 102 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 175 places in 98 ms
[2020-05-22 08:58:06] [INFO ] Deduced a trap composed of 175 places in 99 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 168 places in 135 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 170 places in 114 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 170 places in 113 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 169 places in 122 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 179 places in 98 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 172 places in 124 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 160 places in 113 ms
[2020-05-22 08:58:07] [INFO ] Deduced a trap composed of 160 places in 121 ms
[2020-05-22 08:58:08] [INFO ] Deduced a trap composed of 162 places in 151 ms
[2020-05-22 08:58:08] [INFO ] Deduced a trap composed of 162 places in 133 ms
[2020-05-22 08:58:08] [INFO ] Deduced a trap composed of 173 places in 150 ms
[2020-05-22 08:58:08] [INFO ] Deduced a trap composed of 173 places in 115 ms
[2020-05-22 08:58:08] [INFO ] Deduced a trap composed of 64 places in 126 ms
[2020-05-22 08:58:08] [INFO ] Deduced a trap composed of 172 places in 119 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 174 places in 130 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 174 places in 128 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 172 places in 101 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 170 places in 127 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 173 places in 107 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 171 places in 109 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 174 places in 114 ms
[2020-05-22 08:58:09] [INFO ] Deduced a trap composed of 175 places in 99 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 175 places in 107 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 174 places in 117 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 173 places in 108 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 175 places in 117 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 178 places in 110 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 175 places in 103 ms
[2020-05-22 08:58:10] [INFO ] Deduced a trap composed of 181 places in 118 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 49 places in 138 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 174 places in 106 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 57 places in 117 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 78 places in 123 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 151 places in 117 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2020-05-22 08:58:11] [INFO ] Deduced a trap composed of 161 places in 100 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 179 places in 105 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 183 places in 106 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 56 places in 97 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 178 places in 143 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 172 places in 110 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 170 places in 106 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 177 places in 125 ms
[2020-05-22 08:58:12] [INFO ] Deduced a trap composed of 61 places in 118 ms
[2020-05-22 08:58:13] [INFO ] Deduced a trap composed of 176 places in 116 ms
[2020-05-22 08:58:13] [INFO ] Deduced a trap composed of 180 places in 102 ms
[2020-05-22 08:58:13] [INFO ] Deduced a trap composed of 180 places in 142 ms
[2020-05-22 08:58:13] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 13678 ms
[2020-05-22 08:58:13] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 17 ms.
[2020-05-22 08:58:32] [INFO ] Added : 370 causal constraints over 74 iterations in 19471 ms. Result :sat
[2020-05-22 08:58:33] [INFO ] Deduced a trap composed of 175 places in 204 ms
[2020-05-22 08:58:33] [INFO ] Deduced a trap composed of 153 places in 158 ms
[2020-05-22 08:58:33] [INFO ] Deduced a trap composed of 159 places in 156 ms
[2020-05-22 08:58:33] [INFO ] Deduced a trap composed of 167 places in 155 ms
[2020-05-22 08:58:33] [INFO ] Deduced a trap composed of 164 places in 159 ms
[2020-05-22 08:58:34] [INFO ] Deduced a trap composed of 171 places in 138 ms
[2020-05-22 08:58:34] [INFO ] Deduced a trap composed of 166 places in 152 ms
[2020-05-22 08:58:34] [INFO ] Deduced a trap composed of 11 places in 176 ms
[2020-05-22 08:58:35] [INFO ] Deduced a trap composed of 17 places in 148 ms
[2020-05-22 08:58:35] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2020-05-22 08:58:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2480 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-05-22 08:58:35] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-05-22 08:58:35] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 23 ms returned sat
[2020-05-22 08:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:58:35] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2020-05-22 08:58:35] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:58:36] [INFO ] Deduced a trap composed of 22 places in 180 ms
[2020-05-22 08:58:36] [INFO ] Deduced a trap composed of 17 places in 167 ms
[2020-05-22 08:58:36] [INFO ] Deduced a trap composed of 5 places in 137 ms
[2020-05-22 08:58:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 553 ms
[2020-05-22 08:58:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:58:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-05-22 08:58:36] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 21 ms returned sat
[2020-05-22 08:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:58:36] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2020-05-22 08:58:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 244 ms returned sat
[2020-05-22 08:58:37] [INFO ] Deduced a trap composed of 14 places in 173 ms
[2020-05-22 08:58:37] [INFO ] Deduced a trap composed of 5 places in 137 ms
[2020-05-22 08:58:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2020-05-22 08:58:37] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 20 ms.
[2020-05-22 08:58:42] [INFO ] Added : 260 causal constraints over 53 iterations in 5329 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-05-22 08:58:43] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-05-22 08:58:43] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 38 ms returned sat
[2020-05-22 08:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:58:43] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2020-05-22 08:58:43] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-22 08:58:43] [INFO ] Deduced a trap composed of 5 places in 227 ms
[2020-05-22 08:58:44] [INFO ] Deduced a trap composed of 137 places in 189 ms
[2020-05-22 08:58:44] [INFO ] Deduced a trap composed of 136 places in 141 ms
[2020-05-22 08:58:44] [INFO ] Deduced a trap composed of 155 places in 165 ms
[2020-05-22 08:58:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 787 ms
[2020-05-22 08:58:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:58:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-05-22 08:58:44] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 21 ms returned sat
[2020-05-22 08:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:58:44] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2020-05-22 08:58:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 111 ms returned sat
[2020-05-22 08:58:45] [INFO ] Deduced a trap composed of 10 places in 172 ms
[2020-05-22 08:58:45] [INFO ] Deduced a trap composed of 154 places in 125 ms
[2020-05-22 08:58:45] [INFO ] Deduced a trap composed of 154 places in 125 ms
[2020-05-22 08:58:45] [INFO ] Deduced a trap composed of 158 places in 132 ms
[2020-05-22 08:58:45] [INFO ] Deduced a trap composed of 159 places in 124 ms
[2020-05-22 08:58:45] [INFO ] Deduced a trap composed of 5 places in 134 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 139 places in 129 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 138 places in 124 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 25 places in 128 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 56 places in 134 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 69 places in 130 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 149 places in 118 ms
[2020-05-22 08:58:46] [INFO ] Deduced a trap composed of 150 places in 124 ms
[2020-05-22 08:58:47] [INFO ] Deduced a trap composed of 158 places in 124 ms
[2020-05-22 08:58:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2109 ms
[2020-05-22 08:58:47] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 15 ms.
[2020-05-22 08:59:06] [INFO ] Added : 407 causal constraints over 82 iterations in 19292 ms. Result :sat
[2020-05-22 08:59:06] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-05-22 08:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-05-22 08:59:07] [INFO ] Flatten gal took : 161 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 08:59:07] [INFO ] Applying decomposition
[2020-05-22 08:59:07] [INFO ] Flatten gal took : 71 ms
[2020-05-22 08:59:07] [INFO ] Flatten gal took : 99 ms
[2020-05-22 08:59:07] [INFO ] Input system was already deterministic with 462 transitions.
[2020-05-22 08:59:07] [INFO ] Input system was already deterministic with 462 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/graph13287072936540306533.txt, -o, /tmp/graph13287072936540306533.bin, -w, /tmp/graph13287072936540306533.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/graph13287072936540306533.bin, -l, -1, -v, -w, /tmp/graph13287072936540306533.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 08:59:08] [INFO ] Decomposing Gal with order
[2020-05-22 08:59:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:59:08] [INFO ] Ran tautology test, simplified 0 / 10 in 750 ms.
[2020-05-22 08:59:08] [INFO ] Removed a total of 299 redundant transitions.
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=0 took 26 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=0 took 2 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=0 took 39 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=0 took 2 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=0 took 1 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=0 took 2 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=0 took 6 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=0 took 17 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=1 took 11 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=1 took 13 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=1 took 4 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:59:08] [INFO ] Flatten gal took : 337 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=1 took 89 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:59:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 107 ms.
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=1 took 76 ms
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=1 took 18 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 462 rows 454 cols
[2020-05-22 08:59:08] [INFO ] Computed 66 place invariants in 148 ms
inv : p214 - p216 + p217 - p219 + p240 + p252 = 0
[2020-05-22 08:59:08] [INFO ] Computed 66 place invariants in 64 ms
inv : p214 - p216 + p217 - p219 + p240 + p252 = 0
inv : p1005 + p1007 + p917 + p919 - p923 - p924 - p925 - p926 - p928 - p929 - p935 - p937 - p938 - p941 - p947 - p949 - p952 - p954 = 0
inv : -p652 - p654 + p658 + p660 + p661 + p664 + p667 + p670 + p672 + p673 + p676 + p679 + p680 + p682 + p684 + p687 + p689 + p690 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p273 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p386 + p387 + p389 + p434 + p440 + p442 + p487 + p493 + p495 + p540 + p545 + p546 + p548 + p593 + p599 + p600 + p601 + p63 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : p532 - p534 + p535 - p537 + p558 + p570 = 0
inv : p850 - p852 + p853 - p855 + p876 + p888 = 0
inv : p904 - p905 + p907 - p908 + p924 + p929 + p941 = 0
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : p108 - p110 + p111 - p113 + p134 + p146 = 0
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p126 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p157 + p159 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : p268 - p269 + p271 - p272 + p293 + p305 = 0
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p903 - p905 + p906 - p908 + p929 + p941 = 0
inv : -p334 - p336 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p369 + p371 - p387 - p389 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 - p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : -p599 - p601 + p605 + p607 + p608 + p611 + p615 + p617 + p619 + p620 + p623 + p629 + p631 + p634 + p636 - p652 - p654 + p658 + p660 + p661 + p664 + p667 + p670 + p672 + p673 + p676 + p679 + p680 + p682 + p684 + p690 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p744 - p746 + p747 - p749 + p770 + p782 = 0
inv : p1000 + p1002 + p101 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p126 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p31 + p311 + p313 + p319 + p328 + p34 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p40 + p405 + p407 + p408 + p411 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p52 + p523 + p525 + p54 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p699 + p705 + p706 + p707 + p75 + p752 + p755 + p756 + p758 + p760 + p77 + p78 + p805 + p81 + p811 + p813 + p858 + p864 + p866 + p87 + p89 + p90 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p93 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p97 + p976 + p978 + p979 + p982 + p988 + p99 + p990 + p991 + p994 + p998 = 1
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p263 + p265 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : p957 - p958 + p960 - p961 + p982 + p994 = 0
inv : -p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 + p740 + p742 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : -p374 + p375 - p377 + p378 - p394 - p399 - p411 = 0
inv : p267 - p269 + p270 - p272 + p293 + p305 = 0
inv : p638 - p640 + p641 - p643 + p664 + p676 = 0
inv : p639 - p640 + p642 - p643 + p664 + p676 = 0
inv : p1000 + p1002 + p101 + p1015 + p1017 + p1029 + p1032 + p1035 + p104 + p1047 + p1053 + p1055 + p1057 + p106 + p116 + p119 + p120 + p126 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p699 + p705 + p706 + p707 + p75 + p752 + p755 + p756 + p758 + p760 + p77 + p78 + p805 + p81 + p811 + p813 + p858 + p864 + p866 + p87 + p89 + p90 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p93 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p97 + p976 + p978 + p979 + p982 + p988 + p99 + p990 + p991 + p994 + p998 = 1
inv : p1000 + p1002 + p101 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p12 + p120 + p126 + p13 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p31 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p40 + p405 + p407 + p408 + p411 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p52 + p523 + p525 + p54 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p699 + p705 + p706 + p707 + p75 + p752 + p755 + p756 + p758 + p760 + p77 + p78 + p805 + p81 + p811 + p813 + p858 + p864 + p866 + p87 + p89 + p90 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p93 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p97 + p976 + p978 + p979 + p982 + p988 + p99 + p990 + p991 + p994 + p998 = 3
inv : -p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p528 + p530 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : p8 + p9 = 2
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p230 + p234 + p236 + p237 + p238 + p24 + p240 + p242 + p243 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p318 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : -p281 - p283 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p316 + p318 + p319 - p334 - p336 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 - p387 - p389 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 - p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : -p546 + p552 + p554 + p555 + p558 + p560 + p561 - p634 = 0
inv : -p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p581 + p583 - p634 - p636 = 0
inv : p373 - p374 + p376 - p377 - p394 = 0
inv : -p1000 - p1002 + p1058 + p1060 + p917 + p919 - p923 - p924 - p925 - p926 - p928 - p929 - p935 - p937 - p938 - p941 - p947 - p949 - p952 - p954 + p970 + p972 - p976 - p978 - p979 - p982 - p988 - p990 - p991 - p994 - p998 = 0
inv : -p230 + p246 + p248 + p249 + p252 + p254 + p255 - p318 = 0
inv : -p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 + p793 + p795 - p846 - p848 = 0
inv : -p654 + p670 + p672 + p673 + p676 + p678 + p679 - p742 = 0
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p210 + p212 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : -p811 - p813 + p817 + p819 + p820 + p823 + p829 + p831 + p832 + p835 + p841 + p843 + p846 + p848 - p864 - p866 + p870 + p872 + p873 + p876 + p882 + p884 + p885 + p888 + p894 + p896 - p952 - p954 = 0
inv : -p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p475 + p477 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : p956 - p958 + p959 - p961 + p982 + p994 = 0
inv : p533 - p534 + p536 - p537 + p558 + p570 = 0
inv : -p120 + p162 - p163 + p165 - p166 + p187 + p199 + p259 = 0
inv : -p119 - p120 + p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p1010 - p1011 + p1013 - p1014 + p1035 + p1047 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : -p652 + p658 + p660 + p661 + p664 + p666 + p667 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 + p742 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p480 - p481 + p483 - p484 + p505 + p517 = 0
inv : p745 - p746 + p748 - p749 + p768 + p770 + p782 = 0
inv : p1009 - p1011 + p1012 - p1014 + p1035 + p1047 = 0
inv : -p755 + p797 - p798 + p800 - p801 = 0
inv : p692 - p693 + p695 - p696 + p717 + p729 = 0
inv : p10 + p11 = 2
inv : -p586 + p587 - p589 + p590 - p599 - p601 + p605 + p607 + p608 + p615 + p617 + p619 + p620 + p629 + p631 + p634 + p636 - p652 - p654 + p658 + p660 + p661 + p664 + p667 + p670 + p672 + p673 + p676 + p679 + p680 + p682 + p684 + p690 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p320 - p322 + p323 - p325 + p346 + p358 - p367 = 0
inv : -p387 - p389 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p422 + p424 - p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : p756 - p798 + p799 - p801 + p802 - p811 - p813 + p817 + p819 + p820 + p829 + p831 + p832 + p841 + p843 + p846 + p848 - p864 - p866 + p870 + p872 + p873 + p876 + p882 + p884 + p885 + p888 + p894 + p896 - p952 - p954 = 0
inv : -p864 - p866 + p870 + p872 + p873 + p876 + p882 + p884 + p885 + p888 + p894 + p896 + p899 + p901 - p952 - p954 = 0
inv : p215 - p216 + p218 - p219 + p238 + p240 + p252 = 0
inv : p585 - p586 + p588 - p589 = 0
inv : p691 - p693 + p694 - p696 + p717 + p729 = 0
inv : p851 - p852 + p854 - p855 + p876 + p888 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 - p367 = 0
Total of 66 invariants.
[2020-05-22 08:59:08] [INFO ] Computed 66 place invariants in 66 ms
inv : p1005 + p1007 + p917 + p919 - p923 - p924 - p925 - p926 - p928 - p929 - p935 - p937 - p938 - p941 - p947 - p949 - p952 - p954 = 0
inv : -p652 - p654 + p658 + p660 + p661 + p664 + p667 + p670 + p672 + p673 + p676 + p679 + p680 + p682 + p684 + p687 + p689 + p690 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p228 + p230 + p24 + p273 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p386 + p387 + p389 + p434 + p440 + p442 + p487 + p493 + p495 + p540 + p545 + p546 + p548 + p593 + p599 + p600 + p601 + p63 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : p532 - p534 + p535 - p537 + p558 + p570 = 0
inv : p850 - p852 + p853 - p855 + p876 + p888 = 0
inv : p904 - p905 + p907 - p908 + p924 + p929 + p941 = 0
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : p108 - p110 + p111 - p113 + p134 + p146 = 0
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p126 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p157 + p159 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : p268 - p269 + p271 - p272 + p293 + p305 = 0
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p903 - p905 + p906 - p908 + p929 + p941 = 0
inv : -p334 - p336 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p369 + p371 - p387 - p389 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 - p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : -p599 - p601 + p605 + p607 + p608 + p611 + p615 + p617 + p619 + p620 + p623 + p629 + p631 + p634 + p636 - p652 - p654 + p658 + p660 + p661 + p664 + p667 + p670 + p672 + p673 + p676 + p679 + p680 + p682 + p684 + p690 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p744 - p746 + p747 - p749 + p770 + p782 = 0
inv : p1000 + p1002 + p101 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p126 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p31 + p311 + p313 + p319 + p328 + p34 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p40 + p405 + p407 + p408 + p411 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p52 + p523 + p525 + p54 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p699 + p705 + p706 + p707 + p75 + p752 + p755 + p756 + p758 + p760 + p77 + p78 + p805 + p81 + p811 + p813 + p858 + p864 + p866 + p87 + p89 + p90 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p93 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p97 + p976 + p978 + p979 + p982 + p988 + p99 + p990 + p991 + p994 + p998 = 1
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p263 + p265 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : p957 - p958 + p960 - p961 + p982 + p994 = 0
inv : -p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 + p740 + p742 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : -p374 + p375 - p377 + p378 - p394 - p399 - p411 = 0
inv : p267 - p269 + p270 - p272 + p293 + p305 = 0
inv : p638 - p640 + p641 - p643 + p664 + p676 = 0
inv : p639 - p640 + p642 - p643 + p664 + p676 = 0
inv : p1000 + p1002 + p101 + p1015 + p1017 + p1029 + p1032 + p1035 + p104 + p1047 + p1053 + p1055 + p1057 + p106 + p116 + p119 + p120 + p126 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p699 + p705 + p706 + p707 + p75 + p752 + p755 + p756 + p758 + p760 + p77 + p78 + p805 + p81 + p811 + p813 + p858 + p864 + p866 + p87 + p89 + p90 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p93 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p97 + p976 + p978 + p979 + p982 + p988 + p99 + p990 + p991 + p994 + p998 = 1
inv : p1000 + p1002 + p101 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p12 + p120 + p126 + p13 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p222 + p234 + p236 + p237 + p238 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p31 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p40 + p405 + p407 + p408 + p411 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p52 + p523 + p525 + p54 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p699 + p705 + p706 + p707 + p75 + p752 + p755 + p756 + p758 + p760 + p77 + p78 + p805 + p81 + p811 + p813 + p858 + p864 + p866 + p87 + p89 + p90 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p93 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p97 + p976 + p978 + p979 + p982 + p988 + p99 + p990 + p991 + p994 + p998 = 3
inv : -p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p528 + p530 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : p8 + p9 = 2
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p175 + p177 + p22 + p222 + p230 + p234 + p236 + p237 + p238 + p24 + p240 + p242 + p243 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p318 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : -p281 - p283 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p316 + p318 + p319 - p334 - p336 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 - p387 - p389 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 - p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : -p546 + p552 + p554 + p555 + p558 + p560 + p561 - p634 = 0
inv : -p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p581 + p583 - p634 - p636 = 0
inv : p373 - p374 + p376 - p377 - p394 = 0
inv : -p1000 - p1002 + p1058 + p1060 + p917 + p919 - p923 - p924 - p925 - p926 - p928 - p929 - p935 - p937 - p938 - p941 - p947 - p949 - p952 - p954 + p970 + p972 - p976 - p978 - p979 - p982 - p988 - p990 - p991 - p994 - p998 = 0
inv : -p230 + p246 + p248 + p249 + p252 + p254 + p255 - p318 = 0
inv : -p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 + p793 + p795 - p846 - p848 = 0
inv : -p654 + p670 + p672 + p673 + p676 + p678 + p679 - p742 = 0
inv : p1000 + p1002 + p1015 + p1017 + p1029 + p1032 + p1035 + p1047 + p1053 + p1055 + p1057 + p116 + p119 + p120 + p122 + p124 + p14 + p16 + p169 + p181 + p183 + p184 + p187 + p193 + p195 + p196 + p199 + p205 + p207 + p210 + p212 + p22 + p222 + p234 + p236 + p237 + p238 + p24 + p240 + p243 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p259 + p260 + p273 + p275 + p287 + p289 + p290 + p293 + p299 + p301 + p302 + p305 + p311 + p313 + p319 + p328 + p340 + p342 + p343 + p346 + p350 + p352 + p354 + p358 + p364 + p366 + p367 + p381 + p386 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p487 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 + p540 + p545 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 + p593 + p599 + p600 + p601 + p63 - p634 - p636 + p646 + p652 + p654 + p69 + p699 + p705 + p706 + p707 + p71 + p752 + p755 + p756 + p758 + p760 + p805 + p811 + p813 + p858 + p864 + p866 + p909 + p911 + p923 + p924 + p925 + p926 + p928 + p929 + p935 + p937 + p938 + p941 + p947 + p949 + p952 + p954 + p964 + p976 + p978 + p979 + p982 + p988 + p990 + p991 + p994 + p998 = 1
inv : -p811 - p813 + p817 + p819 + p820 + p823 + p829 + p831 + p832 + p835 + p841 + p843 + p846 + p848 - p864 - p866 + p870 + p872 + p873 + p876 + p882 + p884 + p885 + p888 + p894 + p896 - p952 - p954 = 0
inv : -p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 + p475 + p477 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : p956 - p958 + p959 - p961 + p982 + p994 = 0
inv : p533 - p534 + p536 - p537 + p558 + p570 = 0
inv : -p120 + p162 - p163 + p165 - p166 + p187 + p199 + p259 = 0
inv : -p119 - p120 + p161 - p163 + p164 - p166 + p187 + p199 = 0
inv : p1010 - p1011 + p1013 - p1014 + p1035 + p1047 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : -p652 + p658 + p660 + p661 + p664 + p666 + p667 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 + p742 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p480 - p481 + p483 - p484 + p505 + p517 = 0
inv : p745 - p746 + p748 - p749 + p768 + p770 + p782 = 0
inv : p1009 - p1011 + p1012 - p1014 + p1035 + p1047 = 0
inv : -p755 + p797 - p798 + p800 - p801 = 0
inv : p692 - p693 + p695 - p696 + p717 + p729 = 0
inv : p10 + p11 = 2
inv : -p586 + p587 - p589 + p590 - p599 - p601 + p605 + p607 + p608 + p615 + p617 + p619 + p620 + p629 + p631 + p634 + p636 - p652 - p654 + p658 + p660 + p661 + p664 + p667 + p670 + p672 + p673 + p676 + p679 + p680 + p682 + p684 + p690 - p705 - p707 + p711 + p713 + p714 + p717 + p723 + p725 + p726 + p729 + p735 + p737 - p758 - p760 + p762 + p763 + p764 + p766 + p767 + p768 + p770 + p776 + p778 + p779 + p782 + p788 + p790 - p846 - p848 = 0
inv : p320 - p322 + p323 - p325 + p346 + p358 - p367 = 0
inv : -p387 - p389 + p393 + p394 + p395 + p396 + p399 + p405 + p407 + p408 + p411 + p417 + p419 + p422 + p424 - p440 - p442 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p465 + p468 + p470 + p472 - p493 - p495 + p499 + p501 + p502 + p505 + p511 + p513 + p514 + p517 + p523 + p525 - p546 - p548 + p552 + p554 + p555 + p558 + p561 + p564 + p566 + p567 + p570 + p574 + p576 + p578 - p634 - p636 = 0
inv : p756 - p798 + p799 - p801 + p802 - p811 - p813 + p817 + p819 + p820 + p829 + p831 + p832 + p841 + p843 + p846 + p848 - p864 - p866 + p870 + p872 + p873 + p876 + p882 + p884 + p885 + p888 + p894 + p896 - p952 - p954 = 0
inv : -p864 - p866 + p870 + p872 + p873 + p876 + p882 + p884 + p885 + p888 + p894 + p896 + p899 + p901 - p952 - p954 = 0
inv : p215 - p216 + p218 - p219 + p238 + p240 + p252 = 0
inv : p585 - p586 + p588 - p589 = 0
inv : p691 - p693 + p694 - p696 + p717 + p729 = 0
inv : p851 - p852 + p854 - p855 + p876 + p888 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 - p367 = 0
Total of 66 invariants.
[2020-05-22 08:59:08] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=1 took 99 ms
[2020-05-22 08:59:08] [INFO ] Computed 66 place invariants in 202 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=1 took 35 ms
[2020-05-22 08:59:09] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 36 ms
[2020-05-22 08:59:09] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=2 took 102 ms

[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=2 took 2 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=2 took 7 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=2 took 4 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=2 took 0 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=2 took 2 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=2 took 2 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=2 took 4 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=2 took 3 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=2 took 3 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=3 took 89 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=3 took 86 ms
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-00 with value :((gu89.p937<=gu89.p387)&&((gu74.p763>gu74.p960)||(gu45.p270>gu45.p52)))
Read [invariant] property : DoubleExponent-PT-020-ReachabilityCardinality-01 with value :(gu61.p646<=gu61.p560)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-04 with value :(gi9.gi1.gi3.gu49.p546>=1)
Read [invariant] property : DoubleExponent-PT-020-ReachabilityCardinality-05 with value :(gu9.p706<=gu9.p131)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-07 with value :(gi9.gi1.gi2.gu28.p324>=3)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-08 with value :(((gu75.p768>gu75.p42)&&(gi9.gi1.gi3.gu25.p600<1))&&(((gi9.gi1.gi2.gu30.p352>=3)||(gi9.gi1.gi3.gu34.p394>=1))||((gu72.p756<=gu72.p615)&&(gu21.p259<=gu21.p1057))))
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-09 with value :(gu19.p928>gu19.p243)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-11 with value :((((gu20.p367>gu20.p255)&&(gu64.p690<=gu64.p311))&&(gi9.gi0.gu8.p120>=3))||((gu21.p165>=3)&&((gi9.gi1.gi3.gu40.p465>=1)||(gi9.gi2.gi3.gu86.p924>=2))))
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-13 with value :(gi9.gi1.gi0.gu15.p238>=1)
Read [invariant] property : DoubleExponent-PT-020-ReachabilityCardinality-15 with value :(gi9.gi2.gi1.gu70.p748<2)
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=3 took 60 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=3 took 59 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=3 took 97 ms
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=3 took 247 ms
[2020-05-22 08:59:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=3 took 115 ms
SDD proceeding with computation, new max is 4096
[2020-05-22 08:59:10] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=3 took 80 ms
[2020-05-22 08:59:10] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=3 took 150 ms
[2020-05-22 08:59:10] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=3 took 79 ms
SDD proceeding with computation, new max is 8192
[2020-05-22 08:59:10] [INFO ] Proved 454 variables to be positive in 1622 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-00
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(SAT) depth K=0 took 51 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=0 took 29 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-04
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(SAT) depth K=0 took 42 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=0 took 28 ms
[2020-05-22 08:59:10] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=4 took 369 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-07
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(SAT) depth K=0 took 41 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-08
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(SAT) depth K=0 took 42 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-09
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(SAT) depth K=0 took 58 ms
SDD proceeding with computation, new max is 16384
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-11
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(SAT) depth K=0 took 51 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=0 took 42 ms
[2020-05-22 08:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2020-05-22 08:59:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=0 took 38 ms
[2020-05-22 08:59:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=4 took 586 ms
[2020-05-22 08:59:11] [INFO ] Proved 454 variables to be positive in 2893 ms
[2020-05-22 08:59:11] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=4 took 374 ms
[2020-05-22 08:59:11] [INFO ] Computing symmetric may disable matrix : 462 transitions.
[2020-05-22 08:59:11] [INFO ] Computation of disable matrix completed :0/462 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:59:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-00
[2020-05-22 08:59:11] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(SAT) depth K=1 took 733 ms
[2020-05-22 08:59:11] [INFO ] Computation of Complete disable matrix. took 129 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:59:11] [INFO ] Computing symmetric may enable matrix : 462 transitions.
[2020-05-22 08:59:11] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 32768
[2020-05-22 08:59:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2020-05-22 08:59:11] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=1 took 245 ms
[2020-05-22 08:59:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-04
[2020-05-22 08:59:12] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(SAT) depth K=1 took 259 ms
[2020-05-22 08:59:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2020-05-22 08:59:12] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=1 took 259 ms
[2020-05-22 08:59:12] [INFO ] Computing symmetric co enabling matrix : 462 transitions.
SMT solver raised 'unknown', retrying with same input.
[2020-05-22 08:59:13] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=4 took 2152 ms
SMT solver raised 'unknown' twice, overapproximating result to 1.
[2020-05-22 08:59:14] [INFO ] Computation of Finished co-enabling matrix. took 1342 ms. Total solver calls (SAT/UNSAT): 5(1/4)
[2020-05-22 08:59:14] [INFO ] Computing Do-Not-Accords matrix : 462 transitions.
[2020-05-22 08:59:14] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=4 took 448 ms
[2020-05-22 08:59:14] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=4 took 172 ms
[2020-05-22 08:59:14] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=4 took 382 ms
[2020-05-22 08:59:15] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=4 took 373 ms
SDD proceeding with computation, new max is 65536
[2020-05-22 08:59:15] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=4 took 436 ms
[2020-05-22 08:59:16] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=4 took 447 ms
[2020-05-22 08:59:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-07
[2020-05-22 08:59:16] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(SAT) depth K=1 took 4313 ms
[2020-05-22 08:59:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-08
[2020-05-22 08:59:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(SAT) depth K=1 took 236 ms
[2020-05-22 08:59:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-09
[2020-05-22 08:59:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(SAT) depth K=1 took 313 ms
[2020-05-22 08:59:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-11
[2020-05-22 08:59:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(SAT) depth K=1 took 203 ms
[2020-05-22 08:59:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2020-05-22 08:59:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=1 took 133 ms
[2020-05-22 08:59:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2020-05-22 08:59:17] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=1 took 131 ms
[2020-05-22 08:59:18] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=5 took 2678 ms
[2020-05-22 08:59:19] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=5 took 780 ms
[2020-05-22 08:59:20] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=5 took 861 ms
[2020-05-22 08:59:21] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=5 took 1263 ms
[2020-05-22 08:59:22] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=5 took 947 ms
[2020-05-22 08:59:24] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=5 took 1817 ms
[2020-05-22 08:59:25] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=5 took 954 ms
SDD proceeding with computation, new max is 131072
[2020-05-22 08:59:26] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=5 took 926 ms
[2020-05-22 08:59:28] [INFO ] Computation of Completed DNA matrix. took 14236 ms. Total solver calls (SAT/UNSAT): 2249(0/2249)
[2020-05-22 08:59:28] [INFO ] Built C files in 20851ms 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]
[2020-05-22 08:59:31] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=5 took 5122 ms
[2020-05-22 08:59:32] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=5 took 1262 ms
Compilation finished in 10203 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 86 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT020ReachabilityCardinality00==true], 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, -p, --pins-guards, --when, -i, DoubleExponentPT020ReachabilityCardinality00==true], 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, -p, --pins-guards, --when, -i, DoubleExponentPT020ReachabilityCardinality00==true], 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)
[2020-05-22 08:59:39] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=6 took 7271 ms
[2020-05-22 08:59:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-00
[2020-05-22 08:59:42] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(SAT) depth K=2 took 24568 ms
[2020-05-22 08:59:46] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=6 took 6137 ms
[2020-05-22 08:59:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=6 took 1650 ms
SDD proceeding with computation, new max is 262144
[2020-05-22 09:00:01] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=6 took 13821 ms
[2020-05-22 09:00:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=6 took 8232 ms
[2020-05-22 09:00:27] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=6 took 17923 ms
SDD proceeding with computation, new max is 524288
[2020-05-22 09:00:41] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=6 took 13334 ms
[2020-05-22 09:00:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=6 took 6526 ms
[2020-05-22 09:00:52] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=6 took 5199 ms
[2020-05-22 09:00:53] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=6 took 858 ms
[2020-05-22 09:00:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2020-05-22 09:00:59] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=2 took 76773 ms
[2020-05-22 09:01:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=7 took 8723 ms
[2020-05-22 09:01:16] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=7 took 13813 ms
[2020-05-22 09:01:20] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=7 took 4755 ms
[2020-05-22 09:01:29] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=7 took 9005 ms
[2020-05-22 09:01:33] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=7 took 3660 ms
[2020-05-22 09:01:54] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=7 took 20505 ms
[2020-05-22 09:01:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-04
[2020-05-22 09:01:58] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(SAT) depth K=2 took 59537 ms
[2020-05-22 09:02:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=7 took 8712 ms
[2020-05-22 09:02:09] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=7 took 6598 ms
[2020-05-22 09:02:15] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=7 took 6338 ms
SDD proceeding with computation, new max is 1048576
[2020-05-22 09:02:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2020-05-22 09:02:25] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=2 took 26952 ms
[2020-05-22 09:02:32] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=7 took 16899 ms
[2020-05-22 09:02:39] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=8 took 6602 ms
[2020-05-22 09:02:48] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=8 took 9519 ms
[2020-05-22 09:02:56] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=8 took 7171 ms
[2020-05-22 09:03:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-07
[2020-05-22 09:03:23] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(SAT) depth K=2 took 58290 ms
[2020-05-22 09:04:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-08
[2020-05-22 09:04:30] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(SAT) depth K=2 took 66812 ms
[2020-05-22 09:04:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-09
[2020-05-22 09:04:53] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(SAT) depth K=2 took 22644 ms
[2020-05-22 09:05:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-11
[2020-05-22 09:05:20] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(SAT) depth K=2 took 27394 ms
[2020-05-22 09:05:22] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=8 took 146440 ms
SDD proceeding with computation, new max is 2097152
[2020-05-22 09:05:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2020-05-22 09:05:59] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=2 took 38602 ms
[2020-05-22 09:06:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2020-05-22 09:06:22] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=2 took 23402 ms
[2020-05-22 09:07:40] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=8 took 137553 ms
[2020-05-22 09:08:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-00
[2020-05-22 09:08:07] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(SAT) depth K=3 took 104437 ms
[2020-05-22 09:08:56] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=8 took 76061 ms
[2020-05-22 09:09:06] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=8 took 10506 ms
[2020-05-22 09:09:45] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=8 took 39349 ms
[2020-05-22 09:10:04] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=8 took 18382 ms
[2020-05-22 09:10:25] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=8 took 20996 ms
[2020-05-22 09:10:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-01
[2020-05-22 09:10:50] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(SAT) depth K=3 took 163501 ms
[2020-05-22 09:12:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-04
[2020-05-22 09:12:16] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(SAT) depth K=3 took 85979 ms
SDD proceeding with computation, new max is 4194304
[2020-05-22 09:12:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-05
[2020-05-22 09:12:59] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(SAT) depth K=3 took 43224 ms
[2020-05-22 09:15:30] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=9 took 304806 ms
[2020-05-22 09:16:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-07
[2020-05-22 09:16:10] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(SAT) depth K=3 took 190238 ms
[2020-05-22 09:17:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-08
[2020-05-22 09:17:32] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(SAT) depth K=3 took 82389 ms
[2020-05-22 09:20:07] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=9 took 276897 ms
[2020-05-22 09:20:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-09
[2020-05-22 09:20:32] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(SAT) depth K=3 took 179463 ms
[2020-05-22 09:21:26] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-04(UNSAT) depth K=9 took 79920 ms
[2020-05-22 09:21:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-11
[2020-05-22 09:21:30] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(SAT) depth K=3 took 58257 ms
[2020-05-22 09:21:47] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-05(UNSAT) depth K=9 took 20458 ms
[2020-05-22 09:22:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-13
[2020-05-22 09:22:21] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(SAT) depth K=3 took 51418 ms
[2020-05-22 09:24:26] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-07(UNSAT) depth K=9 took 159258 ms
[2020-05-22 09:24:39] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-08(UNSAT) depth K=9 took 13014 ms
[2020-05-22 09:25:19] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-09(UNSAT) depth K=9 took 39883 ms
[2020-05-22 09:25:53] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-11(UNSAT) depth K=9 took 34166 ms
[2020-05-22 09:26:18] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-13(UNSAT) depth K=9 took 24988 ms
Detected timeout of ITS tools.
[2020-05-22 09:26:57] [INFO ] Flatten gal took : 100 ms
[2020-05-22 09:26:57] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 34 ms
[2020-05-22 09:26:57] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-00 with value :((p937<=p387)&&((p763>p960)||(p270>p52)))
Read [invariant] property : DoubleExponent-PT-020-ReachabilityCardinality-01 with value :(p646<=p560)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-04 with value :(p546>=1)
Read [invariant] property : DoubleExponent-PT-020-ReachabilityCardinality-05 with value :(p706<=p131)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-07 with value :(p324>=3)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-08 with value :(((p768>p42)&&(p600<1))&&(((p352>=3)||(p394>=1))||((p756<=p615)&&(p259<=p1057))))
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-09 with value :(p928>p243)
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-11 with value :((((p367>p255)&&(p690<=p311))&&(p120>=3))||((p165>=3)&&((p465>=1)||(p924>=2))))
Read [reachable] property : DoubleExponent-PT-020-ReachabilityCardinality-13 with value :(p238>=1)
Read [invariant] property : DoubleExponent-PT-020-ReachabilityCardinality-15 with value :(p748<2)
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
[2020-05-22 09:27:18] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(UNSAT) depth K=9 took 59618 ms
[2020-05-22 09:27:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-15
[2020-05-22 09:27:22] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-15(SAT) depth K=3 took 301205 ms
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
SDD proceeding with computation, new max is 2097152
[2020-05-22 09:34:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-020-ReachabilityCardinality-00
[2020-05-22 09:34:29] [INFO ] KInduction solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(SAT) depth K=4 took 426834 ms
[2020-05-22 09:34:35] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-00(UNSAT) depth K=10 took 436824 ms
[2020-05-22 09:35:02] [INFO ] BMC solution for property DoubleExponent-PT-020-ReachabilityCardinality-01(UNSAT) depth K=10 took 27221 ms

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DoubleExponent-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
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 DoubleExponent-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814800790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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