Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r145-tall-171631145000353.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-020, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r145-tall-171631145000353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716404780157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-22 19:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-22 19:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:06:21] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-22 19:06:21] [INFO ] Transformed 1064 places.
[2024-05-22 19:06:21] [INFO ] Transformed 998 transitions.
[2024-05-22 19:06:21] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 189 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 10 ms.
[2024-05-22 19:06:22] [INFO ] Flatten gal took : 196 ms
[2024-05-22 19:06:22] [INFO ] Flatten gal took : 77 ms
[2024-05-22 19:06:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11847775214836961836.gal : 36 ms
[2024-05-22 19:06:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13367334133134984663.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11847775214836961836.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13367334133134984663.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (1323 resets) in 3710 ms. (10 steps per ms) remains 985/1053 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
Loading property file /tmp/ReachabilityCardinality13367334133134984663.prop.
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 86 ms. (1 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 88 ms. (1 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 84 ms. (1 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 78 ms. (1 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 61 ms. (1 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 21 ms. (5 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 22 ms. (5 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 985/985 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 985/985 properties
Probabilistic random walk after 30000 steps, saw 15006 distinct states, run finished after 1241 ms. (steps per millisecond=24 ) properties seen :67
SDD proceeding with computation,1053 properties remain. new max is 4
SDD size :1 after 4
// Phase 1: matrix 998 rows 1064 cols
[2024-05-22 19:06:24] [INFO ] Invariants computation overflowed in 115 ms
SDD proceeding with computation,1053 properties remain. new max is 8
SDD size :4 after 7
Invariant property smplace_953 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_121 does not hold.
SDD proceeding with computation,1049 properties remain. new max is 8
SDD size :7 after 11
Invariant property smplace_154 does not hold.
Invariant property smplace_77 does not hold.
SDD proceeding with computation,1047 properties remain. new max is 8
SDD size :11 after 12
Invariant property smplace_587 does not hold.
Invariant property smplace_576 does not hold.
Invariant property smplace_565 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_276 does not hold.
Invariant property smplace_265 does not hold.
Invariant property smplace_254 does not hold.
Invariant property smplace_243 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_165 does not hold.
SDD proceeding with computation,1035 properties remain. new max is 8
SDD size :12 after 20
Invariant property smplace_332 does not hold.
Invariant property smplace_321 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_288 does not hold.
Invariant property smplace_88 does not hold.
SDD proceeding with computation,1030 properties remain. new max is 8
SDD size :20 after 24
Invariant property smplace_343 does not hold.
SDD proceeding with computation,1029 properties remain. new max is 8
SDD size :24 after 26
Invariant property smplace_532 does not hold.
Invariant property smplace_521 does not hold.
Invariant property smplace_510 does not hold.
Invariant property smplace_354 does not hold.
SDD proceeding with computation,1025 properties remain. new max is 8
SDD size :26 after 29
SDD proceeding with computation,1025 properties remain. new max is 16
SDD size :29 after 31
SDD proceeding with computation,1025 properties remain. new max is 32
SDD size :31 after 32
SDD proceeding with computation,1025 properties remain. new max is 64
SDD size :32 after 44
Invariant property smplace_554 does not hold.
Invariant property smplace_543 does not hold.
SDD proceeding with computation,1023 properties remain. new max is 64
SDD size :44 after 57
Invariant property smplace_487 does not hold.
Invariant property smplace_476 does not hold.
Invariant property smplace_465 does not hold.
Invariant property smplace_454 does not hold.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 918/2062 variables, and 0 constraints, problems are : Problem set: 0 solved, 918 unsolved in 5057 ms.
Refiners :[State Equation: 0/1064 constraints, PredecessorRefiner: 918/918 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 918 unsolved
Invariant property smplace_443 does not hold.
Invariant property smplace_432 does not hold.
Invariant property smplace_421 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_376 does not hold.
Invariant property smplace_365 does not hold.
Invariant property smplace_221 does not hold.
Invariant property smplace_210 does not hold.
SDD proceeding with computation,1009 properties remain. new max is 64
SDD size :57 after 77
SDD proceeding with computation,1009 properties remain. new max is 128
SDD size :77 after 95
SDD proceeding with computation,1009 properties remain. new max is 256
SDD size :95 after 133
Invariant property smplace_1053 does not hold.
Invariant property smplace_1042 does not hold.
Invariant property smplace_1031 does not hold.
Invariant property smplace_876 does not hold.
Invariant property smplace_865 does not hold.
Invariant property smplace_854 does not hold.
Invariant property smplace_843 does not hold.
Invariant property smplace_831 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_809 does not hold.
Invariant property smplace_798 does not hold.
Invariant property smplace_787 does not hold.
Invariant property smplace_776 does not hold.
Invariant property smplace_765 does not hold.
Invariant property smplace_720 does not hold.
Invariant property smplace_709 does not hold.
Invariant property smplace_698 does not hold.
Invariant property smplace_687 does not hold.
Invariant property smplace_676 does not hold.
Invariant property smplace_665 does not hold.
Invariant property smplace_654 does not hold.
Invariant property smplace_643 does not hold.
Invariant property smplace_632 does not hold.
Invariant property smplace_621 does not hold.
Invariant property smplace_609 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_498 does not hold.
Invariant property smplace_232 does not hold.
Invariant property smplace_78 does not hold.
Invariant property smplace_76 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_2 does not hold.
SDD proceeding with computation,973 properties remain. new max is 256
SDD size :133 after 192
Invariant property smplace_68 does not hold.
Invariant property smplace_57 does not hold.
SDD proceeding with computation,971 properties remain. new max is 256
SDD size :192 after 426
Invariant property smplace_74 does not hold.
SDD proceeding with computation,970 properties remain. new max is 256
SDD size :426 after 864
Invariant property smplace_1009 does not hold.
Invariant property smplace_998 does not hold.
Invariant property smplace_987 does not hold.
Invariant property smplace_976 does not hold.
Invariant property smplace_965 does not hold.
Invariant property smplace_954 does not hold.
Invariant property smplace_942 does not hold.
Invariant property smplace_931 does not hold.
Invariant property smplace_920 does not hold.
Invariant property smplace_909 does not hold.
Invariant property smplace_898 does not hold.
Invariant property smplace_887 does not hold.
Invariant property smplace_743 does not hold.
Invariant property smplace_732 does not hold.
SDD proceeding with computation,956 properties remain. new max is 256
SDD size :864 after 1267
SDD proceeding with computation,956 properties remain. new max is 512
SDD size :1267 after 1885
SDD proceeding with computation,956 properties remain. new max is 1024
SDD size :1885 after 3567
Invariant property smplace_1020 does not hold.
Invariant property smplace_754 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_105 does not hold.
Invariant property smplace_104 does not hold.
Invariant property smplace_103 does not hold.
Invariant property smplace_102 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_100 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_96 does not hold.
Invariant property smplace_95 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_79 does not hold.
SDD proceeding with computation,918 properties remain. new max is 1024
SDD size :3567 after 8329
SDD proceeding with computation,918 properties remain. new max is 2048
SDD size :8329 after 29097
SDD proceeding with computation,918 properties remain. new max is 4096
SDD size :29097 after 118876
Invariant property smplace_133 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_118 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_111 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_93 does not hold.
Invariant property smplace_92 does not hold.
SDD proceeding with computation,903 properties remain. new max is 4096
SDD size :118876 after 358780
Error getting values : (error "ParserException while parsing response: ((s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s92 1)
(s93 1)
(s94 1)
(s107 1)
(s108 1)
(s109 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s133 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 918/2062 variables, and 0 constraints, problems are : Problem set: 15 solved, 903 unsolved in 5048 ms.
Refiners :[State Equation: 0/1064 constraints, PredecessorRefiner: 0/918 constraints, Known Traps: 0/0 constraints]
After SMT, in 10451ms problems are : Problem set: 15 solved, 903 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 903 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1064 transition count 965
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1031 transition count 965
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 66 place count 1031 transition count 959
Deduced a syphon composed of 6 places in 12 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 1025 transition count 959
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 42 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 142 place count 993 transition count 927
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 30 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 154 place count 987 transition count 927
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 163 place count 987 transition count 918
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 172 place count 978 transition count 918
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 183 place count 978 transition count 918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 977 transition count 917
Applied a total of 184 rules in 314 ms. Remains 977 /1064 variables (removed 87) and now considering 917/998 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 977/1064 places, 917/998 transitions.
SDD proceeding with computation,903 properties remain. new max is 8192
SDD size :358780 after 624853
SDD proceeding with computation,903 properties remain. new max is 16384
SDD size :624853 after 1.17566e+06
Invariant property smplace_195 does not hold.
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_183 does not hold.
Invariant property smplace_182 does not hold.
Invariant property smplace_181 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_157 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_155 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_149 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_137 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_94 does not hold.
SDD proceeding with computation,867 properties remain. new max is 16384
SDD size :1.17566e+06 after 2.38516e+06
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
SDD proceeding with computation,865 properties remain. new max is 16384
SDD size :2.38516e+06 after 5.78554e+07
SDD proceeding with computation,865 properties remain. new max is 32768
SDD size :5.78554e+07 after 1.94657e+08
SDD proceeding with computation,865 properties remain. new max is 65536
SDD size :1.94657e+08 after 6.40706e+08
SDD proceeding with computation,865 properties remain. new max is 131072
SDD size :6.40706e+08 after 2.01777e+09
SDD proceeding with computation,865 properties remain. new max is 262144
SDD size :2.01777e+09 after 6.15747e+09
RANDOM walk for 2502378 steps (321121 resets) in 120004 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (339 resets) in 185 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (330 resets) in 165 ms. (24 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (324 resets) in 172 ms. (23 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (332 resets) in 133 ms. (29 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (327 resets) in 152 ms. (26 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (340 resets) in 161 ms. (24 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (339 resets) in 140 ms. (28 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (342 resets) in 165 ms. (24 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (326 resets) in 166 ms. (23 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (334 resets) in 177 ms. (22 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (333 resets) in 174 ms. (22 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (332 resets) in 158 ms. (25 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (348 resets) in 177 ms. (22 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (336 resets) in 165 ms. (24 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (336 resets) in 226 ms. (17 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (351 resets) in 191 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (331 resets) in 184 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (348 resets) in 205 ms. (19 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (349 resets) in 229 ms. (17 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (325 resets) in 193 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (324 resets) in 191 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (336 resets) in 188 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (347 resets) in 168 ms. (23 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (333 resets) in 198 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (354 resets) in 216 ms. (18 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (342 resets) in 197 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (326 resets) in 192 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (348 resets) in 189 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (336 resets) in 197 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (342 resets) in 190 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (341 resets) in 181 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (343 resets) in 197 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (334 resets) in 189 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (323 resets) in 176 ms. (22 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (342 resets) in 206 ms. (19 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (348 resets) in 195 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (342 resets) in 195 ms. (20 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (345 resets) in 201 ms. (19 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (339 resets) in 167 ms. (23 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (352 resets) in 178 ms. (22 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (324 resets) in 184 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (342 resets) in 201 ms. (19 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (334 resets) in 188 ms. (21 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (340 resets) in 161 ms. (24 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4003 steps (344 resets) in 136 ms. (29 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4000 steps (329 resets) in 158 ms. (25 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (330 resets) in 149 ms. (26 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (351 resets) in 177 ms. (22 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4001 steps (313 resets) in 162 ms. (24 steps per ms) remains 903/903 properties
BEST_FIRST walk for 4002 steps (318 resets) in 163 ms. (24 steps per ms) remains 903/903 properties
SDD proceeding with computation,865 properties remain. new max is 524288
SDD size :6.15747e+09 after 1.84724e+10
Probabilistic random walk after 1000001 steps, saw 500314 distinct states, run finished after 38616 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 917 rows 977 cols
[2024-05-22 19:07:46] [INFO ] Invariants computation overflowed in 77 ms
[2024-05-22 19:07:46] [INFO ] State equation strengthened by 10 read => feed constraints.
Invariant property smplace_192 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_166 does not hold.
Invariant property smplace_151 does not hold.
Invariant property smplace_150 does not hold.
SDD proceeding with computation,850 properties remain. new max is 524288
SDD size :1.84724e+10 after 5.33859e+10
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/865 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 850 unsolved
SDD proceeding with computation,850 properties remain. new max is 1048576
SDD size :5.33859e+10 after 9.64618e+10
At refinement iteration 1 (OVERLAPS) 818/1683 variables, 865/865 constraints. Problems are: Problem set: 15 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: ((t16 (/ 361.0 16.0))
(t18 (/ 361.0 16.0))
(t19 0.0)
(t20 (/ 361.0 16.0))
(t32 (/ 698805.0 2.0))
(t33 (/ 698805.0 2.0))
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 (/ 698805.0 2.0))
(t38 (/ 698805.0 2.0))
(t39 (/ 698805.0 2.0))
(t40 (/ 698805.0 2.0))
(t41 (/ 698805.0 2.0))
(t42 0.0)
(t43 (/ 698805.0 2.0))
(t44 (/ 698805.0 2.0))
(t53 (/ 11180881.0 16.0))
(t54 (/ 45.0 2.0))
(t55 (/ 359.0 16.0))
(t56 (/ 179.0 8.0))
(t57 (/ 179.0 8.0))
(t58 (/ 179.0 8.0))
(t59 (/ 179.0 8.0))
(t60 (/ 179.0 8.0))
(t61 (/ 179.0 8.0))
(t62 (/ 179.0 8.0))
(t63 0.0)
(t64 (/ 177.0 8.0))
(t65 (/ 353.0 16.0))
(t66 0.0)
(t67 22.0)
(t68 (/ 698761.0 4.0))
(t69 (/ 1.0 16.0))
(t70 (/ 1.0 16.0))
(t71 (/ 1.0 16.0))
(t72 (/ 2795043.0 16.0))
(t73 (/ 2795043.0 16.0))
(t74 (/ 2795043.0 16.0))
(t75 (/ 2795043.0 16.0))
(t76 (/ 1397521.0 8.0))
(t77 0.0)
(t78 (/ 2795041.0 16.0))
(t79 174690.0)
(t80 (/ 1397519.0 8.0))
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 (/ 1397519.0 8.0))
(t86 (/ 1397519.0 8.0))
(t87 (/ 1397519.0 8.0))
(t88 (/ 1397519.0 8.0))
(t89 (/ 1397519.0 8.0))
(t90 0.0)
(t91 (/ 1397519.0 8.0))
(t92 (/ 2795037.0 16.0))
(t93 (/ 5590079.0 16.0))
(t94 (/ 5590079.0 16.0))
(t95 (/ 5590079.0 16.0))
(t96 (/ 5590079.0 16.0))
(t97 (/ 5590079.0 16.0))
(t98 (/ 5590079.0 16.0))
(t99 (/ 5590079.0 16.0))
(t100 0.0)
(t101 (/ 5590079.0 16.0))
(t102 (/ 5590079.0 16.0))
(t103 0.0)
(t104 (/ 2795039.0 8.0))
(t105 (/ 351.0 16.0))
(t106 (/ 175.0 8.0))
(t107 (/ 349.0 16.0))
(t108 (/ 349.0 16.0))
(t109 (/ 349.0 16.0))
(t110 (/ 349.0 16.0))
(t111 (/ 349.0 16.0))
(t112 (/ 349.0 16.0))
(t113 (/ 349.0 16.0))
(t114 0.0)
(t115 (/ 349.0 16.0))
(t116 (/ 349.0 16.0))
(t117 0.0)
(t118 (/ 169.0 8.0))
(t119 (/ 698679.0 8.0))
(t120 (/ 3.0 16.0))
(t121 (/ 1.0 8.0))
(t122 (/ 1.0 16.0))
(t123 (/ 698677.0 8.0))
(t124 (/ 1397353.0 16.0))
(t125 (/ 174669.0 2.0))
(t126 (/ 1397351.0 16.0))
(t127 (/ 698675.0 8.0))
(t128 0.0)
(t129 (/ 1397349.0 16.0))
(t130 (/ 349337.0 4.0))
(t131 (/ 1397345.0 16.0))
(t132 (/ 3.0 16.0))
(t133 (/ 1.0 8.0))
(t134 (/ 1.0 16.0))
(t135 (/ 1397341.0 16.0))
(t136 (/ 349335.0 4.0))
(t137 (/ 1397339.0 16.0))
(t138 (/ 698669.0 8.0))
(t139 (/ 1397337.0 16.0))
(t140 0.0)
(t141 (/ 174667.0 2.0))
(t142 (/ 1397335.0 16.0))
(t143 (/ 2794685.0 16.0))
(t144 (/ 2794685.0 16.0))
(t145 (/ 1397343.0 8.0))
(t146 (/ 1397343.0 8.0))
(t147 (/ 1397343.0 8.0))
(t148 (/ 1397343.0 8.0))
(t149 (/ 1397343.0 8.0))
(t150 (/ 1.0 16.0))
(t151 (/ 2794685.0 16.0))
(t152 (/ 2794685.0 16.0))
(t153 0.0)
(t154 (/ 698671.0 4.0))
(t155 (/ 337.0 16.0))
(t156 21.0)
(t157 (/ 335.0 16.0))
(t158 (/ 167.0 8.0))
(t159 (/ 333.0 16.0))
(t160 (/ 83.0 4.0))
(t161 (/ 331.0 16.0))
(t162 (/ 165.0 8.0))
(t163 (/ 329.0 16.0))
(t164 0.0)
(t165 (/ 149.0 8.0))
(t166 (/ 297.0 16.0))
(t167 0.0)
(t168 (/ 143.0 8.0))
(t169 (/ 349267.0 8.0))
(t170 (/ 3.0 16.0))
(t171 (/ 1.0 8.0))
(t172 (/ 1.0 16.0))
(t173 (/ 349265.0 8.0))
(t174 (/ 698529.0 16.0))
(t175 43658.0)
(t176 (/ 698527.0 16.0))
(t177 (/ 349263.0 8.0))
(t178 0.0)
(t179 (/ 698525.0 16.0))
(t180 (/ 87313.0 2.0))
(t181 (/ 698501.0 16.0))
(t182 (/ 3.0 16.0))
(t183 (/ 1.0 8.0))
(t184 (/ 1.0 16.0))
(t185 (/ 698497.0 16.0))
(t186 43656.0)
(t187 (/ 698495.0 16.0))
(t188 (/ 349247.0 8.0))
(t189 (/ 698493.0 16.0))
(t190 0.0)
(t191 (/ 174623.0 4.0))
(t192 (/ 698491.0 16.0))
(t193 (/ 174627.0 2.0))
(t194 (/ 1397015.0 16.0))
(t195 (/ 698507.0 8.0))
(t196 (/ 1397013.0 16.0))
(t197 (/ 349253.0 4.0))
(t198 (/ 1397011.0 16.0))
(t199 (/ 698505.0 8.0))
(t200 0.0)
(t201 (/ 698499.0 8.0))
(t202 (/ 1396997.0 16.0))
(t203 0.0)
(t204 (/ 349249.0 4.0))
(t205 (/ 285.0 16.0))
(t207 (/ 71.0 4.0))
(t208 (/ 283.0 16.0))
(t209 (/ 141.0 8.0))
(t210 (/ 281.0 16.0))
(t211 (/ 35.0 2.0))
(t212 (/ 279.0 16.0))
(t213 (/ 139.0 8.0))
(t214 (/ 277.0 16.0))
(t215 0.0)
(t216 (/ 133.0 8.0))
(t217 (/ 265.0 16.0))
(t218 0.0)
(t219 (/ 33.0 2.0))
(t220 (/ 174557.0 8.0))
(t221 (/ 3.0 16.0))
(t222 (/ 1.0 8.0))
(t223 (/ 1.0 16.0))
(t224 (/ 174555.0 8.0))
(t225 (/ 349109.0 16.0))
(t226 (/ 87277.0 4.0))
(t227 (/ 349107.0 16.0))
(t228 (/ 174553.0 8.0))
(t229 0.0)
(t230 (/ 349105.0 16.0))
(t231 21819.0)
(t232 (/ 349101.0 16.0))
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 (/ 349101.0 16.0))
(t237 (/ 349125.0 16.0))
(t238 (/ 349125.0 16.0))
(t239 (/ 349125.0 16.0))
(t240 (/ 349125.0 16.0))
(t241 (/ 3.0 2.0))
(t242 (/ 349101.0 16.0))
(t243 (/ 349099.0 16.0))
(t244 (/ 349103.0 8.0))
(t245 (/ 349103.0 8.0))
(t246 (/ 349103.0 8.0))
(t247 (/ 349103.0 8.0))
(t248 (/ 349103.0 8.0))
(t249 (/ 349103.0 8.0))
(t250 (/ 349103.0 8.0))
(t251 0.0)
(t252 (/ 698205.0 16.0))
(t253 (/ 698205.0 16.0))
(t254 0.0)
(t255 (/ 174551.0 4.0))
(t256 (/ 263.0 16.0))
(t257 (/ 131.0 8.0))
(t258 (/ 261.0 16.0))
(t259 (/ 65.0 4.0))
(t260 (/ 259.0 16.0))
(t261 (/ 129.0 8.0))
(t262 (/ 257.0 16.0))
(t263 16.0)
(t264 (/ 255.0 16.0))
(t265 0.0)
(t266 (/ 235.0 16.0))
(t267 (/ 117.0 8.0))
(t268 0.0)
(t269 (/ 223.0 16.0))
(t270 (/ 174443.0 16.0))
(t271 (/ 3.0 16.0))
(t272 (/ 1.0 8.0))
(t273 (/ 1.0 16.0))
(t274 (/ 174439.0 16.0))
(t275 (/ 87219.0 8.0))
(t276 (/ 174437.0 16.0))
(t277 (/ 43609.0 4.0))
(t278 (/ 174435.0 16.0))
(t279 0.0)
(t280 (/ 87217.0 8.0))
(t281 (/ 21803.0 2.0))
(t282 (/ 43605.0 4.0))
(t283 (/ 3.0 16.0))
(t284 (/ 1.0 8.0))
(t285 (/ 1.0 16.0))
(t286 10901.0)
(t287 (/ 87227.0 8.0))
(t288 (/ 174453.0 16.0))
(t289 (/ 43613.0 4.0))
(t290 (/ 174451.0 16.0))
(t291 (/ 39.0 16.0))
(t292 (/ 174411.0 16.0))
(t293 (/ 87205.0 8.0))
(t294 (/ 87211.0 4.0))
(t295 (/ 348843.0 16.0))
(t296 (/ 174421.0 8.0))
(t297 (/ 348841.0 16.0))
(t298 (/ 43605.0 2.0))
(t299 (/ 348839.0 16.0))
(t300 (/ 174419.0 8.0))
(t301 0.0)
(t302 (/ 348837.0 16.0))
(t303 (/ 87209.0 4.0))
(t304 0.0)
(t305 (/ 348835.0 16.0))
(t306 (/ 111.0 8.0))
(t308 (/ 221.0 16.0))
(t309 (/ 55.0 4.0))
(t310 (/ 219.0 16.0))
(t311 (/ 109.0 8.0))
(t312 (/ 217.0 16.0))
(t313 (/ 27.0 2.0))
(t314 (/ 215.0 16.0))
(t315 (/ 107.0 8.0))
(t316 0.0)
(t317 (/ 193.0 16.0))
(t318 12.0)
(t319 0.0)
(t320 (/ 181.0 16.0))
(t321 (/ 43559.0 8.0))
(t322 (/ 3.0 16.0))
(t323 (/ 1.0 8.0))
(t324 (/ 1.0 16.0))
(t325 (/ 43557.0 8.0))
(t326 (/ 87113.0 16.0))
(t327 (/ 10889.0 2.0))
(t329 (/ 87111.0 16.0))
(t330 (/ 43555.0 8.0))
(t331 0.0)
(t332 (/ 87109.0 16.0))
(t333 (/ 87099.0 16.0))
(t334 (/ 10887.0 2.0))
(t335 (/ 3.0 16.0))
(t336 (/ 1.0 8.0))
(t337 (/ 1.0 16.0))
(t338 (/ 21773.0 4.0))
(t339 (/ 21781.0 4.0))
(t340 (/ 87123.0 16.0))
(t341 (/ 43561.0 8.0))
(t342 (/ 87121.0 16.0))
(t343 (/ 33.0 16.0))
(t344 (/ 87087.0 16.0))
(t345 (/ 43543.0 8.0))
(t346 (/ 174195.0 16.0))
(t347 (/ 87097.0 8.0))
(t348 (/ 174193.0 16.0))
(t349 10887.0)
(t350 (/ 174191.0 16.0))
(t351 (/ 87095.0 8.0))
(t352 (/ 174189.0 16.0))
(t353 0.0)
(t354 (/ 43547.0 4.0))
(t355 (/ 174187.0 16.0))
(t356 0.0)
(t357 (/ 87093.0 8.0))
(t358 (/ 45.0 4.0))
(t359 (/ 179.0 16.0))
(t360 (/ 89.0 8.0))
(t361 (/ 177.0 16.0))
(t362 11.0)
(t363 (/ 175.0 16.0))
(t364 (/ 87.0 8.0))
(t365 (/ 173.0 16.0))
(t366 (/ 43.0 4.0))
(t367 0.0)
(t368 (/ 171.0 16.0))
(t369 (/ 85.0 8.0))
(t370 0.0)
(t371 (/ 169.0 16.0))
(t372 (/ 21727.0 8.0))
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 (/ 21727.0 8.0))
(t377 (/ 21727.0 8.0))
(t378 (/ 21727.0 8.0))
(t379 (/ 21727.0 8.0))
(t380 (/ 21727.0 8.0))
(t381 0.0)
(t382 (/ 21727.0 8.0))
(t383 (/ 43453.0 16.0))
(t384 (/ 43451.0 16.0))
(t385 0.0)
(t386 0.0)
(t387 0.0)
(t388 (/ 43451.0 16.0))
(t389 (/ 43459.0 16.0))
(t390 (/ 43459.0 16.0))
(t391 (/ 43459.0 16.0))
(t392 (/ 43459.0 16.0))
(t393 (/ 1.0 2.0))
(t394 (/ 43451.0 16.0))
(t395 (/ 21725.0 8.0))
(t396 (/ 86905.0 16.0))
(t397 (/ 86905.0 16.0))
(t398 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1683/1894 variables, and 865 constraints, problems are : Problem set: 15 solved, 850 unsolved in 45027 ms.
Refiners :[State Equation: 865/977 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 850 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/850 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 802/1652 variables, 850/850 constraints. Problems are: Problem set: 15 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1652 variables, 833/1683 constraints. Problems are: Problem set: 15 solved, 850 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1652/1894 variables, and 1683 constraints, problems are : Problem set: 15 solved, 850 unsolved in 45025 ms.
Refiners :[State Equation: 850/977 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 833/865 constraints, Known Traps: 0/0 constraints]
After SMT, in 90329ms problems are : Problem set: 15 solved, 850 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 850 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 917/917 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 977 transition count 906
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 966 transition count 906
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 966 transition count 904
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 964 transition count 904
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 10 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 46 place count 954 transition count 894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 952 transition count 894
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 952 transition count 890
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 948 transition count 890
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 948 transition count 890
Applied a total of 62 rules in 138 ms. Remains 948 /977 variables (removed 29) and now considering 890/917 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 948/977 places, 890/917 transitions.
RANDOM walk for 2700299 steps (345425 resets) in 120004 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (325 resets) in 139 ms. (28 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (338 resets) in 137 ms. (29 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (330 resets) in 145 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (337 resets) in 140 ms. (28 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (330 resets) in 144 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (328 resets) in 141 ms. (28 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (328 resets) in 152 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (343 resets) in 136 ms. (29 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (342 resets) in 143 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (353 resets) in 144 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (340 resets) in 122 ms. (32 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (342 resets) in 153 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (342 resets) in 145 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (339 resets) in 141 ms. (28 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (336 resets) in 206 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (331 resets) in 147 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (333 resets) in 214 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (331 resets) in 186 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (338 resets) in 135 ms. (29 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (317 resets) in 186 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (339 resets) in 215 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (334 resets) in 167 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (351 resets) in 195 ms. (20 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (321 resets) in 157 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (320 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (351 resets) in 164 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (353 resets) in 161 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (347 resets) in 146 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (335 resets) in 157 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (320 resets) in 172 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (363 resets) in 163 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (337 resets) in 161 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (325 resets) in 154 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (337 resets) in 168 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (337 resets) in 156 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (323 resets) in 169 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (330 resets) in 165 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (330 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (334 resets) in 178 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (357 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (345 resets) in 168 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (345 resets) in 157 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (335 resets) in 168 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (342 resets) in 148 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (317 resets) in 150 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (328 resets) in 156 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (332 resets) in 186 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (352 resets) in 156 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (340 resets) in 182 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (352 resets) in 169 ms. (23 steps per ms) remains 850/850 properties
SDD proceeding with computation,850 properties remain. new max is 2097152
SDD size :9.64618e+10 after 1.49276e+11
Probabilistic random walk after 1000001 steps, saw 500315 distinct states, run finished after 36775 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 19:10:27] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-22 19:10:27] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/850 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 804/1654 variables, 850/850 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 850 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 75205ms, After SMT, problems are : Problem set: 0 solved, 850 unsolved
Fused 850 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 850 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Applied a total of 0 rules in 22 ms. Remains 948 /948 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 948/948 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 890/890 transitions.
Applied a total of 0 rules in 22 ms. Remains 948 /948 variables (removed 0) and now considering 890/890 (removed 0) transitions.
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 19:11:42] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-22 19:11:42] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 890 rows 948 cols
[2024-05-22 19:11:42] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-22 19:11:42] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:11:45] [INFO ] Implicit Places using invariants and state equation in 3253 ms returned [85, 91, 112, 276, 401, 769, 895]
[2024-05-22 19:11:45] [INFO ] Actually due to overlaps returned [401, 276]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3491 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 946/948 places, 890/890 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 946 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 945 transition count 889
Applied a total of 2 rules in 58 ms. Remains 945 /946 variables (removed 1) and now considering 889/890 (removed 1) transitions.
// Phase 1: matrix 889 rows 945 cols
[2024-05-22 19:11:45] [INFO ] Invariants computation overflowed in 123 ms
[2024-05-22 19:11:46] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 889 rows 945 cols
[2024-05-22 19:11:46] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-22 19:11:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:11:48] [INFO ] Implicit Places using invariants and state equation in 2851 ms returned [85, 91, 112, 766, 892]
[2024-05-22 19:11:48] [INFO ] Actually due to overlaps returned [892, 766]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3111 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 943/948 places, 889/890 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 943 transition count 888
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 942 transition count 888
Applied a total of 2 rules in 45 ms. Remains 942 /943 variables (removed 1) and now considering 888/889 (removed 1) transitions.
// Phase 1: matrix 888 rows 942 cols
[2024-05-22 19:11:48] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-22 19:11:49] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 888 rows 942 cols
[2024-05-22 19:11:49] [INFO ] Invariants computation overflowed in 55 ms
[2024-05-22 19:11:49] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:11:51] [INFO ] Implicit Places using invariants and state equation in 2369 ms returned [85, 91, 112]
[2024-05-22 19:11:51] [INFO ] Actually due to overlaps returned [91, 85]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2561 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 940/948 places, 888/890 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 940 transition count 887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 939 transition count 887
Applied a total of 2 rules in 68 ms. Remains 939 /940 variables (removed 1) and now considering 887/888 (removed 1) transitions.
// Phase 1: matrix 887 rows 939 cols
[2024-05-22 19:11:51] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-22 19:11:51] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 887 rows 939 cols
[2024-05-22 19:11:51] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-22 19:11:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:11:54] [INFO ] Implicit Places using invariants and state equation in 3127 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3376 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 938/948 places, 887/890 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 938 transition count 887
Applied a total of 1 rules in 54 ms. Remains 938 /938 variables (removed 0) and now considering 887/887 (removed 0) transitions.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:11:55] [INFO ] Invariants computation overflowed in 119 ms
[2024-05-22 19:11:55] [INFO ] Implicit Places using invariants in 240 ms returned []
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:11:55] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-22 19:11:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:11:57] [INFO ] Implicit Places using invariants and state equation in 2762 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 938/948 places, 887/890 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 15802 ms. Remains : 938/948 places, 887/890 transitions.
RANDOM walk for 1999779 steps (288458 resets) in 120007 ms. (16 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (350 resets) in 214 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (361 resets) in 219 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (355 resets) in 206 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (371 resets) in 164 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (368 resets) in 187 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (350 resets) in 183 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (363 resets) in 171 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (356 resets) in 168 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (373 resets) in 167 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4004 steps (355 resets) in 149 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (374 resets) in 158 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (341 resets) in 166 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (372 resets) in 155 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (373 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (373 resets) in 163 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (354 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (383 resets) in 163 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (341 resets) in 164 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (376 resets) in 156 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (355 resets) in 191 ms. (20 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (357 resets) in 158 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (367 resets) in 155 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4004 steps (369 resets) in 166 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (376 resets) in 144 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (364 resets) in 155 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (379 resets) in 146 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (379 resets) in 172 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (355 resets) in 160 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (351 resets) in 182 ms. (21 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (384 resets) in 171 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (354 resets) in 170 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (360 resets) in 156 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (350 resets) in 172 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (366 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (358 resets) in 157 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (376 resets) in 158 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (379 resets) in 152 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (357 resets) in 144 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (358 resets) in 153 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (383 resets) in 165 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (366 resets) in 164 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (378 resets) in 147 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (363 resets) in 158 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (349 resets) in 160 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (359 resets) in 158 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (375 resets) in 164 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (358 resets) in 147 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (372 resets) in 152 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (359 resets) in 154 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (351 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
Probabilistic random walk after 1000001 steps, saw 500103 distinct states, run finished after 36499 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:13:07] [INFO ] Invariants computation overflowed in 125 ms
[2024-05-22 19:13:07] [INFO ] State equation strengthened by 14 read => feed constraints.
SDD proceeding with computation,850 properties remain. new max is 4194304
SDD size :1.49276e+11 after 3.13374e+11
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/850 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 804/1654 variables, 850/850 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 850 unsolved
SMT process timed out in 90263ms, After SMT, problems are : Problem set: 0 solved, 850 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 850 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Applied a total of 0 rules in 18 ms. Remains 938 /938 variables (removed 0) and now considering 887/887 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 938/938 places, 887/887 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Applied a total of 0 rules in 19 ms. Remains 938 /938 variables (removed 0) and now considering 887/887 (removed 0) transitions.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:14:37] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-22 19:14:37] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:14:37] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-22 19:14:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:14:40] [INFO ] Implicit Places using invariants and state equation in 2732 ms returned []
Implicit Place search using SMT with State Equation took 2978 ms to find 0 implicit places.
[2024-05-22 19:14:40] [INFO ] Redundant transitions in 44 ms returned []
Running 886 sub problems to find dead transitions.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:14:40] [INFO ] Invariants computation overflowed in 115 ms
[2024-05-22 19:14:40] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 887/1820 variables, 933/933 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1820/1825 variables, and 947 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30045 ms.
Refiners :[State Equation: 933/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 886 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 887/1820 variables, 933/933 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1820 variables, 14/947 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1820 variables, 880/1827 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1820/1825 variables, and 1827 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30034 ms.
Refiners :[State Equation: 933/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 880/886 constraints, Known Traps: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 886 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63431 ms. Remains : 938/938 places, 887/887 transitions.
RANDOM walk for 400000 steps (57874 resets) in 26327 ms. (15 steps per ms) remains 850/850 properties
Running SMT prover for 850 properties.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:15:48] [INFO ] Invariants computation overflowed in 124 ms
[2024-05-22 19:16:00] [INFO ] After 11371ms SMT Verify possible using state equation in real domain returned unsat :0 sat :850
[2024-05-22 19:16:00] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:16:11] [INFO ] After 11909ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :850
TRAPS : Iteration 0
Detected timeout of ITS tools.
[2024-05-22 19:16:22] [INFO ] Flatten gal took : 51 ms
[2024-05-22 19:16:22] [INFO ] Applying decomposition
[2024-05-22 19:16:22] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17907104631263831177.txt' '-o' '/tmp/graph17907104631263831177.bin' '-w' '/tmp/graph17907104631263831177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17907104631263831177.bin' '-l' '-1' '-v' '-w' '/tmp/graph17907104631263831177.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:16:23] [INFO ] Decomposing Gal with order
[2024-05-22 19:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:16:23] [INFO ] Removed a total of 276 redundant transitions.
[2024-05-22 19:16:23] [INFO ] Flatten gal took : 188 ms
[2024-05-22 19:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 51 ms.
[2024-05-22 19:16:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9082908973439055019.gal : 44 ms
[2024-05-22 19:16:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4216877162800877202.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9082908973439055019.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4216877162800877202.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4216877162800877202.prop.
SDD proceeding with computation,850 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,850 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,850 properties remain. new max is 16
SDD size :1 after 32
SDD proceeding with computation,850 properties remain. new max is 32
SDD size :32 after 78
SDD proceeding with computation,850 properties remain. new max is 64
SDD size :78 after 3851
SDD proceeding with computation,850 properties remain. new max is 128
SDD size :3851 after 565051
[2024-05-22 19:17:13] [INFO ] After 73241ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:850
[2024-05-22 19:17:13] [INFO ] After 85148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:850
[2024-05-22 19:17:29] [INFO ] After 15711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :850
SDD proceeding with computation,850 properties remain. new max is 256
SDD size :565051 after 1.72981e+06
[2024-05-22 19:18:09] [INFO ] After 40092ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :850
TRAPS : Iteration 0
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 38 ms to minimize.
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 4 ms to minimize.
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 4 ms to minimize.
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 3 ms to minimize.
[2024-05-22 19:18:10] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 182 places in 155 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 189 places in 124 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 2 ms to minimize.
[2024-05-22 19:18:11] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 3 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 156 places in 132 ms of which 2 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 199 places in 152 ms of which 3 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 225 places in 126 ms of which 2 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 158 places in 139 ms of which 3 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 132 places in 159 ms of which 3 ms to minimize.
[2024-05-22 19:18:12] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 3 ms to minimize.
[2024-05-22 19:18:13] [INFO ] Deduced a trap composed of 120 places in 148 ms of which 3 ms to minimize.
[2024-05-22 19:18:13] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 3 ms to minimize.
[2024-05-22 19:18:13] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 2 ms to minimize.
[2024-05-22 19:18:13] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 3 ms to minimize.
[2024-05-22 19:18:13] [INFO ] Deduced a trap composed of 195 places in 162 ms of which 4 ms to minimize.
[2024-05-22 19:18:14] [INFO ] Deduced a trap composed of 222 places in 176 ms of which 3 ms to minimize.
[2024-05-22 19:18:14] [INFO ] Deduced a trap composed of 207 places in 151 ms of which 3 ms to minimize.
[2024-05-22 19:18:14] [INFO ] Deduced a trap composed of 241 places in 150 ms of which 3 ms to minimize.
[2024-05-22 19:18:14] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 3 ms to minimize.
[2024-05-22 19:18:14] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 3 ms to minimize.
[2024-05-22 19:18:15] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 4 ms to minimize.
[2024-05-22 19:18:15] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 3 ms to minimize.
[2024-05-22 19:18:15] [INFO ] Deduced a trap composed of 163 places in 186 ms of which 4 ms to minimize.
[2024-05-22 19:18:15] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 4 ms to minimize.
[2024-05-22 19:18:16] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 4 ms to minimize.
[2024-05-22 19:18:16] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 3 ms to minimize.
[2024-05-22 19:18:16] [INFO ] Deduced a trap composed of 150 places in 191 ms of which 4 ms to minimize.
[2024-05-22 19:18:16] [INFO ] Deduced a trap composed of 173 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:18:16] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 9 ms to minimize.
[2024-05-22 19:18:17] [INFO ] Deduced a trap composed of 192 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:18:17] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2024-05-22 19:18:17] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:18:17] [INFO ] Deduced a trap composed of 86 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:18:18] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:18:18] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:18:18] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 14 ms to minimize.
[2024-05-22 19:18:18] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:18:19] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 4 ms to minimize.
[2024-05-22 19:18:19] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:18:19] [INFO ] Deduced a trap composed of 230 places in 177 ms of which 4 ms to minimize.
[2024-05-22 19:18:19] [INFO ] Deduced a trap composed of 213 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:18:19] [INFO ] Deduced a trap composed of 244 places in 178 ms of which 4 ms to minimize.
[2024-05-22 19:18:20] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:18:20] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 3 ms to minimize.
[2024-05-22 19:18:21] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 3 ms to minimize.
[2024-05-22 19:18:21] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 2 ms to minimize.
[2024-05-22 19:18:21] [INFO ] Deduced a trap composed of 213 places in 122 ms of which 3 ms to minimize.
[2024-05-22 19:18:22] [INFO ] Deduced a trap composed of 162 places in 122 ms of which 2 ms to minimize.
[2024-05-22 19:18:23] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 3 ms to minimize.
[2024-05-22 19:18:24] [INFO ] Deduced a trap composed of 193 places in 154 ms of which 3 ms to minimize.
[2024-05-22 19:18:24] [INFO ] Deduced a trap composed of 165 places in 145 ms of which 3 ms to minimize.
[2024-05-22 19:18:24] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 2 ms to minimize.
[2024-05-22 19:18:25] [INFO ] Deduced a trap composed of 183 places in 149 ms of which 3 ms to minimize.
[2024-05-22 19:18:26] [INFO ] Deduced a trap composed of 199 places in 132 ms of which 2 ms to minimize.
[2024-05-22 19:18:26] [INFO ] Deduced a trap composed of 185 places in 127 ms of which 3 ms to minimize.
[2024-05-22 19:18:30] [INFO ] Deduced a trap composed of 159 places in 132 ms of which 3 ms to minimize.
[2024-05-22 19:18:30] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 2 ms to minimize.
[2024-05-22 19:18:30] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 3 ms to minimize.
[2024-05-22 19:18:31] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 3 ms to minimize.
[2024-05-22 19:18:31] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 4 ms to minimize.
[2024-05-22 19:18:33] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 4 ms to minimize.
[2024-05-22 19:18:34] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 4 ms to minimize.
[2024-05-22 19:18:39] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 4 ms to minimize.
[2024-05-22 19:18:40] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:18:40] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 4 ms to minimize.
[2024-05-22 19:18:40] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 4 ms to minimize.
[2024-05-22 19:18:40] [INFO ] Deduced a trap composed of 103 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:18:40] [INFO ] Deduced a trap composed of 316 places in 185 ms of which 4 ms to minimize.
[2024-05-22 19:18:41] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 4 ms to minimize.
[2024-05-22 19:18:41] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 4 ms to minimize.
[2024-05-22 19:18:41] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 31930 ms
[2024-05-22 19:18:45] [INFO ] Deduced a trap composed of 186 places in 127 ms of which 2 ms to minimize.
[2024-05-22 19:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-22 19:18:46] [INFO ] Deduced a trap composed of 200 places in 104 ms of which 2 ms to minimize.
[2024-05-22 19:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-05-22 19:18:46] [INFO ] Deduced a trap composed of 206 places in 108 ms of which 1 ms to minimize.
[2024-05-22 19:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-22 19:18:48] [INFO ] Deduced a trap composed of 454 places in 245 ms of which 5 ms to minimize.
[2024-05-22 19:18:48] [INFO ] Deduced a trap composed of 456 places in 239 ms of which 5 ms to minimize.
[2024-05-22 19:18:49] [INFO ] Deduced a trap composed of 388 places in 242 ms of which 5 ms to minimize.
[2024-05-22 19:18:49] [INFO ] Deduced a trap composed of 397 places in 243 ms of which 5 ms to minimize.
[2024-05-22 19:18:49] [INFO ] Deduced a trap composed of 244 places in 247 ms of which 5 ms to minimize.
[2024-05-22 19:18:50] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 5 ms to minimize.
[2024-05-22 19:18:50] [INFO ] Deduced a trap composed of 442 places in 236 ms of which 5 ms to minimize.
[2024-05-22 19:18:50] [INFO ] Deduced a trap composed of 352 places in 239 ms of which 5 ms to minimize.
[2024-05-22 19:18:51] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 5 ms to minimize.
[2024-05-22 19:18:51] [INFO ] Deduced a trap composed of 471 places in 249 ms of which 5 ms to minimize.
[2024-05-22 19:18:51] [INFO ] Deduced a trap composed of 471 places in 236 ms of which 5 ms to minimize.
[2024-05-22 19:18:51] [INFO ] Deduced a trap composed of 399 places in 242 ms of which 5 ms to minimize.
[2024-05-22 19:18:52] [INFO ] Deduced a trap composed of 217 places in 247 ms of which 5 ms to minimize.
[2024-05-22 19:18:53] [INFO ] Deduced a trap composed of 394 places in 264 ms of which 5 ms to minimize.
[2024-05-22 19:18:53] [INFO ] Deduced a trap composed of 413 places in 270 ms of which 5 ms to minimize.
[2024-05-22 19:18:54] [INFO ] Deduced a trap composed of 393 places in 269 ms of which 5 ms to minimize.
[2024-05-22 19:18:54] [INFO ] Deduced a trap composed of 299 places in 255 ms of which 5 ms to minimize.
[2024-05-22 19:18:54] [INFO ] Deduced a trap composed of 194 places in 119 ms of which 1 ms to minimize.
[2024-05-22 19:18:57] [INFO ] Deduced a trap composed of 358 places in 258 ms of which 5 ms to minimize.
[2024-05-22 19:18:58] [INFO ] Deduced a trap composed of 281 places in 257 ms of which 5 ms to minimize.
[2024-05-22 19:18:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 10197 ms
[2024-05-22 19:19:03] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 5 ms to minimize.
[2024-05-22 19:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2024-05-22 19:19:05] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 18 ms to minimize.
[2024-05-22 19:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2024-05-22 19:19:07] [INFO ] Deduced a trap composed of 331 places in 253 ms of which 5 ms to minimize.
[2024-05-22 19:19:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-05-22 19:19:09] [INFO ] Deduced a trap composed of 311 places in 285 ms of which 6 ms to minimize.
[2024-05-22 19:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2024-05-22 19:19:13] [INFO ] Deduced a trap composed of 312 places in 286 ms of which 6 ms to minimize.
[2024-05-22 19:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2024-05-22 19:19:17] [INFO ] Deduced a trap composed of 320 places in 239 ms of which 5 ms to minimize.
[2024-05-22 19:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2024-05-22 19:19:19] [INFO ] Deduced a trap composed of 345 places in 291 ms of which 5 ms to minimize.
[2024-05-22 19:19:20] [INFO ] Deduced a trap composed of 316 places in 286 ms of which 6 ms to minimize.
[2024-05-22 19:19:21] [INFO ] Deduced a trap composed of 364 places in 284 ms of which 5 ms to minimize.
[2024-05-22 19:19:21] [INFO ] Deduced a trap composed of 372 places in 279 ms of which 6 ms to minimize.
[2024-05-22 19:19:21] [INFO ] Deduced a trap composed of 357 places in 281 ms of which 6 ms to minimize.
[2024-05-22 19:19:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2785 ms
[2024-05-22 19:19:29] [INFO ] Deduced a trap composed of 323 places in 232 ms of which 4 ms to minimize.
[2024-05-22 19:19:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2024-05-22 19:19:37] [INFO ] Deduced a trap composed of 304 places in 221 ms of which 4 ms to minimize.
[2024-05-22 19:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 871 ms
[2024-05-22 19:19:52] [INFO ] Deduced a trap composed of 269 places in 201 ms of which 4 ms to minimize.
[2024-05-22 19:19:52] [INFO ] Deduced a trap composed of 295 places in 211 ms of which 3 ms to minimize.
[2024-05-22 19:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2024-05-22 19:20:03] [INFO ] Deduced a trap composed of 295 places in 192 ms of which 4 ms to minimize.
[2024-05-22 19:20:03] [INFO ] Deduced a trap composed of 297 places in 190 ms of which 3 ms to minimize.
[2024-05-22 19:20:03] [INFO ] Deduced a trap composed of 289 places in 198 ms of which 3 ms to minimize.
[2024-05-22 19:20:03] [INFO ] Deduced a trap composed of 290 places in 191 ms of which 4 ms to minimize.
[2024-05-22 19:20:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1190 ms
[2024-05-22 19:20:05] [INFO ] Deduced a trap composed of 366 places in 272 ms of which 6 ms to minimize.
[2024-05-22 19:20:06] [INFO ] Deduced a trap composed of 342 places in 266 ms of which 5 ms to minimize.
[2024-05-22 19:20:06] [INFO ] Deduced a trap composed of 349 places in 263 ms of which 5 ms to minimize.
[2024-05-22 19:20:06] [INFO ] Deduced a trap composed of 348 places in 262 ms of which 5 ms to minimize.
[2024-05-22 19:20:07] [INFO ] Deduced a trap composed of 354 places in 259 ms of which 5 ms to minimize.
[2024-05-22 19:20:07] [INFO ] Deduced a trap composed of 346 places in 262 ms of which 5 ms to minimize.
[2024-05-22 19:20:07] [INFO ] Deduced a trap composed of 303 places in 261 ms of which 5 ms to minimize.
[2024-05-22 19:20:08] [INFO ] Deduced a trap composed of 354 places in 265 ms of which 5 ms to minimize.
[2024-05-22 19:20:08] [INFO ] Deduced a trap composed of 349 places in 266 ms of which 5 ms to minimize.
[2024-05-22 19:20:08] [INFO ] Deduced a trap composed of 357 places in 261 ms of which 5 ms to minimize.
[2024-05-22 19:20:09] [INFO ] Deduced a trap composed of 357 places in 271 ms of which 5 ms to minimize.
[2024-05-22 19:20:09] [INFO ] Deduced a trap composed of 312 places in 288 ms of which 5 ms to minimize.
[2024-05-22 19:20:09] [INFO ] Deduced a trap composed of 367 places in 260 ms of which 6 ms to minimize.
[2024-05-22 19:20:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4085 ms
[2024-05-22 19:20:10] [INFO ] Deduced a trap composed of 332 places in 209 ms of which 4 ms to minimize.
[2024-05-22 19:20:11] [INFO ] Deduced a trap composed of 319 places in 200 ms of which 4 ms to minimize.
[2024-05-22 19:20:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1385 ms
[2024-05-22 19:20:17] [INFO ] Deduced a trap composed of 372 places in 280 ms of which 6 ms to minimize.
[2024-05-22 19:20:17] [INFO ] Deduced a trap composed of 370 places in 271 ms of which 6 ms to minimize.
[2024-05-22 19:20:18] [INFO ] Deduced a trap composed of 350 places in 268 ms of which 5 ms to minimize.
[2024-05-22 19:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 973 ms
[2024-05-22 19:20:22] [INFO ] Deduced a trap composed of 293 places in 196 ms of which 3 ms to minimize.
[2024-05-22 19:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
TRAPS : Iteration 1
[2024-05-22 19:20:33] [INFO ] After 183780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :849
[2024-05-22 19:20:33] [INFO ] After 200016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :849
RANDOM walk for 1813386 steps (261790 resets) in 120004 ms. (15 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (360 resets) in 152 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (351 resets) in 208 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (367 resets) in 169 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (383 resets) in 206 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (366 resets) in 208 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (379 resets) in 144 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (368 resets) in 142 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (382 resets) in 201 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (348 resets) in 171 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (360 resets) in 174 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (352 resets) in 206 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (357 resets) in 170 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (361 resets) in 205 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (361 resets) in 146 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (353 resets) in 213 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (367 resets) in 161 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (367 resets) in 157 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (376 resets) in 174 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (360 resets) in 154 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (358 resets) in 218 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (362 resets) in 179 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (368 resets) in 159 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (372 resets) in 215 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (364 resets) in 175 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (368 resets) in 149 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (350 resets) in 152 ms. (26 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (355 resets) in 207 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (364 resets) in 213 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (367 resets) in 161 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (357 resets) in 192 ms. (20 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (373 resets) in 157 ms. (25 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (362 resets) in 212 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (380 resets) in 166 ms. (23 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (365 resets) in 178 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (376 resets) in 205 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (368 resets) in 197 ms. (20 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (366 resets) in 140 ms. (28 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (341 resets) in 214 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (375 resets) in 162 ms. (24 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (355 resets) in 210 ms. (18 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4002 steps (353 resets) in 143 ms. (27 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (364 resets) in 209 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (386 resets) in 180 ms. (22 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (374 resets) in 202 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (342 resets) in 208 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (362 resets) in 199 ms. (20 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (367 resets) in 141 ms. (28 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4001 steps (365 resets) in 208 ms. (19 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4000 steps (354 resets) in 199 ms. (20 steps per ms) remains 850/850 properties
BEST_FIRST walk for 4003 steps (370 resets) in 166 ms. (23 steps per ms) remains 850/850 properties
Probabilistic random walk after 1000001 steps, saw 500103 distinct states, run finished after 45166 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:21:51] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-22 19:21:51] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/850 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 1 (OVERLAPS) 804/1654 variables, 850/850 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 850 unsolved
At refinement iteration 3 (OVERLAPS) 53/1707 variables, 19/869 constraints. Problems are: Problem set: 0 solved, 850 unsolved
SMT process timed out in 105245ms, After SMT, problems are : Problem set: 0 solved, 850 unsolved
Fused 850 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 850 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Applied a total of 0 rules in 19 ms. Remains 938 /938 variables (removed 0) and now considering 887/887 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 938/938 places, 887/887 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Applied a total of 0 rules in 17 ms. Remains 938 /938 variables (removed 0) and now considering 887/887 (removed 0) transitions.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:23:36] [INFO ] Invariants computation overflowed in 119 ms
[2024-05-22 19:23:36] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:23:36] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-22 19:23:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:23:39] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 3009 ms to find 0 implicit places.
[2024-05-22 19:23:39] [INFO ] Redundant transitions in 9 ms returned []
Running 886 sub problems to find dead transitions.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:23:39] [INFO ] Invariants computation overflowed in 117 ms
[2024-05-22 19:23:39] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 887/1820 variables, 933/933 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1820/1825 variables, and 947 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30035 ms.
Refiners :[State Equation: 933/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 886/886 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 886 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 1 (OVERLAPS) 887/1820 variables, 933/933 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1820 variables, 14/947 constraints. Problems are: Problem set: 0 solved, 886 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1820 variables, 880/1827 constraints. Problems are: Problem set: 0 solved, 886 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1820/1825 variables, and 1827 constraints, problems are : Problem set: 0 solved, 886 unsolved in 30042 ms.
Refiners :[State Equation: 933/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 880/886 constraints, Known Traps: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 886 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63401 ms. Remains : 938/938 places, 887/887 transitions.
RANDOM walk for 400000 steps (57774 resets) in 26879 ms. (14 steps per ms) remains 850/850 properties
Running SMT prover for 850 properties.
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:24:47] [INFO ] Invariants computation overflowed in 118 ms
[2024-05-22 19:24:59] [INFO ] After 11365ms SMT Verify possible using state equation in real domain returned unsat :0 sat :850
[2024-05-22 19:24:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 19:25:11] [INFO ] After 11745ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :850
TRAPS : Iteration 0
SDD proceeding with computation,850 properties remain. new max is 512
SDD size :1.72981e+06 after 1.7879e+07
[2024-05-22 19:26:12] [INFO ] After 73571ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:850
[2024-05-22 19:26:12] [INFO ] After 85438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:850
Detected timeout of ITS tools.
[2024-05-22 19:26:28] [INFO ] After 15420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :850
[2024-05-22 19:27:08] [INFO ] After 39577ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :850
TRAPS : Iteration 0
[2024-05-22 19:27:08] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 5 ms to minimize.
[2024-05-22 19:27:08] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-05-22 19:27:09] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-22 19:27:09] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 4 ms to minimize.
[2024-05-22 19:27:09] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 2 ms to minimize.
[2024-05-22 19:27:09] [INFO ] Deduced a trap composed of 182 places in 108 ms of which 1 ms to minimize.
[2024-05-22 19:27:09] [INFO ] Deduced a trap composed of 189 places in 129 ms of which 2 ms to minimize.
[2024-05-22 19:27:09] [INFO ] Deduced a trap composed of 180 places in 117 ms of which 2 ms to minimize.
[2024-05-22 19:27:10] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 2 ms to minimize.
[2024-05-22 19:27:10] [INFO ] Deduced a trap composed of 170 places in 129 ms of which 2 ms to minimize.
[2024-05-22 19:27:10] [INFO ] Deduced a trap composed of 175 places in 127 ms of which 2 ms to minimize.
[2024-05-22 19:27:10] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 2 ms to minimize.
[2024-05-22 19:27:10] [INFO ] Deduced a trap composed of 199 places in 138 ms of which 3 ms to minimize.
[2024-05-22 19:27:10] [INFO ] Deduced a trap composed of 225 places in 127 ms of which 3 ms to minimize.
[2024-05-22 19:27:11] [INFO ] Deduced a trap composed of 158 places in 123 ms of which 2 ms to minimize.
[2024-05-22 19:27:11] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 2 ms to minimize.
[2024-05-22 19:27:11] [INFO ] Deduced a trap composed of 173 places in 152 ms of which 3 ms to minimize.
[2024-05-22 19:27:11] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
[2024-05-22 19:27:11] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 3 ms to minimize.
[2024-05-22 19:27:11] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 3 ms to minimize.
[2024-05-22 19:27:12] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-22 19:27:12] [INFO ] Deduced a trap composed of 195 places in 166 ms of which 3 ms to minimize.
[2024-05-22 19:27:12] [INFO ] Deduced a trap composed of 222 places in 164 ms of which 3 ms to minimize.
[2024-05-22 19:27:12] [INFO ] Deduced a trap composed of 207 places in 145 ms of which 3 ms to minimize.
[2024-05-22 19:27:12] [INFO ] Deduced a trap composed of 241 places in 150 ms of which 3 ms to minimize.
[2024-05-22 19:27:13] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 3 ms to minimize.
[2024-05-22 19:27:13] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 4 ms to minimize.
[2024-05-22 19:27:13] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 3 ms to minimize.
[2024-05-22 19:27:13] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 4 ms to minimize.
[2024-05-22 19:27:14] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 3 ms to minimize.
[2024-05-22 19:27:14] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 4 ms to minimize.
[2024-05-22 19:27:14] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 4 ms to minimize.
[2024-05-22 19:27:14] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 4 ms to minimize.
[2024-05-22 19:27:15] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 4 ms to minimize.
[2024-05-22 19:27:15] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:27:15] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:27:15] [INFO ] Deduced a trap composed of 192 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:27:15] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 4 ms to minimize.
[2024-05-22 19:27:16] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 4 ms to minimize.
[2024-05-22 19:27:16] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:27:16] [INFO ] Deduced a trap composed of 163 places in 186 ms of which 4 ms to minimize.
[2024-05-22 19:27:16] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 4 ms to minimize.
[2024-05-22 19:27:17] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 4 ms to minimize.
[2024-05-22 19:27:17] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:27:17] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 4 ms to minimize.
[2024-05-22 19:27:17] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 3 ms to minimize.
[2024-05-22 19:27:18] [INFO ] Deduced a trap composed of 230 places in 179 ms of which 3 ms to minimize.
[2024-05-22 19:27:18] [INFO ] Deduced a trap composed of 213 places in 180 ms of which 4 ms to minimize.
[2024-05-22 19:27:18] [INFO ] Deduced a trap composed of 244 places in 182 ms of which 4 ms to minimize.
[2024-05-22 19:27:18] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 4 ms to minimize.
[2024-05-22 19:27:19] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 4 ms to minimize.
[2024-05-22 19:27:19] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-22 19:27:19] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 3 ms to minimize.
[2024-05-22 19:27:20] [INFO ] Deduced a trap composed of 213 places in 126 ms of which 2 ms to minimize.
[2024-05-22 19:27:20] [INFO ] Deduced a trap composed of 162 places in 118 ms of which 2 ms to minimize.
[2024-05-22 19:27:22] [INFO ] Deduced a trap composed of 171 places in 153 ms of which 3 ms to minimize.
[2024-05-22 19:27:22] [INFO ] Deduced a trap composed of 193 places in 152 ms of which 3 ms to minimize.
[2024-05-22 19:27:23] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 3 ms to minimize.
[2024-05-22 19:27:23] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 3 ms to minimize.
[2024-05-22 19:27:23] [INFO ] Deduced a trap composed of 183 places in 146 ms of which 3 ms to minimize.
[2024-05-22 19:27:24] [INFO ] Deduced a trap composed of 199 places in 123 ms of which 2 ms to minimize.
[2024-05-22 19:27:25] [INFO ] Deduced a trap composed of 185 places in 127 ms of which 2 ms to minimize.
[2024-05-22 19:27:28] [INFO ] Deduced a trap composed of 159 places in 127 ms of which 2 ms to minimize.
[2024-05-22 19:27:28] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 3 ms to minimize.
[2024-05-22 19:27:29] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 3 ms to minimize.
[2024-05-22 19:27:29] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 2 ms to minimize.
[2024-05-22 19:27:29] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 3 ms to minimize.
[2024-05-22 19:27:31] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 4 ms to minimize.
[2024-05-22 19:27:33] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-05-22 19:27:37] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 4 ms to minimize.
[2024-05-22 19:27:38] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 5 ms to minimize.
[2024-05-22 19:27:38] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 4 ms to minimize.
[2024-05-22 19:27:38] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 4 ms to minimize.
[2024-05-22 19:27:39] [INFO ] Deduced a trap composed of 103 places in 191 ms of which 4 ms to minimize.
[2024-05-22 19:27:39] [INFO ] Deduced a trap composed of 316 places in 184 ms of which 4 ms to minimize.
[2024-05-22 19:27:39] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 4 ms to minimize.
[2024-05-22 19:27:39] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 4 ms to minimize.
[2024-05-22 19:27:39] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 31428 ms
[2024-05-22 19:27:43] [INFO ] Deduced a trap composed of 186 places in 129 ms of which 3 ms to minimize.
[2024-05-22 19:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-05-22 19:27:44] [INFO ] Deduced a trap composed of 200 places in 103 ms of which 2 ms to minimize.
[2024-05-22 19:27:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-22 19:27:44] [INFO ] Deduced a trap composed of 206 places in 101 ms of which 1 ms to minimize.
[2024-05-22 19:27:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-05-22 19:27:46] [INFO ] Deduced a trap composed of 454 places in 250 ms of which 5 ms to minimize.
[2024-05-22 19:27:47] [INFO ] Deduced a trap composed of 456 places in 241 ms of which 5 ms to minimize.
[2024-05-22 19:27:47] [INFO ] Deduced a trap composed of 388 places in 248 ms of which 5 ms to minimize.
[2024-05-22 19:27:47] [INFO ] Deduced a trap composed of 397 places in 247 ms of which 5 ms to minimize.
[2024-05-22 19:27:48] [INFO ] Deduced a trap composed of 244 places in 241 ms of which 5 ms to minimize.
[2024-05-22 19:27:48] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 5 ms to minimize.
[2024-05-22 19:27:48] [INFO ] Deduced a trap composed of 442 places in 240 ms of which 5 ms to minimize.
[2024-05-22 19:27:48] [INFO ] Deduced a trap composed of 352 places in 240 ms of which 5 ms to minimize.
[2024-05-22 19:27:49] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 5 ms to minimize.
[2024-05-22 19:27:49] [INFO ] Deduced a trap composed of 471 places in 243 ms of which 5 ms to minimize.
[2024-05-22 19:27:49] [INFO ] Deduced a trap composed of 471 places in 237 ms of which 5 ms to minimize.
[2024-05-22 19:27:50] [INFO ] Deduced a trap composed of 399 places in 244 ms of which 5 ms to minimize.
[2024-05-22 19:27:50] [INFO ] Deduced a trap composed of 217 places in 238 ms of which 5 ms to minimize.
[2024-05-22 19:27:51] [INFO ] Deduced a trap composed of 394 places in 259 ms of which 5 ms to minimize.
[2024-05-22 19:27:52] [INFO ] Deduced a trap composed of 413 places in 256 ms of which 6 ms to minimize.
[2024-05-22 19:27:52] [INFO ] Deduced a trap composed of 393 places in 264 ms of which 5 ms to minimize.
[2024-05-22 19:27:52] [INFO ] Deduced a trap composed of 299 places in 257 ms of which 5 ms to minimize.
[2024-05-22 19:27:52] [INFO ] Deduced a trap composed of 194 places in 111 ms of which 1 ms to minimize.
[2024-05-22 19:27:55] [INFO ] Deduced a trap composed of 358 places in 250 ms of which 6 ms to minimize.
[2024-05-22 19:27:56] [INFO ] Deduced a trap composed of 281 places in 252 ms of which 5 ms to minimize.
[2024-05-22 19:27:56] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 10129 ms
[2024-05-22 19:28:01] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 5 ms to minimize.
[2024-05-22 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2024-05-22 19:28:03] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 5 ms to minimize.
[2024-05-22 19:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2024-05-22 19:28:05] [INFO ] Deduced a trap composed of 331 places in 248 ms of which 4 ms to minimize.
[2024-05-22 19:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2024-05-22 19:28:07] [INFO ] Deduced a trap composed of 311 places in 278 ms of which 6 ms to minimize.
[2024-05-22 19:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2024-05-22 19:28:11] [INFO ] Deduced a trap composed of 312 places in 272 ms of which 5 ms to minimize.
[2024-05-22 19:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2024-05-22 19:28:15] [INFO ] Deduced a trap composed of 320 places in 262 ms of which 4 ms to minimize.
[2024-05-22 19:28:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2024-05-22 19:28:17] [INFO ] Deduced a trap composed of 345 places in 269 ms of which 5 ms to minimize.
[2024-05-22 19:28:17] [INFO ] Deduced a trap composed of 316 places in 281 ms of which 5 ms to minimize.
[2024-05-22 19:28:18] [INFO ] Deduced a trap composed of 364 places in 271 ms of which 5 ms to minimize.
[2024-05-22 19:28:19] [INFO ] Deduced a trap composed of 372 places in 281 ms of which 6 ms to minimize.
[2024-05-22 19:28:19] [INFO ] Deduced a trap composed of 357 places in 272 ms of which 5 ms to minimize.
[2024-05-22 19:28:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2706 ms
[2024-05-22 19:28:26] [INFO ] Deduced a trap composed of 323 places in 226 ms of which 5 ms to minimize.
[2024-05-22 19:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-05-22 19:28:35] [INFO ] Deduced a trap composed of 304 places in 219 ms of which 4 ms to minimize.
[2024-05-22 19:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 859 ms
[2024-05-22 19:28:49] [INFO ] Deduced a trap composed of 269 places in 202 ms of which 3 ms to minimize.
[2024-05-22 19:28:50] [INFO ] Deduced a trap composed of 295 places in 207 ms of which 4 ms to minimize.
[2024-05-22 19:28:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 685 ms
[2024-05-22 19:29:00] [INFO ] Deduced a trap composed of 295 places in 195 ms of which 3 ms to minimize.
[2024-05-22 19:29:00] [INFO ] Deduced a trap composed of 297 places in 195 ms of which 3 ms to minimize.
[2024-05-22 19:29:00] [INFO ] Deduced a trap composed of 289 places in 200 ms of which 6 ms to minimize.
[2024-05-22 19:29:01] [INFO ] Deduced a trap composed of 290 places in 200 ms of which 4 ms to minimize.
[2024-05-22 19:29:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1230 ms
[2024-05-22 19:29:03] [INFO ] Deduced a trap composed of 366 places in 263 ms of which 5 ms to minimize.
[2024-05-22 19:29:03] [INFO ] Deduced a trap composed of 342 places in 265 ms of which 5 ms to minimize.
[2024-05-22 19:29:03] [INFO ] Deduced a trap composed of 349 places in 265 ms of which 5 ms to minimize.
[2024-05-22 19:29:04] [INFO ] Deduced a trap composed of 348 places in 268 ms of which 5 ms to minimize.
[2024-05-22 19:29:04] [INFO ] Deduced a trap composed of 354 places in 262 ms of which 5 ms to minimize.
[2024-05-22 19:29:04] [INFO ] Deduced a trap composed of 346 places in 267 ms of which 6 ms to minimize.
[2024-05-22 19:29:05] [INFO ] Deduced a trap composed of 303 places in 266 ms of which 5 ms to minimize.
[2024-05-22 19:29:05] [INFO ] Deduced a trap composed of 354 places in 267 ms of which 6 ms to minimize.
[2024-05-22 19:29:05] [INFO ] Deduced a trap composed of 349 places in 262 ms of which 5 ms to minimize.
[2024-05-22 19:29:05] [INFO ] Deduced a trap composed of 357 places in 267 ms of which 6 ms to minimize.
[2024-05-22 19:29:06] [INFO ] Deduced a trap composed of 357 places in 268 ms of which 7 ms to minimize.
[2024-05-22 19:29:06] [INFO ] Deduced a trap composed of 312 places in 259 ms of which 5 ms to minimize.
[2024-05-22 19:29:06] [INFO ] Deduced a trap composed of 367 places in 263 ms of which 5 ms to minimize.
[2024-05-22 19:29:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4063 ms
[2024-05-22 19:29:08] [INFO ] Deduced a trap composed of 332 places in 201 ms of which 4 ms to minimize.
[2024-05-22 19:29:08] [INFO ] Deduced a trap composed of 319 places in 199 ms of which 4 ms to minimize.
[2024-05-22 19:29:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1364 ms
[2024-05-22 19:29:14] [INFO ] Deduced a trap composed of 372 places in 262 ms of which 6 ms to minimize.
[2024-05-22 19:29:15] [INFO ] Deduced a trap composed of 370 places in 272 ms of which 6 ms to minimize.
[2024-05-22 19:29:15] [INFO ] Deduced a trap composed of 350 places in 264 ms of which 6 ms to minimize.
[2024-05-22 19:29:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 950 ms
[2024-05-22 19:29:19] [INFO ] Deduced a trap composed of 293 places in 193 ms of which 3 ms to minimize.
[2024-05-22 19:29:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
TRAPS : Iteration 1
[2024-05-22 19:29:32] [INFO ] After 184075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :849 real:1
[2024-05-22 19:29:32] [INFO ] After 200034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :849 real:1
RANDOM walk for 40000 steps (5770 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3673 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 265439 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 265439 steps, saw 132746 distinct states, run finished after 3007 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:29:36] [INFO ] Invariants computation overflowed in 116 ms
[2024-05-22 19:29:36] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/22 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/64 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/121 variables, 28/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/177 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 90/267 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 70/337 variables, 41/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/403 variables, 33/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 82/485 variables, 45/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/537 variables, 28/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/537 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 59/596 variables, 32/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/596 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 47/643 variables, 24/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/643 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 56/699 variables, 29/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/699 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 47/746 variables, 24/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/746 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 56/802 variables, 29/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/802 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 47/849 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/849 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 56/905 variables, 29/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/905 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 47/952 variables, 24/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/952 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 56/1008 variables, 29/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1008 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 47/1055 variables, 24/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1055 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 56/1111 variables, 29/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1111 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 47/1158 variables, 24/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1158 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 56/1214 variables, 29/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1214 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 47/1261 variables, 24/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1261 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 56/1317 variables, 29/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1317 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 47/1364 variables, 24/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1364 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 56/1420 variables, 29/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1420 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 47/1467 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1467 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 56/1523 variables, 29/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1523 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 48/1571 variables, 24/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1571 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 76/1647 variables, 34/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1647 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1647 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 84/1731 variables, 43/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1731 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1731 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 76/1807 variables, 40/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1807 variables, 8/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1807 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 18/1825 variables, 17/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1825 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 0/1825 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1825/1825 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 909 ms.
Refiners :[State Equation: 938/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/22 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/64 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/121 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/177 variables, 28/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/267 variables, 41/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/337 variables, 41/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 66/403 variables, 33/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 82/485 variables, 45/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/485 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/537 variables, 28/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/537 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 59/596 variables, 32/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/596 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 47/643 variables, 24/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/643 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 56/699 variables, 29/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/699 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 47/746 variables, 24/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/746 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 56/802 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/802 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 47/849 variables, 24/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/849 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 56/905 variables, 29/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/905 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 47/952 variables, 24/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/952 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 56/1008 variables, 29/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1008 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 47/1055 variables, 24/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1055 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 56/1111 variables, 29/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1111 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 47/1158 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1158 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 56/1214 variables, 29/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1214 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 47/1261 variables, 24/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1261 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 56/1317 variables, 29/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1317 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 47/1364 variables, 24/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1364 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 56/1420 variables, 29/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1420 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 47/1467 variables, 24/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1467 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 56/1523 variables, 29/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1523 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 48/1571 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1571 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 76/1647 variables, 34/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1647 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1647 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1825 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1954 ms.
Refiners :[State Equation: 881/938 constraints, ReadFeed: 2/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2990ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Graph (complete) has 1812 edges and 938 vertex of which 932 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 931 transition count 692
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 391 place count 738 transition count 691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 737 transition count 691
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 392 place count 737 transition count 659
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 456 place count 705 transition count 659
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 746 place count 560 transition count 514
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 806 place count 530 transition count 514
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 3 with 65 rules applied. Total rules applied 871 place count 530 transition count 449
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 936 place count 465 transition count 449
Partial Free-agglomeration rule applied 64 times.
Drop transitions (Partial Free agglomeration) removed 64 transitions
Iterating global reduction 4 with 64 rules applied. Total rules applied 1000 place count 465 transition count 449
Applied a total of 1000 rules in 104 ms. Remains 465 /938 variables (removed 473) and now considering 449/887 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 465/938 places, 449/887 transitions.
RANDOM walk for 40000 steps (5781 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3682 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 429972 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 429972 steps, saw 215026 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 449 rows 465 cols
[2024-05-22 19:29:42] [INFO ] Computed 93 invariants in 82 ms
[2024-05-22 19:29:42] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/388 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/461 variables, 28/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 449/910 variables, 461/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 78/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/910 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/914 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 2/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/914 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/914 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 914/914 variables, and 636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 465/465 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/388 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:29:43] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:29:43] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 3 ms to minimize.
[2024-05-22 19:29:43] [INFO ] Deduced a trap composed of 144 places in 197 ms of which 2 ms to minimize.
[2024-05-22 19:29:43] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:29:44] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:29:44] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:29:44] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:44] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 3 ms to minimize.
[2024-05-22 19:29:44] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:44] [INFO ] Deduced a trap composed of 169 places in 190 ms of which 3 ms to minimize.
[2024-05-22 19:29:45] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:29:45] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 2 ms to minimize.
[2024-05-22 19:29:45] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:29:45] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:29:45] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:29:46] [INFO ] Deduced a trap composed of 159 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:29:46] [INFO ] Deduced a trap composed of 177 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:29:46] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:29:46] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:29:46] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:29:47] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:29:47] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:47] [INFO ] Deduced a trap composed of 161 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:29:47] [INFO ] Deduced a trap composed of 136 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:29:47] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:29:48] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:29:48] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 3 ms to minimize.
[2024-05-22 19:29:48] [INFO ] Deduced a trap composed of 149 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:29:48] [INFO ] Deduced a trap composed of 133 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:29:48] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 3 ms to minimize.
[2024-05-22 19:29:49] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 2 ms to minimize.
[2024-05-22 19:29:49] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:29:49] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:29:49] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:29:49] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:29:50] [INFO ] Deduced a trap composed of 170 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:29:50] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:29:50] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:29:50] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:29:50] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:29:51] [INFO ] Deduced a trap composed of 121 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:29:51] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 2 ms to minimize.
[2024-05-22 19:29:51] [INFO ] Deduced a trap composed of 165 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:51] [INFO ] Deduced a trap composed of 166 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:29:51] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:29:52] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:29:52] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:29:52] [INFO ] Deduced a trap composed of 165 places in 188 ms of which 3 ms to minimize.
[2024-05-22 19:29:52] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:52] [INFO ] Deduced a trap composed of 136 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:29:53] [INFO ] Deduced a trap composed of 161 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:29:53] [INFO ] Deduced a trap composed of 153 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:29:53] [INFO ] Deduced a trap composed of 154 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:29:53] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:29:53] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 3 ms to minimize.
[2024-05-22 19:29:54] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:29:54] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:29:54] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:29:54] [INFO ] Deduced a trap composed of 157 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:29:54] [INFO ] Deduced a trap composed of 170 places in 176 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:29:54] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:29:55] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 2 ms to minimize.
[2024-05-22 19:29:55] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:55] [INFO ] Deduced a trap composed of 174 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:29:55] [INFO ] Deduced a trap composed of 139 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:29:55] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:29:56] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:29:56] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-22 19:29:56] [INFO ] Deduced a trap composed of 168 places in 176 ms of which 2 ms to minimize.
[2024-05-22 19:29:56] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:29:56] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:29:57] [INFO ] Deduced a trap composed of 176 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:29:57] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:29:57] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:29:57] [INFO ] Deduced a trap composed of 130 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:29:57] [INFO ] Deduced a trap composed of 171 places in 177 ms of which 3 ms to minimize.
[2024-05-22 19:29:58] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:29:58] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 2 ms to minimize.
[2024-05-22 19:29:58] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 3 ms to minimize.
[2024-05-22 19:29:58] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:29:58] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:29:59] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:29:59] [INFO ] Deduced a trap composed of 134 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:29:59] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:29:59] [INFO ] Deduced a trap composed of 130 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:29:59] [INFO ] Deduced a trap composed of 135 places in 177 ms of which 2 ms to minimize.
[2024-05-22 19:29:59] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 3 ms to minimize.
[2024-05-22 19:30:00] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:30:00] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 3 ms to minimize.
[2024-05-22 19:30:00] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:30:00] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:30:00] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:30:01] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:30:01] [INFO ] Deduced a trap composed of 151 places in 190 ms of which 3 ms to minimize.
[2024-05-22 19:30:01] [INFO ] Deduced a trap composed of 170 places in 188 ms of which 3 ms to minimize.
[2024-05-22 19:30:01] [INFO ] Deduced a trap composed of 170 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:30:01] [INFO ] Deduced a trap composed of 174 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:30:02] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:30:02] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:30:02] [INFO ] Deduced a trap composed of 135 places in 190 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:02] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:30:02] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:30:03] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:30:03] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:30:03] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:30:03] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:30:03] [INFO ] Deduced a trap composed of 180 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:30:04] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:30:04] [INFO ] Deduced a trap composed of 168 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:30:04] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:04] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:04] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 3 ms to minimize.
[2024-05-22 19:30:05] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:05] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:30:05] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:30:05] [INFO ] Deduced a trap composed of 176 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:05] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:06] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:30:06] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:06] [INFO ] Deduced a trap composed of 134 places in 182 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:06] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:30:06] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 2 ms to minimize.
[2024-05-22 19:30:06] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:07] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 2 ms to minimize.
[2024-05-22 19:30:07] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 4 ms to minimize.
[2024-05-22 19:30:07] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:30:07] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:07] [INFO ] Deduced a trap composed of 169 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:30:08] [INFO ] Deduced a trap composed of 169 places in 178 ms of which 3 ms to minimize.
[2024-05-22 19:30:08] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:08] [INFO ] Deduced a trap composed of 142 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:08] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:09] [INFO ] Deduced a trap composed of 145 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:30:09] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:30:09] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:30:09] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:30:10] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:10] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:30:10] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:30:10] [INFO ] Deduced a trap composed of 171 places in 189 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:10] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:30:11] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 3 ms to minimize.
[2024-05-22 19:30:11] [INFO ] Deduced a trap composed of 165 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:30:11] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:11] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:30:11] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:12] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:12] [INFO ] Deduced a trap composed of 141 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:30:12] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:30:12] [INFO ] Deduced a trap composed of 139 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:12] [INFO ] Deduced a trap composed of 143 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:30:13] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:30:13] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:30:13] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:13] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:30:13] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:14] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:30:14] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:30:14] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:14] [INFO ] Deduced a trap composed of 169 places in 181 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:14] [INFO ] Deduced a trap composed of 161 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:15] [INFO ] Deduced a trap composed of 146 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 159 places in 193 ms of which 2 ms to minimize.
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 163 places in 191 ms of which 3 ms to minimize.
[2024-05-22 19:30:16] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:30:17] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:30:17] [INFO ] Deduced a trap composed of 142 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:30:17] [INFO ] Deduced a trap composed of 171 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:30:17] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:30:17] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:30:18] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:18] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:30:18] [INFO ] Deduced a trap composed of 167 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:18] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:18] [INFO ] Deduced a trap composed of 161 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:19] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:30:19] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 3 ms to minimize.
[2024-05-22 19:30:19] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:30:19] [INFO ] Deduced a trap composed of 165 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:30:19] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 147 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 3 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 2 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 2 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 2 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 151 places in 172 ms of which 3 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 2 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 146 places in 169 ms of which 3 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 2 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 165 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 177 places in 186 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 2 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 167 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 173 places in 174 ms of which 2 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 2 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 177 places in 184 ms of which 3 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 2 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 173 places in 173 ms of which 3 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 148 places in 171 ms of which 2 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 3 ms to minimize.
[2024-05-22 19:30:25] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 2 ms to minimize.
[2024-05-22 19:30:25] [INFO ] Deduced a trap composed of 174 places in 171 ms of which 3 ms to minimize.
[2024-05-22 19:30:25] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 3 ms to minimize.
[2024-05-22 19:30:25] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:30:25] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:30:26] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:30:26] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:30:26] [INFO ] Deduced a trap composed of 172 places in 173 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:30:26] [INFO ] Deduced a trap composed of 174 places in 177 ms of which 2 ms to minimize.
[2024-05-22 19:30:26] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 2 ms to minimize.
[2024-05-22 19:30:27] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 3 ms to minimize.
[2024-05-22 19:30:27] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 2 ms to minimize.
[2024-05-22 19:30:27] [INFO ] Deduced a trap composed of 173 places in 175 ms of which 2 ms to minimize.
[2024-05-22 19:30:27] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 3 ms to minimize.
[2024-05-22 19:30:27] [INFO ] Deduced a trap composed of 173 places in 191 ms of which 2 ms to minimize.
[2024-05-22 19:30:28] [INFO ] Deduced a trap composed of 169 places in 186 ms of which 2 ms to minimize.
SMT process timed out in 45904ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 449/449 transitions.
Applied a total of 0 rules in 18 ms. Remains 465 /465 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 465/465 places, 449/449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 465/465 places, 449/449 transitions.
Applied a total of 0 rules in 10 ms. Remains 465 /465 variables (removed 0) and now considering 449/449 (removed 0) transitions.
[2024-05-22 19:30:28] [INFO ] Invariant cache hit.
[2024-05-22 19:30:29] [INFO ] Implicit Places using invariants in 1094 ms returned [14, 19, 71, 92, 97, 117, 123, 144, 149, 169, 174, 195, 201, 220, 225, 248, 254, 276, 281, 301, 306, 327, 332, 353, 359, 380, 385, 405, 411, 433, 438, 457, 463]
[2024-05-22 19:30:29] [INFO ] Actually due to overlaps returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1099 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/465 places, 449/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 448
Applied a total of 2 rules in 32 ms. Remains 463 /464 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 463 cols
[2024-05-22 19:30:29] [INFO ] Computed 92 invariants in 96 ms
[2024-05-22 19:30:30] [INFO ] Implicit Places using invariants in 1071 ms returned [14, 19, 90, 95, 115, 121, 142, 147, 167, 172, 193, 199, 218, 223, 246, 252, 274, 279, 299, 304, 325, 330, 351, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 19:30:30] [INFO ] Actually due to overlaps returned [95, 90]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1076 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/465 places, 448/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 447
Applied a total of 2 rules in 25 ms. Remains 460 /461 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 460 cols
[2024-05-22 19:30:30] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:30:30] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 447 rows 460 cols
[2024-05-22 19:30:30] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:30:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:30:39] [INFO ] Implicit Places using invariants and state equation in 8960 ms returned [14, 19, 112, 118, 139, 144, 164, 169, 190, 196, 215, 220, 243, 249, 271, 276, 296, 301, 322, 327, 348, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 19:30:39] [INFO ] Actually due to overlaps returned [118, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9351 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 458/465 places, 447/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 446
Applied a total of 2 rules in 17 ms. Remains 457 /458 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 457 cols
[2024-05-22 19:30:39] [INFO ] Invariants computation overflowed in 84 ms
[2024-05-22 19:30:40] [INFO ] Implicit Places using invariants in 429 ms returned []
// Phase 1: matrix 446 rows 457 cols
[2024-05-22 19:30:40] [INFO ] Invariants computation overflowed in 74 ms
[2024-05-22 19:30:40] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:30:49] [INFO ] Implicit Places using invariants and state equation in 9693 ms returned [14, 19, 136, 141, 161, 166, 187, 193, 212, 217, 240, 246, 268, 273, 293, 298, 319, 324, 345, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 19:30:49] [INFO ] Actually due to overlaps returned [141, 136]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10126 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 455/465 places, 446/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 445
Applied a total of 2 rules in 24 ms. Remains 454 /455 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 454 cols
[2024-05-22 19:30:49] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 19:30:50] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 445 rows 454 cols
[2024-05-22 19:30:50] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 19:30:50] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:06] [INFO ] Implicit Places using invariants and state equation in 16772 ms returned [14, 19, 158, 163, 184, 190, 209, 214, 237, 243, 265, 270, 290, 295, 316, 321, 342, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 19:31:07] [INFO ] Actually due to overlaps returned [163, 158]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17139 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/465 places, 445/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 444
Applied a total of 2 rules in 19 ms. Remains 451 /452 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 451 cols
[2024-05-22 19:31:07] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 19:31:07] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 444 rows 451 cols
[2024-05-22 19:31:07] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 19:31:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:15] [INFO ] Implicit Places using invariants and state equation in 8015 ms returned [14, 19, 181, 187, 206, 211, 234, 240, 262, 267, 287, 292, 313, 318, 339, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 19:31:15] [INFO ] Actually due to overlaps returned [187, 181]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8371 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 449/465 places, 444/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 443
Applied a total of 2 rules in 17 ms. Remains 448 /449 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 448 cols
[2024-05-22 19:31:15] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:31:15] [INFO ] Implicit Places using invariants in 342 ms returned []
// Phase 1: matrix 443 rows 448 cols
[2024-05-22 19:31:15] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:31:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:24] [INFO ] Implicit Places using invariants and state equation in 8665 ms returned [14, 19, 203, 208, 231, 237, 259, 264, 284, 289, 310, 315, 336, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 19:31:24] [INFO ] Actually due to overlaps returned [208, 203]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9008 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 446/465 places, 443/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 442
Applied a total of 2 rules in 17 ms. Remains 445 /446 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 445 cols
[2024-05-22 19:31:24] [INFO ] Computed 80 invariants in 72 ms
[2024-05-22 19:31:25] [INFO ] Implicit Places using invariants in 661 ms returned [14, 19, 228, 234, 256, 261, 281, 286, 307, 312, 333, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 19:31:25] [INFO ] Actually due to overlaps returned [234, 228]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 662 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 443/465 places, 442/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 441
Applied a total of 2 rules in 16 ms. Remains 442 /443 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 442 cols
[2024-05-22 19:31:25] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:31:25] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 441 rows 442 cols
[2024-05-22 19:31:25] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 19:31:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:30] [INFO ] Implicit Places using invariants and state equation in 5540 ms returned [14, 19, 253, 258, 278, 283, 304, 309, 330, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 19:31:30] [INFO ] Actually due to overlaps returned [258, 253]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5861 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 440/465 places, 441/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 440
Applied a total of 2 rules in 24 ms. Remains 439 /440 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 439 cols
[2024-05-22 19:31:31] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 19:31:31] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 440 rows 439 cols
[2024-05-22 19:31:31] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 19:31:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:38] [INFO ] Implicit Places using invariants and state equation in 7258 ms returned [14, 19, 275, 280, 301, 306, 327, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 19:31:38] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7593 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 437/465 places, 440/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 439
Applied a total of 2 rules in 16 ms. Remains 436 /437 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 436 cols
[2024-05-22 19:31:38] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 19:31:38] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 439 rows 436 cols
[2024-05-22 19:31:38] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 19:31:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:46] [INFO ] Implicit Places using invariants and state equation in 7160 ms returned [14, 19, 298, 303, 324, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 19:31:46] [INFO ] Actually due to overlaps returned [303, 298]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7473 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 434/465 places, 439/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 438
Applied a total of 2 rules in 19 ms. Remains 433 /434 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 433 cols
[2024-05-22 19:31:46] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:31:46] [INFO ] Implicit Places using invariants in 306 ms returned []
// Phase 1: matrix 438 rows 433 cols
[2024-05-22 19:31:46] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:31:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:53] [INFO ] Implicit Places using invariants and state equation in 7129 ms returned [14, 19, 321, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 19:31:53] [INFO ] Actually due to overlaps returned [327, 321]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7437 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 431/465 places, 438/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 437
Applied a total of 2 rules in 16 ms. Remains 430 /431 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 430 cols
[2024-05-22 19:31:53] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 19:31:53] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 437 rows 430 cols
[2024-05-22 19:31:53] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:31:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:31:59] [INFO ] Implicit Places using invariants and state equation in 6098 ms returned [14, 19, 345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-22 19:31:59] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6387 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 428/465 places, 437/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 436
Applied a total of 2 rules in 15 ms. Remains 427 /428 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 427 cols
[2024-05-22 19:31:59] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 19:32:00] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 436 rows 427 cols
[2024-05-22 19:32:00] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 19:32:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:32:05] [INFO ] Implicit Places using invariants and state equation in 5355 ms returned [14, 19, 367, 373, 395, 400, 419, 425]
[2024-05-22 19:32:05] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5643 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 425/465 places, 436/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 435
Applied a total of 2 rules in 22 ms. Remains 424 /425 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 424 cols
[2024-05-22 19:32:05] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 19:32:05] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 435 rows 424 cols
[2024-05-22 19:32:05] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 19:32:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:32:12] [INFO ] Implicit Places using invariants and state equation in 6887 ms returned [14, 19, 392, 397, 416, 422]
[2024-05-22 19:32:12] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7167 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 422/465 places, 435/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 434
Applied a total of 2 rules in 15 ms. Remains 421 /422 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 421 cols
[2024-05-22 19:32:12] [INFO ] Computed 64 invariants in 61 ms
[2024-05-22 19:32:13] [INFO ] Implicit Places using invariants in 419 ms returned [14, 19, 413, 419]
[2024-05-22 19:32:13] [INFO ] Actually due to overlaps returned [413, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 420 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 419/465 places, 434/449 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 433
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 418 transition count 433
Applied a total of 3 rules in 23 ms. Remains 418 /419 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 19:32:13] [INFO ] Computed 62 invariants in 55 ms
[2024-05-22 19:32:13] [INFO ] Implicit Places using invariants in 412 ms returned [416]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 417/465 places, 433/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 417 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 416 transition count 432
Applied a total of 2 rules in 17 ms. Remains 416 /417 variables (removed 1) and now considering 432/433 (removed 1) transitions.
// Phase 1: matrix 432 rows 416 cols
[2024-05-22 19:32:13] [INFO ] Computed 61 invariants in 55 ms
[2024-05-22 19:32:14] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-22 19:32:14] [INFO ] Invariant cache hit.
[2024-05-22 19:32:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:32:18] [INFO ] Implicit Places using invariants and state equation in 4503 ms returned []
Implicit Place search using SMT with State Equation took 4906 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 416/465 places, 432/449 transitions.
Finished structural reductions in REACHABILITY mode , in 18 iterations and 110482 ms. Remains : 416/465 places, 432/449 transitions.
RANDOM walk for 40000 steps (5799 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3637 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 267413 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 267413 steps, saw 133734 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:32:21] [INFO ] Invariants computation overflowed in 123 ms
[2024-05-22 19:32:21] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/17 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/49 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 56/105 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/178 variables, 37/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 85/263 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 66/329 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/394 variables, 35/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/394 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/455 variables, 31/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/455 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 51/506 variables, 31/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/506 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 37/543 variables, 18/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/543 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 56/599 variables, 29/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/599 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 44/643 variables, 22/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/643 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 56/699 variables, 29/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/699 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 47/746 variables, 24/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/746 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 56/802 variables, 29/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/802 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 47/849 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/849 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 56/905 variables, 29/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/905 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 47/952 variables, 24/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/952 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 56/1008 variables, 29/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1008 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 47/1055 variables, 24/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1055 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 56/1111 variables, 29/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1111 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 47/1158 variables, 24/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1158 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 56/1214 variables, 29/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1214 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 47/1261 variables, 24/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1261 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 56/1317 variables, 29/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1317 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 47/1364 variables, 24/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1364 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 56/1420 variables, 29/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1420 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 47/1467 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1467 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 56/1523 variables, 29/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1523 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 48/1571 variables, 24/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1571 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 76/1647 variables, 34/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1647 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1647 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 84/1731 variables, 43/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1731 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1731 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 76/1807 variables, 40/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1807 variables, 8/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1807 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 18/1825 variables, 17/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1825 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 0/1825 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1825/1825 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 869 ms.
Refiners :[State Equation: 938/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/17 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/49 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/105 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 73/178 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/178 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 85/263 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 66/329 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 65/394 variables, 35/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/394 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 61/455 variables, 31/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/455 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 51/506 variables, 31/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/506 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 37/543 variables, 18/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/543 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 56/599 variables, 29/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/599 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/643 variables, 22/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/643 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 56/699 variables, 29/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/699 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 47/746 variables, 24/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/746 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 56/802 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/802 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 47/849 variables, 24/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/849 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 56/905 variables, 29/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/905 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 47/952 variables, 24/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/952 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 56/1008 variables, 29/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1008 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 47/1055 variables, 24/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1055 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 56/1111 variables, 29/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1111 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 47/1158 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1158 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 56/1214 variables, 29/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1214 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 47/1261 variables, 24/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1261 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 56/1317 variables, 29/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1317 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 47/1364 variables, 24/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1364 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 56/1420 variables, 29/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1420 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 47/1467 variables, 24/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1467 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 56/1523 variables, 29/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1523 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 48/1571 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1571 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 76/1647 variables, 34/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1647 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1647 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1825 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1735 ms.
Refiners :[State Equation: 881/938 constraints, ReadFeed: 2/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2740ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Graph (complete) has 1812 edges and 938 vertex of which 932 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 197 rules applied. Total rules applied 198 place count 931 transition count 691
Reduce places removed 194 places and 0 transitions.
Iterating post reduction 1 with 194 rules applied. Total rules applied 392 place count 737 transition count 691
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 392 place count 737 transition count 659
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 456 place count 705 transition count 659
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 290 rules applied. Total rules applied 746 place count 560 transition count 514
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 806 place count 530 transition count 514
Free-agglomeration rule (complex) applied 64 times.
Iterating global reduction 2 with 64 rules applied. Total rules applied 870 place count 530 transition count 450
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 934 place count 466 transition count 450
Partial Free-agglomeration rule applied 65 times.
Drop transitions (Partial Free agglomeration) removed 65 transitions
Iterating global reduction 3 with 65 rules applied. Total rules applied 999 place count 466 transition count 450
Applied a total of 999 rules in 82 ms. Remains 466 /938 variables (removed 472) and now considering 450/887 (removed 437) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 466/938 places, 450/887 transitions.
RANDOM walk for 40000 steps (5758 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3607 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 431923 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 431923 steps, saw 216002 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 19:32:27] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:32:27] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 215/239 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 510/749 variables, 267/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 41/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 167/916 variables, 135/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 29/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/916 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 916/916 variables, and 544 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[State Equation: 466/466 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/239 variables, 57/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 510/749 variables, 267/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 41/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/749 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 167/916 variables, 135/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 29/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-22 19:32:29] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-22 19:32:30] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2024-05-22 19:32:30] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:32:30] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-22 19:32:30] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-22 19:32:30] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/916 variables, 14/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/916 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/916 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 916/916 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2687 ms.
Refiners :[State Equation: 466/466 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 3064ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30004 ms.
Support contains 1 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 450/450 transitions.
Applied a total of 0 rules in 9 ms. Remains 466 /466 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 466/466 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 450/450 transitions.
Applied a total of 0 rules in 8 ms. Remains 466 /466 variables (removed 0) and now considering 450/450 (removed 0) transitions.
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 19:33:00] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 19:33:01] [INFO ] Implicit Places using invariants in 425 ms returned []
// Phase 1: matrix 450 rows 466 cols
[2024-05-22 19:33:01] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:33:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:33:10] [INFO ] Implicit Places using invariants and state equation in 9769 ms returned [15, 20, 72, 93, 98, 118, 124, 145, 150, 170, 175, 196, 202, 221, 226, 249, 255, 277, 282, 302, 307, 328, 333, 354, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 19:33:10] [INFO ] Actually due to overlaps returned [72]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10195 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 465/466 places, 450/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 465 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 464 transition count 449
Applied a total of 2 rules in 17 ms. Remains 464 /465 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 464 cols
[2024-05-22 19:33:10] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 19:33:11] [INFO ] Implicit Places using invariants in 409 ms returned []
// Phase 1: matrix 449 rows 464 cols
[2024-05-22 19:33:11] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:33:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:33:24] [INFO ] Implicit Places using invariants and state equation in 13548 ms returned [15, 20, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 358, 379, 384, 404, 410, 432, 437, 456, 462]
[2024-05-22 19:33:24] [INFO ] Actually due to overlaps returned [96, 91]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13959 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 462/466 places, 449/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 461 transition count 448
Applied a total of 2 rules in 21 ms. Remains 461 /462 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 461 cols
[2024-05-22 19:33:24] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 19:33:25] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 448 rows 461 cols
[2024-05-22 19:33:25] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 19:33:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:33:35] [INFO ] Implicit Places using invariants and state equation in 10094 ms returned [15, 20, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 355, 376, 381, 401, 407, 429, 434, 453, 459]
[2024-05-22 19:33:35] [INFO ] Actually due to overlaps returned [119, 113]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10492 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 459/466 places, 448/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 459 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 458 transition count 447
Applied a total of 2 rules in 17 ms. Remains 458 /459 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 458 cols
[2024-05-22 19:33:35] [INFO ] Computed 88 invariants in 61 ms
[2024-05-22 19:33:36] [INFO ] Implicit Places using invariants in 912 ms returned [15, 20, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 352, 373, 378, 398, 404, 426, 431, 450, 456]
[2024-05-22 19:33:36] [INFO ] Actually due to overlaps returned [142, 137]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 913 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 456/466 places, 447/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 456 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 455 transition count 446
Applied a total of 2 rules in 18 ms. Remains 455 /456 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 455 cols
[2024-05-22 19:33:36] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:33:36] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 446 rows 455 cols
[2024-05-22 19:33:36] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 19:33:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:33:44] [INFO ] Implicit Places using invariants and state equation in 7992 ms returned [15, 20, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 349, 370, 375, 395, 401, 423, 428, 447, 453]
[2024-05-22 19:33:44] [INFO ] Actually due to overlaps returned [164, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8351 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 453/466 places, 446/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 445
Applied a total of 2 rules in 21 ms. Remains 452 /453 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 452 cols
[2024-05-22 19:33:44] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:33:44] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 445 rows 452 cols
[2024-05-22 19:33:45] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 19:33:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:33:51] [INFO ] Implicit Places using invariants and state equation in 6484 ms returned [15, 20, 182, 188, 207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 346, 367, 372, 392, 398, 420, 425, 444, 450]
[2024-05-22 19:33:51] [INFO ] Actually due to overlaps returned [188, 182]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6838 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 450/466 places, 445/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 444
Applied a total of 2 rules in 17 ms. Remains 449 /450 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 449 cols
[2024-05-22 19:33:51] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:33:51] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 444 rows 449 cols
[2024-05-22 19:33:51] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:33:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:33:58] [INFO ] Implicit Places using invariants and state equation in 6653 ms returned [15, 20, 204, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 343, 364, 369, 389, 395, 417, 422, 441, 447]
[2024-05-22 19:33:58] [INFO ] Actually due to overlaps returned [209, 204]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6997 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 447/466 places, 444/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 447 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 446 transition count 443
Applied a total of 2 rules in 17 ms. Remains 446 /447 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 446 cols
[2024-05-22 19:33:58] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 19:33:58] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 443 rows 446 cols
[2024-05-22 19:33:58] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 19:33:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:11] [INFO ] Implicit Places using invariants and state equation in 13036 ms returned [15, 20, 229, 235, 257, 262, 282, 287, 308, 313, 334, 340, 361, 366, 386, 392, 414, 419, 438, 444]
[2024-05-22 19:34:11] [INFO ] Actually due to overlaps returned [235, 229]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13374 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 444/466 places, 443/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 443 transition count 442
Applied a total of 2 rules in 16 ms. Remains 443 /444 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 443 cols
[2024-05-22 19:34:11] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 19:34:12] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 442 rows 443 cols
[2024-05-22 19:34:12] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:34:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:19] [INFO ] Implicit Places using invariants and state equation in 7005 ms returned [15, 20, 254, 259, 279, 284, 305, 310, 331, 337, 358, 363, 383, 389, 411, 416, 435, 441]
[2024-05-22 19:34:19] [INFO ] Actually due to overlaps returned [259, 254]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7314 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 441/466 places, 442/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 440 transition count 441
Applied a total of 2 rules in 21 ms. Remains 440 /441 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 440 cols
[2024-05-22 19:34:19] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 19:34:19] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 441 rows 440 cols
[2024-05-22 19:34:19] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:34:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:27] [INFO ] Implicit Places using invariants and state equation in 7480 ms returned [15, 20, 276, 281, 302, 307, 328, 334, 355, 360, 380, 386, 408, 413, 432, 438]
[2024-05-22 19:34:27] [INFO ] Actually due to overlaps returned [281, 276]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7793 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 438/466 places, 441/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 440
Applied a total of 2 rules in 21 ms. Remains 437 /438 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 437 cols
[2024-05-22 19:34:27] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:34:27] [INFO ] Implicit Places using invariants in 309 ms returned []
// Phase 1: matrix 440 rows 437 cols
[2024-05-22 19:34:27] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:34:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:33] [INFO ] Implicit Places using invariants and state equation in 6235 ms returned [15, 20, 299, 304, 325, 331, 352, 357, 377, 383, 405, 410, 429, 435]
[2024-05-22 19:34:33] [INFO ] Actually due to overlaps returned [304, 299]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6547 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 435/466 places, 440/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 435 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 434 transition count 439
Applied a total of 2 rules in 19 ms. Remains 434 /435 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 434 cols
[2024-05-22 19:34:33] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 19:34:33] [INFO ] Implicit Places using invariants in 304 ms returned []
// Phase 1: matrix 439 rows 434 cols
[2024-05-22 19:34:33] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:34:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:41] [INFO ] Implicit Places using invariants and state equation in 7276 ms returned [15, 20, 322, 328, 349, 354, 374, 380, 402, 407, 426, 432]
[2024-05-22 19:34:41] [INFO ] Actually due to overlaps returned [328, 322]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7584 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 432/466 places, 439/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 432 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 431 transition count 438
Applied a total of 2 rules in 15 ms. Remains 431 /432 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 431 cols
[2024-05-22 19:34:41] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:34:41] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 438 rows 431 cols
[2024-05-22 19:34:41] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 19:34:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:47] [INFO ] Implicit Places using invariants and state equation in 5859 ms returned [15, 20, 346, 351, 371, 377, 399, 404, 423, 429]
[2024-05-22 19:34:47] [INFO ] Actually due to overlaps returned [351, 346]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6159 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 429/466 places, 438/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 428 transition count 437
Applied a total of 2 rules in 23 ms. Remains 428 /429 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 428 cols
[2024-05-22 19:34:47] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:34:47] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 437 rows 428 cols
[2024-05-22 19:34:47] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 19:34:47] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:53] [INFO ] Implicit Places using invariants and state equation in 5869 ms returned [15, 20, 368, 374, 396, 401, 420, 426]
[2024-05-22 19:34:53] [INFO ] Actually due to overlaps returned [374, 368]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6162 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 426/466 places, 437/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 426 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 436
Applied a total of 2 rules in 22 ms. Remains 425 /426 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 425 cols
[2024-05-22 19:34:53] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 19:34:53] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 436 rows 425 cols
[2024-05-22 19:34:53] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 19:34:54] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:34:59] [INFO ] Implicit Places using invariants and state equation in 5653 ms returned [15, 20, 393, 398, 417, 423]
[2024-05-22 19:34:59] [INFO ] Actually due to overlaps returned [398, 393]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5932 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 423/466 places, 436/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 423 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 422 transition count 435
Applied a total of 2 rules in 19 ms. Remains 422 /423 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 422 cols
[2024-05-22 19:34:59] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 19:34:59] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 435 rows 422 cols
[2024-05-22 19:34:59] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:35:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:35:06] [INFO ] Implicit Places using invariants and state equation in 6483 ms returned [15, 20, 414, 420]
[2024-05-22 19:35:06] [INFO ] Actually due to overlaps returned [414, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6755 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 420/466 places, 435/450 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 419 transition count 434
Applied a total of 3 rules in 17 ms. Remains 419 /420 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 419 cols
[2024-05-22 19:35:06] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 19:35:06] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 434 rows 419 cols
[2024-05-22 19:35:06] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 19:35:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:35:12] [INFO ] Implicit Places using invariants and state equation in 5513 ms returned [417]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5781 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 418/466 places, 434/450 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 418 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 417 transition count 433
Applied a total of 2 rules in 15 ms. Remains 417 /418 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 417 cols
[2024-05-22 19:35:12] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 19:35:12] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 433 rows 417 cols
[2024-05-22 19:35:12] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 19:35:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 19:35:31] [INFO ] Implicit Places using invariants and state equation in 19405 ms returned []
Implicit Place search using SMT with State Equation took 19687 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 417/466 places, 433/450 transitions.
Finished structural reductions in REACHABILITY mode , in 18 iterations and 151161 ms. Remains : 417/466 places, 433/450 transitions.
RANDOM walk for 40000 steps (5746 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 266187 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 266187 steps, saw 133121 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 887 rows 938 cols
[2024-05-22 19:35:34] [INFO ] Invariants computation overflowed in 114 ms
[2024-05-22 19:35:34] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/41 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/91 variables, 22/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 71/162 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 82/244 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 83/327 variables, 46/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/389 variables, 34/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 43/432 variables, 24/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 50/482 variables, 27/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/482 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 34/516 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/516 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 36/552 variables, 16/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/552 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 50/602 variables, 26/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/602 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 41/643 variables, 20/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/643 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 56/699 variables, 29/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/699 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 47/746 variables, 24/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/746 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 56/802 variables, 29/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/802 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 47/849 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/849 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 56/905 variables, 29/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/905 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 47/952 variables, 24/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/952 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 56/1008 variables, 29/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1008 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 47/1055 variables, 24/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1055 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 56/1111 variables, 29/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1111 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 47/1158 variables, 24/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1158 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 56/1214 variables, 29/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1214 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 47/1261 variables, 24/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1261 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 56/1317 variables, 29/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1317 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 47/1364 variables, 24/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1364 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 56/1420 variables, 29/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1420 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 47/1467 variables, 24/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1467 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 56/1523 variables, 29/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1523 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 48/1571 variables, 24/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1571 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 76/1647 variables, 34/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1647 variables, 2/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1647 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 84/1731 variables, 43/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1731 variables, 4/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1731 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 76/1807 variables, 40/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1807 variables, 8/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1807 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 18/1825 variables, 17/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1825 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 0/1825 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1825/1825 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 831 ms.
Refiners :[State Equation: 938/938 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/41 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 50/91 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 71/162 variables, 35/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 82/244 variables, 40/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 83/327 variables, 46/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/389 variables, 34/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/389 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 43/432 variables, 24/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 50/482 variables, 27/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/482 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 34/516 variables, 20/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/516 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 36/552 variables, 16/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/552 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 50/602 variables, 26/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/602 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 41/643 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/643 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 56/699 variables, 29/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/699 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 47/746 variables, 24/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/746 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 56/802 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/802 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 47/849 variables, 24/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/849 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 56/905 variables, 29/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/905 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 47/952 variables, 24/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/952 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 56/1008 variables, 29/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1008 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 47/1055 variables, 24/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1055 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 56/1111 variables, 29/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1111 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 47/1158 variables, 24/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1158 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 56/1214 variables, 29/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1214 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 47/1261 variables, 24/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1261 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 56/1317 variables, 29/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1317 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 47/1364 variables, 24/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1364 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 56/1420 variables, 29/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1420 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 47/1467 variables, 24/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1467 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 56/1523 variables, 29/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1523 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 48/1571 variables, 24/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1571 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 76/1647 variables, 34/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1647 variables, 2/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1647 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1731/1825 variables, and 884 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1434 ms.
Refiners :[State Equation: 881/938 constraints, ReadFeed: 2/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 887/887 transitions.
Graph (complete) has 1812 edges and 938 vertex of which 932 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 196 rules applied. Total rules applied 197 place count 931 transition count 692
Reduce places removed 193 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 194 rules applied. Total rules applied 391 place count 738 transition count 691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 392 place count 737 transition count 691
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 392 place count 737 transition count 659
Deduced a syphon composed of 32 places in 5 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 456 place count 705 transition count 659
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 2 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 746 place count 560 transition count 514
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 806 place count 530 transition count 514
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 3 with 65 rules applied. Total rules applied 871 place count 530 transition count 449
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 936 place count 465 transition count 449
Partial Free-agglomeration rule applied 65 times.
Drop transitions (Partial Free agglomeration) removed 65 transitions
Iterating global reduction 4 with 65 rules applied. Total rules applied 1001 place count 465 transition count 449
Applied a total of 1001 rules in 65 ms. Remains 465 /938 variables (removed 473) and now considering 449/887 (removed 438) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 465/938 places, 449/887 transitions.
RANDOM walk for 40000 steps (5813 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3645 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 436066 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 436066 steps, saw 218076 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
// Phase 1: matrix 449 rows 465 cols
[2024-05-22 19:35:40] [INFO ] Computed 93 invariants in 63 ms
[2024-05-22 19:35:40] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 262/388 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/461 variables, 28/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 449/910 variables, 461/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/910 variables, 78/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/910 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/914 variables, 4/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 2/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/914 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/914 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 914/914 variables, and 636 constraints, problems are : Problem set: 0 solved, 1 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 465/465 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/126 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 262/388 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:35:41] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 3 ms to minimize.
[2024-05-22 19:35:41] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:35:41] [INFO ] Deduced a trap composed of 128 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:35:42] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 2 ms to minimize.
[2024-05-22 19:35:42] [INFO ] Deduced a trap composed of 130 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:35:42] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:35:42] [INFO ] Deduced a trap composed of 136 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:35:42] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:35:43] [INFO ] Deduced a trap composed of 133 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:35:43] [INFO ] Deduced a trap composed of 169 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:35:43] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 3 ms to minimize.
[2024-05-22 19:35:43] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 2 ms to minimize.
[2024-05-22 19:35:43] [INFO ] Deduced a trap composed of 177 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:35:44] [INFO ] Deduced a trap composed of 161 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:35:44] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:35:44] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:35:44] [INFO ] Deduced a trap composed of 132 places in 191 ms of which 2 ms to minimize.
[2024-05-22 19:35:44] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:35:45] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:35:45] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:35:45] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:35:45] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 3 ms to minimize.
[2024-05-22 19:35:45] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:35:46] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:35:46] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 2 ms to minimize.
[2024-05-22 19:35:46] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 3 ms to minimize.
[2024-05-22 19:35:46] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:35:46] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:35:46] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 2 ms to minimize.
[2024-05-22 19:35:47] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:35:47] [INFO ] Deduced a trap composed of 172 places in 192 ms of which 3 ms to minimize.
[2024-05-22 19:35:47] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 3 ms to minimize.
[2024-05-22 19:35:47] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:35:47] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 3 ms to minimize.
[2024-05-22 19:35:48] [INFO ] Deduced a trap composed of 127 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:35:48] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:35:48] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:35:48] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:35:48] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:35:49] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:35:49] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:35:49] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:35:49] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 3 ms to minimize.
[2024-05-22 19:35:49] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:35:50] [INFO ] Deduced a trap composed of 163 places in 191 ms of which 3 ms to minimize.
[2024-05-22 19:35:50] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:35:50] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 3 ms to minimize.
[2024-05-22 19:35:50] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:35:50] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:35:51] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 3 ms to minimize.
[2024-05-22 19:35:51] [INFO ] Deduced a trap composed of 152 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:35:51] [INFO ] Deduced a trap composed of 157 places in 194 ms of which 3 ms to minimize.
[2024-05-22 19:35:51] [INFO ] Deduced a trap composed of 122 places in 198 ms of which 2 ms to minimize.
[2024-05-22 19:35:51] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:35:52] [INFO ] Deduced a trap composed of 155 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:35:52] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:35:52] [INFO ] Deduced a trap composed of 119 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:35:52] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:35:52] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:35:53] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:35:53] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 3 ms to minimize.
[2024-05-22 19:35:53] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:35:53] [INFO ] Deduced a trap composed of 165 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:35:53] [INFO ] Deduced a trap composed of 139 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:35:54] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:35:54] [INFO ] Deduced a trap composed of 176 places in 181 ms of which 3 ms to minimize.
[2024-05-22 19:35:54] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:35:54] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:35:54] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:35:55] [INFO ] Deduced a trap composed of 169 places in 180 ms of which 2 ms to minimize.
[2024-05-22 19:35:55] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:35:55] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:35:55] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 3 ms to minimize.
[2024-05-22 19:35:55] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 3 ms to minimize.
[2024-05-22 19:35:55] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:35:56] [INFO ] Deduced a trap composed of 141 places in 187 ms of which 3 ms to minimize.
[2024-05-22 19:35:56] [INFO ] Deduced a trap composed of 172 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:35:56] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:35:56] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:35:56] [INFO ] Deduced a trap composed of 139 places in 181 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:35:57] [INFO ] Deduced a trap composed of 175 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:35:57] [INFO ] Deduced a trap composed of 177 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:35:57] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 2 ms to minimize.
[2024-05-22 19:35:57] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 2 ms to minimize.
[2024-05-22 19:35:57] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 3 ms to minimize.
[2024-05-22 19:35:58] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:35:58] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 3 ms to minimize.
[2024-05-22 19:35:58] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 3 ms to minimize.
[2024-05-22 19:35:58] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 3 ms to minimize.
[2024-05-22 19:35:58] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:35:59] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 2 ms to minimize.
[2024-05-22 19:35:59] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 3 ms to minimize.
[2024-05-22 19:35:59] [INFO ] Deduced a trap composed of 159 places in 191 ms of which 3 ms to minimize.
[2024-05-22 19:35:59] [INFO ] Deduced a trap composed of 154 places in 195 ms of which 2 ms to minimize.
[2024-05-22 19:36:00] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 3 ms to minimize.
[2024-05-22 19:36:00] [INFO ] Deduced a trap composed of 149 places in 193 ms of which 2 ms to minimize.
[2024-05-22 19:36:00] [INFO ] Deduced a trap composed of 135 places in 197 ms of which 3 ms to minimize.
[2024-05-22 19:36:00] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 2 ms to minimize.
[2024-05-22 19:36:00] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 2 ms to minimize.
[2024-05-22 19:36:01] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:36:01] [INFO ] Deduced a trap composed of 172 places in 192 ms of which 3 ms to minimize.
[2024-05-22 19:36:01] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:36:01] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:36:01] [INFO ] Deduced a trap composed of 172 places in 189 ms of which 3 ms to minimize.
[2024-05-22 19:36:02] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2024-05-22 19:36:02] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:36:02] [INFO ] Deduced a trap composed of 132 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:36:02] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2024-05-22 19:36:02] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:36:03] [INFO ] Deduced a trap composed of 129 places in 185 ms of which 2 ms to minimize.
[2024-05-22 19:36:03] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 3 ms to minimize.
[2024-05-22 19:36:03] [INFO ] Deduced a trap composed of 174 places in 197 ms of which 3 ms to minimize.
[2024-05-22 19:36:03] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 3 ms to minimize.
[2024-05-22 19:36:04] [INFO ] Deduced a trap composed of 147 places in 189 ms of which 2 ms to minimize.
[2024-05-22 19:36:04] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 2 ms to minimize.
[2024-05-22 19:36:04] [INFO ] Deduced a trap composed of 165 places in 190 ms of which 2 ms to minimize.
[2024-05-22 19:36:04] [INFO ] Deduced a trap composed of 165 places in 182 ms of which 2 ms to minimize.
[2024-05-22 19:36:04] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 2 ms to minimize.
[2024-05-22 19:36:05] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 2 ms to minimize.
[2024-05-22 19:36:05] [INFO ] Deduced a trap composed of 176 places in 183 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:36:05] [INFO ] Deduced a trap composed of 170 places in 191 ms of which 2 ms to minimize.
[2024-05-22 19:36:05] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2024-05-22 19:36:05] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 3 ms to minimize.
[2024-05-22 19:36:06] [INFO ] Deduced a trap composed of 163 places in 191 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 73/461 variables, 28/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:36:06] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 2 ms to minimize.
[2024-05-22 19:36:06] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 3 ms to minimize.
[2024-05-22 19:36:06] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 3 ms to minimize.
[2024-05-22 19:36:07] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 3 ms to minimize.
[2024-05-22 19:36:07] [INFO ] Deduced a trap composed of 122 places in 226 ms of which 3 ms to minimize.
[2024-05-22 19:36:07] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 4 ms to minimize.
[2024-05-22 19:36:07] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 3 ms to minimize.
[2024-05-22 19:36:08] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 3 ms to minimize.
[2024-05-22 19:36:08] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 3 ms to minimize.
[2024-05-22 19:36:08] [INFO ] Deduced a trap composed of 122 places in 222 ms of which 2 ms to minimize.
[2024-05-22 19:36:08] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 3 ms to minimize.
[2024-05-22 19:36:09] [INFO ] Deduced a trap composed of 135 places in 226 ms of which 3 ms to minimize.
[2024-05-22 19:36:09] [INFO ] Deduced a trap composed of 116 places in 226 ms of which 3 ms to minimize.
[2024-05-22 19:36:09] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 2 ms to minimize.
[2024-05-22 19:36:09] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 2 ms to minimize.
[2024-05-22 19:36:10] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 3 ms to minimize.
[2024-05-22 19:36:10] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 2 ms to minimize.
[2024-05-22 19:36:10] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 2 ms to minimize.
[2024-05-22 19:36:10] [INFO ] Deduced a trap composed of 138 places in 216 ms of which 3 ms to minimize.
[2024-05-22 19:36:10] [INFO ] Deduced a trap composed of 135 places in 223 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:36:11] [INFO ] Deduced a trap composed of 128 places in 221 ms of which 3 ms to minimize.
[2024-05-22 19:36:11] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 3 ms to minimize.
[2024-05-22 19:36:11] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2024-05-22 19:36:11] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 2 ms to minimize.
[2024-05-22 19:36:12] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 2 ms to minimize.
[2024-05-22 19:36:12] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
[2024-05-22 19:36:12] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2024-05-22 19:36:12] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2024-05-22 19:36:12] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 3 ms to minimize.
[2024-05-22 19:36:13] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 3 ms to minimize.
[2024-05-22 19:36:13] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 3 ms to minimize.
[2024-05-22 19:36:13] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 2 ms to minimize.
[2024-05-22 19:36:13] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2024-05-22 19:36:14] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-22 19:36:14] [INFO ] Deduced a trap composed of 104 places in 216 ms of which 3 ms to minimize.
[2024-05-22 19:36:14] [INFO ] Deduced a trap composed of 128 places in 210 ms of which 2 ms to minimize.
[2024-05-22 19:36:14] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 3 ms to minimize.
[2024-05-22 19:36:15] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 2 ms to minimize.
[2024-05-22 19:36:15] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 2 ms to minimize.
[2024-05-22 19:36:15] [INFO ] Deduced a trap composed of 131 places in 217 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 19:36:15] [INFO ] Deduced a trap composed of 133 places in 211 ms of which 3 ms to minimize.
[2024-05-22 19:36:15] [INFO ] Deduced a trap composed of 132 places in 211 ms of which 3 ms to minimize.
[2024-05-22 19:36:16] [INFO ] Deduced a trap composed of 123 places in 217 ms of which 2 ms to minimize.
[2024-05-22 19:36:16] [INFO ] Deduced a trap composed of 142 places in 215 ms of which 3 ms to minimize.
[2024-05-22 19:36:16] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 2 ms to minimize.
[2024-05-22 19:36:16] [INFO ] Deduced a trap composed of 131 places in 213 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 449/910 variables, 461/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/910 variables, 78/800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/910 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/910 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/914 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/914 variables, 2/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r145-tall-171631145000353"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;