Execution Chart

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

Trace from the execution

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

--------------------
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 1591241266531

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:27:48] [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, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:27:48] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2020-06-04 03:27:48] [INFO ] Transformed 1064 places.
[2020-06-04 03:27:49] [INFO ] Transformed 998 transitions.
[2020-06-04 03:27:49] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 165 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 336 resets, run finished after 116 ms. (steps per millisecond=86 ) 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 58 ms. (steps per millisecond=172 ) 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 43 ms. (steps per millisecond=232 ) 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 278 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 277 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 293 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 288 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 284 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 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 41 ms. (steps per millisecond=243 ) 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 279 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 289 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 44 ms. (steps per millisecond=227 ) 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 288 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 276 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 285 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 266 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]
Interrupted probabilistic random walk after 3417617 steps, run timeout after 30001 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 3417617 steps, saw 1708462 distinct states, run finished after 30001 ms. (steps per millisecond=113 ) 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-06-04 03:28:20] [INFO ] Computed 104 place invariants in 287 ms
[2020-06-04 03:28:20] [INFO ] [Real]Absence check using 2 positive place invariants in 55 ms returned sat
[2020-06-04 03:28:21] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 415 ms returned sat
[2020-06-04 03:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s1030 (- t896 t897))") while checking expression at index 0
[2020-06-04 03:28:25] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2020-06-04 03:28:25] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 203 ms returned sat
[2020-06-04 03:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:29] [INFO ] [Real]Absence check using state equation in 4147 ms returned sat
[2020-06-04 03:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 34 ms returned sat
[2020-06-04 03:28:30] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 92 ms returned sat
[2020-06-04 03:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:33] [INFO ] [Nat]Absence check using state equation in 3525 ms returned sat
[2020-06-04 03:28:34] [INFO ] Deduced a trap composed of 79 places in 674 ms
[2020-06-04 03:28:35] [INFO ] Deduced a trap composed of 149 places in 538 ms
[2020-06-04 03:28:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 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-06-04 03:28:35] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-06-04 03:28:35] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 89 ms returned unsat
[2020-06-04 03:28:35] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-06-04 03:28:35] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 104 ms returned unsat
[2020-06-04 03:28:35] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2020-06-04 03:28:35] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 135 ms returned sat
[2020-06-04 03:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:38] [INFO ] [Real]Absence check using state equation in 3002 ms returned sat
[2020-06-04 03:28:39] [INFO ] Deduced a trap composed of 423 places in 1011 ms
[2020-06-04 03:28:40] [INFO ] Deduced a trap composed of 395 places in 578 ms
[2020-06-04 03:28:40] [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-06-04 03:28:40] [INFO ] [Real]Absence check using 2 positive place invariants in 33 ms returned sat
[2020-06-04 03:28:40] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 103 ms returned sat
[2020-06-04 03:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:44] [INFO ] [Real]Absence check using state equation in 3476 ms returned sat
[2020-06-04 03:28:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:28:44] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 145 ms returned sat
[2020-06-04 03:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:48] [INFO ] [Nat]Absence check using state equation in 3383 ms returned sat
[2020-06-04 03:28:48] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 58 ms.
[2020-06-04 03:28:49] [INFO ] Added : 50 causal constraints over 10 iterations in 1200 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:28:49] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:28:49] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 156 ms returned sat
[2020-06-04 03:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:53] [INFO ] [Real]Absence check using state equation in 3707 ms returned sat
[2020-06-04 03:28:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-06-04 03:28:53] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 141 ms returned unsat
[2020-06-04 03:28:53] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:28:54] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 131 ms returned sat
[2020-06-04 03:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:28:57] [INFO ] [Real]Absence check using state equation in 3156 ms returned sat
[2020-06-04 03:28:58] [INFO ] Deduced a trap composed of 55 places in 720 ms
[2020-06-04 03:28:58] [INFO ] Deduced a trap composed of 62 places in 416 ms
[2020-06-04 03:28:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1268 ms
[2020-06-04 03:28:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:28:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 20 ms returned sat
[2020-06-04 03:28:58] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 86 ms returned sat
[2020-06-04 03:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:01] [INFO ] [Nat]Absence check using state equation in 3138 ms returned sat
[2020-06-04 03:29:02] [INFO ] Deduced a trap composed of 55 places in 468 ms
[2020-06-04 03:29:02] [INFO ] Deduced a trap composed of 62 places in 441 ms
[2020-06-04 03:29:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1029 ms
[2020-06-04 03:29:02] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 57 ms.
[2020-06-04 03:29:03] [INFO ] Added : 55 causal constraints over 11 iterations in 686 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:29:03] [INFO ] [Real]Absence check using 2 positive place invariants in 27 ms returned sat
[2020-06-04 03:29:04] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 289 ms returned sat
[2020-06-04 03:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:08] [INFO ] [Real]Absence check using state equation in 4033 ms returned sat
[2020-06-04 03:29:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:29:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-06-04 03:29:08] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 114 ms returned sat
[2020-06-04 03:29:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:11] [INFO ] [Nat]Absence check using state equation in 2875 ms returned sat
[2020-06-04 03:29:11] [INFO ] Deduced a trap composed of 394 places in 545 ms
[2020-06-04 03:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 839 ms
[2020-06-04 03:29:12] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 95 ms.
[2020-06-04 03:29:13] [INFO ] Added : 65 causal constraints over 13 iterations in 1044 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 03:29:13] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2020-06-04 03:29:13] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 141 ms returned sat
[2020-06-04 03:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:17] [INFO ] [Real]Absence check using state equation in 3873 ms returned sat
[2020-06-04 03:29:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:29:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-06-04 03:29:17] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 94 ms returned sat
[2020-06-04 03:29:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:21] [INFO ] [Nat]Absence check using state equation in 3636 ms returned sat
[2020-06-04 03:29:21] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 119 ms.
[2020-06-04 03:29:22] [INFO ] Added : 55 causal constraints over 11 iterations in 1051 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:29:22] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:29:22] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 149 ms returned unsat
[2020-06-04 03:29:22] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2020-06-04 03:29:23] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 145 ms returned sat
[2020-06-04 03:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:25] [INFO ] [Real]Absence check using state equation in 2914 ms returned sat
[2020-06-04 03:29:26] [INFO ] Deduced a trap composed of 53 places in 424 ms
[2020-06-04 03:29:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 535 ms
[2020-06-04 03:29:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:29:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-06-04 03:29:26] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 122 ms returned sat
[2020-06-04 03:29:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:29] [INFO ] [Nat]Absence check using state equation in 2934 ms returned sat
[2020-06-04 03:29:30] [INFO ] Deduced a trap composed of 404 places in 511 ms
[2020-06-04 03:29:30] [INFO ] Deduced a trap composed of 89 places in 348 ms
[2020-06-04 03:29:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1130 ms
[2020-06-04 03:29:30] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints in 51 ms.
[2020-06-04 03:29:31] [INFO ] Added : 75 causal constraints over 15 iterations in 704 ms. Result :(error "Failed to check-sat")
[2020-06-04 03:29:31] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2020-06-04 03:29:31] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 44 ms returned unsat
[2020-06-04 03:29:31] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-06-04 03:29:31] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 92 ms returned sat
[2020-06-04 03:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:34] [INFO ] [Real]Absence check using state equation in 2412 ms returned sat
[2020-06-04 03:29:34] [INFO ] Deduced a trap composed of 53 places in 533 ms
[2020-06-04 03:29:35] [INFO ] Deduced a trap composed of 363 places in 534 ms
[2020-06-04 03:29:36] [INFO ] Deduced a trap composed of 396 places in 644 ms
[2020-06-04 03:29:37] [INFO ] Deduced a trap composed of 378 places in 581 ms
[2020-06-04 03:29:37] [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 s3 s4 s9 s11 s16 s19 s20 s29 s30 s31 s44 s51 s52 s53 s54 s55 s56 s58 s60 s67 s70 s80 s82 s83 s84 s85 s92 s93 s94 s101 s102 s103 s104 s105 s106 s107 s110 s120 s121 s132 s133 s137 s140 s141 s143 s150 s152 s154 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s180 s181 s182 s183 s184 s188 s190 s191 s192 s196 s199 s200 s201 s209 s210 s212 s221 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s238 s239 s240 s248 s250 s255 s258 s259 s268 s270 s283 s284 s285 s286 s287 s289 s290 s291 s292 s293 s294 s295 s297 s298 s300 s307 s309 s314 s317 s318 s327 s328 s329 s342 s349 s350 s351 s352 s353 s356 s357 s358 s366 s368 s369 s372 s375 s377 s385 s388 s398 s402 s403 s404 s405 s406 s408 s409 s415 s416 s417 s425 s426 s427 s428 s431 s435 s436 s445 s447 s460 s461 s462 s463 s464 s467 s468 s473 s475 s483 s485 s490 s492 s493 s494 s503 s505 s509 s519 s520 s522 s523 s524 s525 s526 s527 s528 s533 s535 s536 s537 s538 s539 s540 s541 s542 s545 s549 s552 s553 s562 s564 s578 s579 s580 s581 s582 s583 s584 s585 s586 s588 s589 s591 s592 s593 s598 s601 s603 s607 s611 s612 s620 s622 s623 s624 s632 s637 s643 s644 s645 s646 s647 s648 s650 s651 s652 s660 s662 s667 s670 s671 s680 s681 s682 s695 s702 s703 s704 s705 s706 s708 s710 s711 s718 s719 s721 s723 s726 s728 s729 s730 s731 s733 s739 s740 s741 s746 s749 s754 s755 s768 s769 s770 s778 s779 s780 s781 s784 s788 s789 s797 s800 s813 s814 s815 s816 s817 s819 s821 s826 s827 s828 s829 s830 s836 s837 s838 s839 s844 s847 s848 s857 s858 s859 s872 s877 s880 s885 s888 s895 s897 s899 s902 s905 s906 s915 s917 s930 s932 s933 s934 s935 s937 s938 s944 s945 s946 s954 s955 s956 s957 s958 s959 s962 s964 s965 s966 s967 s968 s969 s974 s976 s977 s981 s984 s987 s990 s991 s992 s993 s994 s996 s997 s998 s1003 s1005 s1009 s1013 s1015 s1016 s1019 s1020 s1023 s1024 s1033 s1035 s1048 s1049 s1050 s1051 s1052 s1055 s1056 s1061 s1063) 0)") while checking expression at index 13
[2020-06-04 03:29:37] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:29:37] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 85 ms returned unsat
[2020-06-04 03:29:37] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-06-04 03:29:37] [INFO ] [Real]Absence check using 2 positive and 102 generalized place invariants in 91 ms returned sat
[2020-06-04 03:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:40] [INFO ] [Real]Absence check using state equation in 2922 ms returned sat
[2020-06-04 03:29:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:29:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:29:40] [INFO ] [Nat]Absence check using 2 positive and 102 generalized place invariants in 139 ms returned sat
[2020-06-04 03:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:29:44] [INFO ] [Nat]Absence check using state equation in 3490 ms returned sat
[2020-06-04 03:29:44] [INFO ] Deduced a trap composed of 133 places in 411 ms
[2020-06-04 03:29:45] [INFO ] Deduced a trap composed of 430 places in 517 ms
[2020-06-04 03:29:45] [INFO ] Deduced a trap composed of 418 places in 447 ms
[2020-06-04 03:29:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s9 s10 s11 s16 s19 s20 s29 s31 s44 s45 s47 s48 s49 s50 s51 s52 s53 s54 s55 s58 s59 s60 s67 s70 s74 s80 s82 s83 s84 s85 s92 s93 s94 s101 s102 s103 s104 s105 s107 s110 s120 s121 s122 s123 s130 s133 s138 s140 s141 s142 s144 s150 s151 s152 s159 s160 s161 s162 s163 s166 s176 s180 s181 s182 s183 s184 s190 s191 s192 s197 s200 s201 s202 s203 s209 s211 s212 s218 s219 s220 s222 s223 s225 s232 s238 s239 s240 s241 s242 s248 s249 s250 s255 s257 s258 s259 s268 s270 s283 s284 s285 s286 s287 s289 s290 s291 s292 s293 s297 s298 s300 s301 s302 s304 s305 s306 s307 s308 s309 s314 s317 s318 s327 s328 s329 s342 s349 s350 s351 s352 s353 s356 s357 s358 s366 s368 s372 s375 s377 s385 s386 s388 s398 s402 s408 s409 s411 s412 s413 s415 s416 s417 s425 s426 s427 s431 s432 s435 s436 s443 s445 s447 s454 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s473 s474 s475 s476 s483 s484 s485 s487 s491 s493 s494 s495 s496 s498 s503 s504 s505 s509 s513 s514 s515 s516 s517 s519 s533 s534 s535 s542 s545 s552 s553 s555 s556 s557 s558 s559 s560 s561 s562 s563 s564 s578 s591 s592 s593 s594 s595 s598 s601 s602 s603 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s622 s623 s624 s632 s637 s643 s650 s651 s652 s653 s655 s656 s657 s658 s659 s660 s661 s662 s667 s670 s671 s680 s682 s695 s696 s697 s699 s700 s701 s702 s703 s704 s705 s706 s708 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s721 s725 s728 s729 s731 s732 s739 s740 s741 s754 s755 s761 s762 s763 s764 s766 s768 s769 s770 s778 s780 s782 s788 s789 s790 s791 s792 s797 s799 s800 s801 s802 s803 s804 s806 s807 s813 s826 s827 s828 s836 s837 s838 s839 s847 s848 s849 s850 s851 s857 s858 s859 s872 s877 s885 s886 s887 s888 s889 s890 s891 s892 s893 s895 s896 s897 s898 s899 s902 s905 s906 s909 s915 s916 s917 s920 s930 s931 s935 s938 s942 s944 s945 s946 s947 s948 s949 s950 s951 s952 s953 s954 s955 s956 s957 s958 s961 s964 s965 s966 s974 s975 s976 s977 s987 s990 s994 s997 s998 s1003 s1004 s1005 s1009 s1013 s1014 s1015 s1019 s1020 s1023 s1024 s1033 s1035 s1048 s1049 s1050 s1051 s1052 s1054 s1055 s1056 s1057 s1058 s1059 s1061 s1062 s1063) 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
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 18 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 8 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 7 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 477 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 127319 resets, run finished after 2344 ms. (steps per millisecond=426 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84274 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84305 resets, run finished after 1510 ms. (steps per millisecond=662 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84488 resets, run finished after 1490 ms. (steps per millisecond=671 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84304 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84245 resets, run finished after 1510 ms. (steps per millisecond=662 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84252 resets, run finished after 1522 ms. (steps per millisecond=657 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84224 resets, run finished after 1482 ms. (steps per millisecond=674 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84491 resets, run finished after 1794 ms. (steps per millisecond=557 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84289 resets, run finished after 1474 ms. (steps per millisecond=678 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84354 resets, run finished after 1463 ms. (steps per millisecond=683 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5250283 steps, run timeout after 30001 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5250283 steps, saw 2624711 distinct states, run finished after 30001 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 477 rows 504 cols
[2020-06-04 03:30:33] [INFO ] Computed 100 place invariants in 131 ms
[2020-06-04 03:30:33] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 03:30:34] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 90 ms returned sat
[2020-06-04 03:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:34] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2020-06-04 03:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 20 ms returned sat
[2020-06-04 03:30:35] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 63 ms returned sat
[2020-06-04 03:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:35] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2020-06-04 03:30:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-06-04 03:30:36] [INFO ] [Nat]Added 71 Read/Feed constraints in 77 ms returned sat
[2020-06-04 03:30:36] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 41 ms.
[2020-06-04 03:30:44] [INFO ] Added : 354 causal constraints over 71 iterations in 8200 ms. Result :sat
[2020-06-04 03:30:44] [INFO ] Deduced a trap composed of 11 places in 308 ms
[2020-06-04 03:30:44] [INFO ] Deduced a trap composed of 12 places in 233 ms
[2020-06-04 03:30:45] [INFO ] Deduced a trap composed of 12 places in 245 ms
[2020-06-04 03:30:45] [INFO ] Deduced a trap composed of 23 places in 213 ms
[2020-06-04 03:30:45] [INFO ] Deduced a trap composed of 15 places in 242 ms
[2020-06-04 03:30:46] [INFO ] Deduced a trap composed of 14 places in 241 ms
[2020-06-04 03:30:46] [INFO ] Deduced a trap composed of 16 places in 370 ms
[2020-06-04 03:30:46] [INFO ] Deduced a trap composed of 8 places in 326 ms
[2020-06-04 03:30:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2596 ms
Attempting to minimize the solution found.
Minimization took 56 ms.
[2020-06-04 03:30:47] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-04 03:30:47] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 163 ms returned sat
[2020-06-04 03:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:48] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2020-06-04 03:30:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:30:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:30:48] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 101 ms returned sat
[2020-06-04 03:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:30:49] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2020-06-04 03:30:49] [INFO ] [Nat]Added 71 Read/Feed constraints in 89 ms returned sat
[2020-06-04 03:30:49] [INFO ] Deduced a trap composed of 36 places in 174 ms
[2020-06-04 03:30:49] [INFO ] Deduced a trap composed of 33 places in 140 ms
[2020-06-04 03:30:50] [INFO ] Deduced a trap composed of 30 places in 149 ms
[2020-06-04 03:30:50] [INFO ] Deduced a trap composed of 34 places in 135 ms
[2020-06-04 03:30:50] [INFO ] Deduced a trap composed of 34 places in 181 ms
[2020-06-04 03:30:50] [INFO ] Deduced a trap composed of 36 places in 114 ms
[2020-06-04 03:30:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1050 ms
[2020-06-04 03:30:50] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 27 ms.
[2020-06-04 03:31:03] [INFO ] Added : 437 causal constraints over 88 iterations in 13063 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-04 03:31:03] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:31:04] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 76 ms returned sat
[2020-06-04 03:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:04] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2020-06-04 03:31:04] [INFO ] [Real]Added 71 Read/Feed constraints in 63 ms returned sat
[2020-06-04 03:31:04] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 47 ms.
[2020-06-04 03:31:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:31:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:31:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 69 ms returned sat
[2020-06-04 03:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:05] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2020-06-04 03:31:06] [INFO ] [Nat]Added 71 Read/Feed constraints in 238 ms returned sat
[2020-06-04 03:31:06] [INFO ] Deduced a trap composed of 22 places in 198 ms
[2020-06-04 03:31:06] [INFO ] Deduced a trap composed of 27 places in 385 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 24 places in 301 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 34 places in 143 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 114 places in 124 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 116 places in 115 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 108 places in 126 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 106 places in 131 ms
[2020-06-04 03:31:07] [INFO ] Deduced a trap composed of 97 places in 143 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 108 places in 131 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 105 places in 121 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 111 places in 122 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 119 places in 99 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 110 places in 100 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 107 places in 97 ms
[2020-06-04 03:31:08] [INFO ] Deduced a trap composed of 34 places in 98 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 115 places in 111 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 103 places in 129 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 121 places in 131 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 137 places in 122 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 119 places in 129 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 134 places in 132 ms
[2020-06-04 03:31:09] [INFO ] Deduced a trap composed of 120 places in 114 ms
[2020-06-04 03:31:10] [INFO ] Deduced a trap composed of 118 places in 106 ms
[2020-06-04 03:31:10] [INFO ] Deduced a trap composed of 133 places in 100 ms
[2020-06-04 03:31:10] [INFO ] Deduced a trap composed of 119 places in 98 ms
[2020-06-04 03:31:10] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4258 ms
[2020-06-04 03:31:10] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 22 ms.
[2020-06-04 03:31:25] [INFO ] Added : 429 causal constraints over 86 iterations in 15072 ms. Result :sat
[2020-06-04 03:31:25] [INFO ] Deduced a trap composed of 8 places in 259 ms
[2020-06-04 03:31:26] [INFO ] Deduced a trap composed of 17 places in 240 ms
[2020-06-04 03:31:26] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2020-06-04 03:31:26] [INFO ] Deduced a trap composed of 4 places in 246 ms
[2020-06-04 03:31:26] [INFO ] Deduced a trap composed of 4 places in 207 ms
[2020-06-04 03:31:27] [INFO ] Deduced a trap composed of 153 places in 185 ms
[2020-06-04 03:31:27] [INFO ] Deduced a trap composed of 148 places in 177 ms
[2020-06-04 03:31:27] [INFO ] Deduced a trap composed of 11 places in 182 ms
[2020-06-04 03:31:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2257 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-04 03:31:27] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-04 03:31:27] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 54 ms returned sat
[2020-06-04 03:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:28] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2020-06-04 03:31:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:31:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-06-04 03:31:28] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 53 ms returned sat
[2020-06-04 03:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:29] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2020-06-04 03:31:29] [INFO ] [Nat]Added 71 Read/Feed constraints in 62 ms returned sat
[2020-06-04 03:31:29] [INFO ] Deduced a trap composed of 16 places in 209 ms
[2020-06-04 03:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2020-06-04 03:31:29] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 24 ms.
[2020-06-04 03:31:41] [INFO ] Added : 450 causal constraints over 90 iterations in 11751 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-06-04 03:31:41] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-04 03:31:41] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 116 ms returned sat
[2020-06-04 03:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:42] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2020-06-04 03:31:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:31:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2020-06-04 03:31:42] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 64 ms returned sat
[2020-06-04 03:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:31:43] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2020-06-04 03:31:44] [INFO ] [Nat]Added 71 Read/Feed constraints in 720 ms returned sat
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 59 places in 142 ms
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 54 places in 106 ms
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 89 places in 114 ms
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 104 places in 109 ms
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 121 places in 110 ms
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 104 places in 102 ms
[2020-06-04 03:31:44] [INFO ] Deduced a trap composed of 117 places in 99 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 90 places in 88 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 119 places in 88 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 100 places in 88 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 90 places in 89 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 24 places in 89 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 64 places in 64 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 81 places in 70 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 104 places in 57 ms
[2020-06-04 03:31:45] [INFO ] Deduced a trap composed of 112 places in 79 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 115 places in 102 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 101 places in 92 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 103 places in 69 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 103 places in 67 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 112 places in 58 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 108 places in 57 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 103 places in 56 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 112 places in 58 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 104 places in 88 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 110 places in 58 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 114 places in 85 ms
[2020-06-04 03:31:46] [INFO ] Deduced a trap composed of 116 places in 57 ms
[2020-06-04 03:31:47] [INFO ] Deduced a trap composed of 113 places in 64 ms
[2020-06-04 03:31:47] [INFO ] Deduced a trap composed of 121 places in 98 ms
[2020-06-04 03:31:47] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3133 ms
[2020-06-04 03:31:47] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 21 ms.
[2020-06-04 03:31:57] [INFO ] Added : 350 causal constraints over 70 iterations in 10331 ms. Result :sat
[2020-06-04 03:31:57] [INFO ] Deduced a trap composed of 4 places in 304 ms
[2020-06-04 03:31:58] [INFO ] Deduced a trap composed of 27 places in 312 ms
[2020-06-04 03:31:58] [INFO ] Deduced a trap composed of 34 places in 300 ms
[2020-06-04 03:31:59] [INFO ] Deduced a trap composed of 140 places in 360 ms
[2020-06-04 03:31:59] [INFO ] Deduced a trap composed of 4 places in 281 ms
[2020-06-04 03:31:59] [INFO ] Deduced a trap composed of 145 places in 282 ms
[2020-06-04 03:32:00] [INFO ] Deduced a trap composed of 129 places in 260 ms
[2020-06-04 03:32:00] [INFO ] Deduced a trap composed of 149 places in 284 ms
[2020-06-04 03:32:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3067 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-06-04 03:32:00] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-06-04 03:32:00] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 99 ms returned sat
[2020-06-04 03:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:01] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2020-06-04 03:32:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:32:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 03:32:02] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 67 ms returned sat
[2020-06-04 03:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:02] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2020-06-04 03:32:02] [INFO ] [Nat]Added 71 Read/Feed constraints in 52 ms returned sat
[2020-06-04 03:32:02] [INFO ] Deduced a trap composed of 68 places in 75 ms
[2020-06-04 03:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2020-06-04 03:32:02] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 30 ms.
[2020-06-04 03:32:17] [INFO ] Added : 463 causal constraints over 93 iterations in 15017 ms. Result :sat
[2020-06-04 03:32:18] [INFO ] Deduced a trap composed of 16 places in 203 ms
[2020-06-04 03:32:18] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-06-04 03:32:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 748 ms
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-06-04 03:32:18] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2020-06-04 03:32:18] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 82 ms returned sat
[2020-06-04 03:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:19] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2020-06-04 03:32:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:32:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 19 ms returned sat
[2020-06-04 03:32:20] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 56 ms returned sat
[2020-06-04 03:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:20] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2020-06-04 03:32:20] [INFO ] [Nat]Added 71 Read/Feed constraints in 38 ms returned sat
[2020-06-04 03:32:21] [INFO ] Deduced a trap composed of 151 places in 255 ms
[2020-06-04 03:32:21] [INFO ] Deduced a trap composed of 127 places in 210 ms
[2020-06-04 03:32:21] [INFO ] Deduced a trap composed of 134 places in 213 ms
[2020-06-04 03:32:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 762 ms
[2020-06-04 03:32:21] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 29 ms.
[2020-06-04 03:32:40] [INFO ] Added : 473 causal constraints over 95 iterations in 18587 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2020-06-04 03:32:40] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-04 03:32:40] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 102 ms returned sat
[2020-06-04 03:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:41] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2020-06-04 03:32:41] [INFO ] [Real]Added 71 Read/Feed constraints in 13 ms returned sat
[2020-06-04 03:32:41] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 26 ms.
[2020-06-04 03:32:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:32:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:32:41] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 96 ms returned sat
[2020-06-04 03:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:42] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2020-06-04 03:32:42] [INFO ] [Nat]Added 71 Read/Feed constraints in 218 ms returned sat
[2020-06-04 03:32:42] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2020-06-04 03:32:42] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2020-06-04 03:32:43] [INFO ] Deduced a trap composed of 59 places in 107 ms
[2020-06-04 03:32:43] [INFO ] Deduced a trap composed of 73 places in 76 ms
[2020-06-04 03:32:43] [INFO ] Deduced a trap composed of 103 places in 67 ms
[2020-06-04 03:32:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 756 ms
[2020-06-04 03:32:43] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 30 ms.
[2020-06-04 03:32:53] [INFO ] Added : 435 causal constraints over 87 iterations in 10576 ms. Result :sat
[2020-06-04 03:32:54] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-06-04 03:32:54] [INFO ] Deduced a trap composed of 133 places in 242 ms
[2020-06-04 03:32:54] [INFO ] Deduced a trap composed of 12 places in 258 ms
[2020-06-04 03:32:55] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-06-04 03:32:55] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-06-04 03:32:55] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-06-04 03:32:56] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2020-06-04 03:32:56] [INFO ] Deduced a trap composed of 114 places in 216 ms
[2020-06-04 03:32:57] [INFO ] Deduced a trap composed of 152 places in 322 ms
[2020-06-04 03:32:57] [INFO ] Deduced a trap composed of 123 places in 270 ms
[2020-06-04 03:32:57] [INFO ] Deduced a trap composed of 114 places in 284 ms
[2020-06-04 03:32:58] [INFO ] Deduced a trap composed of 118 places in 284 ms
[2020-06-04 03:32:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4290 ms
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-06-04 03:32:58] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 03:32:58] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 84 ms returned sat
[2020-06-04 03:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:32:59] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2020-06-04 03:32:59] [INFO ] [Real]Added 71 Read/Feed constraints in 42 ms returned sat
[2020-06-04 03:32:59] [INFO ] Deduced a trap composed of 12 places in 297 ms
[2020-06-04 03:32:59] [INFO ] Deduced a trap composed of 12 places in 280 ms
[2020-06-04 03:33:00] [INFO ] Deduced a trap composed of 18 places in 191 ms
[2020-06-04 03:33:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 840 ms
[2020-06-04 03:33:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:33:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-06-04 03:33:00] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 49 ms returned sat
[2020-06-04 03:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:00] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2020-06-04 03:33:01] [INFO ] [Nat]Added 71 Read/Feed constraints in 440 ms returned sat
[2020-06-04 03:33:01] [INFO ] Deduced a trap composed of 175 places in 242 ms
[2020-06-04 03:33:01] [INFO ] Deduced a trap composed of 179 places in 220 ms
[2020-06-04 03:33:02] [INFO ] Deduced a trap composed of 184 places in 170 ms
[2020-06-04 03:33:02] [INFO ] Deduced a trap composed of 170 places in 166 ms
[2020-06-04 03:33:02] [INFO ] Deduced a trap composed of 182 places in 153 ms
[2020-06-04 03:33:02] [INFO ] Deduced a trap composed of 186 places in 146 ms
[2020-06-04 03:33:02] [INFO ] Deduced a trap composed of 172 places in 145 ms
[2020-06-04 03:33:02] [INFO ] Deduced a trap composed of 34 places in 147 ms
[2020-06-04 03:33:03] [INFO ] Deduced a trap composed of 77 places in 156 ms
[2020-06-04 03:33:03] [INFO ] Deduced a trap composed of 73 places in 149 ms
[2020-06-04 03:33:03] [INFO ] Deduced a trap composed of 162 places in 166 ms
[2020-06-04 03:33:03] [INFO ] Deduced a trap composed of 158 places in 177 ms
[2020-06-04 03:33:03] [INFO ] Deduced a trap composed of 150 places in 152 ms
[2020-06-04 03:33:03] [INFO ] Deduced a trap composed of 159 places in 162 ms
[2020-06-04 03:33:04] [INFO ] Deduced a trap composed of 152 places in 149 ms
[2020-06-04 03:33:04] [INFO ] Deduced a trap composed of 168 places in 162 ms
[2020-06-04 03:33:04] [INFO ] Deduced a trap composed of 152 places in 142 ms
[2020-06-04 03:33:04] [INFO ] Deduced a trap composed of 162 places in 157 ms
[2020-06-04 03:33:04] [INFO ] Deduced a trap composed of 165 places in 149 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 177 places in 145 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 172 places in 138 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 158 places in 147 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 150 places in 149 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 157 places in 162 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 153 places in 139 ms
[2020-06-04 03:33:05] [INFO ] Deduced a trap composed of 171 places in 151 ms
[2020-06-04 03:33:06] [INFO ] Deduced a trap composed of 50 places in 142 ms
[2020-06-04 03:33:06] [INFO ] Deduced a trap composed of 68 places in 147 ms
[2020-06-04 03:33:06] [INFO ] Deduced a trap composed of 46 places in 147 ms
[2020-06-04 03:33:06] [INFO ] Deduced a trap composed of 62 places in 142 ms
[2020-06-04 03:33:06] [INFO ] Deduced a trap composed of 172 places in 154 ms
[2020-06-04 03:33:06] [INFO ] Deduced a trap composed of 56 places in 149 ms
[2020-06-04 03:33:07] [INFO ] Deduced a trap composed of 84 places in 148 ms
[2020-06-04 03:33:07] [INFO ] Deduced a trap composed of 66 places in 144 ms
[2020-06-04 03:33:07] [INFO ] Deduced a trap composed of 187 places in 156 ms
[2020-06-04 03:33:07] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6183 ms
[2020-06-04 03:33:07] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 55 ms.
[2020-06-04 03:33:18] [INFO ] Added : 325 causal constraints over 65 iterations in 10660 ms. Result :sat
[2020-06-04 03:33:18] [INFO ] Deduced a trap composed of 17 places in 275 ms
[2020-06-04 03:33:18] [INFO ] Deduced a trap composed of 4 places in 220 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 9 places in 221 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 7 places in 186 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 13 places in 186 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 19 places in 191 ms
[2020-06-04 03:33:19] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2020-06-04 03:33:20] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2020-06-04 03:33:20] [INFO ] Deduced a trap composed of 16 places in 174 ms
[2020-06-04 03:33:20] [INFO ] Deduced a trap composed of 12 places in 164 ms
[2020-06-04 03:33:20] [INFO ] Deduced a trap composed of 11 places in 177 ms
[2020-06-04 03:33:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2663 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-04 03:33:20] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-04 03:33:21] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 68 ms returned sat
[2020-06-04 03:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:21] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2020-06-04 03:33:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:33:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-04 03:33:21] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 59 ms returned sat
[2020-06-04 03:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:33:22] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2020-06-04 03:33:22] [INFO ] [Nat]Added 71 Read/Feed constraints in 183 ms returned sat
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 48 places in 125 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 50 places in 101 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 44 places in 86 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 42 places in 77 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 46 places in 91 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 60 places in 74 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 56 places in 69 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 78 places in 84 ms
[2020-06-04 03:33:23] [INFO ] Deduced a trap composed of 62 places in 79 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 77 places in 87 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 88 places in 64 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 56 places in 78 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 40 places in 68 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 99 places in 92 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 94 places in 55 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 60 places in 79 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 91 places in 56 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 94 places in 62 ms
[2020-06-04 03:33:24] [INFO ] Deduced a trap composed of 93 places in 69 ms
[2020-06-04 03:33:25] [INFO ] Deduced a trap composed of 105 places in 81 ms
[2020-06-04 03:33:25] [INFO ] Deduced a trap composed of 99 places in 87 ms
[2020-06-04 03:33:25] [INFO ] Deduced a trap composed of 99 places in 73 ms
[2020-06-04 03:33:25] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2270 ms
[2020-06-04 03:33:25] [INFO ] Computed and/alt/rep : 476/3157/476 causal constraints in 27 ms.
[2020-06-04 03:33:40] [INFO ] Added : 469 causal constraints over 95 iterations in 14918 ms. Result :sat
[2020-06-04 03:33:40] [INFO ] Deduced a trap composed of 13 places in 212 ms
[2020-06-04 03:33:40] [INFO ] Deduced a trap composed of 16 places in 179 ms
[2020-06-04 03:33:40] [INFO ] Deduced a trap composed of 20 places in 184 ms
[2020-06-04 03:33:41] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-06-04 03:33:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1171 ms
Attempting to minimize the solution found.
Minimization took 58 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 11104653 steps, including 1677607 resets, run timeout after 30001 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 5755300 steps, including 869097 resets, run finished after 14751 ms. (steps per millisecond=390 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 11555806 steps, including 1745190 resets, run timeout after 30001 ms. (steps per millisecond=385 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12122154 steps, including 1831556 resets, run timeout after 30001 ms. (steps per millisecond=404 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 11791394 steps, including 1781142 resets, run timeout after 30001 ms. (steps per millisecond=393 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 11022800 steps, including 1664099 resets, run timeout after 30001 ms. (steps per millisecond=367 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 11875435 steps, including 1794334 resets, run timeout after 30001 ms. (steps per millisecond=395 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 12033561 steps, including 1817676 resets, run timeout after 30001 ms. (steps per millisecond=401 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 290700 steps, including 43860 resets, run finished after 927 ms. (steps per millisecond=313 ) 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 20 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 20 ms. Remains 504 /504 variables (removed 0) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 504 cols
[2020-06-04 03:37:27] [INFO ] Computed 100 place invariants in 66 ms
[2020-06-04 03:37:28] [INFO ] Implicit Places using invariants in 1316 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 1318 ms to find 35 implicit places.
[2020-06-04 03:37:28] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 477 rows 469 cols
[2020-06-04 03:37:28] [INFO ] Computed 66 place invariants in 29 ms
[2020-06-04 03:37:29] [INFO ] Dead Transitions using invariants and state equation in 1071 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 5 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 72 ms. Remains 454 /469 variables (removed 15) and now considering 462/477 (removed 15) transitions.
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:37:29] [INFO ] Computed 66 place invariants in 51 ms
[2020-06-04 03:37:30] [INFO ] Implicit Places using invariants in 755 ms returned []
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:37:30] [INFO ] Computed 66 place invariants in 50 ms
[2020-06-04 03:37:31] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-06-04 03:37:35] [INFO ] Implicit Places using invariants and state equation in 5441 ms returned []
Implicit Place search using SMT with State Equation took 6197 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 143160 resets, run finished after 2209 ms. (steps per millisecond=452 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 90524 resets, run finished after 1466 ms. (steps per millisecond=682 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90731 resets, run finished after 1445 ms. (steps per millisecond=692 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 90700 resets, run finished after 1434 ms. (steps per millisecond=697 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90679 resets, run finished after 1439 ms. (steps per millisecond=694 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90598 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91009 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 90778 resets, run finished after 1437 ms. (steps per millisecond=695 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90808 resets, run finished after 1477 ms. (steps per millisecond=677 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 90628 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 90789 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5696572 steps, run timeout after 30001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5696572 steps, saw 2847784 distinct states, run finished after 30001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:38:22] [INFO ] Computed 66 place invariants in 36 ms
[2020-06-04 03:38:22] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 03:38:22] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 59 ms returned sat
[2020-06-04 03:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:38:23] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2020-06-04 03:38:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:38:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-04 03:38:23] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 51 ms returned sat
[2020-06-04 03:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:38:24] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2020-06-04 03:38:24] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-06-04 03:38:24] [INFO ] [Nat]Added 71 Read/Feed constraints in 125 ms returned sat
[2020-06-04 03:38:24] [INFO ] Deduced a trap composed of 4 places in 191 ms
[2020-06-04 03:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2020-06-04 03:38:24] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 33 ms.
[2020-06-04 03:38:35] [INFO ] Added : 415 causal constraints over 83 iterations in 10687 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 59 ms.
[2020-06-04 03:38:35] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 03:38:35] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 46 ms returned sat
[2020-06-04 03:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:38:36] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2020-06-04 03:38:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:38:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2020-06-04 03:38:36] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 43 ms returned sat
[2020-06-04 03:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:38:37] [INFO ] [Nat]Absence check using state equation in 919 ms returned sat
[2020-06-04 03:38:37] [INFO ] [Nat]Added 71 Read/Feed constraints in 196 ms returned sat
[2020-06-04 03:38:38] [INFO ] Deduced a trap composed of 24 places in 229 ms
[2020-06-04 03:38:38] [INFO ] Deduced a trap composed of 11 places in 144 ms
[2020-06-04 03:38:38] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-06-04 03:38:38] [INFO ] Deduced a trap composed of 27 places in 130 ms
[2020-06-04 03:38:38] [INFO ] Deduced a trap composed of 28 places in 126 ms
[2020-06-04 03:38:38] [INFO ] Deduced a trap composed of 28 places in 116 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 34 places in 101 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 44 places in 84 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 46 places in 91 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 38 places in 98 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 30 places in 85 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 39 places in 114 ms
[2020-06-04 03:38:39] [INFO ] Deduced a trap composed of 32 places in 104 ms
[2020-06-04 03:38:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2063 ms
[2020-06-04 03:38:40] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 19 ms.
[2020-06-04 03:38:52] [INFO ] Added : 413 causal constraints over 84 iterations in 12789 ms. Result :sat
[2020-06-04 03:38:52] [INFO ] Deduced a trap composed of 11 places in 189 ms
[2020-06-04 03:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-04 03:38:53] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 03:38:53] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 43 ms returned sat
[2020-06-04 03:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:38:54] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-06-04 03:38:54] [INFO ] [Real]Added 71 Read/Feed constraints in 55 ms returned sat
[2020-06-04 03:38:54] [INFO ] Deduced a trap composed of 17 places in 255 ms
[2020-06-04 03:38:54] [INFO ] Deduced a trap composed of 122 places in 232 ms
[2020-06-04 03:38:54] [INFO ] Deduced a trap composed of 119 places in 218 ms
[2020-06-04 03:38:55] [INFO ] Deduced a trap composed of 119 places in 205 ms
[2020-06-04 03:38:55] [INFO ] Deduced a trap composed of 41 places in 215 ms
[2020-06-04 03:38:55] [INFO ] Deduced a trap composed of 92 places in 158 ms
[2020-06-04 03:38:55] [INFO ] Deduced a trap composed of 138 places in 155 ms
[2020-06-04 03:38:55] [INFO ] Deduced a trap composed of 126 places in 189 ms
[2020-06-04 03:38:56] [INFO ] Deduced a trap composed of 118 places in 179 ms
[2020-06-04 03:38:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2034 ms
[2020-06-04 03:38:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:38:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2020-06-04 03:38:56] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 27 ms returned sat
[2020-06-04 03:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:38:56] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2020-06-04 03:38:57] [INFO ] [Nat]Added 71 Read/Feed constraints in 229 ms returned sat
[2020-06-04 03:38:57] [INFO ] Deduced a trap composed of 4 places in 217 ms
[2020-06-04 03:38:57] [INFO ] Deduced a trap composed of 129 places in 216 ms
[2020-06-04 03:38:57] [INFO ] Deduced a trap composed of 140 places in 179 ms
[2020-06-04 03:38:57] [INFO ] Deduced a trap composed of 144 places in 133 ms
[2020-06-04 03:38:58] [INFO ] Deduced a trap composed of 139 places in 150 ms
[2020-06-04 03:38:58] [INFO ] Deduced a trap composed of 135 places in 152 ms
[2020-06-04 03:38:58] [INFO ] Deduced a trap composed of 124 places in 130 ms
[2020-06-04 03:38:58] [INFO ] Deduced a trap composed of 125 places in 214 ms
[2020-06-04 03:38:58] [INFO ] Deduced a trap composed of 134 places in 190 ms
[2020-06-04 03:38:58] [INFO ] Deduced a trap composed of 134 places in 153 ms
[2020-06-04 03:38:59] [INFO ] Deduced a trap composed of 138 places in 127 ms
[2020-06-04 03:38:59] [INFO ] Deduced a trap composed of 134 places in 216 ms
[2020-06-04 03:38:59] [INFO ] Deduced a trap composed of 136 places in 187 ms
[2020-06-04 03:38:59] [INFO ] Deduced a trap composed of 121 places in 190 ms
[2020-06-04 03:38:59] [INFO ] Deduced a trap composed of 133 places in 130 ms
[2020-06-04 03:39:00] [INFO ] Deduced a trap composed of 131 places in 219 ms
[2020-06-04 03:39:00] [INFO ] Deduced a trap composed of 110 places in 191 ms
[2020-06-04 03:39:00] [INFO ] Deduced a trap composed of 133 places in 189 ms
[2020-06-04 03:39:00] [INFO ] Deduced a trap composed of 138 places in 131 ms
[2020-06-04 03:39:00] [INFO ] Deduced a trap composed of 134 places in 132 ms
[2020-06-04 03:39:00] [INFO ] Deduced a trap composed of 137 places in 131 ms
[2020-06-04 03:39:01] [INFO ] Deduced a trap composed of 131 places in 219 ms
[2020-06-04 03:39:01] [INFO ] Deduced a trap composed of 144 places in 195 ms
[2020-06-04 03:39:01] [INFO ] Deduced a trap composed of 136 places in 194 ms
[2020-06-04 03:39:01] [INFO ] Deduced a trap composed of 139 places in 194 ms
[2020-06-04 03:39:02] [INFO ] Deduced a trap composed of 146 places in 165 ms
[2020-06-04 03:39:02] [INFO ] Deduced a trap composed of 138 places in 125 ms
[2020-06-04 03:39:02] [INFO ] Deduced a trap composed of 143 places in 218 ms
[2020-06-04 03:39:02] [INFO ] Deduced a trap composed of 147 places in 153 ms
[2020-06-04 03:39:02] [INFO ] Deduced a trap composed of 138 places in 156 ms
[2020-06-04 03:39:02] [INFO ] Deduced a trap composed of 151 places in 156 ms
[2020-06-04 03:39:03] [INFO ] Deduced a trap composed of 134 places in 168 ms
[2020-06-04 03:39:03] [INFO ] Deduced a trap composed of 123 places in 150 ms
[2020-06-04 03:39:03] [INFO ] Deduced a trap composed of 147 places in 154 ms
[2020-06-04 03:39:03] [INFO ] Deduced a trap composed of 150 places in 152 ms
[2020-06-04 03:39:03] [INFO ] Deduced a trap composed of 138 places in 174 ms
[2020-06-04 03:39:03] [INFO ] Deduced a trap composed of 138 places in 154 ms
[2020-06-04 03:39:04] [INFO ] Deduced a trap composed of 143 places in 153 ms
[2020-06-04 03:39:04] [INFO ] Deduced a trap composed of 142 places in 151 ms
[2020-06-04 03:39:04] [INFO ] Deduced a trap composed of 136 places in 160 ms
[2020-06-04 03:39:04] [INFO ] Deduced a trap composed of 156 places in 155 ms
[2020-06-04 03:39:04] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7581 ms
[2020-06-04 03:39:04] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 24 ms.
[2020-06-04 03:39:22] [INFO ] Added : 399 causal constraints over 80 iterations in 17660 ms. Result :sat
[2020-06-04 03:39:22] [INFO ] Deduced a trap composed of 11 places in 275 ms
[2020-06-04 03:39:22] [INFO ] Deduced a trap composed of 147 places in 261 ms
[2020-06-04 03:39:23] [INFO ] Deduced a trap composed of 148 places in 172 ms
[2020-06-04 03:39:23] [INFO ] Deduced a trap composed of 143 places in 257 ms
[2020-06-04 03:39:23] [INFO ] Deduced a trap composed of 139 places in 303 ms
[2020-06-04 03:39:24] [INFO ] Deduced a trap composed of 146 places in 286 ms
[2020-06-04 03:39:24] [INFO ] Deduced a trap composed of 21 places in 266 ms
[2020-06-04 03:39:24] [INFO ] Deduced a trap composed of 150 places in 258 ms
[2020-06-04 03:39:25] [INFO ] Deduced a trap composed of 135 places in 274 ms
[2020-06-04 03:39:25] [INFO ] Deduced a trap composed of 134 places in 262 ms
[2020-06-04 03:39:25] [INFO ] Deduced a trap composed of 140 places in 256 ms
[2020-06-04 03:39:26] [INFO ] Deduced a trap composed of 152 places in 270 ms
[2020-06-04 03:39:26] [INFO ] Deduced a trap composed of 149 places in 264 ms
[2020-06-04 03:39:26] [INFO ] Deduced a trap composed of 149 places in 271 ms
[2020-06-04 03:39:27] [INFO ] Deduced a trap composed of 148 places in 271 ms
[2020-06-04 03:39:27] [INFO ] Deduced a trap composed of 141 places in 272 ms
[2020-06-04 03:39:27] [INFO ] Deduced a trap composed of 157 places in 281 ms
[2020-06-04 03:39:28] [INFO ] Deduced a trap composed of 11 places in 277 ms
[2020-06-04 03:39:28] [INFO ] Deduced a trap composed of 155 places in 271 ms
[2020-06-04 03:39:29] [INFO ] Deduced a trap composed of 142 places in 264 ms
[2020-06-04 03:39:29] [INFO ] Deduced a trap composed of 168 places in 270 ms
[2020-06-04 03:39:29] [INFO ] Deduced a trap composed of 143 places in 212 ms
[2020-06-04 03:39:29] [INFO ] Deduced a trap composed of 146 places in 241 ms
[2020-06-04 03:39:30] [INFO ] Deduced a trap composed of 156 places in 212 ms
[2020-06-04 03:39:30] [INFO ] Deduced a trap composed of 155 places in 235 ms
[2020-06-04 03:39:30] [INFO ] Deduced a trap composed of 160 places in 235 ms
[2020-06-04 03:39:31] [INFO ] Deduced a trap composed of 151 places in 230 ms
[2020-06-04 03:39:31] [INFO ] Deduced a trap composed of 142 places in 221 ms
[2020-06-04 03:39:31] [INFO ] Deduced a trap composed of 162 places in 231 ms
[2020-06-04 03:39:31] [INFO ] Deduced a trap composed of 156 places in 171 ms
[2020-06-04 03:39:32] [INFO ] Deduced a trap composed of 158 places in 258 ms
[2020-06-04 03:39:32] [INFO ] Deduced a trap composed of 152 places in 193 ms
[2020-06-04 03:39:32] [INFO ] Deduced a trap composed of 167 places in 176 ms
[2020-06-04 03:39:33] [INFO ] Deduced a trap composed of 160 places in 163 ms
[2020-06-04 03:39:33] [INFO ] Deduced a trap composed of 149 places in 140 ms
[2020-06-04 03:39:33] [INFO ] Deduced a trap composed of 147 places in 142 ms
[2020-06-04 03:39:33] [INFO ] Deduced a trap composed of 14 places in 264 ms
[2020-06-04 03:39:34] [INFO ] Deduced a trap composed of 21 places in 254 ms
[2020-06-04 03:39:34] [INFO ] Deduced a trap composed of 153 places in 270 ms
[2020-06-04 03:39:34] [INFO ] Deduced a trap composed of 137 places in 253 ms
[2020-06-04 03:39:35] [INFO ] Deduced a trap composed of 135 places in 267 ms
[2020-06-04 03:39:35] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 13228 ms
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-06-04 03:39:35] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 03:39:35] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 54 ms returned sat
[2020-06-04 03:39:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:39:36] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2020-06-04 03:39:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:39:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 03:39:36] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 29 ms returned sat
[2020-06-04 03:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:39:37] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2020-06-04 03:39:37] [INFO ] [Nat]Added 71 Read/Feed constraints in 98 ms returned sat
[2020-06-04 03:39:37] [INFO ] Deduced a trap composed of 34 places in 137 ms
[2020-06-04 03:39:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2020-06-04 03:39:37] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 39 ms.
[2020-06-04 03:39:56] [INFO ] Added : 426 causal constraints over 86 iterations in 18856 ms. Result :sat
[2020-06-04 03:39:56] [INFO ] Deduced a trap composed of 21 places in 208 ms
[2020-06-04 03:39:57] [INFO ] Deduced a trap composed of 15 places in 143 ms
[2020-06-04 03:39:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-06-04 03:39:57] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 03:39:57] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 41 ms returned sat
[2020-06-04 03:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:39:57] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-06-04 03:39:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:39:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 03:39:58] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 44 ms returned sat
[2020-06-04 03:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:39:58] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2020-06-04 03:39:58] [INFO ] [Nat]Added 71 Read/Feed constraints in 369 ms returned sat
[2020-06-04 03:39:59] [INFO ] Deduced a trap composed of 4 places in 252 ms
[2020-06-04 03:39:59] [INFO ] Deduced a trap composed of 130 places in 171 ms
[2020-06-04 03:39:59] [INFO ] Deduced a trap composed of 122 places in 184 ms
[2020-06-04 03:39:59] [INFO ] Deduced a trap composed of 145 places in 195 ms
[2020-06-04 03:40:00] [INFO ] Deduced a trap composed of 137 places in 198 ms
[2020-06-04 03:40:00] [INFO ] Deduced a trap composed of 140 places in 173 ms
[2020-06-04 03:40:00] [INFO ] Deduced a trap composed of 140 places in 134 ms
[2020-06-04 03:40:00] [INFO ] Deduced a trap composed of 144 places in 188 ms
[2020-06-04 03:40:00] [INFO ] Deduced a trap composed of 137 places in 185 ms
[2020-06-04 03:40:00] [INFO ] Deduced a trap composed of 146 places in 160 ms
[2020-06-04 03:40:01] [INFO ] Deduced a trap composed of 140 places in 159 ms
[2020-06-04 03:40:01] [INFO ] Deduced a trap composed of 134 places in 167 ms
[2020-06-04 03:40:01] [INFO ] Deduced a trap composed of 136 places in 162 ms
[2020-06-04 03:40:01] [INFO ] Deduced a trap composed of 134 places in 152 ms
[2020-06-04 03:40:01] [INFO ] Deduced a trap composed of 137 places in 163 ms
[2020-06-04 03:40:02] [INFO ] Deduced a trap composed of 139 places in 222 ms
[2020-06-04 03:40:02] [INFO ] Deduced a trap composed of 136 places in 152 ms
[2020-06-04 03:40:02] [INFO ] Deduced a trap composed of 140 places in 137 ms
[2020-06-04 03:40:02] [INFO ] Deduced a trap composed of 135 places in 141 ms
[2020-06-04 03:40:02] [INFO ] Deduced a trap composed of 137 places in 175 ms
[2020-06-04 03:40:02] [INFO ] Deduced a trap composed of 151 places in 144 ms
[2020-06-04 03:40:02] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4024 ms
[2020-06-04 03:40:03] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 18 ms.
[2020-06-04 03:40:10] [INFO ] Added : 255 causal constraints over 51 iterations in 7352 ms. Result :sat
[2020-06-04 03:40:10] [INFO ] Deduced a trap composed of 8 places in 252 ms
[2020-06-04 03:40:10] [INFO ] Deduced a trap composed of 148 places in 235 ms
[2020-06-04 03:40:11] [INFO ] Deduced a trap composed of 149 places in 221 ms
[2020-06-04 03:40:11] [INFO ] Deduced a trap composed of 138 places in 204 ms
[2020-06-04 03:40:11] [INFO ] Deduced a trap composed of 153 places in 219 ms
[2020-06-04 03:40:11] [INFO ] Deduced a trap composed of 145 places in 215 ms
[2020-06-04 03:40:12] [INFO ] Deduced a trap composed of 140 places in 164 ms
[2020-06-04 03:40:12] [INFO ] Deduced a trap composed of 15 places in 155 ms
[2020-06-04 03:40:12] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-06-04 03:40:12] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2020-06-04 03:40:12] [INFO ] Deduced a trap composed of 21 places in 198 ms
[2020-06-04 03:40:13] [INFO ] Deduced a trap composed of 24 places in 186 ms
[2020-06-04 03:40:13] [INFO ] Deduced a trap composed of 26 places in 178 ms
[2020-06-04 03:40:13] [INFO ] Deduced a trap composed of 21 places in 221 ms
[2020-06-04 03:40:13] [INFO ] Deduced a trap composed of 133 places in 194 ms
[2020-06-04 03:40:14] [INFO ] Deduced a trap composed of 14 places in 188 ms
[2020-06-04 03:40:14] [INFO ] Deduced a trap composed of 147 places in 191 ms
[2020-06-04 03:40:14] [INFO ] Deduced a trap composed of 112 places in 206 ms
[2020-06-04 03:40:16] [INFO ] Deduced a trap composed of 103 places in 249 ms
[2020-06-04 03:40:16] [INFO ] Deduced a trap composed of 106 places in 226 ms
[2020-06-04 03:40:16] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6158 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-04 03:40:16] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 03:40:16] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 45 ms returned sat
[2020-06-04 03:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:40:17] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2020-06-04 03:40:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:40:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 03:40:17] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 44 ms returned sat
[2020-06-04 03:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:40:18] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2020-06-04 03:40:18] [INFO ] [Nat]Added 71 Read/Feed constraints in 86 ms returned sat
[2020-06-04 03:40:18] [INFO ] Deduced a trap composed of 122 places in 186 ms
[2020-06-04 03:40:18] [INFO ] Deduced a trap composed of 29 places in 185 ms
[2020-06-04 03:40:18] [INFO ] Deduced a trap composed of 142 places in 185 ms
[2020-06-04 03:40:19] [INFO ] Deduced a trap composed of 143 places in 202 ms
[2020-06-04 03:40:19] [INFO ] Deduced a trap composed of 131 places in 134 ms
[2020-06-04 03:40:19] [INFO ] Deduced a trap composed of 134 places in 138 ms
[2020-06-04 03:40:19] [INFO ] Deduced a trap composed of 141 places in 137 ms
[2020-06-04 03:40:19] [INFO ] Deduced a trap composed of 139 places in 154 ms
[2020-06-04 03:40:19] [INFO ] Deduced a trap composed of 143 places in 201 ms
[2020-06-04 03:40:20] [INFO ] Deduced a trap composed of 139 places in 161 ms
[2020-06-04 03:40:20] [INFO ] Deduced a trap composed of 133 places in 155 ms
[2020-06-04 03:40:20] [INFO ] Deduced a trap composed of 144 places in 156 ms
[2020-06-04 03:40:20] [INFO ] Deduced a trap composed of 146 places in 154 ms
[2020-06-04 03:40:20] [INFO ] Deduced a trap composed of 151 places in 158 ms
[2020-06-04 03:40:21] [INFO ] Deduced a trap composed of 150 places in 148 ms
[2020-06-04 03:40:21] [INFO ] Deduced a trap composed of 137 places in 143 ms
[2020-06-04 03:40:21] [INFO ] Deduced a trap composed of 141 places in 135 ms
[2020-06-04 03:40:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3060 ms
[2020-06-04 03:40:21] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 19 ms.
[2020-06-04 03:40:34] [INFO ] Added : 395 causal constraints over 79 iterations in 13286 ms. Result :sat
[2020-06-04 03:40:34] [INFO ] Deduced a trap composed of 14 places in 173 ms
[2020-06-04 03:40:35] [INFO ] Deduced a trap composed of 4 places in 154 ms
[2020-06-04 03:40:35] [INFO ] Deduced a trap composed of 32 places in 156 ms
[2020-06-04 03:40:35] [INFO ] Deduced a trap composed of 30 places in 127 ms
[2020-06-04 03:40:35] [INFO ] Deduced a trap composed of 18 places in 125 ms
[2020-06-04 03:40:35] [INFO ] Deduced a trap composed of 35 places in 117 ms
[2020-06-04 03:40:35] [INFO ] Deduced a trap composed of 28 places in 101 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 56 places in 56 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 61 places in 60 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 69 places in 53 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 49 places in 44 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 60 places in 52 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 69 places in 45 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 76 places in 44 ms
[2020-06-04 03:40:36] [INFO ] Deduced a trap composed of 76 places in 48 ms
[2020-06-04 03:40:36] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2198 ms
Attempting to minimize the solution found.
Minimization took 44 ms.
[2020-06-04 03:40:36] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 03:40:36] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 33 ms returned sat
[2020-06-04 03:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:40:37] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-06-04 03:40:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:40:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 03:40:37] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 40 ms returned sat
[2020-06-04 03:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:40:38] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2020-06-04 03:40:38] [INFO ] [Nat]Added 71 Read/Feed constraints in 30 ms returned sat
[2020-06-04 03:40:38] [INFO ] Deduced a trap composed of 101 places in 176 ms
[2020-06-04 03:40:38] [INFO ] Deduced a trap composed of 57 places in 106 ms
[2020-06-04 03:40:38] [INFO ] Deduced a trap composed of 53 places in 98 ms
[2020-06-04 03:40:39] [INFO ] Deduced a trap composed of 29 places in 90 ms
[2020-06-04 03:40:39] [INFO ] Deduced a trap composed of 55 places in 63 ms
[2020-06-04 03:40:39] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2020-06-04 03:40:39] [INFO ] Deduced a trap composed of 65 places in 57 ms
[2020-06-04 03:40:39] [INFO ] Deduced a trap composed of 58 places in 75 ms
[2020-06-04 03:40:39] [INFO ] Deduced a trap composed of 56 places in 58 ms
[2020-06-04 03:40:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 972 ms
[2020-06-04 03:40:39] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 28 ms.
[2020-06-04 03:40:59] [INFO ] Added : 440 causal constraints over 88 iterations in 20425 ms.(timeout) Result :sat
[2020-06-04 03:41:00] [INFO ] Deduced a trap composed of 7 places in 219 ms
[2020-06-04 03:41:00] [INFO ] Deduced a trap composed of 21 places in 193 ms
[2020-06-04 03:41:00] [INFO ] Deduced a trap composed of 18 places in 215 ms
[2020-06-04 03:41:01] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-06-04 03:41:01] [INFO ] Deduced a trap composed of 14 places in 222 ms
[2020-06-04 03:41:01] [INFO ] Deduced a trap composed of 19 places in 236 ms
[2020-06-04 03:41:02] [INFO ] Deduced a trap composed of 8 places in 234 ms
[2020-06-04 03:41:02] [INFO ] Deduced a trap composed of 30 places in 245 ms
[2020-06-04 03:41:02] [INFO ] Deduced a trap composed of 18 places in 230 ms
[2020-06-04 03:41:03] [INFO ] Deduced a trap composed of 21 places in 234 ms
[2020-06-04 03:41:03] [INFO ] Deduced a trap composed of 15 places in 208 ms
[2020-06-04 03:41:04] [INFO ] Deduced a trap composed of 170 places in 220 ms
[2020-06-04 03:41:04] [INFO ] Deduced a trap composed of 172 places in 230 ms
[2020-06-04 03:41:04] [INFO ] Deduced a trap composed of 114 places in 214 ms
[2020-06-04 03:41:05] [INFO ] Deduced a trap composed of 158 places in 202 ms
[2020-06-04 03:41:05] [INFO ] Deduced a trap composed of 160 places in 194 ms
[2020-06-04 03:41:05] [INFO ] Deduced a trap composed of 158 places in 169 ms
[2020-06-04 03:41:06] [INFO ] Deduced a trap composed of 162 places in 208 ms
[2020-06-04 03:41:06] [INFO ] Deduced a trap composed of 157 places in 208 ms
[2020-06-04 03:41:06] [INFO ] Deduced a trap composed of 160 places in 218 ms
[2020-06-04 03:41:06] [INFO ] Deduced a trap composed of 159 places in 220 ms
[2020-06-04 03:41:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7108 ms
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-06-04 03:41:07] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 03:41:07] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 54 ms returned sat
[2020-06-04 03:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:41:08] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2020-06-04 03:41:08] [INFO ] [Real]Added 71 Read/Feed constraints in 14 ms returned sat
[2020-06-04 03:41:08] [INFO ] Deduced a trap composed of 12 places in 260 ms
[2020-06-04 03:41:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2020-06-04 03:41:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 03:41:08] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-06-04 03:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:41:09] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2020-06-04 03:41:09] [INFO ] [Nat]Added 71 Read/Feed constraints in 256 ms returned sat
[2020-06-04 03:41:09] [INFO ] Deduced a trap composed of 4 places in 245 ms
[2020-06-04 03:41:09] [INFO ] Deduced a trap composed of 14 places in 163 ms
[2020-06-04 03:41:10] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-06-04 03:41:10] [INFO ] Deduced a trap composed of 18 places in 172 ms
[2020-06-04 03:41:10] [INFO ] Deduced a trap composed of 15 places in 152 ms
[2020-06-04 03:41:10] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-06-04 03:41:10] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2020-06-04 03:41:10] [INFO ] Deduced a trap composed of 29 places in 137 ms
[2020-06-04 03:41:11] [INFO ] Deduced a trap composed of 89 places in 124 ms
[2020-06-04 03:41:11] [INFO ] Deduced a trap composed of 34 places in 124 ms
[2020-06-04 03:41:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1821 ms
[2020-06-04 03:41:11] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 51 ms.
[2020-06-04 03:41:19] [INFO ] Added : 347 causal constraints over 70 iterations in 8051 ms. Result :sat
[2020-06-04 03:41:19] [INFO ] Deduced a trap composed of 21 places in 239 ms
[2020-06-04 03:41:19] [INFO ] Deduced a trap composed of 141 places in 246 ms
[2020-06-04 03:41:20] [INFO ] Deduced a trap composed of 26 places in 268 ms
[2020-06-04 03:41:20] [INFO ] Deduced a trap composed of 154 places in 218 ms
[2020-06-04 03:41:20] [INFO ] Deduced a trap composed of 105 places in 178 ms
[2020-06-04 03:41:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1545 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-04 03:41:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 03:41:21] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 31 ms returned sat
[2020-06-04 03:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:41:21] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2020-06-04 03:41:21] [INFO ] [Real]Added 71 Read/Feed constraints in 10 ms returned sat
[2020-06-04 03:41:21] [INFO ] Deduced a trap composed of 11 places in 221 ms
[2020-06-04 03:41:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2020-06-04 03:41:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:41:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 03:41:21] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 33 ms returned sat
[2020-06-04 03:41:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:41:22] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2020-06-04 03:41:22] [INFO ] [Nat]Added 71 Read/Feed constraints in 189 ms returned sat
[2020-06-04 03:41:22] [INFO ] Deduced a trap composed of 4 places in 199 ms
[2020-06-04 03:41:23] [INFO ] Deduced a trap composed of 129 places in 198 ms
[2020-06-04 03:41:23] [INFO ] Deduced a trap composed of 21 places in 218 ms
[2020-06-04 03:41:23] [INFO ] Deduced a trap composed of 136 places in 184 ms
[2020-06-04 03:41:23] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-06-04 03:41:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1071 ms
[2020-06-04 03:41:23] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 20 ms.
[2020-06-04 03:41:31] [INFO ] Added : 341 causal constraints over 69 iterations in 7725 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-04 03:41:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-04 03:41:31] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 29 ms returned sat
[2020-06-04 03:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:41:32] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2020-06-04 03:41:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:41:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 03:41:32] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 52 ms returned sat
[2020-06-04 03:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:41:33] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2020-06-04 03:41:33] [INFO ] [Nat]Added 71 Read/Feed constraints in 166 ms returned sat
[2020-06-04 03:41:33] [INFO ] Deduced a trap composed of 143 places in 240 ms
[2020-06-04 03:41:33] [INFO ] Deduced a trap composed of 11 places in 202 ms
[2020-06-04 03:41:34] [INFO ] Deduced a trap composed of 21 places in 210 ms
[2020-06-04 03:41:34] [INFO ] Deduced a trap composed of 149 places in 208 ms
[2020-06-04 03:41:34] [INFO ] Deduced a trap composed of 146 places in 224 ms
[2020-06-04 03:41:34] [INFO ] Deduced a trap composed of 142 places in 167 ms
[2020-06-04 03:41:35] [INFO ] Deduced a trap composed of 145 places in 167 ms
[2020-06-04 03:41:35] [INFO ] Deduced a trap composed of 146 places in 160 ms
[2020-06-04 03:41:35] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-06-04 03:41:35] [INFO ] Deduced a trap composed of 141 places in 148 ms
[2020-06-04 03:41:35] [INFO ] Deduced a trap composed of 141 places in 150 ms
[2020-06-04 03:41:35] [INFO ] Deduced a trap composed of 144 places in 149 ms
[2020-06-04 03:41:36] [INFO ] Deduced a trap composed of 146 places in 131 ms
[2020-06-04 03:41:36] [INFO ] Deduced a trap composed of 11 places in 151 ms
[2020-06-04 03:41:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2836 ms
[2020-06-04 03:41:36] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 29 ms.
[2020-06-04 03:41:55] [INFO ] Added : 415 causal constraints over 83 iterations in 19037 ms. Result :sat
[2020-06-04 03:41:55] [INFO ] Deduced a trap composed of 21 places in 258 ms
[2020-06-04 03:41:55] [INFO ] Deduced a trap composed of 12 places in 247 ms
[2020-06-04 03:41:56] [INFO ] Deduced a trap composed of 24 places in 233 ms
[2020-06-04 03:41:56] [INFO ] Deduced a trap composed of 34 places in 251 ms
[2020-06-04 03:41:56] [INFO ] Deduced a trap composed of 21 places in 272 ms
[2020-06-04 03:41:57] [INFO ] Deduced a trap composed of 29 places in 213 ms
[2020-06-04 03:41:57] [INFO ] Deduced a trap composed of 25 places in 246 ms
[2020-06-04 03:41:57] [INFO ] Deduced a trap composed of 3 places in 258 ms
[2020-06-04 03:41:58] [INFO ] Deduced a trap composed of 151 places in 328 ms
[2020-06-04 03:41:58] [INFO ] Deduced a trap composed of 170 places in 219 ms
[2020-06-04 03:41:58] [INFO ] Deduced a trap composed of 161 places in 249 ms
[2020-06-04 03:41:59] [INFO ] Deduced a trap composed of 157 places in 267 ms
[2020-06-04 03:41:59] [INFO ] Deduced a trap composed of 170 places in 235 ms
[2020-06-04 03:41:59] [INFO ] Deduced a trap composed of 17 places in 179 ms
[2020-06-04 03:42:00] [INFO ] Deduced a trap composed of 166 places in 261 ms
[2020-06-04 03:42:00] [INFO ] Deduced a trap composed of 39 places in 207 ms
[2020-06-04 03:42:00] [INFO ] Deduced a trap composed of 173 places in 322 ms
[2020-06-04 03:42:01] [INFO ] Deduced a trap composed of 165 places in 273 ms
[2020-06-04 03:42:01] [INFO ] Deduced a trap composed of 167 places in 257 ms
[2020-06-04 03:42:01] [INFO ] Deduced a trap composed of 38 places in 255 ms
[2020-06-04 03:42:02] [INFO ] Deduced a trap composed of 35 places in 254 ms
[2020-06-04 03:42:02] [INFO ] Deduced a trap composed of 44 places in 285 ms
[2020-06-04 03:42:02] [INFO ] Deduced a trap composed of 118 places in 279 ms
[2020-06-04 03:42:03] [INFO ] Deduced a trap composed of 46 places in 249 ms
[2020-06-04 03:42:03] [INFO ] Deduced a trap composed of 161 places in 253 ms
[2020-06-04 03:42:03] [INFO ] Deduced a trap composed of 96 places in 273 ms
[2020-06-04 03:42:04] [INFO ] Deduced a trap composed of 98 places in 250 ms
[2020-06-04 03:42:04] [INFO ] Deduced a trap composed of 112 places in 249 ms
[2020-06-04 03:42:04] [INFO ] Deduced a trap composed of 111 places in 241 ms
[2020-06-04 03:42:05] [INFO ] Deduced a trap composed of 168 places in 243 ms
[2020-06-04 03:42:05] [INFO ] Deduced a trap composed of 167 places in 261 ms
[2020-06-04 03:42:05] [INFO ] Deduced a trap composed of 167 places in 244 ms
[2020-06-04 03:42:06] [INFO ] Deduced a trap composed of 180 places in 269 ms
[2020-06-04 03:42:06] [INFO ] Deduced a trap composed of 152 places in 246 ms
[2020-06-04 03:42:06] [INFO ] Deduced a trap composed of 157 places in 244 ms
[2020-06-04 03:42:07] [INFO ] Deduced a trap composed of 174 places in 242 ms
[2020-06-04 03:42:07] [INFO ] Deduced a trap composed of 162 places in 244 ms
[2020-06-04 03:42:07] [INFO ] Deduced a trap composed of 170 places in 251 ms
[2020-06-04 03:42:08] [INFO ] Deduced a trap composed of 173 places in 246 ms
[2020-06-04 03:42:08] [INFO ] Deduced a trap composed of 165 places in 244 ms
[2020-06-04 03:42:08] [INFO ] Deduced a trap composed of 142 places in 264 ms
[2020-06-04 03:42:09] [INFO ] Deduced a trap composed of 180 places in 250 ms
[2020-06-04 03:42:09] [INFO ] Deduced a trap composed of 165 places in 247 ms
[2020-06-04 03:42:09] [INFO ] Deduced a trap composed of 182 places in 245 ms
[2020-06-04 03:42:10] [INFO ] Deduced a trap composed of 97 places in 300 ms
[2020-06-04 03:42:10] [INFO ] Deduced a trap composed of 156 places in 255 ms
[2020-06-04 03:42:11] [INFO ] Deduced a trap composed of 88 places in 255 ms
[2020-06-04 03:42:11] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 15864 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
Interrupted Parikh walk after 10251814 steps, including 1708655 resets, run timeout after 30001 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 59700 steps, including 9937 resets, run finished after 167 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1831300 steps, including 305290 resets, run finished after 5176 ms. (steps per millisecond=353 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
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 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 432500 steps, including 72092 resets, run finished after 1214 ms. (steps per millisecond=356 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 10635852 steps, including 1773023 resets, run timeout after 30001 ms. (steps per millisecond=354 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 6133900 steps, including 1022786 resets, run finished after 17393 ms. (steps per millisecond=352 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 10739309 steps, including 1790935 resets, run timeout after 30001 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 427000 steps, including 71309 resets, run finished after 1166 ms. (steps per millisecond=366 ) 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 12 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 11 ms. Remains 454 /454 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:44:06] [INFO ] Computed 66 place invariants in 43 ms
[2020-06-04 03:44:07] [INFO ] Implicit Places using invariants in 817 ms returned []
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:44:07] [INFO ] Computed 66 place invariants in 43 ms
[2020-06-04 03:44:08] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-06-04 03:44:12] [INFO ] Implicit Places using invariants and state equation in 5198 ms returned []
Implicit Place search using SMT with State Equation took 6016 ms to find 0 implicit places.
[2020-06-04 03:44:12] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:44:12] [INFO ] Computed 66 place invariants in 84 ms
[2020-06-04 03:44:13] [INFO ] Dead Transitions using invariants and state equation in 948 ms returned []
Finished structural reductions, in 1 iterations. Remains : 454/454 places, 462/462 transitions.
Incomplete random walk after 100000 steps, including 14404 resets, run finished after 313 ms. (steps per millisecond=319 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 462 rows 454 cols
[2020-06-04 03:44:13] [INFO ] Computed 66 place invariants in 60 ms
[2020-06-04 03:44:13] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-04 03:44:13] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 56 ms returned sat
[2020-06-04 03:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:44:14] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2020-06-04 03:44:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:44:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2020-06-04 03:44:14] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 57 ms returned sat
[2020-06-04 03:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:44:15] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2020-06-04 03:44:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2020-06-04 03:44:15] [INFO ] [Nat]Added 71 Read/Feed constraints in 62 ms returned sat
[2020-06-04 03:44:15] [INFO ] Deduced a trap composed of 4 places in 173 ms
[2020-06-04 03:44:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2020-06-04 03:44:16] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 29 ms.
[2020-06-04 03:44:26] [INFO ] Added : 415 causal constraints over 83 iterations in 10041 ms. Result :sat
[2020-06-04 03:44:26] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 03:44:26] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 57 ms returned sat
[2020-06-04 03:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:44:27] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2020-06-04 03:44:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:44:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-04 03:44:27] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 50 ms returned sat
[2020-06-04 03:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:44:28] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2020-06-04 03:44:28] [INFO ] [Nat]Added 71 Read/Feed constraints in 155 ms returned sat
[2020-06-04 03:44:28] [INFO ] Deduced a trap composed of 24 places in 210 ms
[2020-06-04 03:44:28] [INFO ] Deduced a trap composed of 11 places in 180 ms
[2020-06-04 03:44:29] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-06-04 03:44:29] [INFO ] Deduced a trap composed of 27 places in 131 ms
[2020-06-04 03:44:29] [INFO ] Deduced a trap composed of 28 places in 127 ms
[2020-06-04 03:44:29] [INFO ] Deduced a trap composed of 28 places in 151 ms
[2020-06-04 03:44:29] [INFO ] Deduced a trap composed of 34 places in 173 ms
[2020-06-04 03:44:29] [INFO ] Deduced a trap composed of 38 places in 154 ms
[2020-06-04 03:44:30] [INFO ] Deduced a trap composed of 44 places in 139 ms
[2020-06-04 03:44:30] [INFO ] Deduced a trap composed of 46 places in 135 ms
[2020-06-04 03:44:30] [INFO ] Deduced a trap composed of 38 places in 130 ms
[2020-06-04 03:44:30] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-06-04 03:44:30] [INFO ] Deduced a trap composed of 34 places in 112 ms
[2020-06-04 03:44:30] [INFO ] Deduced a trap composed of 39 places in 165 ms
[2020-06-04 03:44:31] [INFO ] Deduced a trap composed of 32 places in 118 ms
[2020-06-04 03:44:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2573 ms
[2020-06-04 03:44:31] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 34 ms.
[2020-06-04 03:44:43] [INFO ] Added : 413 causal constraints over 84 iterations in 12859 ms. Result :sat
[2020-06-04 03:44:44] [INFO ] Deduced a trap composed of 11 places in 229 ms
[2020-06-04 03:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2020-06-04 03:44:44] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 03:44:44] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 51 ms returned sat
[2020-06-04 03:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:44:45] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2020-06-04 03:44:45] [INFO ] [Real]Added 71 Read/Feed constraints in 71 ms returned sat
[2020-06-04 03:44:45] [INFO ] Deduced a trap composed of 17 places in 274 ms
[2020-06-04 03:44:45] [INFO ] Deduced a trap composed of 122 places in 246 ms
[2020-06-04 03:44:46] [INFO ] Deduced a trap composed of 119 places in 249 ms
[2020-06-04 03:44:46] [INFO ] Deduced a trap composed of 119 places in 259 ms
[2020-06-04 03:44:46] [INFO ] Deduced a trap composed of 41 places in 203 ms
[2020-06-04 03:44:47] [INFO ] Deduced a trap composed of 92 places in 267 ms
[2020-06-04 03:44:47] [INFO ] Deduced a trap composed of 138 places in 248 ms
[2020-06-04 03:44:47] [INFO ] Deduced a trap composed of 126 places in 284 ms
[2020-06-04 03:44:47] [INFO ] Deduced a trap composed of 118 places in 245 ms
[2020-06-04 03:44:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2571 ms
[2020-06-04 03:44:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:44:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 03:44:48] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 43 ms returned sat
[2020-06-04 03:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:44:48] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-06-04 03:44:48] [INFO ] [Nat]Added 71 Read/Feed constraints in 160 ms returned sat
[2020-06-04 03:44:49] [INFO ] Deduced a trap composed of 4 places in 256 ms
[2020-06-04 03:44:49] [INFO ] Deduced a trap composed of 129 places in 215 ms
[2020-06-04 03:44:49] [INFO ] Deduced a trap composed of 140 places in 228 ms
[2020-06-04 03:44:49] [INFO ] Deduced a trap composed of 144 places in 212 ms
[2020-06-04 03:44:50] [INFO ] Deduced a trap composed of 139 places in 226 ms
[2020-06-04 03:44:50] [INFO ] Deduced a trap composed of 135 places in 209 ms
[2020-06-04 03:44:50] [INFO ] Deduced a trap composed of 124 places in 203 ms
[2020-06-04 03:44:50] [INFO ] Deduced a trap composed of 125 places in 193 ms
[2020-06-04 03:44:50] [INFO ] Deduced a trap composed of 134 places in 197 ms
[2020-06-04 03:44:51] [INFO ] Deduced a trap composed of 134 places in 176 ms
[2020-06-04 03:44:51] [INFO ] Deduced a trap composed of 138 places in 171 ms
[2020-06-04 03:44:51] [INFO ] Deduced a trap composed of 134 places in 155 ms
[2020-06-04 03:44:51] [INFO ] Deduced a trap composed of 136 places in 159 ms
[2020-06-04 03:44:51] [INFO ] Deduced a trap composed of 121 places in 160 ms
[2020-06-04 03:44:52] [INFO ] Deduced a trap composed of 133 places in 163 ms
[2020-06-04 03:44:52] [INFO ] Deduced a trap composed of 131 places in 161 ms
[2020-06-04 03:44:52] [INFO ] Deduced a trap composed of 110 places in 160 ms
[2020-06-04 03:44:52] [INFO ] Deduced a trap composed of 133 places in 156 ms
[2020-06-04 03:44:52] [INFO ] Deduced a trap composed of 138 places in 156 ms
[2020-06-04 03:44:52] [INFO ] Deduced a trap composed of 134 places in 155 ms
[2020-06-04 03:44:53] [INFO ] Deduced a trap composed of 137 places in 155 ms
[2020-06-04 03:44:53] [INFO ] Deduced a trap composed of 131 places in 158 ms
[2020-06-04 03:44:53] [INFO ] Deduced a trap composed of 144 places in 152 ms
[2020-06-04 03:44:53] [INFO ] Deduced a trap composed of 136 places in 152 ms
[2020-06-04 03:44:53] [INFO ] Deduced a trap composed of 139 places in 151 ms
[2020-06-04 03:44:53] [INFO ] Deduced a trap composed of 146 places in 157 ms
[2020-06-04 03:44:54] [INFO ] Deduced a trap composed of 138 places in 153 ms
[2020-06-04 03:44:54] [INFO ] Deduced a trap composed of 143 places in 154 ms
[2020-06-04 03:44:54] [INFO ] Deduced a trap composed of 147 places in 162 ms
[2020-06-04 03:44:54] [INFO ] Deduced a trap composed of 138 places in 154 ms
[2020-06-04 03:44:54] [INFO ] Deduced a trap composed of 151 places in 160 ms
[2020-06-04 03:44:55] [INFO ] Deduced a trap composed of 134 places in 162 ms
[2020-06-04 03:44:55] [INFO ] Deduced a trap composed of 123 places in 155 ms
[2020-06-04 03:44:55] [INFO ] Deduced a trap composed of 147 places in 151 ms
[2020-06-04 03:44:55] [INFO ] Deduced a trap composed of 150 places in 173 ms
[2020-06-04 03:44:55] [INFO ] Deduced a trap composed of 138 places in 154 ms
[2020-06-04 03:44:55] [INFO ] Deduced a trap composed of 138 places in 153 ms
[2020-06-04 03:44:56] [INFO ] Deduced a trap composed of 143 places in 153 ms
[2020-06-04 03:44:56] [INFO ] Deduced a trap composed of 142 places in 158 ms
[2020-06-04 03:44:56] [INFO ] Deduced a trap composed of 136 places in 162 ms
[2020-06-04 03:44:56] [INFO ] Deduced a trap composed of 156 places in 156 ms
[2020-06-04 03:44:56] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7844 ms
[2020-06-04 03:44:56] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 27 ms.
[2020-06-04 03:45:07] [INFO ] Added : 330 causal constraints over 66 iterations in 11277 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 03:45:08] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 03:45:08] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 33 ms returned sat
[2020-06-04 03:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:45:08] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2020-06-04 03:45:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:45:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2020-06-04 03:45:08] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 46 ms returned sat
[2020-06-04 03:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:45:09] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2020-06-04 03:45:09] [INFO ] [Nat]Added 71 Read/Feed constraints in 75 ms returned sat
[2020-06-04 03:45:09] [INFO ] Deduced a trap composed of 34 places in 167 ms
[2020-06-04 03:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2020-06-04 03:45:09] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 33 ms.
[2020-06-04 03:45:26] [INFO ] Added : 426 causal constraints over 86 iterations in 16194 ms. Result :sat
[2020-06-04 03:45:26] [INFO ] Deduced a trap composed of 21 places in 256 ms
[2020-06-04 03:45:26] [INFO ] Deduced a trap composed of 15 places in 199 ms
[2020-06-04 03:45:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2020-06-04 03:45:26] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 03:45:26] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 60 ms returned sat
[2020-06-04 03:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:45:27] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2020-06-04 03:45:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:45:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 03:45:27] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 48 ms returned sat
[2020-06-04 03:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:45:28] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2020-06-04 03:45:28] [INFO ] [Nat]Added 71 Read/Feed constraints in 370 ms returned sat
[2020-06-04 03:45:28] [INFO ] Deduced a trap composed of 4 places in 258 ms
[2020-06-04 03:45:29] [INFO ] Deduced a trap composed of 130 places in 213 ms
[2020-06-04 03:45:29] [INFO ] Deduced a trap composed of 122 places in 210 ms
[2020-06-04 03:45:29] [INFO ] Deduced a trap composed of 145 places in 189 ms
[2020-06-04 03:45:29] [INFO ] Deduced a trap composed of 137 places in 171 ms
[2020-06-04 03:45:30] [INFO ] Deduced a trap composed of 140 places in 148 ms
[2020-06-04 03:45:30] [INFO ] Deduced a trap composed of 140 places in 149 ms
[2020-06-04 03:45:30] [INFO ] Deduced a trap composed of 144 places in 152 ms
[2020-06-04 03:45:30] [INFO ] Deduced a trap composed of 137 places in 215 ms
[2020-06-04 03:45:30] [INFO ] Deduced a trap composed of 146 places in 139 ms
[2020-06-04 03:45:30] [INFO ] Deduced a trap composed of 140 places in 138 ms
[2020-06-04 03:45:31] [INFO ] Deduced a trap composed of 134 places in 151 ms
[2020-06-04 03:45:31] [INFO ] Deduced a trap composed of 136 places in 147 ms
[2020-06-04 03:45:31] [INFO ] Deduced a trap composed of 134 places in 212 ms
[2020-06-04 03:45:31] [INFO ] Deduced a trap composed of 137 places in 179 ms
[2020-06-04 03:45:31] [INFO ] Deduced a trap composed of 139 places in 136 ms
[2020-06-04 03:45:31] [INFO ] Deduced a trap composed of 136 places in 143 ms
[2020-06-04 03:45:32] [INFO ] Deduced a trap composed of 140 places in 165 ms
[2020-06-04 03:45:32] [INFO ] Deduced a trap composed of 135 places in 162 ms
[2020-06-04 03:45:32] [INFO ] Deduced a trap composed of 137 places in 133 ms
[2020-06-04 03:45:32] [INFO ] Deduced a trap composed of 151 places in 133 ms
[2020-06-04 03:45:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3956 ms
[2020-06-04 03:45:32] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 23 ms.
[2020-06-04 03:45:40] [INFO ] Added : 255 causal constraints over 51 iterations in 7754 ms. Result :sat
[2020-06-04 03:45:40] [INFO ] Deduced a trap composed of 10 places in 250 ms
[2020-06-04 03:45:40] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-06-04 03:45:41] [INFO ] Deduced a trap composed of 149 places in 206 ms
[2020-06-04 03:45:41] [INFO ] Deduced a trap composed of 23 places in 203 ms
[2020-06-04 03:45:41] [INFO ] Deduced a trap composed of 24 places in 182 ms
[2020-06-04 03:45:42] [INFO ] Deduced a trap composed of 28 places in 229 ms
[2020-06-04 03:45:42] [INFO ] Deduced a trap composed of 145 places in 239 ms
[2020-06-04 03:45:42] [INFO ] Deduced a trap composed of 29 places in 142 ms
[2020-06-04 03:45:42] [INFO ] Deduced a trap composed of 139 places in 170 ms
[2020-06-04 03:45:42] [INFO ] Deduced a trap composed of 145 places in 138 ms
[2020-06-04 03:45:43] [INFO ] Deduced a trap composed of 26 places in 150 ms
[2020-06-04 03:45:43] [INFO ] Deduced a trap composed of 146 places in 140 ms
[2020-06-04 03:45:43] [INFO ] Deduced a trap composed of 21 places in 130 ms
[2020-06-04 03:45:43] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2020-06-04 03:45:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3367 ms
[2020-06-04 03:45:43] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 03:45:43] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 39 ms returned sat
[2020-06-04 03:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:45:44] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2020-06-04 03:45:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-04 03:45:44] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 54 ms returned sat
[2020-06-04 03:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:45:45] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2020-06-04 03:45:45] [INFO ] [Nat]Added 71 Read/Feed constraints in 88 ms returned sat
[2020-06-04 03:45:45] [INFO ] Deduced a trap composed of 122 places in 273 ms
[2020-06-04 03:45:46] [INFO ] Deduced a trap composed of 29 places in 234 ms
[2020-06-04 03:45:46] [INFO ] Deduced a trap composed of 142 places in 204 ms
[2020-06-04 03:45:46] [INFO ] Deduced a trap composed of 143 places in 194 ms
[2020-06-04 03:45:46] [INFO ] Deduced a trap composed of 131 places in 251 ms
[2020-06-04 03:45:47] [INFO ] Deduced a trap composed of 134 places in 208 ms
[2020-06-04 03:45:47] [INFO ] Deduced a trap composed of 141 places in 207 ms
[2020-06-04 03:45:47] [INFO ] Deduced a trap composed of 139 places in 192 ms
[2020-06-04 03:45:47] [INFO ] Deduced a trap composed of 143 places in 175 ms
[2020-06-04 03:45:47] [INFO ] Deduced a trap composed of 139 places in 161 ms
[2020-06-04 03:45:48] [INFO ] Deduced a trap composed of 133 places in 158 ms
[2020-06-04 03:45:48] [INFO ] Deduced a trap composed of 144 places in 222 ms
[2020-06-04 03:45:48] [INFO ] Deduced a trap composed of 146 places in 166 ms
[2020-06-04 03:45:48] [INFO ] Deduced a trap composed of 151 places in 163 ms
[2020-06-04 03:45:48] [INFO ] Deduced a trap composed of 150 places in 168 ms
[2020-06-04 03:45:49] [INFO ] Deduced a trap composed of 137 places in 168 ms
[2020-06-04 03:45:49] [INFO ] Deduced a trap composed of 141 places in 157 ms
[2020-06-04 03:45:49] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3768 ms
[2020-06-04 03:45:49] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 26 ms.
[2020-06-04 03:46:01] [INFO ] Added : 395 causal constraints over 79 iterations in 12263 ms. Result :sat
[2020-06-04 03:46:01] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2020-06-04 03:46:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2020-06-04 03:46:01] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 03:46:01] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 42 ms returned sat
[2020-06-04 03:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:02] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2020-06-04 03:46:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:46:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 03:46:02] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 31 ms returned sat
[2020-06-04 03:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:03] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2020-06-04 03:46:03] [INFO ] [Nat]Added 71 Read/Feed constraints in 26 ms returned sat
[2020-06-04 03:46:03] [INFO ] Deduced a trap composed of 101 places in 255 ms
[2020-06-04 03:46:03] [INFO ] Deduced a trap composed of 57 places in 111 ms
[2020-06-04 03:46:03] [INFO ] Deduced a trap composed of 53 places in 108 ms
[2020-06-04 03:46:04] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-04 03:46:04] [INFO ] Deduced a trap composed of 55 places in 61 ms
[2020-06-04 03:46:04] [INFO ] Deduced a trap composed of 62 places in 98 ms
[2020-06-04 03:46:04] [INFO ] Deduced a trap composed of 65 places in 64 ms
[2020-06-04 03:46:04] [INFO ] Deduced a trap composed of 58 places in 63 ms
[2020-06-04 03:46:04] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2020-06-04 03:46:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1090 ms
[2020-06-04 03:46:04] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 28 ms.
[2020-06-04 03:46:22] [INFO ] Added : 440 causal constraints over 88 iterations in 18246 ms. Result :unknown
[2020-06-04 03:46:22] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-04 03:46:22] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 36 ms returned sat
[2020-06-04 03:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:23] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2020-06-04 03:46:23] [INFO ] [Real]Added 71 Read/Feed constraints in 11 ms returned sat
[2020-06-04 03:46:23] [INFO ] Deduced a trap composed of 12 places in 272 ms
[2020-06-04 03:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2020-06-04 03:46:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:46:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 03:46:23] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 51 ms returned sat
[2020-06-04 03:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:24] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2020-06-04 03:46:24] [INFO ] [Nat]Added 71 Read/Feed constraints in 235 ms returned sat
[2020-06-04 03:46:24] [INFO ] Deduced a trap composed of 4 places in 201 ms
[2020-06-04 03:46:25] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-06-04 03:46:25] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2020-06-04 03:46:25] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2020-06-04 03:46:25] [INFO ] Deduced a trap composed of 15 places in 161 ms
[2020-06-04 03:46:25] [INFO ] Deduced a trap composed of 24 places in 134 ms
[2020-06-04 03:46:25] [INFO ] Deduced a trap composed of 28 places in 123 ms
[2020-06-04 03:46:26] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2020-06-04 03:46:26] [INFO ] Deduced a trap composed of 89 places in 107 ms
[2020-06-04 03:46:26] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2020-06-04 03:46:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1638 ms
[2020-06-04 03:46:26] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 27 ms.
[2020-06-04 03:46:33] [INFO ] Added : 347 causal constraints over 70 iterations in 6767 ms. Result :sat
[2020-06-04 03:46:33] [INFO ] Deduced a trap composed of 21 places in 318 ms
[2020-06-04 03:46:33] [INFO ] Deduced a trap composed of 141 places in 290 ms
[2020-06-04 03:46:34] [INFO ] Deduced a trap composed of 26 places in 289 ms
[2020-06-04 03:46:34] [INFO ] Deduced a trap composed of 154 places in 274 ms
[2020-06-04 03:46:34] [INFO ] Deduced a trap composed of 105 places in 301 ms
[2020-06-04 03:46:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1840 ms
[2020-06-04 03:46:34] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 03:46:35] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 47 ms returned sat
[2020-06-04 03:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:35] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2020-06-04 03:46:35] [INFO ] [Real]Added 71 Read/Feed constraints in 13 ms returned sat
[2020-06-04 03:46:36] [INFO ] Deduced a trap composed of 11 places in 347 ms
[2020-06-04 03:46:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2020-06-04 03:46:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:46:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-04 03:46:36] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 49 ms returned sat
[2020-06-04 03:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:37] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2020-06-04 03:46:37] [INFO ] [Nat]Added 71 Read/Feed constraints in 256 ms returned sat
[2020-06-04 03:46:37] [INFO ] Deduced a trap composed of 4 places in 248 ms
[2020-06-04 03:46:37] [INFO ] Deduced a trap composed of 129 places in 210 ms
[2020-06-04 03:46:38] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2020-06-04 03:46:38] [INFO ] Deduced a trap composed of 136 places in 154 ms
[2020-06-04 03:46:38] [INFO ] Deduced a trap composed of 21 places in 225 ms
[2020-06-04 03:46:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1171 ms
[2020-06-04 03:46:38] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 20 ms.
[2020-06-04 03:46:46] [INFO ] Added : 341 causal constraints over 69 iterations in 8414 ms. Result :sat
[2020-06-04 03:46:47] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-04 03:46:47] [INFO ] [Real]Absence check using 3 positive and 63 generalized place invariants in 39 ms returned sat
[2020-06-04 03:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:47] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2020-06-04 03:46:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:46:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-04 03:46:47] [INFO ] [Nat]Absence check using 3 positive and 63 generalized place invariants in 30 ms returned sat
[2020-06-04 03:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:46:48] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2020-06-04 03:46:48] [INFO ] [Nat]Added 71 Read/Feed constraints in 163 ms returned sat
[2020-06-04 03:46:48] [INFO ] Deduced a trap composed of 143 places in 217 ms
[2020-06-04 03:46:48] [INFO ] Deduced a trap composed of 11 places in 174 ms
[2020-06-04 03:46:49] [INFO ] Deduced a trap composed of 21 places in 195 ms
[2020-06-04 03:46:49] [INFO ] Deduced a trap composed of 149 places in 203 ms
[2020-06-04 03:46:49] [INFO ] Deduced a trap composed of 146 places in 175 ms
[2020-06-04 03:46:49] [INFO ] Deduced a trap composed of 142 places in 206 ms
[2020-06-04 03:46:50] [INFO ] Deduced a trap composed of 145 places in 210 ms
[2020-06-04 03:46:50] [INFO ] Deduced a trap composed of 146 places in 245 ms
[2020-06-04 03:46:50] [INFO ] Deduced a trap composed of 11 places in 193 ms
[2020-06-04 03:46:50] [INFO ] Deduced a trap composed of 141 places in 186 ms
[2020-06-04 03:46:50] [INFO ] Deduced a trap composed of 141 places in 209 ms
[2020-06-04 03:46:51] [INFO ] Deduced a trap composed of 144 places in 201 ms
[2020-06-04 03:46:51] [INFO ] Deduced a trap composed of 146 places in 182 ms
[2020-06-04 03:46:51] [INFO ] Deduced a trap composed of 11 places in 238 ms
[2020-06-04 03:46:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3184 ms
[2020-06-04 03:46:51] [INFO ] Computed and/alt/rep : 461/2951/461 causal constraints in 31 ms.
[2020-06-04 03:47:07] [INFO ] Added : 415 causal constraints over 83 iterations in 16029 ms. Result :(error "Failed to check-sat")
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 3 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 3 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 2 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 119 ms. Remains 406 /454 variables (removed 48) and now considering 414/462 (removed 48) transitions.
// Phase 1: matrix 414 rows 406 cols
[2020-06-04 03:47:07] [INFO ] Computed 66 place invariants in 38 ms
[2020-06-04 03:47:07] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2020-06-04 03:47:07] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 54 ms returned sat
[2020-06-04 03:47:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:08] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2020-06-04 03:47:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:47:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2020-06-04 03:47:08] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 47 ms returned sat
[2020-06-04 03:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:09] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2020-06-04 03:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 03:47:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 44 ms returned sat
[2020-06-04 03:47:09] [INFO ] Deduced a trap composed of 5 places in 144 ms
[2020-06-04 03:47:09] [INFO ] Deduced a trap composed of 20 places in 83 ms
[2020-06-04 03:47:09] [INFO ] Deduced a trap composed of 25 places in 113 ms
[2020-06-04 03:47:09] [INFO ] Deduced a trap composed of 15 places in 112 ms
[2020-06-04 03:47:10] [INFO ] Deduced a trap composed of 11 places in 106 ms
[2020-06-04 03:47:10] [INFO ] Deduced a trap composed of 71 places in 51 ms
[2020-06-04 03:47:10] [INFO ] Deduced a trap composed of 69 places in 50 ms
[2020-06-04 03:47:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2020-06-04 03:47:10] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 29 ms.
[2020-06-04 03:47:13] [INFO ] Added : 205 causal constraints over 42 iterations in 2839 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-04 03:47:13] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-06-04 03:47:13] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 33 ms returned sat
[2020-06-04 03:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:13] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-06-04 03:47:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:47:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-06-04 03:47:14] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 35 ms returned sat
[2020-06-04 03:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:14] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2020-06-04 03:47:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 68 ms returned sat
[2020-06-04 03:47:14] [INFO ] Deduced a trap composed of 11 places in 196 ms
[2020-06-04 03:47:15] [INFO ] Deduced a trap composed of 15 places in 163 ms
[2020-06-04 03:47:15] [INFO ] Deduced a trap composed of 100 places in 113 ms
[2020-06-04 03:47:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2020-06-04 03:47:15] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 26 ms.
[2020-06-04 03:47:24] [INFO ] Added : 381 causal constraints over 77 iterations in 9179 ms. Result :sat
[2020-06-04 03:47:24] [INFO ] Deduced a trap composed of 17 places in 203 ms
[2020-06-04 03:47:24] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2020-06-04 03:47:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 541 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-06-04 03:47:25] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-06-04 03:47:25] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 39 ms returned sat
[2020-06-04 03:47:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:25] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2020-06-04 03:47:25] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-04 03:47:26] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-06-04 03:47:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2020-06-04 03:47:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:47:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2020-06-04 03:47:26] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 37 ms returned sat
[2020-06-04 03:47:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:26] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2020-06-04 03:47:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 105 ms returned sat
[2020-06-04 03:47:27] [INFO ] Deduced a trap composed of 10 places in 221 ms
[2020-06-04 03:47:27] [INFO ] Deduced a trap composed of 152 places in 197 ms
[2020-06-04 03:47:27] [INFO ] Deduced a trap composed of 35 places in 117 ms
[2020-06-04 03:47:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 606 ms
[2020-06-04 03:47:27] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 26 ms.
[2020-06-04 03:47:35] [INFO ] Added : 360 causal constraints over 72 iterations in 7951 ms. Result :sat
[2020-06-04 03:47:35] [INFO ] Deduced a trap composed of 17 places in 239 ms
[2020-06-04 03:47:36] [INFO ] Deduced a trap composed of 25 places in 218 ms
[2020-06-04 03:47:36] [INFO ] Deduced a trap composed of 22 places in 216 ms
[2020-06-04 03:47:36] [INFO ] Deduced a trap composed of 10 places in 205 ms
[2020-06-04 03:47:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1264 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-04 03:47:36] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-04 03:47:36] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 33 ms returned sat
[2020-06-04 03:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:37] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2020-06-04 03:47:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:47:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 22 ms returned sat
[2020-06-04 03:47:37] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 40 ms returned sat
[2020-06-04 03:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:38] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2020-06-04 03:47:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2020-06-04 03:47:38] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 41 ms.
[2020-06-04 03:47:50] [INFO ] Added : 389 causal constraints over 78 iterations in 11541 ms. Result :sat
[2020-06-04 03:47:50] [INFO ] Deduced a trap composed of 11 places in 192 ms
[2020-06-04 03:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-04 03:47:50] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-04 03:47:50] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 37 ms returned sat
[2020-06-04 03:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:51] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-06-04 03:47:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:47:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 21 ms returned sat
[2020-06-04 03:47:51] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 38 ms returned sat
[2020-06-04 03:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:47:51] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2020-06-04 03:47:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 220 ms returned sat
[2020-06-04 03:47:52] [INFO ] Deduced a trap composed of 22 places in 198 ms
[2020-06-04 03:47:52] [INFO ] Deduced a trap composed of 20 places in 182 ms
[2020-06-04 03:47:52] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2020-06-04 03:47:52] [INFO ] Deduced a trap composed of 147 places in 169 ms
[2020-06-04 03:47:53] [INFO ] Deduced a trap composed of 106 places in 174 ms
[2020-06-04 03:47:53] [INFO ] Deduced a trap composed of 56 places in 169 ms
[2020-06-04 03:47:53] [INFO ] Deduced a trap composed of 49 places in 162 ms
[2020-06-04 03:47:53] [INFO ] Deduced a trap composed of 45 places in 186 ms
[2020-06-04 03:47:53] [INFO ] Deduced a trap composed of 161 places in 169 ms
[2020-06-04 03:47:54] [INFO ] Deduced a trap composed of 106 places in 183 ms
[2020-06-04 03:47:54] [INFO ] Deduced a trap composed of 110 places in 161 ms
[2020-06-04 03:47:54] [INFO ] Deduced a trap composed of 153 places in 184 ms
[2020-06-04 03:47:54] [INFO ] Deduced a trap composed of 150 places in 158 ms
[2020-06-04 03:47:54] [INFO ] Deduced a trap composed of 146 places in 162 ms
[2020-06-04 03:47:55] [INFO ] Deduced a trap composed of 148 places in 158 ms
[2020-06-04 03:47:55] [INFO ] Deduced a trap composed of 155 places in 165 ms
[2020-06-04 03:47:55] [INFO ] Deduced a trap composed of 156 places in 155 ms
[2020-06-04 03:47:55] [INFO ] Deduced a trap composed of 153 places in 155 ms
[2020-06-04 03:47:55] [INFO ] Deduced a trap composed of 157 places in 157 ms
[2020-06-04 03:47:56] [INFO ] Deduced a trap composed of 150 places in 175 ms
[2020-06-04 03:47:56] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3862 ms
[2020-06-04 03:47:56] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 23 ms.
[2020-06-04 03:48:06] [INFO ] Added : 368 causal constraints over 74 iterations in 10865 ms. Result :sat
[2020-06-04 03:48:07] [INFO ] Deduced a trap composed of 7 places in 174 ms
[2020-06-04 03:48:07] [INFO ] Deduced a trap composed of 10 places in 173 ms
[2020-06-04 03:48:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 518 ms
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-06-04 03:48:07] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-04 03:48:07] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 48 ms returned sat
[2020-06-04 03:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:48:08] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2020-06-04 03:48:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:48:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-06-04 03:48:08] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 121 ms returned sat
[2020-06-04 03:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:48:09] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2020-06-04 03:48:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 42 ms returned sat
[2020-06-04 03:48:09] [INFO ] Deduced a trap composed of 160 places in 207 ms
[2020-06-04 03:48:09] [INFO ] Deduced a trap composed of 5 places in 170 ms
[2020-06-04 03:48:10] [INFO ] Deduced a trap composed of 22 places in 353 ms
[2020-06-04 03:48:10] [INFO ] Deduced a trap composed of 156 places in 186 ms
[2020-06-04 03:48:10] [INFO ] Deduced a trap composed of 157 places in 195 ms
[2020-06-04 03:48:10] [INFO ] Deduced a trap composed of 31 places in 194 ms
[2020-06-04 03:48:11] [INFO ] Deduced a trap composed of 157 places in 195 ms
[2020-06-04 03:48:11] [INFO ] Deduced a trap composed of 157 places in 175 ms
[2020-06-04 03:48:11] [INFO ] Deduced a trap composed of 152 places in 167 ms
[2020-06-04 03:48:11] [INFO ] Deduced a trap composed of 158 places in 164 ms
[2020-06-04 03:48:11] [INFO ] Deduced a trap composed of 155 places in 137 ms
[2020-06-04 03:48:11] [INFO ] Deduced a trap composed of 158 places in 136 ms
[2020-06-04 03:48:12] [INFO ] Deduced a trap composed of 152 places in 166 ms
[2020-06-04 03:48:12] [INFO ] Deduced a trap composed of 151 places in 128 ms
[2020-06-04 03:48:12] [INFO ] Deduced a trap composed of 151 places in 160 ms
[2020-06-04 03:48:12] [INFO ] Deduced a trap composed of 11 places in 128 ms
[2020-06-04 03:48:12] [INFO ] Deduced a trap composed of 154 places in 146 ms
[2020-06-04 03:48:12] [INFO ] Deduced a trap composed of 15 places in 137 ms
[2020-06-04 03:48:13] [INFO ] Deduced a trap composed of 154 places in 115 ms
[2020-06-04 03:48:13] [INFO ] Deduced a trap composed of 164 places in 116 ms
[2020-06-04 03:48:13] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3740 ms
[2020-06-04 03:48:13] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 17 ms.
[2020-06-04 03:48:31] [INFO ] Added : 402 causal constraints over 81 iterations in 18066 ms. Result :sat
[2020-06-04 03:48:31] [INFO ] Deduced a trap composed of 9 places in 190 ms
[2020-06-04 03:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-06-04 03:48:31] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-06-04 03:48:31] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 39 ms returned sat
[2020-06-04 03:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:48:32] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2020-06-04 03:48:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:48:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 21 ms returned sat
[2020-06-04 03:48:32] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 38 ms returned sat
[2020-06-04 03:48:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:48:33] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2020-06-04 03:48:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 22 places in 106 ms
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 69 places in 50 ms
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 71 places in 65 ms
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 66 places in 48 ms
[2020-06-04 03:48:33] [INFO ] Deduced a trap composed of 56 places in 46 ms
[2020-06-04 03:48:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 665 ms
[2020-06-04 03:48:33] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 18 ms.
[2020-06-04 03:48:49] [INFO ] Added : 408 causal constraints over 82 iterations in 15168 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-04 03:48:49] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2020-06-04 03:48:49] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 50 ms returned sat
[2020-06-04 03:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:48:49] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2020-06-04 03:48:49] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 03:48:50] [INFO ] Deduced a trap composed of 11 places in 211 ms
[2020-06-04 03:48:50] [INFO ] Deduced a trap composed of 15 places in 159 ms
[2020-06-04 03:48:50] [INFO ] Deduced a trap composed of 5 places in 209 ms
[2020-06-04 03:48:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 647 ms
[2020-06-04 03:48:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:48:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2020-06-04 03:48:50] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 32 ms returned sat
[2020-06-04 03:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:48:51] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2020-06-04 03:48:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 144 ms returned sat
[2020-06-04 03:48:51] [INFO ] Deduced a trap composed of 15 places in 145 ms
[2020-06-04 03:48:51] [INFO ] Deduced a trap composed of 7 places in 121 ms
[2020-06-04 03:48:51] [INFO ] Deduced a trap composed of 31 places in 130 ms
[2020-06-04 03:48:51] [INFO ] Deduced a trap composed of 179 places in 118 ms
[2020-06-04 03:48:52] [INFO ] Deduced a trap composed of 179 places in 124 ms
[2020-06-04 03:48:52] [INFO ] Deduced a trap composed of 29 places in 140 ms
[2020-06-04 03:48:52] [INFO ] Deduced a trap composed of 181 places in 170 ms
[2020-06-04 03:48:52] [INFO ] Deduced a trap composed of 180 places in 144 ms
[2020-06-04 03:48:52] [INFO ] Deduced a trap composed of 168 places in 146 ms
[2020-06-04 03:48:52] [INFO ] Deduced a trap composed of 17 places in 142 ms
[2020-06-04 03:48:53] [INFO ] Deduced a trap composed of 69 places in 162 ms
[2020-06-04 03:48:53] [INFO ] Deduced a trap composed of 189 places in 184 ms
[2020-06-04 03:48:53] [INFO ] Deduced a trap composed of 189 places in 154 ms
[2020-06-04 03:48:53] [INFO ] Deduced a trap composed of 185 places in 142 ms
[2020-06-04 03:48:53] [INFO ] Deduced a trap composed of 165 places in 118 ms
[2020-06-04 03:48:53] [INFO ] Deduced a trap composed of 167 places in 113 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 167 places in 168 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 168 places in 104 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 169 places in 172 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 168 places in 105 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 169 places in 177 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 171 places in 158 ms
[2020-06-04 03:48:54] [INFO ] Deduced a trap composed of 170 places in 151 ms
[2020-06-04 03:48:55] [INFO ] Deduced a trap composed of 173 places in 169 ms
[2020-06-04 03:48:55] [INFO ] Deduced a trap composed of 171 places in 157 ms
[2020-06-04 03:48:55] [INFO ] Deduced a trap composed of 177 places in 156 ms
[2020-06-04 03:48:55] [INFO ] Deduced a trap composed of 170 places in 167 ms
[2020-06-04 03:48:55] [INFO ] Deduced a trap composed of 173 places in 144 ms
[2020-06-04 03:48:55] [INFO ] Deduced a trap composed of 175 places in 105 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 176 places in 106 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 177 places in 111 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 174 places in 107 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 170 places in 108 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 178 places in 109 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 175 places in 106 ms
[2020-06-04 03:48:56] [INFO ] Deduced a trap composed of 167 places in 173 ms
[2020-06-04 03:48:57] [INFO ] Deduced a trap composed of 177 places in 150 ms
[2020-06-04 03:48:57] [INFO ] Deduced a trap composed of 177 places in 151 ms
[2020-06-04 03:48:57] [INFO ] Deduced a trap composed of 171 places in 142 ms
[2020-06-04 03:48:57] [INFO ] Deduced a trap composed of 169 places in 160 ms
[2020-06-04 03:48:57] [INFO ] Deduced a trap composed of 175 places in 155 ms
[2020-06-04 03:48:57] [INFO ] Deduced a trap composed of 175 places in 99 ms
[2020-06-04 03:48:58] [INFO ] Deduced a trap composed of 175 places in 142 ms
[2020-06-04 03:48:58] [INFO ] Deduced a trap composed of 170 places in 110 ms
[2020-06-04 03:48:58] [INFO ] Deduced a trap composed of 174 places in 170 ms
[2020-06-04 03:48:58] [INFO ] Deduced a trap composed of 174 places in 175 ms
[2020-06-04 03:48:58] [INFO ] Deduced a trap composed of 174 places in 142 ms
[2020-06-04 03:48:58] [INFO ] Deduced a trap composed of 174 places in 142 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 175 places in 146 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 175 places in 102 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 175 places in 172 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 175 places in 152 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 168 places in 121 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 170 places in 124 ms
[2020-06-04 03:48:59] [INFO ] Deduced a trap composed of 170 places in 110 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 169 places in 110 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 179 places in 120 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 172 places in 173 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 160 places in 145 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 160 places in 115 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 162 places in 104 ms
[2020-06-04 03:49:00] [INFO ] Deduced a trap composed of 162 places in 163 ms
[2020-06-04 03:49:01] [INFO ] Deduced a trap composed of 173 places in 110 ms
[2020-06-04 03:49:01] [INFO ] Deduced a trap composed of 173 places in 105 ms
[2020-06-04 03:49:01] [INFO ] Deduced a trap composed of 64 places in 175 ms
[2020-06-04 03:49:01] [INFO ] Deduced a trap composed of 172 places in 150 ms
[2020-06-04 03:49:01] [INFO ] Deduced a trap composed of 174 places in 145 ms
[2020-06-04 03:49:01] [INFO ] Deduced a trap composed of 174 places in 160 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 172 places in 101 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 170 places in 100 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 173 places in 173 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 171 places in 146 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 174 places in 140 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 175 places in 143 ms
[2020-06-04 03:49:02] [INFO ] Deduced a trap composed of 175 places in 144 ms
[2020-06-04 03:49:03] [INFO ] Deduced a trap composed of 174 places in 143 ms
[2020-06-04 03:49:03] [INFO ] Deduced a trap composed of 173 places in 139 ms
[2020-06-04 03:49:03] [INFO ] Deduced a trap composed of 175 places in 173 ms
[2020-06-04 03:49:03] [INFO ] Deduced a trap composed of 178 places in 100 ms
[2020-06-04 03:49:03] [INFO ] Deduced a trap composed of 175 places in 174 ms
[2020-06-04 03:49:03] [INFO ] Deduced a trap composed of 181 places in 146 ms
[2020-06-04 03:49:04] [INFO ] Deduced a trap composed of 49 places in 186 ms
[2020-06-04 03:49:04] [INFO ] Deduced a trap composed of 174 places in 157 ms
[2020-06-04 03:49:04] [INFO ] Deduced a trap composed of 57 places in 146 ms
[2020-06-04 03:49:04] [INFO ] Deduced a trap composed of 78 places in 145 ms
[2020-06-04 03:49:04] [INFO ] Deduced a trap composed of 151 places in 144 ms
[2020-06-04 03:49:05] [INFO ] Deduced a trap composed of 20 places in 149 ms
[2020-06-04 03:49:05] [INFO ] Deduced a trap composed of 161 places in 101 ms
[2020-06-04 03:49:05] [INFO ] Deduced a trap composed of 179 places in 182 ms
[2020-06-04 03:49:05] [INFO ] Deduced a trap composed of 183 places in 144 ms
[2020-06-04 03:49:05] [INFO ] Deduced a trap composed of 56 places in 140 ms
[2020-06-04 03:49:05] [INFO ] Deduced a trap composed of 178 places in 97 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 172 places in 179 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 170 places in 111 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 177 places in 123 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 61 places in 164 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 176 places in 145 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 180 places in 107 ms
[2020-06-04 03:49:06] [INFO ] Deduced a trap composed of 180 places in 167 ms
[2020-06-04 03:49:06] [INFO ] Trap strengthening (SAT) tested/added 100/99 trap constraints in 15630 ms
[2020-06-04 03:49:06] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 17 ms.
[2020-06-04 03:49:26] [INFO ] Added : 370 causal constraints over 74 iterations in 19180 ms. Result :sat
[2020-06-04 03:49:26] [INFO ] Deduced a trap composed of 25 places in 159 ms
[2020-06-04 03:49:26] [INFO ] Deduced a trap composed of 162 places in 223 ms
[2020-06-04 03:49:26] [INFO ] Deduced a trap composed of 161 places in 206 ms
[2020-06-04 03:49:27] [INFO ] Deduced a trap composed of 93 places in 180 ms
[2020-06-04 03:49:27] [INFO ] Deduced a trap composed of 41 places in 201 ms
[2020-06-04 03:49:27] [INFO ] Deduced a trap composed of 111 places in 221 ms
[2020-06-04 03:49:27] [INFO ] Deduced a trap composed of 115 places in 235 ms
[2020-06-04 03:49:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2174 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-06-04 03:49:28] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-06-04 03:49:28] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 39 ms returned sat
[2020-06-04 03:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:49:29] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2020-06-04 03:49:29] [INFO ] [Real]Added 1 Read/Feed constraints in 18 ms returned sat
[2020-06-04 03:49:29] [INFO ] Deduced a trap composed of 22 places in 235 ms
[2020-06-04 03:49:29] [INFO ] Deduced a trap composed of 17 places in 195 ms
[2020-06-04 03:49:29] [INFO ] Deduced a trap composed of 5 places in 175 ms
[2020-06-04 03:49:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 666 ms
[2020-06-04 03:49:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:49:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-04 03:49:29] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 32 ms returned sat
[2020-06-04 03:49:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:49:30] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2020-06-04 03:49:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 251 ms returned sat
[2020-06-04 03:49:30] [INFO ] Deduced a trap composed of 14 places in 210 ms
[2020-06-04 03:49:31] [INFO ] Deduced a trap composed of 5 places in 143 ms
[2020-06-04 03:49:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2020-06-04 03:49:31] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 29 ms.
[2020-06-04 03:49:36] [INFO ] Added : 260 causal constraints over 53 iterations in 5208 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-04 03:49:36] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-04 03:49:36] [INFO ] [Real]Absence check using 6 positive and 60 generalized place invariants in 31 ms returned sat
[2020-06-04 03:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:49:37] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2020-06-04 03:49:37] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-04 03:49:37] [INFO ] Deduced a trap composed of 5 places in 251 ms
[2020-06-04 03:49:37] [INFO ] Deduced a trap composed of 137 places in 175 ms
[2020-06-04 03:49:37] [INFO ] Deduced a trap composed of 136 places in 200 ms
[2020-06-04 03:49:37] [INFO ] Deduced a trap composed of 155 places in 153 ms
[2020-06-04 03:49:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 861 ms
[2020-06-04 03:49:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:49:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-04 03:49:37] [INFO ] [Nat]Absence check using 6 positive and 60 generalized place invariants in 23 ms returned sat
[2020-06-04 03:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:49:38] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2020-06-04 03:49:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 111 ms returned sat
[2020-06-04 03:49:38] [INFO ] Deduced a trap composed of 10 places in 172 ms
[2020-06-04 03:49:38] [INFO ] Deduced a trap composed of 154 places in 153 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 154 places in 152 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 158 places in 150 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 159 places in 133 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 5 places in 116 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 139 places in 151 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 138 places in 145 ms
[2020-06-04 03:49:39] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2020-06-04 03:49:40] [INFO ] Deduced a trap composed of 56 places in 146 ms
[2020-06-04 03:49:40] [INFO ] Deduced a trap composed of 69 places in 146 ms
[2020-06-04 03:49:40] [INFO ] Deduced a trap composed of 149 places in 143 ms
[2020-06-04 03:49:40] [INFO ] Deduced a trap composed of 150 places in 126 ms
[2020-06-04 03:49:40] [INFO ] Deduced a trap composed of 158 places in 134 ms
[2020-06-04 03:49:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2239 ms
[2020-06-04 03:49:40] [INFO ] Computed and/alt/rep : 413/2652/413 causal constraints in 18 ms.
[2020-06-04 03:49:54] [INFO ] Added : 360 causal constraints over 72 iterations in 13398 ms. Result :sat
[2020-06-04 03:49:54] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2020-06-04 03:49:54] [INFO ] Deduced a trap composed of 15 places in 146 ms
[2020-06-04 03:49:54] [INFO ] Deduced a trap composed of 41 places in 102 ms
[2020-06-04 03:49:54] [INFO ] Deduced a trap composed of 65 places in 100 ms
[2020-06-04 03:49:55] [INFO ] Deduced a trap composed of 49 places in 89 ms
[2020-06-04 03:49:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1127 ms
Attempting to minimize the solution found.
Minimization took 62 ms.
[2020-06-04 03:49:55] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-04 03:49:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
[2020-06-04 03:49:55] [INFO ] Flatten gal took : 110 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DoubleExponent-PT-020 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 11079592 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16314144 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-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 r178-tajo-158987882900790"
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 ;