Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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.6K 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 279K 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 ASLink-PT-02a-LTLFireability-00
FORMULA_NAME ASLink-PT-02a-LTLFireability-01
FORMULA_NAME ASLink-PT-02a-LTLFireability-02
FORMULA_NAME ASLink-PT-02a-LTLFireability-03
FORMULA_NAME ASLink-PT-02a-LTLFireability-04
FORMULA_NAME ASLink-PT-02a-LTLFireability-05
FORMULA_NAME ASLink-PT-02a-LTLFireability-06
FORMULA_NAME ASLink-PT-02a-LTLFireability-07
FORMULA_NAME ASLink-PT-02a-LTLFireability-08
FORMULA_NAME ASLink-PT-02a-LTLFireability-09
FORMULA_NAME ASLink-PT-02a-LTLFireability-10
FORMULA_NAME ASLink-PT-02a-LTLFireability-11
FORMULA_NAME ASLink-PT-02a-LTLFireability-12
FORMULA_NAME ASLink-PT-02a-LTLFireability-13
FORMULA_NAME ASLink-PT-02a-LTLFireability-14
FORMULA_NAME ASLink-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748567350277

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 01:09:11] [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 01:09:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:09:11] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-05-30 01:09:11] [INFO ] Transformed 626 places.
[2025-05-30 01:09:11] [INFO ] Transformed 1008 transitions.
[2025-05-30 01:09:11] [INFO ] Found NUPN structural information;
[2025-05-30 01:09:11] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 615 transition count 998
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 608 transition count 973
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 26 place count 607 transition count 973
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 607 transition count 971
Applied a total of 28 rules in 96 ms. Remains 607 /626 variables (removed 19) and now considering 971/998 (removed 27) transitions.
// Phase 1: matrix 971 rows 607 cols
[2025-05-30 01:09:12] [INFO ] Computed 106 invariants in 71 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:12] [INFO ] Implicit Places using invariants in 765 ms returned [1, 19, 23, 33, 51, 69, 198, 215, 220, 221, 222, 240, 258, 387, 392, 404, 409, 410, 411, 445, 447, 450, 469, 470, 471, 488, 496, 504, 510, 516, 522, 536, 542, 548, 556]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 801 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 572/626 places, 971/998 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 561 transition count 960
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 561 transition count 960
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 553 transition count 952
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 553 transition count 952
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 550 transition count 949
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 550 transition count 949
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 549 transition count 948
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 549 transition count 948
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 548 transition count 947
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 548 transition count 947
Applied a total of 48 rules in 111 ms. Remains 548 /572 variables (removed 24) and now considering 947/971 (removed 24) transitions.
// Phase 1: matrix 947 rows 548 cols
[2025-05-30 01:09:12] [INFO ] Computed 71 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:13] [INFO ] Implicit Places using invariants in 337 ms returned []
[2025-05-30 01:09:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:14] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1216 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 548/626 places, 947/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2238 ms. Remains : 548/626 places, 947/998 transitions.
Support contains 63 out of 548 places after structural reductions.
[2025-05-30 01:09:14] [INFO ] Flatten gal took : 97 ms
[2025-05-30 01:09:14] [INFO ] Flatten gal took : 58 ms
[2025-05-30 01:09:14] [INFO ] Input system was already deterministic with 947 transitions.
RANDOM walk for 40000 steps (499 resets) in 1545 ms. (25 steps per ms) remains 19/34 properties
BEST_FIRST walk for 4004 steps (14 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (15 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 57 ms. (69 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 63 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
[2025-05-30 01:09:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 233/273 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 12/285 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 5 (OVERLAPS) 263/548 variables, 52/71 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:16] [INFO ] Deduced a trap composed of 64 places in 222 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 947/1495 variables, 548/620 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1495 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/1495 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1495/1495 variables, and 620 constraints, problems are : Problem set: 1 solved, 18 unsolved in 3365 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 233/273 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 12/285 variables, 3/19 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 263/548 variables, 52/71 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:19] [INFO ] Deduced a trap composed of 65 places in 174 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:19] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 58 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/74 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 9 (OVERLAPS) 947/1495 variables, 548/622 constraints. Problems are: Problem set: 11 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1495 variables, 8/630 constraints. Problems are: Problem set: 11 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1495 variables, 0/630 constraints. Problems are: Problem set: 11 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1495 variables, 0/630 constraints. Problems are: Problem set: 11 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1495/1495 variables, and 630 constraints, problems are : Problem set: 11 solved, 8 unsolved in 4882 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 8/19 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8297ms problems are : Problem set: 11 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 10279 ms.
Support contains 17 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 947/947 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 548 transition count 858
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 459 transition count 858
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 178 place count 459 transition count 799
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 316 place count 380 transition count 799
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 318 place count 379 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 378 transition count 798
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 319 place count 378 transition count 790
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 335 place count 370 transition count 790
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 338 place count 367 transition count 780
Iterating global reduction 4 with 3 rules applied. Total rules applied 341 place count 367 transition count 780
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 342 place count 367 transition count 779
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 343 place count 366 transition count 779
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 343 place count 366 transition count 778
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 345 place count 365 transition count 778
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 364 transition count 770
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 364 transition count 770
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 363 transition count 762
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 363 transition count 762
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 362 transition count 754
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 362 transition count 754
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 361 transition count 746
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 361 transition count 746
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 360 transition count 738
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 360 transition count 738
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 359 transition count 730
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 359 transition count 730
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 358 transition count 722
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 358 transition count 722
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 357 transition count 714
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 357 transition count 714
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 356 transition count 706
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 356 transition count 706
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 355 transition count 698
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 355 transition count 698
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 354 transition count 690
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 354 transition count 690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 353 transition count 682
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 353 transition count 682
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 352 transition count 674
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 352 transition count 674
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 351 transition count 666
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 351 transition count 666
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 374 place count 350 transition count 658
Iterating global reduction 6 with 1 rules applied. Total rules applied 375 place count 350 transition count 658
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 453 place count 311 transition count 619
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 311 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 455 place count 310 transition count 618
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 474 place count 310 transition count 599
Ensure Unique test removed 6 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 499 place count 285 transition count 599
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 502 place count 282 transition count 596
Ensure Unique test removed 1 places
Iterating global reduction 8 with 4 rules applied. Total rules applied 506 place count 281 transition count 596
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 509 place count 281 transition count 593
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 510 place count 281 transition count 592
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 518 place count 281 transition count 592
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 520 place count 281 transition count 592
Applied a total of 520 rules in 318 ms. Remains 281 /548 variables (removed 267) and now considering 592/947 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 281/548 places, 592/947 transitions.
RANDOM walk for 40000 steps (833 resets) in 526 ms. (75 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (316 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (321 resets) in 152 ms. (261 steps per ms) remains 1/7 properties
// Phase 1: matrix 592 rows 281 cols
[2025-05-30 01:09:34] [INFO ] Computed 43 invariants in 7 ms
[2025-05-30 01:09:34] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/80 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 171/251 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/281 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 592/873 variables, 281/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/873 variables, 10/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/873 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/873 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 873/873 variables, and 334 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 281/281 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/80 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 171/251 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/281 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 592/873 variables, 281/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/873 variables, 10/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/873 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/873 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 873/873 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 281/281 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 592/592 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 278 transition count 589
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 278 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 276 transition count 587
Applied a total of 10 rules in 39 ms. Remains 276 /281 variables (removed 5) and now considering 587/592 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 276/281 places, 587/592 transitions.
RANDOM walk for 40000 steps (843 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (299 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20181 steps, run visited all 1 properties in 144 ms. (steps per millisecond=140 )
Probabilistic random walk after 20181 steps, saw 10703 distinct states, run finished after 149 ms. (steps per millisecond=135 ) properties seen :1
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-02a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-02a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 X(G(p1)))))'
Support contains 6 out of 548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 546 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 546 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 545 transition count 931
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 545 transition count 931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 544 transition count 923
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 544 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 543 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 543 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 542 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 542 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 541 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 541 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 540 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 540 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 539 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 539 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 538 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 538 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 537 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 537 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 536 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 535 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 535 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 534 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 534 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 533 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 533 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 532 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 532 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 531 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 531 transition count 819
Applied a total of 33 rules in 241 ms. Remains 531 /548 variables (removed 17) and now considering 819/947 (removed 128) transitions.
// Phase 1: matrix 819 rows 531 cols
[2025-05-30 01:09:36] [INFO ] Computed 70 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:36] [INFO ] Implicit Places using invariants in 342 ms returned [18, 429, 469]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 344 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/548 places, 819/947 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 526 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 526 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 524 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 524 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 522 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 522 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 521 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 521 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 520 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 520 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 519 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 519 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 518 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 518 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 517 transition count 808
Applied a total of 22 rules in 55 ms. Remains 517 /528 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 517 cols
[2025-05-30 01:09:36] [INFO ] Computed 67 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:36] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-05-30 01:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:37] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 517/548 places, 808/947 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1777 ms. Remains : 517/548 places, 808/947 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA ASLink-PT-02a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-02 finished in 2206 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(G(p0)))'
Support contains 4 out of 548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 546 transition count 852
Reduce places removed 96 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 193 place count 450 transition count 850
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 195 place count 448 transition count 850
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 195 place count 448 transition count 786
Deduced a syphon composed of 64 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 343 place count 364 transition count 786
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 10 rules applied. Total rules applied 353 place count 359 transition count 781
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 358 place count 354 transition count 781
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 358 place count 354 transition count 772
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 376 place count 345 transition count 772
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 381 place count 340 transition count 760
Iterating global reduction 5 with 5 rules applied. Total rules applied 386 place count 340 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 389 place count 340 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 390 place count 339 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 390 place count 339 transition count 756
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 392 place count 338 transition count 756
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 337 transition count 748
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 337 transition count 748
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 395 place count 336 transition count 740
Iterating global reduction 7 with 1 rules applied. Total rules applied 396 place count 336 transition count 740
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 397 place count 335 transition count 732
Iterating global reduction 7 with 1 rules applied. Total rules applied 398 place count 335 transition count 732
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 399 place count 334 transition count 724
Iterating global reduction 7 with 1 rules applied. Total rules applied 400 place count 334 transition count 724
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 401 place count 333 transition count 716
Iterating global reduction 7 with 1 rules applied. Total rules applied 402 place count 333 transition count 716
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 403 place count 332 transition count 708
Iterating global reduction 7 with 1 rules applied. Total rules applied 404 place count 332 transition count 708
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 405 place count 331 transition count 700
Iterating global reduction 7 with 1 rules applied. Total rules applied 406 place count 331 transition count 700
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 407 place count 330 transition count 692
Iterating global reduction 7 with 1 rules applied. Total rules applied 408 place count 330 transition count 692
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 409 place count 329 transition count 684
Iterating global reduction 7 with 1 rules applied. Total rules applied 410 place count 329 transition count 684
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 411 place count 328 transition count 676
Iterating global reduction 7 with 1 rules applied. Total rules applied 412 place count 328 transition count 676
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 413 place count 327 transition count 668
Iterating global reduction 7 with 1 rules applied. Total rules applied 414 place count 327 transition count 668
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 415 place count 326 transition count 660
Iterating global reduction 7 with 1 rules applied. Total rules applied 416 place count 326 transition count 660
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 417 place count 325 transition count 652
Iterating global reduction 7 with 1 rules applied. Total rules applied 418 place count 325 transition count 652
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 419 place count 324 transition count 644
Iterating global reduction 7 with 1 rules applied. Total rules applied 420 place count 324 transition count 644
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 421 place count 323 transition count 636
Iterating global reduction 7 with 1 rules applied. Total rules applied 422 place count 323 transition count 636
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 84 rules applied. Total rules applied 506 place count 281 transition count 594
Applied a total of 506 rules in 138 ms. Remains 281 /548 variables (removed 267) and now considering 594/947 (removed 353) transitions.
// Phase 1: matrix 594 rows 281 cols
[2025-05-30 01:09:38] [INFO ] Computed 43 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:38] [INFO ] Implicit Places using invariants in 213 ms returned [17, 75, 92, 98, 103, 162, 179, 185, 190, 192, 240, 261, 274]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 215 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 268/548 places, 594/947 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 268 transition count 592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 266 transition count 592
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 266 transition count 587
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 261 transition count 587
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 257 transition count 583
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 257 transition count 583
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 253 transition count 579
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 253 transition count 579
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 251 transition count 577
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 251 transition count 577
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 247 transition count 573
Applied a total of 42 rules in 38 ms. Remains 247 /268 variables (removed 21) and now considering 573/594 (removed 21) transitions.
// Phase 1: matrix 573 rows 247 cols
[2025-05-30 01:09:38] [INFO ] Computed 30 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:38] [INFO ] Implicit Places using invariants in 174 ms returned [234, 237, 240, 244]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 175 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 243/548 places, 573/947 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 243 transition count 569
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 239 transition count 569
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 236 transition count 566
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 236 transition count 566
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 236 transition count 563
Applied a total of 17 rules in 15 ms. Remains 236 /243 variables (removed 7) and now considering 563/573 (removed 10) transitions.
// Phase 1: matrix 563 rows 236 cols
[2025-05-30 01:09:38] [INFO ] Computed 26 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:38] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-05-30 01:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:39] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 236/548 places, 563/947 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1136 ms. Remains : 236/548 places, 563/947 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-05
Product exploration explored 100000 steps with 2175 reset in 279 ms.
Product exploration explored 100000 steps with 2200 reset in 236 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (906 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (332 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 255724 steps, run visited all 1 properties in 1151 ms. (steps per millisecond=222 )
Probabilistic random walk after 255724 steps, saw 108147 distinct states, run finished after 1151 ms. (steps per millisecond=222 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 4 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 563/563 transitions.
Applied a total of 0 rules in 11 ms. Remains 236 /236 variables (removed 0) and now considering 563/563 (removed 0) transitions.
[2025-05-30 01:09:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:41] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 01:09:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:09:41] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:09:41] [INFO ] Redundant transitions in 32 ms returned []
Running 547 sub problems to find dead transitions.
[2025-05-30 01:09:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:09:55] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 7 (OVERLAPS) 563/799 variables, 236/263 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/799 variables, and 263 constraints, problems are : Problem set: 0 solved, 547 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 547/547 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 547 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (OVERLAPS) 1/236 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 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 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 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 TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 7 (OVERLAPS) 563/799 variables, 236/263 constraints. Problems are: Problem set: 281 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/799 variables, and 529 constraints, problems are : Problem set: 281 solved, 266 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 266/547 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60242ms problems are : Problem set: 281 solved, 266 unsolved
Search for dead transitions found 281 dead transitions in 60246ms
Found 281 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 281 transitions
Dead transitions reduction (with SMT) removed 281 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 236/236 places, 282/563 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 220 transition count 282
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 16 place count 220 transition count 267
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 1 with 30 rules applied. Total rules applied 46 place count 205 transition count 267
Applied a total of 46 rules in 6 ms. Remains 205 /236 variables (removed 31) and now considering 267/282 (removed 15) transitions.
// Phase 1: matrix 267 rows 205 cols
[2025-05-30 01:10:42] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-30 01:10:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 01:10:42] [INFO ] Implicit Places using invariants and state equation in 377 ms returned [154, 155, 156, 157, 158, 159, 160, 161, 162]
Discarding 9 places :
Implicit Place search using SMT with State Equation took 525 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 196/236 places, 267/563 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61398 ms. Remains : 196/236 places, 267/563 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (864 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (349 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9640 steps, run visited all 1 properties in 31 ms. (steps per millisecond=310 )
Probabilistic random walk after 9640 steps, saw 6516 distinct states, run finished after 31 ms. (steps per millisecond=310 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2220 reset in 116 ms.
Product exploration explored 100000 steps with 2222 reset in 133 ms.
Built C files in :
/tmp/ltsmin8736756742181995383
[2025-05-30 01:10:43] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2025-05-30 01:10:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:10:43] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2025-05-30 01:10:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:10:43] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2025-05-30 01:10:43] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:10:43] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8736756742181995383
Running compilation step : cd /tmp/ltsmin8736756742181995383;'/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 637 ms.
Running link step : cd /tmp/ltsmin8736756742181995383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8736756742181995383;'/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/stateBased9472095225913927466.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 267/267 (removed 0) transitions.
// Phase 1: matrix 267 rows 196 cols
[2025-05-30 01:10:58] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:58] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 01:10:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:10:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 01:10:58] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:10:58] [INFO ] Redundant transitions in 1 ms returned []
Running 251 sub problems to find dead transitions.
[2025-05-30 01:10:58] [INFO ] Invariant cache hit.
[2025-05-30 01:10:58] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 244 unsolved
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 12/16 constraints. Problems are: Problem set: 14 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 14 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 4/20 constraints. Problems are: Problem set: 14 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/22 constraints. Problems are: Problem set: 14 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/23 constraints. Problems are: Problem set: 14 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:03] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/25 constraints. Problems are: Problem set: 14 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/25 constraints. Problems are: Problem set: 14 solved, 237 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 8 (OVERLAPS) 267/463 variables, 196/221 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 2/223 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/223 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 0/463 variables, 0/223 constraints. Problems are: Problem set: 49 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 223 constraints, problems are : Problem set: 49 solved, 202 unsolved in 14359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 196/196 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 4/4 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 12/16 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 4/20 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/22 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 3/25 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/25 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 267/463 variables, 196/221 constraints. Problems are: Problem set: 49 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 2/223 constraints. Problems are: Problem set: 49 solved, 202 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 202/425 constraints. Problems are: Problem set: 51 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:11:20] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 1/426 constraints. Problems are: Problem set: 51 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/426 constraints. Problems are: Problem set: 51 solved, 200 unsolved
At refinement iteration 12 (OVERLAPS) 0/463 variables, 0/426 constraints. Problems are: Problem set: 51 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 426 constraints, problems are : Problem set: 51 solved, 200 unsolved in 29865 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 196/196 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 202/251 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44266ms problems are : Problem set: 51 solved, 200 unsolved
Search for dead transitions found 51 dead transitions in 44267ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 196/196 places, 216/267 transitions.
Ensure Unique test removed 14 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 181 transition count 194
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 159 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 158 transition count 193
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 47 place count 158 transition count 191
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 156 transition count 191
Applied a total of 51 rules in 5 ms. Remains 156 /196 variables (removed 40) and now considering 191/216 (removed 25) transitions.
// Phase 1: matrix 191 rows 156 cols
[2025-05-30 01:11:43] [INFO ] Computed 25 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:11:43] [INFO ] Implicit Places using invariants in 98 ms returned [113]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/196 places, 191/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 44758 ms. Remains : 155/196 places, 191/267 transitions.
Built C files in :
/tmp/ltsmin12180570851002285136
[2025-05-30 01:11:43] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2025-05-30 01:11:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:11:43] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2025-05-30 01:11:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:11:43] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2025-05-30 01:11:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:11:43] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12180570851002285136
Running compilation step : cd /tmp/ltsmin12180570851002285136;'/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 377 ms.
Running link step : cd /tmp/ltsmin12180570851002285136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12180570851002285136;'/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/stateBased4904786194182146199.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 01:11:58] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:11:58] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:11:58] [INFO ] Time to serialize gal into /tmp/LTL374647019659760758.gal : 3 ms
[2025-05-30 01:11:58] [INFO ] Time to serialize properties into /tmp/LTL12961208230016965215.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/LTL374647019659760758.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7701108430585637513.hoa' '-atoms' '/tmp/LTL12961208230016965215.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...317
Loading property file /tmp/LTL12961208230016965215.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7701108430585637513.hoa
Reverse transition relation is NOT exact ! Due to transitions t14, t731.t728.t729.t730.t16.t745, t746.t747.t26.t748.t20.t133.t131.t132.t19, t764.t147.t148....818
Computing Next relation with stutter on 873878 deadlock states
Detected timeout of ITS tools.
[2025-05-30 01:12:13] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:12:13] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:12:13] [INFO ] Time to serialize gal into /tmp/LTL5687187951860698444.gal : 3 ms
[2025-05-30 01:12:13] [INFO ] Time to serialize properties into /tmp/LTL2375420790878542517.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/LTL5687187951860698444.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2375420790878542517.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("(((p14!=1)||(p85!=1))||((p546==1)&&(p551==1)))"))))
Formula 0 simplified : GF!"(((p14!=1)||(p85!=1))||((p546==1)&&(p551==1)))"
Reverse transition relation is NOT exact ! Due to transitions t14, t731.t728.t729.t730.t16.t745, t746.t747.t26.t748.t20.t133.t131.t132.t19, t764.t147.t148....819
Computing Next relation with stutter on 873878 deadlock states
Detected timeout of ITS tools.
[2025-05-30 01:12:28] [INFO ] Flatten gal took : 19 ms
[2025-05-30 01:12:28] [INFO ] Applying decomposition
[2025-05-30 01:12:28] [INFO ] Flatten gal took : 12 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/graph5197431372781138996.txt' '-o' '/tmp/graph5197431372781138996.bin' '-w' '/tmp/graph5197431372781138996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5197431372781138996.bin' '-l' '-1' '-v' '-w' '/tmp/graph5197431372781138996.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:12:28] [INFO ] Decomposing Gal with order
[2025-05-30 01:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:12:28] [INFO ] Removed a total of 165 redundant transitions.
[2025-05-30 01:12:28] [INFO ] Flatten gal took : 53 ms
[2025-05-30 01:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 8 ms.
[2025-05-30 01:12:28] [INFO ] Time to serialize gal into /tmp/LTL2324284106734879909.gal : 4 ms
[2025-05-30 01:12:28] [INFO ] Time to serialize properties into /tmp/LTL770623054483114301.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/LTL2324284106734879909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL770623054483114301.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...253
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i1.u0.p14!=1)||(i1.u0.p85!=1))||((i6.u22.p546==1)&&(i6.u21.p551==1)))"))))
Formula 0 simplified : GF!"(((i1.u0.p14!=1)||(i1.u0.p85!=1))||((i6.u22.p546==1)&&(i6.u21.p551==1)))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-02a-LTLFireability-05 finished in 186028 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(F(p0))||(F(p0)&&X(F(!p1))))))'
Support contains 3 out of 548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 546 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 546 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 545 transition count 931
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 545 transition count 931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 544 transition count 923
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 544 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 543 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 543 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 542 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 542 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 541 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 541 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 540 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 540 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 539 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 539 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 538 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 538 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 537 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 537 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 536 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 535 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 535 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 534 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 534 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 533 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 533 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 532 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 532 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 531 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 531 transition count 819
Applied a total of 33 rules in 102 ms. Remains 531 /548 variables (removed 17) and now considering 819/947 (removed 128) transitions.
// Phase 1: matrix 819 rows 531 cols
[2025-05-30 01:12:44] [INFO ] Computed 70 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:44] [INFO ] Implicit Places using invariants in 363 ms returned [18, 429, 469]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 364 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/548 places, 819/947 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 526 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 526 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 524 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 524 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 522 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 522 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 521 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 521 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 520 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 520 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 519 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 519 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 518 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 518 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 517 transition count 808
Applied a total of 22 rules in 53 ms. Remains 517 /528 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 517 cols
[2025-05-30 01:12:44] [INFO ] Computed 67 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:44] [INFO ] Implicit Places using invariants in 342 ms returned []
[2025-05-30 01:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:45] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 517/548 places, 808/947 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1621 ms. Remains : 517/548 places, 808/947 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 273 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 p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLFireability-08 finished in 2447 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(F(p0)))'
Support contains 3 out of 548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 546 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 546 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 545 transition count 931
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 545 transition count 931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 544 transition count 923
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 544 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 543 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 543 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 542 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 542 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 541 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 541 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 540 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 540 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 539 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 539 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 538 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 538 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 537 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 537 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 536 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 535 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 535 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 534 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 534 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 533 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 533 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 532 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 532 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 531 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 531 transition count 819
Applied a total of 33 rules in 110 ms. Remains 531 /548 variables (removed 17) and now considering 819/947 (removed 128) transitions.
// Phase 1: matrix 819 rows 531 cols
[2025-05-30 01:12:46] [INFO ] Computed 70 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:46] [INFO ] Implicit Places using invariants in 357 ms returned [18, 429, 469]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 358 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/548 places, 819/947 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 526 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 526 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 524 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 524 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 522 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 522 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 521 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 521 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 520 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 520 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 519 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 519 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 518 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 518 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 517 transition count 808
Applied a total of 22 rules in 52 ms. Remains 517 /528 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 517 cols
[2025-05-30 01:12:46] [INFO ] Computed 67 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:47] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-05-30 01:12:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:48] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 517/548 places, 808/947 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1657 ms. Remains : 517/548 places, 808/947 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 258 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLFireability-09 finished in 2348 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(p0) U X(X(((!p0 U p1)||G(p2))))))'
Support contains 4 out of 548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 546 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 546 transition count 939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 545 transition count 931
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 545 transition count 931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 544 transition count 923
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 544 transition count 923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 543 transition count 915
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 543 transition count 915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 542 transition count 907
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 542 transition count 907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 541 transition count 899
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 541 transition count 899
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 540 transition count 891
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 540 transition count 891
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 539 transition count 883
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 539 transition count 883
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 538 transition count 875
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 538 transition count 875
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 537 transition count 867
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 537 transition count 867
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 536 transition count 859
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 536 transition count 859
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 535 transition count 851
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 535 transition count 851
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 534 transition count 843
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 534 transition count 843
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 533 transition count 835
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 533 transition count 835
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 532 transition count 827
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 532 transition count 827
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 531 transition count 819
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 531 transition count 819
Applied a total of 33 rules in 119 ms. Remains 531 /548 variables (removed 17) and now considering 819/947 (removed 128) transitions.
// Phase 1: matrix 819 rows 531 cols
[2025-05-30 01:12:48] [INFO ] Computed 70 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:49] [INFO ] Implicit Places using invariants in 341 ms returned [18, 429, 469]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 347 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 528/548 places, 819/947 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 526 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 526 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 524 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 524 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 522 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 522 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 521 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 521 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 520 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 520 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 519 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 519 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 518 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 518 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 517 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 517 transition count 808
Applied a total of 22 rules in 65 ms. Remains 517 /528 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 517 cols
[2025-05-30 01:12:49] [INFO ] Computed 67 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:49] [INFO ] Implicit Places using invariants in 336 ms returned []
[2025-05-30 01:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:50] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 517/548 places, 808/947 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1680 ms. Remains : 517/548 places, 808/947 transitions.
Stuttering acceptance computed with spot in 436 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-10 finished in 2144 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(F(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 8 out of 548 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 547 transition count 939
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 547 transition count 939
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 546 transition count 931
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 546 transition count 931
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 545 transition count 923
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 545 transition count 923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 544 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 544 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 543 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 543 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 542 transition count 899
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 542 transition count 899
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 541 transition count 891
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 541 transition count 891
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 540 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 540 transition count 883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 539 transition count 875
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 539 transition count 875
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 538 transition count 867
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 538 transition count 867
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 537 transition count 859
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 537 transition count 859
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 536 transition count 851
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 536 transition count 851
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 535 transition count 843
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 535 transition count 843
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 534 transition count 835
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 534 transition count 835
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 533 transition count 827
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 533 transition count 827
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 532 transition count 819
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 532 transition count 819
Applied a total of 32 rules in 97 ms. Remains 532 /548 variables (removed 16) and now considering 819/947 (removed 128) transitions.
// Phase 1: matrix 819 rows 532 cols
[2025-05-30 01:12:51] [INFO ] Computed 71 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:51] [INFO ] Implicit Places using invariants in 352 ms returned [430, 470]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 354 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/548 places, 819/947 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 528 transition count 817
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 528 transition count 817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 526 transition count 815
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 526 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 524 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 524 transition count 813
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 523 transition count 812
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 523 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 522 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 522 transition count 811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 521 transition count 810
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 521 transition count 810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 520 transition count 809
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 520 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 519 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 519 transition count 808
Applied a total of 22 rules in 61 ms. Remains 519 /530 variables (removed 11) and now considering 808/819 (removed 11) transitions.
// Phase 1: matrix 808 rows 519 cols
[2025-05-30 01:12:51] [INFO ] Computed 69 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:51] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-05-30 01:12:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:52] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 519/548 places, 808/947 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1977 ms. Remains : 519/548 places, 808/947 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 268 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 p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-02a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-02a-LTLFireability-13 finished in 2616 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((p0||G(p1))))'
Support contains 2 out of 548 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 548/548 places, 947/947 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 547 transition count 852
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 452 transition count 852
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 191 place count 452 transition count 793
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 328 place count 374 transition count 793
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 331 place count 372 transition count 792
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 332 place count 371 transition count 792
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 332 place count 371 transition count 784
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 348 place count 363 transition count 784
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 351 place count 360 transition count 774
Iterating global reduction 4 with 3 rules applied. Total rules applied 354 place count 360 transition count 774
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 355 place count 360 transition count 773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 359 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 356 place count 359 transition count 772
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 358 place count 358 transition count 772
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 359 place count 357 transition count 764
Iterating global reduction 6 with 1 rules applied. Total rules applied 360 place count 357 transition count 764
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 361 place count 356 transition count 756
Iterating global reduction 6 with 1 rules applied. Total rules applied 362 place count 356 transition count 756
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 363 place count 355 transition count 748
Iterating global reduction 6 with 1 rules applied. Total rules applied 364 place count 355 transition count 748
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 365 place count 354 transition count 740
Iterating global reduction 6 with 1 rules applied. Total rules applied 366 place count 354 transition count 740
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 367 place count 353 transition count 732
Iterating global reduction 6 with 1 rules applied. Total rules applied 368 place count 353 transition count 732
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 369 place count 352 transition count 724
Iterating global reduction 6 with 1 rules applied. Total rules applied 370 place count 352 transition count 724
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 351 transition count 716
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 351 transition count 716
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 373 place count 350 transition count 708
Iterating global reduction 6 with 1 rules applied. Total rules applied 374 place count 350 transition count 708
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 375 place count 349 transition count 700
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 349 transition count 700
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 348 transition count 692
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 348 transition count 692
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 379 place count 347 transition count 684
Iterating global reduction 6 with 1 rules applied. Total rules applied 380 place count 347 transition count 684
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 381 place count 346 transition count 676
Iterating global reduction 6 with 1 rules applied. Total rules applied 382 place count 346 transition count 676
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 383 place count 345 transition count 668
Iterating global reduction 6 with 1 rules applied. Total rules applied 384 place count 345 transition count 668
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 385 place count 344 transition count 660
Iterating global reduction 6 with 1 rules applied. Total rules applied 386 place count 344 transition count 660
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 387 place count 343 transition count 652
Iterating global reduction 6 with 1 rules applied. Total rules applied 388 place count 343 transition count 652
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 470 place count 302 transition count 611
Applied a total of 470 rules in 91 ms. Remains 302 /548 variables (removed 246) and now considering 611/947 (removed 336) transitions.
// Phase 1: matrix 611 rows 302 cols
[2025-05-30 01:12:53] [INFO ] Computed 49 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:53] [INFO ] Implicit Places using invariants in 239 ms returned [18, 93, 99, 104, 120, 191, 197, 202, 222, 259, 273, 279, 292, 299]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 241 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 288/548 places, 611/947 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 288 transition count 608
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 285 transition count 608
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 285 transition count 599
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 276 transition count 599
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 269 transition count 592
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 269 transition count 592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 264 transition count 587
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 264 transition count 587
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 262 transition count 585
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 262 transition count 585
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 258 transition count 581
Applied a total of 60 rules in 26 ms. Remains 258 /288 variables (removed 30) and now considering 581/611 (removed 30) transitions.
// Phase 1: matrix 581 rows 258 cols
[2025-05-30 01:12:53] [INFO ] Computed 35 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:54] [INFO ] Implicit Places using invariants in 189 ms returned [93, 96, 179, 182, 244, 247, 250, 254]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 190 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 250/548 places, 581/947 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 250 transition count 575
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 244 transition count 575
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 239 transition count 570
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 239 transition count 570
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 27 place count 239 transition count 565
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 3 with 2 rules applied. Total rules applied 29 place count 238 transition count 564
Applied a total of 29 rules in 14 ms. Remains 238 /250 variables (removed 12) and now considering 564/581 (removed 17) transitions.
// Phase 1: matrix 564 rows 238 cols
[2025-05-30 01:12:54] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:54] [INFO ] Implicit Places using invariants in 178 ms returned [72, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 179 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 236/548 places, 564/947 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 562
Applied a total of 4 rules in 9 ms. Remains 234 /236 variables (removed 2) and now considering 562/564 (removed 2) transitions.
// Phase 1: matrix 562 rows 234 cols
[2025-05-30 01:12:54] [INFO ] Computed 25 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:54] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-30 01:12:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 01:12:54] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 234/548 places, 562/947 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 1333 ms. Remains : 234/548 places, 562/947 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLFireability-15 finished in 1441 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(G(p0)))'
[2025-05-30 01:12:55] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2362735810580755469
[2025-05-30 01:12:55] [INFO ] Computing symmetric may disable matrix : 947 transitions.
[2025-05-30 01:12:55] [INFO ] Applying decomposition
[2025-05-30 01:12:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:12:55] [INFO ] Computing symmetric may enable matrix : 947 transitions.
[2025-05-30 01:12:55] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:12:55] [INFO ] Flatten gal took : 34 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/graph5164739253424566391.txt' '-o' '/tmp/graph5164739253424566391.bin' '-w' '/tmp/graph5164739253424566391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5164739253424566391.bin' '-l' '-1' '-v' '-w' '/tmp/graph5164739253424566391.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:12:55] [INFO ] Decomposing Gal with order
[2025-05-30 01:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:12:55] [INFO ] Computing Do-Not-Accords matrix : 947 transitions.
[2025-05-30 01:12:55] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:12:55] [INFO ] Built C files in 256ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2362735810580755469
Running compilation step : cd /tmp/ltsmin2362735810580755469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 01:12:55] [INFO ] Removed a total of 1518 redundant transitions.
[2025-05-30 01:12:55] [INFO ] Flatten gal took : 97 ms
[2025-05-30 01:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 67 labels/synchronizations in 27 ms.
[2025-05-30 01:12:55] [INFO ] Time to serialize gal into /tmp/LTLFireability15440224790784363403.gal : 17 ms
[2025-05-30 01:12:55] [INFO ] Time to serialize properties into /tmp/LTLFireability18390958273156413146.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/LTLFireability15440224790784363403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18390958273156413146.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...278
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i0.u5.p14!=1)||(i0.u26.p85!=1))||((i9.i1.i1.u160.p546==1)&&(i9.i1.i2.u162.p551==1)))"))))
Formula 0 simplified : GF!"(((i0.u5.p14!=1)||(i0.u26.p85!=1))||((i9.i1.i1.u160.p546==1)&&(i9.i1.i2.u162.p551==1)))"
Compilation finished in 2758 ms.
Running link step : cd /tmp/ltsmin2362735810580755469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2362735810580755469;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t9, t468, t469, t770, t791, t844, t867, t920, i1.t5, i2.t4, i2.t0, i3.u40...533
Computing Next relation with stutter on 2.49408e+06 deadlock states
Detected timeout of ITS tools.
[2025-05-30 01:34:09] [INFO ] Applying decomposition
[2025-05-30 01:34:09] [INFO ] Flatten gal took : 82 ms
[2025-05-30 01:34:10] [INFO ] Decomposing Gal with order
[2025-05-30 01:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:34:10] [INFO ] Removed a total of 1196 redundant transitions.
[2025-05-30 01:34:10] [INFO ] Flatten gal took : 197 ms
[2025-05-30 01:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 45 ms.
[2025-05-30 01:34:10] [INFO ] Time to serialize gal into /tmp/LTLFireability1733737893889382204.gal : 12 ms
[2025-05-30 01:34:10] [INFO ] Time to serialize properties into /tmp/LTLFireability1530331932479828960.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/LTLFireability1733737893889382204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1530331932479828960.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u1.p14!=1)||(u6.p85!=1))||((i22.u91.p546==1)&&(i22.u92.p551==1)))"))))
Formula 0 simplified : GF!"(((u1.p14!=1)||(u6.p85!=1))||((i22.u91.p546==1)&&(i22.u92.p551==1)))"
Reverse transition relation is NOT exact ! Due to transitions t428, t496, t761, t762, t765, t770, t782, t791, t844, t867, t920, i6.t5, i6.t4, i6.t3, i6.t2,...495
Computing Next relation with stutter on 2.49408e+06 deadlock states
LTSmin run took 1493228 ms.
FORMULA ASLink-PT-02a-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1720216 ms.

BK_STOP 1748569071700

--------------------
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="ASLink-PT-02a"
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 ASLink-PT-02a, 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-174853729000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;