MCC'2025- Execution of r226-smll-174903490600063

About the Execution of ITS-Tools for StigmergyCommit-PT-05b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	1957493.00	0.00	0.00	TFFFTFTTTTFTTTTT	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyCommit-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.4M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749068998743

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 20:30:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 20:30:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 20:30:01] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2025-06-04 20:30:01] [INFO ] Transformed 1837 places.
[2025-06-04 20:30:01] [INFO ] Transformed 3460 transitions.
[2025-06-04 20:30:01] [INFO ] Found NUPN structural information;
[2025-06-04 20:30:01] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 743 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (356 resets) in 2287 ms. (17 steps per ms) remains 15/16 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 323 ms. (12 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 271 ms. (14 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 199 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 264 ms. (15 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 223 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
[2025-06-04 20:30:03] [INFO ] Flatten gal took : 1245 ms
[2025-06-04 20:30:04] [INFO ] Flatten gal took : 462 ms
[2025-06-04 20:30:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4317574494678604312.gal : 349 ms
[2025-06-04 20:30:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17018399237146408437.prop : 11 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4317574494678604312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17018399237146408437.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17018399237146408437.prop.
Interrupted probabilistic random walk after 135593 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :1 out of 15
Probabilistic random walk after 135593 steps, saw 30952 distinct states, run finished after 3009 ms. (steps per millisecond=45 ) properties seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 3460 rows 1837 cols
[2025-06-04 20:30:06] [INFO ] Computed 7 invariants in 123 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyCommit-PT-05b-ReachabilityFireability-2025-01 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-05b-ReachabilityFireability-2025-03 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-05b-ReachabilityFireability-2025-10 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1673/1837 variables, 7/171 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1837 variables, 1673/1844 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1837 variables, 0/1844 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3460/5297 variables, 1837/3681 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 (/ 1.0 12.0))
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 (/ 5.0 6.0))
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 (/ 1.0 12.0))
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 (/ 1.0 12.0))
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 (/ 1.0 12.0))
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 (/ 7.0 12.0))
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 (/ 1.0 12.0))
(s399 0.0)
(s400 0.0)
(s401 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5297/5297 variables, and 3681 constraints, problems are : Problem set: 3 solved, 11 unsolved in 5057 ms.
Refiners :[Domain max(s): 1837/1837 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1837/1837 constraints, PredecessorRefiner: 14/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem StigmergyCommit-PT-05b-ReachabilityFireability-2025-08 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-05b-ReachabilityFireability-2025-13 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1731/1837 variables, 7/113 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1837 variables, 1731/1844 constraints. Problems are: Problem set: 5 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:14] [INFO ] Deduced a trap composed of 205 places in 1825 ms of which 262 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :13 after 18
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :18 after 20
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :20 after 227
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :227 after 1208
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1208 after 7003
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :7003 after 7521
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :7521 after 26177
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :26177 after 226610
[2025-06-04 20:30:16] [INFO ] Deduced a trap composed of 396 places in 1988 ms of which 450 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :226610 after 4.367e+06
[2025-06-04 20:30:18] [INFO ] Deduced a trap composed of 301 places in 1498 ms of which 67 ms to minimize.
SMT process timed out in 11783ms, After SMT, problems are : Problem set: 5 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 97 out of 1837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1643 edges and 1837 vertex of which 109 / 1837 are part of one of the 17 SCC in 9 ms
Free SCC test removed 92 places
Drop transitions (Empty/Sink Transition effects.) removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 2742 edges and 1745 vertex of which 1733 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.51 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1200 transitions
Trivial Post-agglo rules discarded 1200 transitions
Performed 1200 trivial Post agglomeration. Transition count delta: 1200
Iterating post reduction 0 with 1206 rules applied. Total rules applied 1208 place count 1733 transition count 2131
Reduce places removed 1200 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1229 rules applied. Total rules applied 2437 place count 533 transition count 2102
Reduce places removed 12 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 68 rules applied. Total rules applied 2505 place count 521 transition count 2046
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 2561 place count 465 transition count 2046
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 2561 place count 465 transition count 1972
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 2709 place count 391 transition count 1972
Discarding 67 places :
Symmetric choice reduction at 4 with 67 rule applications. Total rules 2776 place count 324 transition count 1905
Iterating global reduction 4 with 67 rules applied. Total rules applied 2843 place count 324 transition count 1905
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 2849 place count 324 transition count 1899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2850 place count 323 transition count 1899
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2867 place count 306 transition count 1880
Iterating global reduction 6 with 17 rules applied. Total rules applied 2884 place count 306 transition count 1880
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2886 place count 306 transition count 1878
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2894 place count 298 transition count 1869
Iterating global reduction 7 with 8 rules applied. Total rules applied 2902 place count 298 transition count 1869
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2908 place count 292 transition count 1863
Iterating global reduction 7 with 6 rules applied. Total rules applied 2914 place count 292 transition count 1863
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2920 place count 292 transition count 1857
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2958 place count 273 transition count 1838
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2964 place count 267 transition count 1832
Iterating global reduction 8 with 6 rules applied. Total rules applied 2970 place count 267 transition count 1832
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2974 place count 263 transition count 1828
Iterating global reduction 8 with 4 rules applied. Total rules applied 2978 place count 263 transition count 1828
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2982 place count 259 transition count 1824
Iterating global reduction 8 with 4 rules applied. Total rules applied 2986 place count 259 transition count 1824
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 3000 place count 252 transition count 1823
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3003 place count 252 transition count 1820
Free-agglomeration rule applied 45 times.
Iterating global reduction 8 with 45 rules applied. Total rules applied 3048 place count 252 transition count 1775
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 3093 place count 207 transition count 1775
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 9 with 58 rules applied. Total rules applied 3151 place count 207 transition count 1717
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3153 place count 206 transition count 1730
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 3156 place count 206 transition count 1730
Applied a total of 3156 rules in 1075 ms. Remains 206 /1837 variables (removed 1631) and now considering 1730/3460 (removed 1730) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1086 ms. Remains : 206/1837 places, 1730/3460 transitions.
RANDOM walk for 40000 steps (2126 resets) in 522 ms. (76 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (349 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (322 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (350 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (398 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (365 resets) in 416 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (359 resets) in 299 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (410 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (355 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
// Phase 1: matrix 1730 rows 206 cols
[2025-06-04 20:30:19] [INFO ] Computed 7 invariants in 22 ms
[2025-06-04 20:30:19] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 112/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1730/1936 variables, 206/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1936 variables, 16/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1936 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/1936 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1936/1936 variables, and 229 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 8/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 112/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :4.367e+06 after 1.80021e+08
[2025-06-04 20:30:22] [INFO ] Deduced a trap composed of 42 places in 744 ms of which 11 ms to minimize.
Problem StigmergyCommit-PT-05b-ReachabilityFireability-2025-04 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:23] [INFO ] Deduced a trap composed of 37 places in 731 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:23] [INFO ] Deduced a trap composed of 55 places in 670 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:24] [INFO ] Deduced a trap composed of 44 places in 782 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:25] [INFO ] Deduced a trap composed of 45 places in 804 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:26] [INFO ] Deduced a trap composed of 46 places in 748 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:26] [INFO ] Deduced a trap composed of 49 places in 672 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:27] [INFO ] Deduced a trap composed of 46 places in 711 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1730/1936 variables, 206/221 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1936 variables, 16/237 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1936 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1936 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1936 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1936/1936 variables, and 238 constraints, problems are : Problem set: 1 solved, 7 unsolved in 8334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 8/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9827ms problems are : Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,15 properties remain. new max is 65536
SDD size :1.80021e+08 after 1.273e+09
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1007 ms.
Support contains 92 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 1730/1730 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 206 transition count 1726
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 202 transition count 1723
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 199 transition count 1723
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 3 with 2 rules applied. Total rules applied 16 place count 198 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 197 transition count 1721
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 197 transition count 1721
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 196 transition count 1720
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 196 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 195 transition count 1719
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 195 transition count 1719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 195 transition count 1718
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 27 place count 193 transition count 1723
Applied a total of 27 rules in 147 ms. Remains 193 /206 variables (removed 13) and now considering 1723/1730 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 193/206 places, 1723/1730 transitions.
RANDOM walk for 40000 steps (2356 resets) in 601 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (362 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (373 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (366 resets) in 425 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (357 resets) in 305 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (363 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 316553 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 5
Probabilistic random walk after 316553 steps, saw 76722 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
// Phase 1: matrix 1723 rows 193 cols
[2025-06-04 20:30:34] [INFO ] Computed 7 invariants in 19 ms
[2025-06-04 20:30:34] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 101/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1723/1916 variables, 193/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1916 variables, 16/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1916 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/1916 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1916/1916 variables, and 216 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 101/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:36] [INFO ] Deduced a trap composed of 43 places in 697 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:37] [INFO ] Deduced a trap composed of 45 places in 699 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:37] [INFO ] Deduced a trap composed of 35 places in 732 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:38] [INFO ] Deduced a trap composed of 35 places in 682 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:39] [INFO ] Deduced a trap composed of 38 places in 723 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:39] [INFO ] Deduced a trap composed of 44 places in 712 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:40] [INFO ] Deduced a trap composed of 30 places in 833 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:41] [INFO ] Deduced a trap composed of 36 places in 842 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:42] [INFO ] Deduced a trap composed of 43 places in 832 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:43] [INFO ] Deduced a trap composed of 33 places in 884 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:44] [INFO ] Deduced a trap composed of 35 places in 823 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:45] [INFO ] Deduced a trap composed of 52 places in 972 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-09 is true.
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :1.273e+09 after 2.47994e+09
[2025-06-04 20:30:46] [INFO ] Deduced a trap composed of 30 places in 895 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:47] [INFO ] Deduced a trap composed of 40 places in 806 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:48] [INFO ] Deduced a trap composed of 54 places in 873 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:48] [INFO ] Deduced a trap composed of 62 places in 742 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:49] [INFO ] Deduced a trap composed of 59 places in 746 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:30:50] [INFO ] Deduced a trap composed of 64 places in 690 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1723/1916 variables, 193/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1916 variables, 16/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1916 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1916 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1916 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1916/1916 variables, and 235 constraints, problems are : Problem set: 0 solved, 5 unsolved in 16649 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 193/193 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17787ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 550 ms.
Support contains 92 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 1723/1723 transitions.
Applied a total of 0 rules in 55 ms. Remains 193 /193 variables (removed 0) and now considering 1723/1723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 193/193 places, 1723/1723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 1723/1723 transitions.
Applied a total of 0 rules in 60 ms. Remains 193 /193 variables (removed 0) and now considering 1723/1723 (removed 0) transitions.
[2025-06-04 20:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:30:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 20:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 20:30:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 20:30:53] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 20:30:53] [INFO ] Redundant transitions in 149 ms returned []
Running 1711 sub problems to find dead transitions.
[2025-06-04 20:30:53] [INFO ] Invariant cache hit.
[2025-06-04 20:30:53] [INFO ] State equation strengthened by 16 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1711 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1711 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:23] [INFO ] Deduced a trap composed of 35 places in 817 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:24] [INFO ] Deduced a trap composed of 38 places in 802 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:25] [INFO ] Deduced a trap composed of 44 places in 789 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:25] [INFO ] Deduced a trap composed of 46 places in 758 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:26] [INFO ] Deduced a trap composed of 44 places in 814 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:27] [INFO ] Deduced a trap composed of 43 places in 815 ms of which 21 ms to minimize.
SMT process timed out in 33970ms, After SMT, problems are : Problem set: 0 solved, 1711 unsolved
Search for dead transitions found 0 dead transitions in 33985ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34985 ms. Remains : 193/193 places, 1723/1723 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 51 ms. Remains 193 /193 variables (removed 0) and now considering 1723/1723 (removed 0) transitions.
Running SMT prover for 5 properties.
[2025-06-04 20:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 20:31:27] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 20:31:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-04 20:31:28] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:29] [INFO ] Deduced a trap composed of 43 places in 680 ms of which 12 ms to minimize.
[2025-06-04 20:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 770 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:30] [INFO ] Deduced a trap composed of 35 places in 720 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:31] [INFO ] Deduced a trap composed of 52 places in 771 ms of which 15 ms to minimize.
[2025-06-04 20:31:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1627 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:32] [INFO ] Deduced a trap composed of 46 places in 701 ms of which 12 ms to minimize.
[2025-06-04 20:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 794 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:31:33] [INFO ] Deduced a trap composed of 45 places in 767 ms of which 16 ms to minimize.
[2025-06-04 20:31:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 853 ms
TRAPS : Iteration 2
[2025-06-04 20:31:33] [INFO ] After 5797ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-06-04 20:31:34] [INFO ] After 6141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-06-04 20:31:34] [INFO ] Flatten gal took : 211 ms
[2025-06-04 20:31:34] [INFO ] Flatten gal took : 184 ms
[2025-06-04 20:31:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17465103095454304608.gal : 56 ms
[2025-06-04 20:31:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1114157028662004266.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17465103095454304608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1114157028662004266.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1114157028662004266.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :16 after 17
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :17 after 20
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :20 after 25
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :25 after 71
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :71 after 681
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :681 after 11991
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :11991 after 70198
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-11 is true.
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-06 is true.
Invariant property StigmergyCommit-PT-05b-ReachabilityFireability-2025-02 does not hold.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :70198 after 1.08901e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.08901e+06 after 1.14037e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.14037e+06 after 3.09256e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3.09256e+06 after 2.01155e+07
Detected timeout of ITS tools.
[2025-06-04 20:31:49] [INFO ] Flatten gal took : 168 ms
[2025-06-04 20:31:49] [INFO ] Applying decomposition
[2025-06-04 20:31:49] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11835862602982644915.txt' '-o' '/tmp/graph11835862602982644915.bin' '-w' '/tmp/graph11835862602982644915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11835862602982644915.bin' '-l' '-1' '-v' '-w' '/tmp/graph11835862602982644915.weights' '-q' '0' '-e' '0.001'
[2025-06-04 20:31:50] [INFO ] Decomposing Gal with order
[2025-06-04 20:31:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 20:31:51] [INFO ] Removed a total of 9061 redundant transitions.
[2025-06-04 20:31:51] [INFO ] Flatten gal took : 773 ms
[2025-06-04 20:31:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 114 ms.
[2025-06-04 20:31:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17974877436985893059.gal : 13 ms
[2025-06-04 20:31:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12938055359591415354.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17974877436985893059.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12938055359591415354.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12938055359591415354.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 91
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :91 after 307
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :307 after 597
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :597 after 1217
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1217 after 4285
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4285 after 7753
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7753 after 13789
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :13789 after 15751
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-15 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15751 after 4.33062e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.33062e+07 after 4.35679e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 39548 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 20:32:07] [INFO ] Flatten gal took : 149 ms
[2025-06-04 20:32:07] [INFO ] Applying decomposition
[2025-06-04 20:32:07] [INFO ] Flatten gal took : 171 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3266952643354714034.txt' '-o' '/tmp/graph3266952643354714034.bin' '-w' '/tmp/graph3266952643354714034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3266952643354714034.bin' '-l' '-1' '-v' '-w' '/tmp/graph3266952643354714034.weights' '-q' '0' '-e' '0.001'
[2025-06-04 20:32:08] [INFO ] Decomposing Gal with order
[2025-06-04 20:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 20:32:09] [INFO ] Removed a total of 9574 redundant transitions.
[2025-06-04 20:32:09] [INFO ] Flatten gal took : 317 ms
[2025-06-04 20:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 83 ms.
[2025-06-04 20:32:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15371487032393633449.gal : 30 ms
[2025-06-04 20:32:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7024446898905317498.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15371487032393633449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7024446898905317498.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7024446898905317498.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2.10195e+09 after 1.19393e+10
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.19393e+10 after 1.93133e+13
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-11 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-06 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.93133e+13 after 4.09731e+13
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :4.09731e+13 after 4.62524e+13
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-15 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Detected timeout of ITS tools.
[2025-06-04 21:02:10] [INFO ] Flatten gal took : 146 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3850660721275519386
[2025-06-04 21:02:10] [INFO ] Too many transitions (1723) to apply POR reductions. Disabling POR matrices.
[2025-06-04 21:02:10] [INFO ] Applying decomposition
[2025-06-04 21:02:10] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3850660721275519386
Running compilation step : cd /tmp/ltsmin3850660721275519386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 21:02:10] [INFO ] Flatten gal took : 161 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9383798013666638850.txt' '-o' '/tmp/graph9383798013666638850.bin' '-w' '/tmp/graph9383798013666638850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9383798013666638850.bin' '-l' '-1' '-v' '-w' '/tmp/graph9383798013666638850.weights' '-q' '0' '-e' '0.001'
[2025-06-04 21:02:10] [INFO ] Decomposing Gal with order
[2025-06-04 21:02:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 21:02:11] [INFO ] Removed a total of 9079 redundant transitions.
[2025-06-04 21:02:11] [INFO ] Flatten gal took : 293 ms
[2025-06-04 21:02:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 47 ms.
[2025-06-04 21:02:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12294733342192730053.gal : 4 ms
[2025-06-04 21:02:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1570292389517973125.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability12294733342192730053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1570292389517973125.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability1570292389517973125.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 2149
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2149 after 4393
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4393 after 9559
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :9559 after 15751
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :15751 after 15751
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :15751 after 25633
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :25633 after 235801
Invariant property StigmergyCommit-PT-05b-ReachabilityFireability-2025-02 does not hold.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :235801 after 4.71697e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.71697e+07 after 1.69073e+08
Compilation finished in 8662 ms.
Running link step : cd /tmp/ltsmin3850660721275519386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin3850660721275519386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'StigmergyCommitPT05bReachabilityFireability202512==true'
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.34669e+08,13.8613,250760,3247,1896,189382,194469,1220,1.27743e+06,203,1.63035e+06,0
Total reachable state count : 734668661

Verifying 2 reachability properties.
Invariant property StigmergyCommit-PT-05b-ReachabilityFireability-2025-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-05b-ReachabilityFireability-2025-02,1.1304e+07,14.2834,250760,624,477,189382,194469,1322,1.27743e+06,215,1.63035e+06,9387
Reachability property StigmergyCommit-PT-05b-ReachabilityFireability-2025-12 is true.
FORMULA StigmergyCommit-PT-05b-ReachabilityFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-05b-ReachabilityFireability-2025-12,1680,15.2925,250760,79,42,189382,194469,1430,1.27743e+06,219,1.63035e+06,35576
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1955413 ms.

BK_STOP 1749070956236

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="StigmergyCommit-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490600063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-05b.tgz
mv StigmergyCommit-PT-05b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;