Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813500222.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 CANConstruction-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813500222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.9M
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 7.3M May 29 14:32 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 CANConstruction-PT-070-ReachabilityCardinality-2025-00
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-01
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-02
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-03
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-04
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-05
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-06
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-07
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-08
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-09
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-10
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-11
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-12
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-13
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-14
FORMULA_NAME CANConstruction-PT-070-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748694147109

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-31 12:22:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 12:22:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 12:22:30] [INFO ] Load time of PNML (sax parser for PT used): 981 ms
[2025-05-31 12:22:30] [INFO ] Transformed 10642 places.
[2025-05-31 12:22:31] [INFO ] Transformed 20160 transitions.
[2025-05-31 12:22:31] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 1296 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (29 resets) in 5269 ms. (7 steps per ms) remains 10/16 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 561 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 850 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 10/10 properties
// Phase 1: matrix 20160 rows 10642 cols
[2025-05-31 12:22:34] [INFO ] Computed 141 invariants in 374 ms
[2025-05-31 12:22:34] [INFO ] Flatten gal took : 1741 ms
[2025-05-31 12:22:35] [INFO ] State equation strengthened by 9730 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 12:22:35] [INFO ] Flatten gal took : 737 ms
[2025-05-31 12:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11314602773634326052.gal : 302 ms
[2025-05-31 12:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16523569276001335515.prop : 8 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/ReachabilityCardinality11314602773634326052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16523569276001335515.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 ...330
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem CANConstruction-PT-070-ReachabilityCardinality-2025-09 is UNSAT
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 10275/10573 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10573 variables, 4/73 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality16523569276001335515.prop.
Error getting values : (error "ParserException while parsing response: ((s0 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)
(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)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 (/ 3.0 4.0))
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 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 1.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)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 (/ 1.0 8.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)
(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)
(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)
(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)
(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)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 (/ 3.0 4.0))
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 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)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 (/ 7.0 8.0))
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 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)
(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)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.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 1.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)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 (/ 3.0 4.0))
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 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)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 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 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 (/ 7.0 8.0))
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.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)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 (/ 3.0 4.0))
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 (/ 1.0 8.0))
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 (/ 7.0 8.0))
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10573/30802 variables, and 73 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 69/71 constraints, Generalized P Invariants (flows): 4/70 constraints, State Equation: 0/10642 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 10/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10340/10571 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10571 variables, 3/71 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:23:10] [INFO ] Deduced a trap composed of 5 places in 26543 ms of which 326 ms to minimize.
SMT process timed out in 36071ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 231 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 10642 transition count 19726
Reduce places removed 434 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 453 rules applied. Total rules applied 887 place count 10208 transition count 19707
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 906 place count 10189 transition count 19707
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 906 place count 10189 transition count 19698
Deduced a syphon composed of 9 places in 18 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 924 place count 10180 transition count 19698
Discarding 4669 places :
Symmetric choice reduction at 3 with 4669 rule applications. Total rules 5593 place count 5511 transition count 10360
Iterating global reduction 3 with 4669 rules applied. Total rules applied 10262 place count 5511 transition count 10360
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 5 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 10378 place count 5453 transition count 10302
Free-agglomeration rule applied 34 times.
Iterating global reduction 3 with 34 rules applied. Total rules applied 10412 place count 5453 transition count 10268
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 10446 place count 5419 transition count 10268
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 10455 place count 5419 transition count 10259
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 10464 place count 5410 transition count 10259
Partial Free-agglomeration rule applied 110 times.
Drop transitions (Partial Free agglomeration) removed 110 transitions
Iterating global reduction 5 with 110 rules applied. Total rules applied 10574 place count 5410 transition count 10259
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 10580 place count 5410 transition count 10259
Applied a total of 10580 rules in 10945 ms. Remains 5410 /10642 variables (removed 5232) and now considering 10259/20160 (removed 9901) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10958 ms. Remains : 5410/10642 places, 10259/20160 transitions.
RANDOM walk for 40000 steps (73 resets) in 1437 ms. (27 steps per ms) remains 8/9 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 707 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
// Phase 1: matrix 10259 rows 5410 cols
[2025-05-31 12:23:22] [INFO ] Computed 141 invariants in 78 ms
[2025-05-31 12:23:22] [INFO ] State equation strengthened by 9831 read => feed constraints.
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/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5115/5339 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5339 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5339 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/5342 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5342 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 67/5409 variables, 67/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5409 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 10259/15668 variables, 5409/5550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15668 variables, 9831/15381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15668 variables, 0/15381 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 1/15669 variables, 1/15382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/15669 variables, 0/15382 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15669/15669 variables, and 15382 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 5410/5410 constraints, ReadFeed: 9831/9831 constraints, PredecessorRefiner: 8/4 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/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5115/5339 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5339 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:24:22] [INFO ] Deduced a trap composed of 2 places in 12732 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:24:46] [INFO ] Deduced a trap composed of 74 places in 24193 ms of which 12014 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:25:09] [INFO ] Deduced a trap composed of 74 places in 23319 ms of which 12012 ms to minimize.
SMT process timed out in 107201ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 224 out of 5410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5410/5410 places, 10259/10259 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5409 transition count 10258
Applied a total of 2 rules in 2459 ms. Remains 5409 /5410 variables (removed 1) and now considering 10258/10259 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2460 ms. Remains : 5409/5410 places, 10258/10259 transitions.
RANDOM walk for 40000 steps (76 resets) in 1453 ms. (27 steps per ms) remains 6/8 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 5/6 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
// Phase 1: matrix 10258 rows 5409 cols
[2025-05-31 12:25:13] [INFO ] Computed 141 invariants in 62 ms
[2025-05-31 12:25:13] [INFO ] State equation strengthened by 9832 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/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5175/5334 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5334 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5334 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/5340 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5340 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 68/5408 variables, 68/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5408 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10258/15666 variables, 5408/5549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15666 variables, 9832/15381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15666 variables, 0/15381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/15667 variables, 1/15382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/15667 variables, 0/15382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/15667 variables, 0/15382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15667/15667 variables, and 15382 constraints, problems are : Problem set: 0 solved, 5 unsolved in 30164 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 5409/5409 constraints, ReadFeed: 9832/9832 constraints, PredecessorRefiner: 5/2 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/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5175/5334 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5334 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:25:54] [INFO ] Deduced a trap composed of 2 places in 10316 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:26:14] [INFO ] Deduced a trap composed of 74 places in 20002 ms of which 12009 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 72
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :72 after 73
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :73 after 75
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :75 after 78
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :78 after 84
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :84 after 95
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :95 after 117
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :117 after 143
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :143 after 154
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :154 after 166
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :166 after 190
[2025-05-31 12:26:35] [INFO ] Deduced a trap composed of 74 places in 20324 ms of which 12085 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:26:55] [INFO ] Deduced a trap composed of 73 places in 19699 ms of which 12008 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:27:15] [INFO ] Deduced a trap composed of 73 places in 19948 ms of which 12016 ms to minimize.
SMT process timed out in 122185ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 159 out of 5409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5409/5409 places, 10258/10258 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 5409 transition count 10254
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 5405 transition count 10254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 5401 transition count 10246
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 5401 transition count 10246
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 60 place count 5379 transition count 10224
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 5376 transition count 10225
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 5376 transition count 10224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 5375 transition count 10224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 5374 transition count 10222
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 5374 transition count 10222
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 5374 transition count 10222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 5373 transition count 10220
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 5373 transition count 10220
Applied a total of 75 rules in 10404 ms. Remains 5373 /5409 variables (removed 36) and now considering 10220/10258 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10404 ms. Remains : 5373/5409 places, 10220/10258 transitions.
RANDOM walk for 40000 steps (76 resets) in 1373 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 68928 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 5
Probabilistic random walk after 68928 steps, saw 60011 distinct states, run finished after 3011 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 10220 rows 5373 cols
[2025-05-31 12:27:29] [INFO ] Computed 141 invariants in 72 ms
[2025-05-31 12:27:29] [INFO ] State equation strengthened by 9863 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5139/5298 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5298 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5298 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/5304 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5304 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 68/5372 variables, 68/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5372 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10220/15592 variables, 5372/5513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15592 variables, 9863/15376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15592 variables, 0/15376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/15593 variables, 1/15377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/15593 variables, 0/15377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/15593 variables, 0/15377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15593/15593 variables, and 15377 constraints, problems are : Problem set: 0 solved, 5 unsolved in 38692 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 5373/5373 constraints, ReadFeed: 9863/9863 constraints, PredecessorRefiner: 5/2 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5139/5298 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5298 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:28:20] [INFO ] Deduced a trap composed of 2 places in 10512 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :5111 after 5177
[2025-05-31 12:28:39] [INFO ] Deduced a trap composed of 74 places in 19092 ms of which 12009 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:28:59] [INFO ] Deduced a trap composed of 74 places in 19999 ms of which 12008 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:29:19] [INFO ] Deduced a trap composed of 73 places in 20094 ms of which 12007 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:29:41] [INFO ] Deduced a trap composed of 74 places in 21530 ms of which 12008 ms to minimize.
SMT process timed out in 131717ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 159 out of 5373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5373/5373 places, 10220/10220 transitions.
Applied a total of 0 rules in 1433 ms. Remains 5373 /5373 variables (removed 0) and now considering 10220/10220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1433 ms. Remains : 5373/5373 places, 10220/10220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5373/5373 places, 10220/10220 transitions.
Applied a total of 0 rules in 1381 ms. Remains 5373 /5373 variables (removed 0) and now considering 10220/10220 (removed 0) transitions.
[2025-05-31 12:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:29:55] [INFO ] Implicit Places using invariants in 11677 ms returned [5, 11, 17, 21, 33, 39, 45, 51, 57, 64, 68, 74, 80, 86, 92, 98, 104, 115, 123, 127, 131, 137, 144, 150, 154, 160, 167, 173, 179, 185, 193, 199, 205, 211, 217, 221, 227, 233, 241, 245, 251, 257, 263, 269, 275, 279, 283, 289, 295, 301, 307, 313, 319, 323, 327, 333, 339, 344, 351, 357, 363, 369, 377, 383, 389, 393, 399, 406]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 11701 ms to find 68 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 5305/5373 places, 10220/10220 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 5305 transition count 10185
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 5270 transition count 10185
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 5265 transition count 10180
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 5265 transition count 10180
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 198 place count 5206 transition count 10121
Applied a total of 198 rules in 4261 ms. Remains 5206 /5305 variables (removed 99) and now considering 10121/10220 (removed 99) transitions.
// Phase 1: matrix 10121 rows 5206 cols
[2025-05-31 12:30:00] [INFO ] Computed 73 invariants in 229 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :5177 after 5315
[2025-05-31 12:30:11] [INFO ] Implicit Places using invariants in 12010 ms returned []
Implicit Place search using SMT only with invariants took 12011 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 5206/5373 places, 10121/10220 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29355 ms. Remains : 5206/5373 places, 10121/10220 transitions.
RANDOM walk for 40000 steps (76 resets) in 1298 ms. (30 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 71995 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 5
Probabilistic random walk after 71995 steps, saw 60052 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2025-05-31 12:30:15] [INFO ] Invariant cache hit.
[2025-05-31 12:30:15] [INFO ] State equation strengthened by 9755 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5040/5199 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5199 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5199 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/5205 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5205 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10121/15326 variables, 5205/5278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15326 variables, 9755/15033 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15326 variables, 0/15033 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/15327 variables, 1/15034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15327 variables, 0/15034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/15327 variables, 0/15034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15327/15327 variables, and 15034 constraints, problems are : Problem set: 0 solved, 5 unsolved in 23463 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 5206/5206 constraints, ReadFeed: 9755/9755 constraints, PredecessorRefiner: 5/2 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5040/5199 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5199 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:30:50] [INFO ] Deduced a trap composed of 2 places in 9788 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:31:10] [INFO ] Deduced a trap composed of 74 places in 19739 ms of which 12007 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:31:29] [INFO ] Deduced a trap composed of 73 places in 19476 ms of which 12007 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:31:49] [INFO ] Deduced a trap composed of 73 places in 19759 ms of which 12007 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:32:08] [INFO ] Deduced a trap composed of 74 places in 18931 ms of which 12007 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 12:32:27] [INFO ] Deduced a trap composed of 74 places in 18980 ms of which 12007 ms to minimize.
SMT process timed out in 132027ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 159 out of 5206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5206/5206 places, 10121/10121 transitions.
Applied a total of 0 rules in 1591 ms. Remains 5206 /5206 variables (removed 0) and now considering 10121/10121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1591 ms. Remains : 5206/5206 places, 10121/10121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5206/5206 places, 10121/10121 transitions.
Applied a total of 0 rules in 1580 ms. Remains 5206 /5206 variables (removed 0) and now considering 10121/10121 (removed 0) transitions.
[2025-05-31 12:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 12:32:41] [INFO ] Implicit Places using invariants in 10643 ms returned []
Implicit Place search using SMT only with invariants took 10644 ms to find 0 implicit places.
Running 10051 sub problems to find dead transitions.
[2025-05-31 12:32:41] [INFO ] Invariant cache hit.
[2025-05-31 12:32:41] [INFO ] State equation strengthened by 9755 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5205 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 10051 unsolved
SMT process timed out in 43249ms, After SMT, problems are : Problem set: 0 solved, 10051 unsolved
Search for dead transitions found 0 dead transitions in 43301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55577 ms. Remains : 5206/5206 places, 10121/10121 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9442 edges and 5206 vertex of which 4076 / 5206 are part of one of the 59 SCC in 9 ms
Free SCC test removed 4017 places
Drop transitions (Empty/Sink Transition effects.) removed 7975 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 7996 transitions.
Graph (complete) has 2408 edges and 1189 vertex of which 1107 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.2 ms
Discarding 82 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 723 rules applied. Total rules applied 725 place count 1107 transition count 1390
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 590 transitions
Reduce isomorphic transitions removed 590 transitions.
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Iterating post reduction 1 with 1322 rules applied. Total rules applied 2047 place count 507 transition count 668
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 2 with 262 rules applied. Total rules applied 2309 place count 375 transition count 538
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 2309 place count 375 transition count 525
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 2335 place count 362 transition count 525
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 2344 place count 353 transition count 515
Iterating global reduction 3 with 9 rules applied. Total rules applied 2353 place count 353 transition count 515
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 2356 place count 353 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2357 place count 352 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2359 place count 351 transition count 511
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 2373 place count 344 transition count 520
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 2382 place count 344 transition count 511
Free-agglomeration rule applied 36 times.
Iterating global reduction 5 with 36 rules applied. Total rules applied 2418 place count 344 transition count 475
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 2454 place count 308 transition count 475
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2456 place count 308 transition count 473
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 6 with 38 rules applied. Total rules applied 2494 place count 308 transition count 473
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 2513 place count 289 transition count 454
Iterating global reduction 6 with 19 rules applied. Total rules applied 2532 place count 289 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2533 place count 289 transition count 453
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2534 place count 288 transition count 452
Iterating global reduction 6 with 1 rules applied. Total rules applied 2535 place count 288 transition count 452
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 6 with 27 rules applied. Total rules applied 2562 place count 261 transition count 425
Applied a total of 2562 rules in 392 ms. Remains 261 /5206 variables (removed 4945) and now considering 425/10121 (removed 9696) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 425 rows 261 cols
[2025-05-31 12:33:25] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-31 12:33:25] [INFO ] After 90ms 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-05-31 12:33:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2025-05-31 12:33:25] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-31 12:33:25] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2025-05-31 12:33:25] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2025-05-31 12:33:26] [INFO ] After 736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2025-05-31 12:33:26] [INFO ] Flatten gal took : 17 ms
[2025-05-31 12:33:26] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:33:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10155462291194477536.gal : 3 ms
[2025-05-31 12:33:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15805509404359486185.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/ReachabilityCardinality10155462291194477536.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15805509404359486185.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 ...330
Loading property file /tmp/ReachabilityCardinality15805509404359486185.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :12 after 84
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :84 after 4536
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :4536 after 9.79776e+06
Detected timeout of ITS tools.
[2025-05-31 12:33:41] [INFO ] Flatten gal took : 11 ms
[2025-05-31 12:33:41] [INFO ] Applying decomposition
[2025-05-31 12:33:41] [INFO ] Flatten gal took : 10 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/graph15890160377149003180.txt' '-o' '/tmp/graph15890160377149003180.bin' '-w' '/tmp/graph15890160377149003180.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15890160377149003180.bin' '-l' '-1' '-v' '-w' '/tmp/graph15890160377149003180.weights' '-q' '0' '-e' '0.001'
[2025-05-31 12:33:41] [INFO ] Decomposing Gal with order
[2025-05-31 12:33:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 12:33:41] [INFO ] Removed a total of 58 redundant transitions.
[2025-05-31 12:33:41] [INFO ] Flatten gal took : 87 ms
[2025-05-31 12:33:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 13 ms.
[2025-05-31 12:33:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11793802769664797201.gal : 11 ms
[2025-05-31 12:33:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10131930493068015194.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/ReachabilityCardinality11793802769664797201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10131930493068015194.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 ...330
Loading property file /tmp/ReachabilityCardinality10131930493068015194.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 42
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :42 after 4536
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :4536 after 5.87866e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31988 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-31 12:33:58] [INFO ] Flatten gal took : 1025 ms
[2025-05-31 12:33:58] [INFO ] Applying decomposition
[2025-05-31 12:33:58] [INFO ] Flatten gal took : 667 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/graph9062615596589470562.txt' '-o' '/tmp/graph9062615596589470562.bin' '-w' '/tmp/graph9062615596589470562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9062615596589470562.bin' '-l' '-1' '-v' '-w' '/tmp/graph9062615596589470562.weights' '-q' '0' '-e' '0.001'
[2025-05-31 12:34:00] [INFO ] Decomposing Gal with order
[2025-05-31 12:34:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 12:34:04] [INFO ] Removed a total of 12147 redundant transitions.
[2025-05-31 12:34:05] [INFO ] Flatten gal took : 2066 ms
[2025-05-31 12:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2325 labels/synchronizations in 939 ms.
[2025-05-31 12:34:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8285490678156247411.gal : 206 ms
[2025-05-31 12:34:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16094249831577670236.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/ReachabilityCardinality8285490678156247411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16094249831577670236.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/ReachabilityCardinality16094249831577670236.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :22 after 27
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :27 after 33
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :33 after 38
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :38 after 64
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :64 after 81
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :81 after 93
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :93 after 101
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :101 after 105
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :105 after 109
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :109 after 117
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :117 after 170
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :170 after 210
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :210 after 10179
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :10179 after 14197
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :14197 after 15659
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :15659 after 650090
SDD proceeding with computation,5 properties remain. new max is 524288
SDD size :650090 after 791627
Detected timeout of ITS tools.
[2025-05-31 13:04:11] [INFO ] Flatten gal took : 306 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13806065144191544676
[2025-05-31 13:04:11] [INFO ] Too many transitions (10121) to apply POR reductions. Disabling POR matrices.
[2025-05-31 13:04:11] [INFO ] Applying decomposition
[2025-05-31 13:04:11] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13806065144191544676
Running compilation step : cd /tmp/ltsmin13806065144191544676;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '144' '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-05-31 13:04:12] [INFO ] Flatten gal took : 349 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/graph6839088904241343217.txt' '-o' '/tmp/graph6839088904241343217.bin' '-w' '/tmp/graph6839088904241343217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6839088904241343217.bin' '-l' '-1' '-v' '-w' '/tmp/graph6839088904241343217.weights' '-q' '0' '-e' '0.001'
[2025-05-31 13:04:12] [INFO ] Decomposing Gal with order
[2025-05-31 13:04:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 13:04:14] [INFO ] Removed a total of 10073 redundant transitions.
[2025-05-31 13:04:14] [INFO ] Flatten gal took : 1612 ms
[2025-05-31 13:04:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 9560 labels/synchronizations in 1688 ms.
[2025-05-31 13:04:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15910544253021635180.gal : 51 ms
[2025-05-31 13:04:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4855765812845155254.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/ReachabilityCardinality15910544253021635180.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4855765812845155254.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/ReachabilityCardinality4855765812845155254.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 41
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :42 after 45
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :45 after 46
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :46 after 972
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :972 after 979
Compilation finished in 105705 ms.
Running link step : cd /tmp/ltsmin13806065144191544676;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 141 ms.
Running LTSmin : cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202501==true'
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :979 after 13684
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202501==true'
Running LTSmin : cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202507==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202507==true'
Running LTSmin : cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202508==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202508==true'
Running LTSmin : cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202510==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202510==true'
Running LTSmin : cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202513==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202513==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin13806065144191544676;'/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' 'CANConstructionPT070ReachabilityCardinality202501==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="CANConstruction-PT-070"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 CANConstruction-PT-070, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813500222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-070.tgz
mv CANConstruction-PT-070 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;