Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729500556.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 AutoFlight-PT-24a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729500556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14: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 169K 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 AutoFlight-PT-24a-LTLFireability-00
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-01
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-02
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-03
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-04
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-05
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-06
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-07
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-08
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-09
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-10
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-11
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-12
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-13
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-14
FORMULA_NAME AutoFlight-PT-24a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748634161849

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-24a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 19:42:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 19:42:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 19:42:43] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2025-05-30 19:42:43] [INFO ] Transformed 607 places.
[2025-05-30 19:42:43] [INFO ] Transformed 605 transitions.
[2025-05-30 19:42:43] [INFO ] Found NUPN structural information;
[2025-05-30 19:42:43] [INFO ] Parsed PT model containing 607 places and 605 transitions and 1940 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 120 transitions
Reduce redundant transitions removed 120 transitions.
FORMULA AutoFlight-PT-24a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-24a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 607 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 607/607 places, 485/485 transitions.
Applied a total of 0 rules in 65 ms. Remains 607 /607 variables (removed 0) and now considering 485/485 (removed 0) transitions.
// Phase 1: matrix 485 rows 607 cols
[2025-05-30 19:42:44] [INFO ] Computed 148 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:42:47] [INFO ] Implicit Places using invariants in 3772 ms returned [7, 14, 28, 35, 49, 56, 63, 70, 77, 84, 91, 98, 105, 119, 133, 140, 154, 161, 168, 171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 213, 216, 219, 222, 225, 231, 234, 237, 240, 362, 460, 466, 472, 478, 484, 496, 502, 508, 514, 520, 526, 532, 538, 544, 550, 556, 562, 568, 574, 580, 592, 598, 604]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 3806 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 541/607 places, 485/485 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 519 transition count 463
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 519 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 518 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 518 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 517 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 517 transition count 461
Applied a total of 48 rules in 89 ms. Remains 517 /541 variables (removed 24) and now considering 461/485 (removed 24) transitions.
// Phase 1: matrix 461 rows 517 cols
[2025-05-30 19:42:48] [INFO ] Computed 82 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:42:48] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-05-30 19:42:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:42:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-30 19:42:49] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 517/607 places, 461/485 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5843 ms. Remains : 517/607 places, 461/485 transitions.
Support contains 50 out of 517 places after structural reductions.
[2025-05-30 19:42:50] [INFO ] Flatten gal took : 74 ms
[2025-05-30 19:42:50] [INFO ] Flatten gal took : 32 ms
[2025-05-30 19:42:50] [INFO ] Input system was already deterministic with 461 transitions.
Support contains 49 out of 517 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (433 resets) in 2478 ms. (16 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40004 steps (12 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2025-05-30 19:42:51] [INFO ] Invariant cache hit.
[2025-05-30 19:42:51] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/322 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/517 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 461/978 variables, 517/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 21/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/978 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 978/978 variables, and 620 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 517/517 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 319/322 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 195/517 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 461/978 variables, 517/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 21/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/978 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 978/978 variables, and 622 constraints, problems are : Problem set: 0 solved, 2 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 517/517 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2087ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 3956 steps, including 51 resets, run visited all 2 properties in 49 ms. (steps per millisecond=80 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 53 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(X(F((!p0||G(p1))))))&&G(p2))||G(F((!p0||G(p1)))))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 468 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 468 transition count 412
Applied a total of 98 rules in 741 ms. Remains 468 /517 variables (removed 49) and now considering 412/461 (removed 49) transitions.
// Phase 1: matrix 412 rows 468 cols
[2025-05-30 19:42:54] [INFO ] Computed 82 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:42:55] [INFO ] Implicit Places using invariants in 579 ms returned [19, 38, 99, 112, 131, 190, 387, 453, 467]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 581 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/517 places, 412/461 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 456 transition count 409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 435 transition count 388
Applied a total of 48 rules in 176 ms. Remains 435 /459 variables (removed 24) and now considering 388/412 (removed 24) transitions.
// Phase 1: matrix 388 rows 435 cols
[2025-05-30 19:42:55] [INFO ] Computed 73 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:42:55] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-05-30 19:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:42:56] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/517 places, 388/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2485 ms. Remains : 435/517 places, 388/461 transitions.
Stuttering acceptance computed with spot in 439 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-01
Product exploration explored 100000 steps with 2855 reset in 477 ms.
Product exploration explored 100000 steps with 2991 reset in 462 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 19 factoid took 218 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (429 resets) in 496 ms. (80 steps per ms) remains 1/11 properties
BEST_FIRST walk for 39339 steps (11 resets) in 183 ms. (213 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 626 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 298 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 388/388 transitions.
Applied a total of 0 rules in 12 ms. Remains 435 /435 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2025-05-30 19:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:43:00] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-05-30 19:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:43:00] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2025-05-30 19:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/435 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/823 variables, 435/508 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 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 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 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)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 508 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/435 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/823 variables, 435/508 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 387/895 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:48] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:48] [INFO ] Deduced a trap composed of 198 places in 100 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:48] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:48] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:48] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:49] [INFO ] Deduced a trap composed of 109 places in 93 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:49] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:49] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:49] [INFO ] Deduced a trap composed of 112 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:50] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:50] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:50] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:50] [INFO ] Deduced a trap composed of 116 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:50] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:51] [INFO ] Deduced a trap composed of 118 places in 100 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:51] [INFO ] Deduced a trap composed of 119 places in 93 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:51] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:51] [INFO ] Deduced a trap composed of 121 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:51] [INFO ] Deduced a trap composed of 122 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:43:52] [INFO ] Deduced a trap composed of 123 places in 91 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 20/915 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 915 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 61121 ms. Remains : 435/435 places, 388/388 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 19 factoid took 252 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (437 resets) in 437 ms. (91 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 32888 steps (9 resets) in 62 ms. (522 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 655 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 307 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 306 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 2897 reset in 367 ms.
Product exploration explored 100000 steps with 2842 reset in 424 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 315 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 435/435 places, 388/388 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 435 transition count 388
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 118 place count 435 transition count 388
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 142 place count 435 transition count 388
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 234 place count 343 transition count 296
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 92 rules applied. Total rules applied 326 place count 343 transition count 296
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 374 place count 343 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 378 place count 339 transition count 292
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 382 place count 339 transition count 292
Deduced a syphon composed of 94 places in 0 ms
Applied a total of 382 rules in 80 ms. Remains 339 /435 variables (removed 96) and now considering 292/388 (removed 96) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 19:44:04] [INFO ] Redundant transitions in 12 ms returned []
Running 291 sub problems to find dead transitions.
// Phase 1: matrix 292 rows 339 cols
[2025-05-30 19:44:04] [INFO ] Computed 73 invariants in 8 ms
[2025-05-30 19:44:04] [INFO ] State equation strengthened by 69 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 4 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 4 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 4 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 5 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:10] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 20/93 constraints. Problems are: Problem set: 20 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 4 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 5 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 113 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 4 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 4 ms to minimize.
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 4 ms to minimize.
Problem TDEAD71 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 4 ms to minimize.
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
Problem TDEAD77 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:12] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 20/113 constraints. Problems are: Problem set: 38 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 5 ms to minimize.
Problem TDEAD83 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 5 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 4 ms to minimize.
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 122 places in 71 ms of which 4 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 20/133 constraints. Problems are: Problem set: 82 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:15] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
Problem TDEAD176 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD178 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD184 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD188 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:44:16] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD190 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 12/145 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/145 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 292/631 variables, 339/484 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 69/553 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 0/553 constraints. Problems are: Problem set: 94 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 631/631 variables, and 553 constraints, problems are : Problem set: 94 solved, 197 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 94 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 95/339 variables, 73/73 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 72/145 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/145 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 292/631 variables, 339/484 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 69/553 constraints. Problems are: Problem set: 94 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 197/750 constraints. Problems are: Problem set: 94 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 750 constraints, problems are : Problem set: 94 solved, 197 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 339/339 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 197/291 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60091ms problems are : Problem set: 94 solved, 197 unsolved
Search for dead transitions found 94 dead transitions in 60093ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 339/435 places, 198/388 transitions.
Graph (complete) has 630 edges and 339 vertex of which 245 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.2 ms
Discarding 94 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 245 /339 variables (removed 94) and now considering 198/198 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 245/435 places, 198/388 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60210 ms. Remains : 245/435 places, 198/388 transitions.
Built C files in :
/tmp/ltsmin13661715431923490643
[2025-05-30 19:45:04] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13661715431923490643
Running compilation step : cd /tmp/ltsmin13661715431923490643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' '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'
Compilation finished in 661 ms.
Running link step : cd /tmp/ltsmin13661715431923490643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13661715431923490643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15073808219671320991.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 388/388 transitions.
Applied a total of 0 rules in 11 ms. Remains 435 /435 variables (removed 0) and now considering 388/388 (removed 0) transitions.
// Phase 1: matrix 388 rows 435 cols
[2025-05-30 19:45:19] [INFO ] Computed 73 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:45:20] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-05-30 19:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:45:20] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 387 sub problems to find dead transitions.
[2025-05-30 19:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/435 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/823 variables, 435/508 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 508 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (OVERLAPS) 1/435 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 3 (OVERLAPS) 388/823 variables, 435/508 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 387/895 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:08] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:08] [INFO ] Deduced a trap composed of 198 places in 109 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:08] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:08] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:08] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:09] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:09] [INFO ] Deduced a trap composed of 110 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:09] [INFO ] Deduced a trap composed of 111 places in 189 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:09] [INFO ] Deduced a trap composed of 112 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:10] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:10] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:10] [INFO ] Deduced a trap composed of 115 places in 93 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:10] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:10] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:11] [INFO ] Deduced a trap composed of 118 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:11] [INFO ] Deduced a trap composed of 119 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:11] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:11] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:11] [INFO ] Deduced a trap composed of 122 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:46:12] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 20/915 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 915 constraints, problems are : Problem set: 0 solved, 387 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 387 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Finished structural reductions in LTL mode , in 1 iterations and 61060 ms. Remains : 435/435 places, 388/388 transitions.
Built C files in :
/tmp/ltsmin5020531474849619563
[2025-05-30 19:46:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5020531474849619563
Running compilation step : cd /tmp/ltsmin5020531474849619563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' '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'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin5020531474849619563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5020531474849619563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1940350144187358706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 19:46:36] [INFO ] Flatten gal took : 20 ms
[2025-05-30 19:46:36] [INFO ] Flatten gal took : 20 ms
[2025-05-30 19:46:36] [INFO ] Time to serialize gal into /tmp/LTL13392305748640845917.gal : 6 ms
[2025-05-30 19:46:36] [INFO ] Time to serialize properties into /tmp/LTL8716842402222020846.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13392305748640845917.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1648752715809943883.hoa' '-atoms' '/tmp/LTL8716842402222020846.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8716842402222020846.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1648752715809943883.hoa
Detected timeout of ITS tools.
[2025-05-30 19:46:51] [INFO ] Flatten gal took : 18 ms
[2025-05-30 19:46:51] [INFO ] Flatten gal took : 16 ms
[2025-05-30 19:46:51] [INFO ] Time to serialize gal into /tmp/LTL1787575215198707837.gal : 4 ms
[2025-05-30 19:46:51] [INFO ] Time to serialize properties into /tmp/LTL12036377726243568897.ltl : 2 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1787575215198707837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12036377726243568897.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((p27!=1)||(p481!=1))")||(G("(p80!=1)")))))||((X(X(X(F(("((p27!=1)||(p481!=1))")||(G("(p80!=1)")))))))&&(G("(p66!=1)")))))...156
Formula 0 simplified : G(F!"(p80!=1)" & (XXXG(!"((p27!=1)||(p481!=1))" & F!"(p80!=1)") | F!"(p66!=1)") & FG!"((p27!=1)||(p481!=1))")
Detected timeout of ITS tools.
[2025-05-30 19:47:06] [INFO ] Flatten gal took : 17 ms
[2025-05-30 19:47:06] [INFO ] Applying decomposition
[2025-05-30 19:47:06] [INFO ] Flatten gal took : 16 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/graph8047165791235657755.txt' '-o' '/tmp/graph8047165791235657755.bin' '-w' '/tmp/graph8047165791235657755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8047165791235657755.bin' '-l' '-1' '-v' '-w' '/tmp/graph8047165791235657755.weights' '-q' '0' '-e' '0.001'
[2025-05-30 19:47:06] [INFO ] Decomposing Gal with order
[2025-05-30 19:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:47:06] [INFO ] Removed a total of 48 redundant transitions.
[2025-05-30 19:47:06] [INFO ] Flatten gal took : 63 ms
[2025-05-30 19:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-05-30 19:47:06] [INFO ] Time to serialize gal into /tmp/LTL5041229313096717833.gal : 7 ms
[2025-05-30 19:47:06] [INFO ] Time to serialize properties into /tmp/LTL12486600600449612799.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5041229313096717833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12486600600449612799.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((i3.u7.p27!=1)||(i3.u139.p481!=1))")||(G("(i19.u22.p80!=1)")))))||((X(X(X(F(("((i3.u7.p27!=1)||(i3.u139.p481!=1))")||(G("...207
Formula 0 simplified : G(F!"(i19.u22.p80!=1)" & (XXXG(!"((i3.u7.p27!=1)||(i3.u139.p481!=1))" & F!"(i19.u22.p80!=1)") | F!"(i6.u18.p66!=1)") & FG!"((i3.u7.p...183
Reverse transition relation is NOT exact ! Due to transitions t287, i0.u1.t117, i0.u3.t113, i1.u5.t109, i2.u6.t107, i2.u8.t103, i2.u2.t115, i2.u4.t111, i3....796
Computing Next relation with stutter on 48 deadlock states
Detected timeout of ITS tools.
Treatment of property AutoFlight-PT-24a-LTLFireability-01 finished in 267981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!((!X(p0) U p1) U X(X(p2)))||!(p1 U p2))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 468 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 468 transition count 412
Applied a total of 98 rules in 413 ms. Remains 468 /517 variables (removed 49) and now considering 412/461 (removed 49) transitions.
// Phase 1: matrix 412 rows 468 cols
[2025-05-30 19:47:22] [INFO ] Computed 82 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:22] [INFO ] Implicit Places using invariants in 616 ms returned [19, 99, 112, 131, 190, 387, 453, 467]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 618 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 460/517 places, 412/461 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 455 transition count 407
Applied a total of 10 rules in 42 ms. Remains 455 /460 variables (removed 5) and now considering 407/412 (removed 5) transitions.
// Phase 1: matrix 407 rows 455 cols
[2025-05-30 19:47:22] [INFO ] Computed 74 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:23] [INFO ] Implicit Places using invariants in 452 ms returned []
[2025-05-30 19:47:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 19:47:23] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 455/517 places, 407/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2174 ms. Remains : 455/517 places, 407/461 transitions.
Stuttering acceptance computed with spot in 419 ms :[p2, p2, false, false, p2, p2, true, (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 18 steps with 2 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-02 finished in 2627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(X(p1)))&&(X(p1)||F(p2))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 468 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 468 transition count 412
Applied a total of 98 rules in 351 ms. Remains 468 /517 variables (removed 49) and now considering 412/461 (removed 49) transitions.
// Phase 1: matrix 412 rows 468 cols
[2025-05-30 19:47:24] [INFO ] Computed 82 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:25] [INFO ] Implicit Places using invariants in 590 ms returned [19, 38, 99, 112, 131, 190, 387, 453, 467]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 602 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/517 places, 412/461 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 456 transition count 409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 435 transition count 388
Applied a total of 48 rules in 127 ms. Remains 435 /459 variables (removed 24) and now considering 388/412 (removed 24) transitions.
// Phase 1: matrix 388 rows 435 cols
[2025-05-30 19:47:25] [INFO ] Computed 73 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:25] [INFO ] Implicit Places using invariants in 388 ms returned []
[2025-05-30 19:47:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:26] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/517 places, 388/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2049 ms. Remains : 435/517 places, 388/461 transitions.
Stuttering acceptance computed with spot in 379 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-03
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-03 finished in 2468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Applied a total of 38 rules in 157 ms. Remains 498 /517 variables (removed 19) and now considering 442/461 (removed 19) transitions.
// Phase 1: matrix 442 rows 498 cols
[2025-05-30 19:47:27] [INFO ] Computed 82 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:27] [INFO ] Implicit Places using invariants in 684 ms returned [19, 38, 99, 112, 190, 417, 483, 497]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 686 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 490/517 places, 442/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 488 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 488 transition count 440
Applied a total of 4 rules in 18 ms. Remains 488 /490 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 488 cols
[2025-05-30 19:47:27] [INFO ] Computed 74 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:28] [INFO ] Implicit Places using invariants in 544 ms returned []
[2025-05-30 19:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 19:47:29] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 488/517 places, 440/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2167 ms. Remains : 488/517 places, 440/461 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-05 finished in 2315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 510 transition count 297
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 332 place count 347 transition count 297
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 332 place count 347 transition count 248
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 454 place count 274 transition count 248
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 454 place count 274 transition count 224
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 502 place count 250 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 504 place count 248 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 506 place count 248 transition count 222
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 604 place count 199 transition count 173
Applied a total of 604 rules in 33 ms. Remains 199 /517 variables (removed 318) and now considering 173/461 (removed 288) transitions.
// Phase 1: matrix 173 rows 199 cols
[2025-05-30 19:47:29] [INFO ] Computed 52 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:29] [INFO ] Implicit Places using invariants in 144 ms returned [156, 190, 198]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 145 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/517 places, 173/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 194 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 194 transition count 171
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 0 with 2 rules applied. Total rules applied 6 place count 193 transition count 170
Applied a total of 6 rules in 11 ms. Remains 193 /196 variables (removed 3) and now considering 170/173 (removed 3) transitions.
// Phase 1: matrix 170 rows 193 cols
[2025-05-30 19:47:29] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:29] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-30 19:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:29] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 193/517 places, 170/461 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 513 ms. Remains : 193/517 places, 170/461 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-06
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-06 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (((F(p1) U p2) U X(p0))||X(p3))))'
Support contains 6 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 468 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 468 transition count 412
Applied a total of 98 rules in 346 ms. Remains 468 /517 variables (removed 49) and now considering 412/461 (removed 49) transitions.
// Phase 1: matrix 412 rows 468 cols
[2025-05-30 19:47:30] [INFO ] Computed 82 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:30] [INFO ] Implicit Places using invariants in 588 ms returned [19, 38, 99, 112, 131, 190, 453, 467]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 590 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 460/517 places, 412/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 458 transition count 410
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 458 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 457 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 445 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 444 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 444 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 443 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 443 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 442 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 442 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 441 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 441 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 440 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 440 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 439 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 439 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 438 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 438 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 437 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 437 transition count 389
Applied a total of 46 rules in 141 ms. Remains 437 /460 variables (removed 23) and now considering 389/412 (removed 23) transitions.
// Phase 1: matrix 389 rows 437 cols
[2025-05-30 19:47:30] [INFO ] Computed 74 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:31] [INFO ] Implicit Places using invariants in 401 ms returned []
[2025-05-30 19:47:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:31] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 437/517 places, 389/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2043 ms. Remains : 437/517 places, 389/461 transitions.
Stuttering acceptance computed with spot in 506 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) p2 (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-08
Stuttering criterion allowed to conclude after 186 steps with 4 reset in 8 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-08 finished in 2584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 517 transition count 337
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 248 place count 393 transition count 337
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 248 place count 393 transition count 270
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 382 place count 326 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 384 place count 324 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 386 place count 324 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 387 place count 323 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 388 place count 323 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 389 place count 322 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 321 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 321 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 320 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 320 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 319 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 319 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 318 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 318 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 317 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 317 transition count 261
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 496 place count 269 transition count 213
Applied a total of 496 rules in 54 ms. Remains 269 /517 variables (removed 248) and now considering 213/461 (removed 248) transitions.
// Phase 1: matrix 213 rows 269 cols
[2025-05-30 19:47:32] [INFO ] Computed 82 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:32] [INFO ] Implicit Places using invariants in 340 ms returned [13, 26, 68, 90, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 206, 257, 268]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 341 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/517 places, 213/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 237 transition count 183
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 207 transition count 183
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 60 place count 207 transition count 180
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 204 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 202 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 202 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 200 transition count 176
Applied a total of 74 rules in 11 ms. Remains 200 /237 variables (removed 37) and now considering 176/213 (removed 37) transitions.
// Phase 1: matrix 176 rows 200 cols
[2025-05-30 19:47:32] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:32] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-30 19:47:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 19:47:33] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 200/517 places, 176/461 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 809 ms. Remains : 200/517 places, 176/461 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-09
Product exploration explored 100000 steps with 1811 reset in 292 ms.
Product exploration explored 100000 steps with 1790 reset in 313 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
RANDOM walk for 19231 steps (342 resets) in 132 ms. (144 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 (NOT p1)) p0))), (F p1), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 13 factoid took 459 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-30 19:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:35] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 19:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:47:35] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 19:47:35] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 19:47:35] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2025-05-30 19:47:35] [INFO ] Invariant cache hit.
[2025-05-30 19:47:35] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/376 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 300 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/376 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 175/475 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 475 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60471 ms. Remains : 200/200 places, 176/176 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 181 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
RANDOM walk for 9142 steps (159 resets) in 53 ms. (169 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (OR p2 (NOT p1)) p0))), (F p1), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 13 factoid took 435 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1802 reset in 279 ms.
Product exploration explored 100000 steps with 1793 reset in 299 ms.
Built C files in :
/tmp/ltsmin17342447186544808659
[2025-05-30 19:48:37] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-05-30 19:48:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:48:37] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-05-30 19:48:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:48:37] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-05-30 19:48:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:48:37] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17342447186544808659
Running compilation step : cd /tmp/ltsmin17342447186544808659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' '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'
Compilation finished in 354 ms.
Running link step : cd /tmp/ltsmin17342447186544808659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17342447186544808659;'/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' '--hoa' '/tmp/stateBased84993287758051820.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-30 19:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:48:52] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 19:48:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:48:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 19:48:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 19:48:52] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2025-05-30 19:48:52] [INFO ] Invariant cache hit.
[2025-05-30 19:48:52] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/376 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/376 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 300 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/376 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 50/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 175/475 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 475 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 200/200 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60478 ms. Remains : 200/200 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin17685420367367418337
[2025-05-30 19:49:52] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-05-30 19:49:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:49:52] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-05-30 19:49:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:49:52] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-05-30 19:49:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 19:49:52] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17685420367367418337
Running compilation step : cd /tmp/ltsmin17685420367367418337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' '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'
Compilation finished in 366 ms.
Running link step : cd /tmp/ltsmin17685420367367418337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17685420367367418337;'/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' '--hoa' '/tmp/stateBased13526745274478635028.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 19:50:08] [INFO ] Flatten gal took : 10 ms
[2025-05-30 19:50:08] [INFO ] Flatten gal took : 14 ms
[2025-05-30 19:50:08] [INFO ] Time to serialize gal into /tmp/LTL15174660408979587000.gal : 2 ms
[2025-05-30 19:50:08] [INFO ] Time to serialize properties into /tmp/LTL11657544549936641673.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15174660408979587000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7027640204771514918.hoa' '-atoms' '/tmp/LTL11657544549936641673.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11657544549936641673.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7027640204771514918.hoa
Detected timeout of ITS tools.
[2025-05-30 19:50:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 19:50:23] [INFO ] Flatten gal took : 5 ms
[2025-05-30 19:50:23] [INFO ] Time to serialize gal into /tmp/LTL8158637285083921771.gal : 2 ms
[2025-05-30 19:50:23] [INFO ] Time to serialize properties into /tmp/LTL16926542390253061337.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8158637285083921771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16926542390253061337.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((p102==1)&&(p450==1))"))U(("((p110!=1)&&(!((p102==1)&&(p450==1))))")||(G(!("((p102==1)&&(p450==1))")))))&&("((p126!=1)||(...170
Formula 0 simplified : FG(!"((p126!=1)||(p331!=1))" | ("((p102==1)&&(p450==1))" M !"((p110!=1)&&(!((p102==1)&&(p450==1))))"))
Detected timeout of ITS tools.
[2025-05-30 19:50:38] [INFO ] Flatten gal took : 7 ms
[2025-05-30 19:50:38] [INFO ] Applying decomposition
[2025-05-30 19:50:38] [INFO ] Flatten gal took : 5 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/graph10301993786230273804.txt' '-o' '/tmp/graph10301993786230273804.bin' '-w' '/tmp/graph10301993786230273804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10301993786230273804.bin' '-l' '-1' '-v' '-w' '/tmp/graph10301993786230273804.weights' '-q' '0' '-e' '0.001'
[2025-05-30 19:50:38] [INFO ] Decomposing Gal with order
[2025-05-30 19:50:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:50:38] [INFO ] Removed a total of 4 redundant transitions.
[2025-05-30 19:50:38] [INFO ] Flatten gal took : 14 ms
[2025-05-30 19:50:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 19:50:38] [INFO ] Time to serialize gal into /tmp/LTL17424626039023166910.gal : 3 ms
[2025-05-30 19:50:38] [INFO ] Time to serialize properties into /tmp/LTL4550139115441753939.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17424626039023166910.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4550139115441753939.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((!("((i9.u29.p102==1)&&(i9.u29.p450==1))"))U(("((i4.u31.p110!=1)&&(!((i9.u29.p102==1)&&(i9.u29.p450==1))))")||(G(!("((i9.u29.p...239
Formula 0 simplified : FG(!"((i0.i1.u48.p126!=1)||(i0.i1.u49.p331!=1))" | ("((i9.u29.p102==1)&&(i9.u29.p450==1))" M !"((i4.u31.p110!=1)&&(!((i9.u29.p102==1...180
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u48.t286.t285.t284.t283.t282.t281.t280, i4.u31.t57, Intersection with reachable at eac...219
Computing Next relation with stutter on 48 deadlock states
76 unique states visited
0 strongly connected components in search stack
125 transitions explored
52 items max in DFS search stack
599 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.01638,196488,1,0,284801,38921,2462,447792,1200,172498,637458
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA AutoFlight-PT-24a-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property AutoFlight-PT-24a-LTLFireability-09 finished in 193093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U (p1 U p2))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 468 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 468 transition count 412
Applied a total of 98 rules in 355 ms. Remains 468 /517 variables (removed 49) and now considering 412/461 (removed 49) transitions.
// Phase 1: matrix 412 rows 468 cols
[2025-05-30 19:50:45] [INFO ] Computed 82 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:46] [INFO ] Implicit Places using invariants in 584 ms returned [19, 38, 112, 131, 190, 387, 453, 467]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 588 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 460/517 places, 412/461 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 457 transition count 409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 457 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 456 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 456 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 455 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 455 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 454 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 454 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 453 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 453 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 452 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 452 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 451 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 451 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 450 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 450 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 449 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 449 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 448 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 448 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 447 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 447 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 446 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 446 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 445 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 445 transition count 397
Applied a total of 30 rules in 80 ms. Remains 445 /460 variables (removed 15) and now considering 397/412 (removed 15) transitions.
// Phase 1: matrix 397 rows 445 cols
[2025-05-30 19:50:46] [INFO ] Computed 74 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:46] [INFO ] Implicit Places using invariants in 438 ms returned []
[2025-05-30 19:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 19:50:47] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 445/517 places, 397/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2106 ms. Remains : 445/517 places, 397/461 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 517 ms.
Product exploration explored 100000 steps with 50000 reset in 534 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 17 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-24a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-24a-LTLFireability-10 finished in 3394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 516 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 516 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 515 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Applied a total of 96 rules in 363 ms. Remains 469 /517 variables (removed 48) and now considering 413/461 (removed 48) transitions.
// Phase 1: matrix 413 rows 469 cols
[2025-05-30 19:50:49] [INFO ] Computed 82 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:49] [INFO ] Implicit Places using invariants in 563 ms returned [19, 38, 99, 112, 131, 387, 454]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 564 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 462/517 places, 413/461 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 459 transition count 410
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 459 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 458 transition count 409
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 458 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 457 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 457 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 456 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 456 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 455 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 455 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 454 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 454 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 453 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 453 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 452 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 452 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 451 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 451 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 450 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 450 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 449 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 449 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 448 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 448 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 447 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 447 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 446 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 446 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 445 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 445 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 444 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 444 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 443 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 443 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 442 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 442 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 441 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 441 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 440 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 440 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 439 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 439 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 438 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 438 transition count 389
Applied a total of 48 rules in 141 ms. Remains 438 /462 variables (removed 24) and now considering 389/413 (removed 24) transitions.
// Phase 1: matrix 389 rows 438 cols
[2025-05-30 19:50:49] [INFO ] Computed 75 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:50] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-05-30 19:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 19:50:50] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 438/517 places, 389/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1850 ms. Remains : 438/517 places, 389/461 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-11 finished in 1996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p0&&X(F(p1))) U (G((!p0&&F(p1)))||(!p0&&X((!p1&&F(p1)))))))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 516 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 516 transition count 460
Applied a total of 2 rules in 20 ms. Remains 516 /517 variables (removed 1) and now considering 460/461 (removed 1) transitions.
// Phase 1: matrix 460 rows 516 cols
[2025-05-30 19:50:50] [INFO ] Computed 82 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:51] [INFO ] Implicit Places using invariants in 174 ms returned [38, 99, 112, 131, 190, 435, 501, 515]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 175 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 508/517 places, 460/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 506 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 506 transition count 458
Applied a total of 4 rules in 15 ms. Remains 506 /508 variables (removed 2) and now considering 458/460 (removed 2) transitions.
// Phase 1: matrix 458 rows 506 cols
[2025-05-30 19:50:51] [INFO ] Computed 74 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:51] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 19:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 19:50:51] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 506/517 places, 458/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 705 ms. Remains : 506/517 places, 458/461 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-12
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-12 finished in 946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 515 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 515 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 514 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 514 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 513 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 513 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 512 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 512 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 511 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 511 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 510 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 510 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 509 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 509 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 508 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 508 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 507 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 507 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 506 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 506 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 505 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 505 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 504 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 504 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 503 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 503 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 502 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 502 transition count 446
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 501 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 501 transition count 445
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 500 transition count 444
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 500 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 499 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 499 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 498 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 498 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 497 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 497 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 496 transition count 440
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 496 transition count 440
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 495 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 495 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 494 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 494 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 493 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 493 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 492 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 492 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 491 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 491 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 490 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 490 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 489 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 489 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 488 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 488 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 487 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 487 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 486 transition count 430
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 486 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 485 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 485 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 484 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 484 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 483 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 483 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 482 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 482 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 481 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 481 transition count 425
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 480 transition count 424
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 480 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 479 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 479 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 478 transition count 422
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 478 transition count 422
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 477 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 477 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 476 transition count 420
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 476 transition count 420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 475 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 475 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 474 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 474 transition count 418
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 473 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 473 transition count 417
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 472 transition count 416
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 472 transition count 416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 471 transition count 415
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 471 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 470 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 470 transition count 414
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 469 transition count 413
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 469 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 468 transition count 412
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 468 transition count 412
Applied a total of 98 rules in 357 ms. Remains 468 /517 variables (removed 49) and now considering 412/461 (removed 49) transitions.
// Phase 1: matrix 412 rows 468 cols
[2025-05-30 19:50:52] [INFO ] Computed 82 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:52] [INFO ] Implicit Places using invariants in 604 ms returned [19, 38, 99, 112, 131, 190, 387, 453, 467]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 606 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 459/517 places, 412/461 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 456 transition count 409
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 456 transition count 409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 455 transition count 408
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 455 transition count 408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 454 transition count 407
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 454 transition count 407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 453 transition count 406
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 453 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 451 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 451 transition count 404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 450 transition count 403
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 450 transition count 403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 449 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 449 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 448 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 448 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 447 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 447 transition count 400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 446 transition count 399
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 446 transition count 399
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 445 transition count 398
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 445 transition count 398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 444 transition count 397
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 444 transition count 397
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 443 transition count 396
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 443 transition count 396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 442 transition count 395
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 442 transition count 395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 441 transition count 394
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 441 transition count 394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 440 transition count 393
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 440 transition count 393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 439 transition count 392
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 439 transition count 392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 438 transition count 391
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 438 transition count 391
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 437 transition count 390
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 437 transition count 390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 436 transition count 389
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 436 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 435 transition count 388
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 435 transition count 388
Applied a total of 48 rules in 149 ms. Remains 435 /459 variables (removed 24) and now considering 388/412 (removed 24) transitions.
// Phase 1: matrix 388 rows 435 cols
[2025-05-30 19:50:52] [INFO ] Computed 73 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:53] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-30 19:50:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:53] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/517 places, 388/461 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2085 ms. Remains : 435/517 places, 388/461 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-13 finished in 2193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p1||G(p2)))))'
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 517 transition count 336
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 250 place count 392 transition count 336
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 250 place count 392 transition count 271
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 380 place count 327 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 382 place count 325 transition count 269
Iterating global reduction 2 with 2 rules applied. Total rules applied 384 place count 325 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 385 place count 324 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 386 place count 324 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 387 place count 323 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 388 place count 323 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 389 place count 322 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 321 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 321 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 320 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 320 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 319 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 319 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 318 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 318 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 317 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 317 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 316 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 316 transition count 260
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 496 place count 269 transition count 213
Applied a total of 496 rules in 63 ms. Remains 269 /517 variables (removed 248) and now considering 213/461 (removed 248) transitions.
// Phase 1: matrix 213 rows 269 cols
[2025-05-30 19:50:54] [INFO ] Computed 82 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:54] [INFO ] Implicit Places using invariants in 315 ms returned [13, 26, 69, 78, 91, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 206, 257, 268]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 316 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/517 places, 213/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 237 transition count 180
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 204 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 202 transition count 178
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 202 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 200 transition count 176
Applied a total of 74 rules in 10 ms. Remains 200 /237 variables (removed 37) and now considering 176/213 (removed 37) transitions.
// Phase 1: matrix 176 rows 200 cols
[2025-05-30 19:50:54] [INFO ] Computed 50 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:54] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 19:50:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:54] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-30 19:50:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 200/517 places, 176/461 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 773 ms. Remains : 200/517 places, 176/461 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 428 steps with 7 reset in 4 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24a-LTLFireability-15 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(X(X(F((!p0||G(p1))))))&&G(p2))||G(F((!p0||G(p1)))))))'
Found a Shortening insensitive property : AutoFlight-PT-24a-LTLFireability-01
Stuttering acceptance computed with spot in 308 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 517 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 517/517 places, 461/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 517 transition count 336
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 250 place count 392 transition count 336
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 250 place count 392 transition count 269
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 384 place count 325 transition count 269
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 386 place count 323 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 323 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 389 place count 322 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 390 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 391 place count 321 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 321 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 320 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 320 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 395 place count 319 transition count 263
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 319 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 397 place count 318 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 398 place count 318 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 399 place count 317 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 317 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 401 place count 316 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 316 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 403 place count 315 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 315 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 405 place count 314 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 314 transition count 258
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 498 place count 268 transition count 212
Applied a total of 498 rules in 58 ms. Remains 268 /517 variables (removed 249) and now considering 212/461 (removed 249) transitions.
// Phase 1: matrix 212 rows 268 cols
[2025-05-30 19:50:55] [INFO ] Computed 82 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:55] [INFO ] Implicit Places using invariants in 313 ms returned [13, 27, 70, 79, 92, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 205, 256, 267]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 320 ms to find 33 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 235/517 places, 212/461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 235 transition count 179
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 202 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 200 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 200 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 198 transition count 175
Applied a total of 74 rules in 8 ms. Remains 198 /235 variables (removed 37) and now considering 175/212 (removed 37) transitions.
// Phase 1: matrix 175 rows 198 cols
[2025-05-30 19:50:55] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:55] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-30 19:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 19:50:56] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/517 places, 175/461 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 803 ms. Remains : 198/517 places, 175/461 transitions.
Running random walk in product with property : AutoFlight-PT-24a-LTLFireability-01
Product exploration explored 100000 steps with 4166 reset in 293 ms.
Product exploration explored 100000 steps with 4287 reset in 315 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 19 factoid took 288 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 38181 steps (673 resets) in 129 ms. (293 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 665 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 298 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-05-30 19:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:58] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 19:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:50:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 19:50:59] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-05-30 19:50:59] [INFO ] Invariant cache hit.
[2025-05-30 19:50:59] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:51:01] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/373 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 45/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 293 constraints, problems are : Problem set: 0 solved, 174 unsolved in 10908 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 198/198 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/373 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 45/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 467 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 198/198 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40950ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 40951ms
Finished structural reductions in LTL mode , in 1 iterations and 41365 ms. Remains : 198/198 places, 175/175 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 19 factoid took 292 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 36670 steps (643 resets) in 148 ms. (246 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p2)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 19 factoid took 658 ms. Reduced automaton from 7 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 290 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 314 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 4241 reset in 291 ms.
Product exploration explored 100000 steps with 4156 reset in 326 ms.
Applying partial POR strategy [false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 328 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 19:51:43] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2025-05-30 19:51:43] [INFO ] Invariant cache hit.
[2025-05-30 19:51:43] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:51:45] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/373 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 45/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 293 constraints, problems are : Problem set: 0 solved, 174 unsolved in 11106 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 198/198 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/373 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 45/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 467 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 198/198 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41149ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 41149ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41162 ms. Remains : 198/198 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin12549231906867069526
[2025-05-30 19:52:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12549231906867069526
Running compilation step : cd /tmp/ltsmin12549231906867069526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' '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'
Compilation finished in 310 ms.
Running link step : cd /tmp/ltsmin12549231906867069526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12549231906867069526;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8301483451971344072.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-05-30 19:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:52:39] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-30 19:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 19:52:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 19:52:40] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-05-30 19:52:40] [INFO ] Invariant cache hit.
[2025-05-30 19:52:40] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 19:52:42] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/373 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 45/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/373 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 293 constraints, problems are : Problem set: 0 solved, 174 unsolved in 10737 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 198/198 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/373 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 45/293 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 467 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 198/198 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40784ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 40785ms
Finished structural reductions in LTL mode , in 1 iterations and 41212 ms. Remains : 198/198 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin5656983111014515199
[2025-05-30 19:53:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5656983111014515199
Running compilation step : cd /tmp/ltsmin5656983111014515199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' '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'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin5656983111014515199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5656983111014515199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7743782817349005483.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 19:53:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 19:53:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 19:53:36] [INFO ] Time to serialize gal into /tmp/LTL15383118371492973607.gal : 1 ms
[2025-05-30 19:53:36] [INFO ] Time to serialize properties into /tmp/LTL14936375866217914972.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15383118371492973607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2251824964037143423.hoa' '-atoms' '/tmp/LTL14936375866217914972.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14936375866217914972.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2251824964037143423.hoa
Detected timeout of ITS tools.
[2025-05-30 19:53:51] [INFO ] Flatten gal took : 4 ms
[2025-05-30 19:53:51] [INFO ] Flatten gal took : 4 ms
[2025-05-30 19:53:51] [INFO ] Time to serialize gal into /tmp/LTL15508325612875075868.gal : 1 ms
[2025-05-30 19:53:51] [INFO ] Time to serialize properties into /tmp/LTL714821226218317578.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15508325612875075868.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL714821226218317578.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((p27!=1)||(p481!=1))")||(G("(p80!=1)")))))||((X(X(X(F(("((p27!=1)||(p481!=1))")||(G("(p80!=1)")))))))&&(G("(p66!=1)")))))...156
Formula 0 simplified : G(F!"(p80!=1)" & (XXXG(!"((p27!=1)||(p481!=1))" & F!"(p80!=1)") | F!"(p66!=1)") & FG!"((p27!=1)||(p481!=1))")
Detected timeout of ITS tools.
[2025-05-30 19:54:06] [INFO ] Flatten gal took : 9 ms
[2025-05-30 19:54:06] [INFO ] Applying decomposition
[2025-05-30 19:54:06] [INFO ] Flatten gal took : 4 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/graph1547507831099949688.txt' '-o' '/tmp/graph1547507831099949688.bin' '-w' '/tmp/graph1547507831099949688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1547507831099949688.bin' '-l' '-1' '-v' '-w' '/tmp/graph1547507831099949688.weights' '-q' '0' '-e' '0.001'
[2025-05-30 19:54:06] [INFO ] Decomposing Gal with order
[2025-05-30 19:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 19:54:06] [INFO ] Removed a total of 5 redundant transitions.
[2025-05-30 19:54:06] [INFO ] Flatten gal took : 15 ms
[2025-05-30 19:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-05-30 19:54:06] [INFO ] Time to serialize gal into /tmp/LTL6716803322438414315.gal : 3 ms
[2025-05-30 19:54:06] [INFO ] Time to serialize properties into /tmp/LTL9351762789847994580.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6716803322438414315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9351762789847994580.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((i1.u7.p27!=1)||(i1.u67.p481!=1))")||(G("(i4.i0.u22.p80!=1)")))))||((X(X(X(F(("((i1.u7.p27!=1)||(i1.u67.p481!=1))")||(G("...212
Formula 0 simplified : G(F!"(i4.i0.u22.p80!=1)" & (XXXG(!"((i1.u7.p27!=1)||(i1.u67.p481!=1))" & F!"(i4.i0.u22.p80!=1)") | F!"(i4.i1.u18.p66!=1)") & FG!"((i...188
Reverse transition relation is NOT exact ! Due to transitions t217_t216_t215_t214_t213_t212_t211_t210_t209_t208_t207_t206_t205_t204_t203_t202_t201_t200_t19...1185
Computing Next relation with stutter on 48 deadlock states
789 unique states visited
0 strongly connected components in search stack
1612 transitions explored
135 items max in DFS search stack
882 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.86687,221880,1,0,393640,34015,2426,463465,1134,168200,892522
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property AutoFlight-PT-24a-LTLFireability-01 finished in 201611 ms.
FORMULA AutoFlight-PT-24a-LTLFireability-01 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2025-05-30 19:54:16] [INFO ] Flatten gal took : 11 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 692915 ms.

BK_STOP 1748634856628

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="AutoFlight-PT-24a"
export BK_EXAMINATION="LTLFireability"
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 AutoFlight-PT-24a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729500556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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