Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 26K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 357K 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-03a-LTLFireability-00
FORMULA_NAME ASLink-PT-03a-LTLFireability-01
FORMULA_NAME ASLink-PT-03a-LTLFireability-02
FORMULA_NAME ASLink-PT-03a-LTLFireability-03
FORMULA_NAME ASLink-PT-03a-LTLFireability-04
FORMULA_NAME ASLink-PT-03a-LTLFireability-05
FORMULA_NAME ASLink-PT-03a-LTLFireability-06
FORMULA_NAME ASLink-PT-03a-LTLFireability-07
FORMULA_NAME ASLink-PT-03a-LTLFireability-08
FORMULA_NAME ASLink-PT-03a-LTLFireability-09
FORMULA_NAME ASLink-PT-03a-LTLFireability-10
FORMULA_NAME ASLink-PT-03a-LTLFireability-11
FORMULA_NAME ASLink-PT-03a-LTLFireability-12
FORMULA_NAME ASLink-PT-03a-LTLFireability-13
FORMULA_NAME ASLink-PT-03a-LTLFireability-14
FORMULA_NAME ASLink-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748571759806

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 02:22:40] [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 02:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:22:41] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2025-05-30 02:22:41] [INFO ] Transformed 821 places.
[2025-05-30 02:22:41] [INFO ] Transformed 1281 transitions.
[2025-05-30 02:22:41] [INFO ] Found NUPN structural information;
[2025-05-30 02:22:41] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 821 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 803 transition count 1268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 797 transition count 1252
Ensure Unique test removed 1 places
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 796 transition count 1252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 796 transition count 1250
Applied a total of 33 rules in 130 ms. Remains 796 /821 variables (removed 25) and now considering 1250/1268 (removed 18) transitions.
// Phase 1: matrix 1250 rows 796 cols
[2025-05-30 02:22:41] [INFO ] Computed 137 invariants in 75 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:22:42] [INFO ] Implicit Places using invariants in 862 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 446, 575, 580, 592, 597, 598, 599, 636, 639, 657, 659, 660, 677, 685, 693, 699, 705, 711, 717, 725, 731, 737, 745]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 893 ms to find 41 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 755/821 places, 1250/1268 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 742 transition count 1237
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 742 transition count 1237
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 732 transition count 1227
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 732 transition count 1227
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 727 transition count 1222
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 727 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 725 transition count 1220
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 725 transition count 1220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 723 transition count 1218
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 723 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 722 transition count 1217
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 722 transition count 1217
Applied a total of 66 rules in 193 ms. Remains 722 /755 variables (removed 33) and now considering 1217/1250 (removed 33) transitions.
// Phase 1: matrix 1217 rows 722 cols
[2025-05-30 02:22:42] [INFO ] Computed 96 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:22:43] [INFO ] Implicit Places using invariants in 424 ms returned []
[2025-05-30 02:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:22:44] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 722/821 places, 1217/1268 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2669 ms. Remains : 722/821 places, 1217/1268 transitions.
Support contains 47 out of 722 places after structural reductions.
[2025-05-30 02:22:44] [INFO ] Flatten gal took : 113 ms
[2025-05-30 02:22:44] [INFO ] Flatten gal took : 70 ms
[2025-05-30 02:22:44] [INFO ] Input system was already deterministic with 1217 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (357 resets) in 1049 ms. (38 steps per ms) remains 14/24 properties
BEST_FIRST walk for 40001 steps (78 resets) in 225 ms. (176 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (77 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (72 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (76 resets) in 108 ms. (366 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (74 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (78 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (78 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (81 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (79 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (80 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
[2025-05-30 02:22:45] [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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 217/246 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 115/361 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 361/722 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1217/1939 variables, 722/818 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1939 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/1939 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1939/1939 variables, and 818 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 72/72 constraints, State Equation: 722/722 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 217/246 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 115/361 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 361/722 variables, 72/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:22:49] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 23 ms to minimize.
Problem AtomicPropp13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:22:49] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:22:49] [INFO ] Deduced a trap composed of 153 places in 367 ms of which 113 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/722 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:22:50] [INFO ] Deduced a trap composed of 60 places in 320 ms of which 53 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 10 (OVERLAPS) 1217/1939 variables, 722/822 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1939 variables, 2/824 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1939 variables, 0/824 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1939 variables, 0/824 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1939/1939 variables, and 824 constraints, problems are : Problem set: 12 solved, 2 unsolved in 4460 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 72/72 constraints, State Equation: 722/722 constraints, PredecessorRefiner: 2/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7042ms problems are : Problem set: 12 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 314 ms.
Support contains 3 out of 722 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 722/722 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 722 transition count 1105
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 610 transition count 1104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 609 transition count 1104
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 226 place count 609 transition count 1019
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 28 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 424 place count 496 transition count 1019
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 3 with 3 rules applied. Total rules applied 427 place count 494 transition count 1018
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 428 place count 493 transition count 1018
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 428 place count 493 transition count 1006
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 452 place count 481 transition count 1006
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 457 place count 476 transition count 988
Iterating global reduction 5 with 5 rules applied. Total rules applied 462 place count 476 transition count 988
Discarding 1 places :
Implicit places reduction removed 1 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 5 with 6 rules applied. Total rules applied 468 place count 475 transition count 983
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 473 place count 470 transition count 983
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 473 place count 470 transition count 982
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 475 place count 469 transition count 982
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 476 place count 468 transition count 974
Iterating global reduction 7 with 1 rules applied. Total rules applied 477 place count 468 transition count 974
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 478 place count 467 transition count 966
Iterating global reduction 7 with 1 rules applied. Total rules applied 479 place count 467 transition count 966
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 480 place count 466 transition count 958
Iterating global reduction 7 with 1 rules applied. Total rules applied 481 place count 466 transition count 958
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 482 place count 465 transition count 950
Iterating global reduction 7 with 1 rules applied. Total rules applied 483 place count 465 transition count 950
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 484 place count 464 transition count 942
Iterating global reduction 7 with 1 rules applied. Total rules applied 485 place count 464 transition count 942
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 486 place count 463 transition count 934
Iterating global reduction 7 with 1 rules applied. Total rules applied 487 place count 463 transition count 934
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 488 place count 462 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 489 place count 462 transition count 926
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 490 place count 461 transition count 918
Iterating global reduction 7 with 1 rules applied. Total rules applied 491 place count 461 transition count 918
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 492 place count 460 transition count 910
Iterating global reduction 7 with 1 rules applied. Total rules applied 493 place count 460 transition count 910
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 494 place count 459 transition count 902
Iterating global reduction 7 with 1 rules applied. Total rules applied 495 place count 459 transition count 902
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 496 place count 458 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 497 place count 458 transition count 894
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 498 place count 457 transition count 886
Iterating global reduction 7 with 1 rules applied. Total rules applied 499 place count 457 transition count 886
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 500 place count 456 transition count 878
Iterating global reduction 7 with 1 rules applied. Total rules applied 501 place count 456 transition count 878
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 502 place count 455 transition count 870
Iterating global reduction 7 with 1 rules applied. Total rules applied 503 place count 455 transition count 870
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 504 place count 454 transition count 862
Iterating global reduction 7 with 1 rules applied. Total rules applied 505 place count 454 transition count 862
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 506 place count 453 transition count 854
Iterating global reduction 7 with 1 rules applied. Total rules applied 507 place count 453 transition count 854
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 591 place count 411 transition count 812
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 592 place count 410 transition count 811
Iterating global reduction 7 with 1 rules applied. Total rules applied 593 place count 410 transition count 811
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 596 place count 410 transition count 808
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 599 place count 407 transition count 808
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 614 place count 407 transition count 793
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 630 place count 391 transition count 793
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 632 place count 391 transition count 791
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 641 place count 391 transition count 791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 642 place count 390 transition count 790
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 646 place count 386 transition count 790
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 11 Pre rules applied. Total rules applied 646 place count 386 transition count 779
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 676 place count 367 transition count 779
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 682 place count 361 transition count 773
Iterating global reduction 10 with 6 rules applied. Total rules applied 688 place count 361 transition count 773
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 694 place count 361 transition count 767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 696 place count 360 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 697 place count 360 transition count 765
Applied a total of 697 rules in 454 ms. Remains 360 /722 variables (removed 362) and now considering 765/1217 (removed 452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 360/722 places, 765/1217 transitions.
RANDOM walk for 40000 steps (752 resets) in 176 ms. (225 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (235 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (230 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1535 steps, run visited all 2 properties in 23 ms. (steps per millisecond=66 )
Probabilistic random walk after 1535 steps, saw 1372 distinct states, run finished after 26 ms. (steps per millisecond=59 ) properties seen :2
Successfully simplified 13 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-03a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(!p0))&&F((!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 722 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 722/722 places, 1217/1217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 719 transition count 1201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 719 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 717 transition count 1192
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 717 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 716 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 716 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 715 transition count 1176
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 715 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 714 transition count 1168
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 714 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 713 transition count 1160
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 713 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 712 transition count 1152
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 712 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 711 transition count 1144
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 711 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 710 transition count 1136
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 710 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 709 transition count 1128
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 709 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 708 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 708 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 707 transition count 1112
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 707 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 706 transition count 1104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 706 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 705 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 705 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 704 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 704 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 703 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 703 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 702 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 702 transition count 1072
Applied a total of 40 rules in 248 ms. Remains 702 /722 variables (removed 20) and now considering 1072/1217 (removed 145) transitions.
// Phase 1: matrix 1072 rows 702 cols
[2025-05-30 02:22:54] [INFO ] Computed 96 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:22:54] [INFO ] Implicit Places using invariants in 403 ms returned [391, 409, 591, 612]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 407 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/722 places, 1072/1217 transitions.
Applied a total of 0 rules in 16 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 672 ms. Remains : 698/722 places, 1072/1217 transitions.
Stuttering acceptance computed with spot in 342 ms :[p0, p0, p0, (AND (NOT p1) p0), p0, true]
Running random walk in product with property : ASLink-PT-03a-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 528 ms.
Product exploration explored 100000 steps with 25000 reset in 338 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 p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 93 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0, p0, true]
RANDOM walk for 10146 steps (90 resets) in 57 ms. (174 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 169 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 698 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Applied a total of 0 rules in 25 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
// Phase 1: matrix 1072 rows 698 cols
[2025-05-30 02:22:56] [INFO ] Computed 92 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:22:56] [INFO ] Implicit Places using invariants in 405 ms returned []
[2025-05-30 02:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:22:58] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Running 1071 sub problems to find dead transitions.
[2025-05-30 02:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1770 variables, and 64 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 64/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 1071/1071 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1071 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 2 (OVERLAPS) 1/698 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/698 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1071 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/1770 variables, and 92 constraints, problems are : Problem set: 0 solved, 1071 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 0/698 constraints, PredecessorRefiner: 0/1071 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 1071 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Finished structural reductions in LTL mode , in 1 iterations and 61996 ms. Remains : 698/698 places, 1072/1072 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, p0, true]
RANDOM walk for 6230 steps (56 resets) in 30 ms. (200 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 314 ms.
Product exploration explored 100000 steps with 25000 reset in 319 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 698 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 698/698 places, 1072/1072 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 698 transition count 1072
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 131 place count 698 transition count 1089
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 181 place count 698 transition count 1089
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 4 rules applied. Total rules applied 185 place count 696 transition count 1089
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 207 place count 674 transition count 1067
Deduced a syphon composed of 163 places in 1 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 229 place count 674 transition count 1067
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 229 place count 674 transition count 1067
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 674 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 231 place count 673 transition count 1066
Deduced a syphon composed of 163 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 673 transition count 1066
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 252 places in 1 ms
Iterating global reduction 2 with 89 rules applied. Total rules applied 321 place count 673 transition count 1078
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 363 place count 631 transition count 1036
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 405 place count 631 transition count 1036
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 214 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 409 place count 631 transition count 1064
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 631 transition count 1068
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 412 place count 629 transition count 1062
Deduced a syphon composed of 213 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 629 transition count 1062
Deduced a syphon composed of 213 places in 0 ms
Applied a total of 414 rules in 200 ms. Remains 629 /698 variables (removed 69) and now considering 1062/1072 (removed 10) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:24:00] [INFO ] Redundant transitions in 64 ms returned []
Running 1061 sub problems to find dead transitions.
// Phase 1: matrix 1062 rows 629 cols
[2025-05-30 02:24:00] [INFO ] Computed 90 invariants in 12 ms
[2025-05-30 02:24:00] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
At refinement iteration 2 (OVERLAPS) 1/629 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/629 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1691 variables, and 90 constraints, problems are : Problem set: 0 solved, 1061 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 0/629 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 1061/1061 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1061 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
At refinement iteration 2 (OVERLAPS) 1/629 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/629 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1061 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:50] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 19 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:51] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 16 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:51] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 21 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:51] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:51] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 28 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:52] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:52] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 13 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:52] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:52] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 12 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:52] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 14 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:52] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 13 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 13 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 13 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 7 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 7 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 7 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 20 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:53] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 10 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:54] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:54] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 56 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 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 TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 20/110 constraints. Problems are: Problem set: 213 solved, 848 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:55] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:24:57] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/1691 variables, and 112 constraints, problems are : Problem set: 214 solved, 847 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 65/65 constraints, State Equation: 0/629 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1061 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60323ms problems are : Problem set: 214 solved, 847 unsolved
Search for dead transitions found 214 dead transitions in 60326ms
Found 214 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 214 transitions
Dead transitions reduction (with SMT) removed 214 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 629/698 places, 848/1072 transitions.
Graph (complete) has 2220 edges and 629 vertex of which 467 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.3 ms
Discarding 162 places :
Also discarding 0 output transitions
Ensure Unique test removed 17 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 450 transition count 848
Deduced a syphon composed of 52 places in 1 ms
Applied a total of 2 rules in 25 ms. Remains 450 /629 variables (removed 179) and now considering 848/848 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 450/698 places, 848/1072 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60626 ms. Remains : 450/698 places, 848/1072 transitions.
Built C files in :
/tmp/ltsmin10154265204692474627
[2025-05-30 02:25:01] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10154265204692474627
Running compilation step : cd /tmp/ltsmin10154265204692474627;'/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 1904 ms.
Running link step : cd /tmp/ltsmin10154265204692474627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin10154265204692474627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5999907181040109770.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA ASLink-PT-03a-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-03a-LTLFireability-03 finished in 129480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0)&&F(!p1))||X(G(!p0))))'
Support contains 5 out of 722 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 722/722 places, 1217/1217 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 720 transition count 1202
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 720 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 719 transition count 1194
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 719 transition count 1194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 718 transition count 1186
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 718 transition count 1186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 717 transition count 1178
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 717 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 716 transition count 1170
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 716 transition count 1170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 715 transition count 1162
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 715 transition count 1162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 714 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 714 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 713 transition count 1146
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 713 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 712 transition count 1138
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 712 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 711 transition count 1130
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 711 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 710 transition count 1122
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 710 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 709 transition count 1114
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 709 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 708 transition count 1106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 708 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 707 transition count 1098
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 707 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 706 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 706 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 705 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 705 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 704 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 704 transition count 1074
Applied a total of 36 rules in 229 ms. Remains 704 /722 variables (removed 18) and now considering 1074/1217 (removed 143) transitions.
// Phase 1: matrix 1074 rows 704 cols
[2025-05-30 02:25:03] [INFO ] Computed 96 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:04] [INFO ] Implicit Places using invariants in 438 ms returned [391, 409, 612]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 439 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 701/722 places, 1074/1217 transitions.
Applied a total of 0 rules in 13 ms. Remains 701 /701 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 681 ms. Remains : 701/722 places, 1074/1217 transitions.
Stuttering acceptance computed with spot in 174 ms :[p0, p0, (AND p1 p0), true, p1]
Running random walk in product with property : ASLink-PT-03a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 362 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 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 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-03a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-03a-LTLFireability-04 finished in 1627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 722 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 722/722 places, 1217/1217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 719 transition count 1201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 719 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 717 transition count 1192
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 717 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 716 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 716 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 715 transition count 1176
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 715 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 714 transition count 1168
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 714 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 713 transition count 1160
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 713 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 712 transition count 1152
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 712 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 711 transition count 1144
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 711 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 710 transition count 1136
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 710 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 709 transition count 1128
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 709 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 708 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 708 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 707 transition count 1112
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 707 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 706 transition count 1104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 706 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 705 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 705 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 704 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 704 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 703 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 703 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 702 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 702 transition count 1072
Applied a total of 40 rules in 191 ms. Remains 702 /722 variables (removed 20) and now considering 1072/1217 (removed 145) transitions.
// Phase 1: matrix 1072 rows 702 cols
[2025-05-30 02:25:05] [INFO ] Computed 96 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:05] [INFO ] Implicit Places using invariants in 418 ms returned [391, 409, 591, 612]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 420 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 698/722 places, 1072/1217 transitions.
Applied a total of 0 rules in 12 ms. Remains 698 /698 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 624 ms. Remains : 698/722 places, 1072/1217 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-03a-LTLFireability-07 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F(G(p2))&&p1)))))'
Support contains 4 out of 722 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 722/722 places, 1217/1217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 719 transition count 1201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 719 transition count 1201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 717 transition count 1192
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 717 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 716 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 716 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 715 transition count 1176
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 715 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 714 transition count 1168
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 714 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 713 transition count 1160
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 713 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 712 transition count 1152
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 712 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 711 transition count 1144
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 711 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 710 transition count 1136
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 710 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 709 transition count 1128
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 709 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 708 transition count 1120
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 708 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 707 transition count 1112
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 707 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 706 transition count 1104
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 706 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 705 transition count 1096
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 705 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 704 transition count 1088
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 704 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 703 transition count 1080
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 703 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 702 transition count 1072
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 702 transition count 1072
Applied a total of 40 rules in 195 ms. Remains 702 /722 variables (removed 20) and now considering 1072/1217 (removed 145) transitions.
[2025-05-30 02:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:06] [INFO ] Implicit Places using invariants in 420 ms returned [391, 409, 591]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 421 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 699/722 places, 1072/1217 transitions.
Applied a total of 0 rules in 12 ms. Remains 699 /699 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 629 ms. Remains : 699/722 places, 1072/1217 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ASLink-PT-03a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Product exploration explored 100000 steps with 50000 reset in 349 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 (NOT p0) (NOT p1) (NOT p2)), (X p0), (X (X (NOT p1)))]
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 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-03a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-03a-LTLFireability-08 finished in 1548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 722 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 722/722 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 721 transition count 1103
Reduce places removed 117 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 119 rules applied. Total rules applied 232 place count 604 transition count 1101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 234 place count 602 transition count 1101
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 234 place count 602 transition count 1003
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 29 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 459 place count 475 transition count 1003
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 13 rules applied. Total rules applied 472 place count 469 transition count 996
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 479 place count 462 transition count 996
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 479 place count 462 transition count 983
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 505 place count 449 transition count 983
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 513 place count 441 transition count 962
Iterating global reduction 5 with 8 rules applied. Total rules applied 521 place count 441 transition count 962
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 5 with 21 rules applied. Total rules applied 542 place count 436 transition count 946
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 555 place count 423 transition count 946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 555 place count 423 transition count 945
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 557 place count 422 transition count 945
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 561 place count 418 transition count 934
Iterating global reduction 7 with 4 rules applied. Total rules applied 565 place count 418 transition count 934
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 568 place count 418 transition count 931
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 569 place count 417 transition count 923
Iterating global reduction 8 with 1 rules applied. Total rules applied 570 place count 417 transition count 923
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 571 place count 416 transition count 915
Iterating global reduction 8 with 1 rules applied. Total rules applied 572 place count 416 transition count 915
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 573 place count 415 transition count 907
Iterating global reduction 8 with 1 rules applied. Total rules applied 574 place count 415 transition count 907
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 575 place count 414 transition count 899
Iterating global reduction 8 with 1 rules applied. Total rules applied 576 place count 414 transition count 899
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 577 place count 413 transition count 891
Iterating global reduction 8 with 1 rules applied. Total rules applied 578 place count 413 transition count 891
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 579 place count 412 transition count 883
Iterating global reduction 8 with 1 rules applied. Total rules applied 580 place count 412 transition count 883
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 581 place count 411 transition count 875
Iterating global reduction 8 with 1 rules applied. Total rules applied 582 place count 411 transition count 875
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 583 place count 410 transition count 867
Iterating global reduction 8 with 1 rules applied. Total rules applied 584 place count 410 transition count 867
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 585 place count 409 transition count 859
Iterating global reduction 8 with 1 rules applied. Total rules applied 586 place count 409 transition count 859
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 587 place count 408 transition count 851
Iterating global reduction 8 with 1 rules applied. Total rules applied 588 place count 408 transition count 851
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 589 place count 407 transition count 843
Iterating global reduction 8 with 1 rules applied. Total rules applied 590 place count 407 transition count 843
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 591 place count 406 transition count 835
Iterating global reduction 8 with 1 rules applied. Total rules applied 592 place count 406 transition count 835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 593 place count 405 transition count 827
Iterating global reduction 8 with 1 rules applied. Total rules applied 594 place count 405 transition count 827
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 595 place count 404 transition count 819
Iterating global reduction 8 with 1 rules applied. Total rules applied 596 place count 404 transition count 819
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 597 place count 403 transition count 811
Iterating global reduction 8 with 1 rules applied. Total rules applied 598 place count 403 transition count 811
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 668 place count 368 transition count 776
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 669 place count 367 transition count 775
Iterating global reduction 8 with 1 rules applied. Total rules applied 670 place count 367 transition count 775
Applied a total of 670 rules in 178 ms. Remains 367 /722 variables (removed 355) and now considering 775/1217 (removed 442) transitions.
// Phase 1: matrix 775 rows 367 cols
[2025-05-30 02:25:07] [INFO ] Computed 52 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:07] [INFO ] Implicit Places using invariants in 253 ms returned [72, 89, 95, 100, 159, 176, 182, 187, 189, 198, 216, 252, 277, 285, 291, 293, 322, 364]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 254 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/722 places, 775/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 349 transition count 766
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 340 transition count 766
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 334 transition count 760
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 334 transition count 760
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 328 transition count 754
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 328 transition count 754
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 325 transition count 751
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 325 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 308 transition count 734
Applied a total of 82 rules in 35 ms. Remains 308 /349 variables (removed 41) and now considering 734/775 (removed 41) transitions.
// Phase 1: matrix 734 rows 308 cols
[2025-05-30 02:25:07] [INFO ] Computed 34 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:07] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-30 02:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:08] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 308/722 places, 734/1217 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1150 ms. Remains : 308/722 places, 734/1217 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-03a-LTLFireability-14
Product exploration explored 100000 steps with 1821 reset in 198 ms.
Product exploration explored 100000 steps with 1828 reset in 206 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 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20863 steps (391 resets) in 48 ms. (425 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 734/734 transitions.
Applied a total of 0 rules in 13 ms. Remains 308 /308 variables (removed 0) and now considering 734/734 (removed 0) transitions.
[2025-05-30 02:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:09] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-30 02:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:25:10] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:25:10] [INFO ] Redundant transitions in 8 ms returned []
Running 713 sub problems to find dead transitions.
[2025-05-30 02:25:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:30] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:32] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 35 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/1042 variables, and 36 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 713 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:25:48] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 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 TDEAD75 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 TDEAD82 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 TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 8 (OVERLAPS) 734/1042 variables, 308/345 constraints. Problems are: Problem set: 120 solved, 593 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 938 constraints, problems are : Problem set: 120 solved, 593 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 593/713 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 120 solved, 593 unsolved
Search for dead transitions found 120 dead transitions in 60225ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 308/308 places, 614/734 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 301 transition count 614
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 301 transition count 607
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 294 transition count 607
Applied a total of 21 rules in 10 ms. Remains 294 /308 variables (removed 14) and now considering 607/614 (removed 7) transitions.
// Phase 1: matrix 607 rows 294 cols
[2025-05-30 02:26:10] [INFO ] Computed 34 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:26:10] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-30 02:26:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:26:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 02:26:11] [INFO ] Implicit Places using invariants and state equation in 539 ms returned [69, 104, 208]
[2025-05-30 02:26:11] [INFO ] Actually due to overlaps returned [69, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 734 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 292/308 places, 607/734 transitions.
Applied a total of 0 rules in 7 ms. Remains 292 /292 variables (removed 0) and now considering 607/607 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61699 ms. Remains : 292/308 places, 607/734 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 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9932 steps (164 resets) in 23 ms. (413 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1790 reset in 143 ms.
Product exploration explored 100000 steps with 1816 reset in 253 ms.
Built C files in :
/tmp/ltsmin7095925314904210566
[2025-05-30 02:26:12] [INFO ] Computing symmetric may disable matrix : 607 transitions.
[2025-05-30 02:26:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:26:12] [INFO ] Computing symmetric may enable matrix : 607 transitions.
[2025-05-30 02:26:12] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:26:12] [INFO ] Computing Do-Not-Accords matrix : 607 transitions.
[2025-05-30 02:26:12] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:26:12] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7095925314904210566
Running compilation step : cd /tmp/ltsmin7095925314904210566;'/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 1436 ms.
Running link step : cd /tmp/ltsmin7095925314904210566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7095925314904210566;'/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/stateBased2037143111163827850.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 292/292 places, 607/607 transitions.
Applied a total of 0 rules in 14 ms. Remains 292 /292 variables (removed 0) and now considering 607/607 (removed 0) transitions.
// Phase 1: matrix 607 rows 292 cols
[2025-05-30 02:26:27] [INFO ] Computed 32 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:26:27] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 02:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 02:26:27] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:26:27] [INFO ] Redundant transitions in 6 ms returned []
Running 586 sub problems to find dead transitions.
[2025-05-30 02:26:27] [INFO ] Invariant cache hit.
[2025-05-30 02:26:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 24/28 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:26:30] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 11 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:26:30] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 10 ms to minimize.
Problem TDEAD25 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 2/30 constraints. Problems are: Problem set: 6 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 3/33 constraints. Problems are: Problem set: 6 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/34 constraints. Problems are: Problem set: 6 solved, 580 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:26:46] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/35 constraints. Problems are: Problem set: 6 solved, 580 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/35 constraints. Problems are: Problem set: 6 solved, 580 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
At refinement iteration 8 (OVERLAPS) 607/899 variables, 292/327 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/899 variables, 1/328 constraints. Problems are: Problem set: 62 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 899/899 variables, and 328 constraints, problems are : Problem set: 62 solved, 524 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 292/292 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 62 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 4/4 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 24/28 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 2/30 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/30 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 1/292 variables, 3/33 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/34 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/35 constraints. Problems are: Problem set: 62 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/35 constraints. Problems are: Problem set: 62 solved, 524 unsolved
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 TDEAD130 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 TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 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 TDEAD183 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 TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 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 TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 8 (OVERLAPS) 607/899 variables, 292/327 constraints. Problems are: Problem set: 278 solved, 308 unsolved
SMT process timed out in 60153ms, After SMT, problems are : Problem set: 278 solved, 308 unsolved
Search for dead transitions found 278 dead transitions in 60155ms
Found 278 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 278 transitions
Dead transitions reduction (with SMT) removed 278 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 292/292 places, 329/607 transitions.
Ensure Unique test removed 21 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 263 transition count 308
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 51 place count 242 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 241 transition count 307
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 52 place count 241 transition count 298
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 70 place count 232 transition count 298
Applied a total of 70 rules in 9 ms. Remains 232 /292 variables (removed 60) and now considering 298/329 (removed 31) transitions.
// Phase 1: matrix 298 rows 232 cols
[2025-05-30 02:27:28] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:27:28] [INFO ] Implicit Places using invariants in 145 ms returned [1, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 230/292 places, 298/607 transitions.
Applied a total of 0 rules in 4 ms. Remains 230 /230 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61099 ms. Remains : 230/292 places, 298/607 transitions.
Built C files in :
/tmp/ltsmin13817953678661027632
[2025-05-30 02:27:28] [INFO ] Computing symmetric may disable matrix : 298 transitions.
[2025-05-30 02:27:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:27:28] [INFO ] Computing symmetric may enable matrix : 298 transitions.
[2025-05-30 02:27:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:27:28] [INFO ] Computing Do-Not-Accords matrix : 298 transitions.
[2025-05-30 02:27:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:27:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13817953678661027632
Running compilation step : cd /tmp/ltsmin13817953678661027632;'/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 612 ms.
Running link step : cd /tmp/ltsmin13817953678661027632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13817953678661027632;'/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/stateBased13077168883563918582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 02:27:43] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:27:43] [INFO ] Flatten gal took : 14 ms
[2025-05-30 02:27:43] [INFO ] Time to serialize gal into /tmp/LTL18027880659181940031.gal : 3 ms
[2025-05-30 02:27:43] [INFO ] Time to serialize properties into /tmp/LTL7205778195914947214.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18027880659181940031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10418410675095600241.hoa' '-atoms' '/tmp/LTL7205778195914947214.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7205778195914947214.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10418410675095600241.hoa
Reverse transition relation is NOT exact ! Due to transitions t934.t936.t30.t937.t24.t185.t183.t184.t23, t948.t197.t198.t949, t1019.t1018, t1021.t1020, t11...920
Computing Next relation with stutter on 1.14038e+08 deadlock states
Detected timeout of ITS tools.
[2025-05-30 02:27:58] [INFO ] Flatten gal took : 26 ms
[2025-05-30 02:27:58] [INFO ] Flatten gal took : 25 ms
[2025-05-30 02:27:58] [INFO ] Time to serialize gal into /tmp/LTL15720511057433512207.gal : 6 ms
[2025-05-30 02:27:58] [INFO ] Time to serialize properties into /tmp/LTL15148852772970552065.ltl : 3 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/LTL15720511057433512207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15148852772970552065.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p242==0)||(p473==0))"))))
Formula 0 simplified : FG!"((p242==0)||(p473==0))"
Detected timeout of ITS tools.
[2025-05-30 02:28:13] [INFO ] Flatten gal took : 23 ms
[2025-05-30 02:28:13] [INFO ] Applying decomposition
[2025-05-30 02:28:13] [INFO ] Flatten gal took : 22 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/graph9840361137062606605.txt' '-o' '/tmp/graph9840361137062606605.bin' '-w' '/tmp/graph9840361137062606605.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9840361137062606605.bin' '-l' '-1' '-v' '-w' '/tmp/graph9840361137062606605.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:28:13] [INFO ] Decomposing Gal with order
[2025-05-30 02:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:28:13] [INFO ] Removed a total of 1119 redundant transitions.
[2025-05-30 02:28:13] [INFO ] Flatten gal took : 100 ms
[2025-05-30 02:28:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 22 ms.
[2025-05-30 02:28:13] [INFO ] Time to serialize gal into /tmp/LTL4280655606574844041.gal : 8 ms
[2025-05-30 02:28:13] [INFO ] Time to serialize properties into /tmp/LTL1163678306627159627.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/LTL4280655606574844041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1163678306627159627.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i5.u42.p242==0)||(i5.u44.p473==0))"))))
Formula 0 simplified : FG!"((i5.u42.p242==0)||(i5.u44.p473==0))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-03a-LTLFireability-14 finished in 201733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2025-05-30 02:28:29] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1066125536062045297
[2025-05-30 02:28:29] [INFO ] Computing symmetric may disable matrix : 1217 transitions.
[2025-05-30 02:28:29] [INFO ] Applying decomposition
[2025-05-30 02:28:29] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:28:29] [INFO ] Computing symmetric may enable matrix : 1217 transitions.
[2025-05-30 02:28:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:28:29] [INFO ] Flatten gal took : 37 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/graph1298364202438234733.txt' '-o' '/tmp/graph1298364202438234733.bin' '-w' '/tmp/graph1298364202438234733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1298364202438234733.bin' '-l' '-1' '-v' '-w' '/tmp/graph1298364202438234733.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:28:29] [INFO ] Decomposing Gal with order
[2025-05-30 02:28:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:28:29] [INFO ] Removed a total of 1812 redundant transitions.
[2025-05-30 02:28:29] [INFO ] Flatten gal took : 69 ms
[2025-05-30 02:28:29] [INFO ] Computing Do-Not-Accords matrix : 1217 transitions.
[2025-05-30 02:28:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 36 ms.
[2025-05-30 02:28:29] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:28:29] [INFO ] Time to serialize gal into /tmp/LTLFireability14242189527271622114.gal : 16 ms
[2025-05-30 02:28:29] [INFO ] Time to serialize properties into /tmp/LTLFireability7271335211163700493.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/LTLFireability14242189527271622114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7271335211163700493.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...277
Read 1 LTL properties
[2025-05-30 02:28:29] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1066125536062045297
Running compilation step : cd /tmp/ltsmin1066125536062045297;'/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'
Checking formula 0 : !((G(F("((i9.u69.p242==0)||(i9.u131.p473==0))"))))
Formula 0 simplified : FG!"((i9.u69.p242==0)||(i9.u131.p473==0))"
Compilation finished in 3908 ms.
Running link step : cd /tmp/ltsmin1066125536062045297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin1066125536062045297;'/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 t0, t1, t2, t3, t6, t7, t8, t9, t13, t14, t15, t23, t979, t1032, t1034, t1037, t1061, t1114, ...664
Computing Next relation with stutter on 5.3497e+08 deadlock states
Detected timeout of ITS tools.
[2025-05-30 02:50:25] [INFO ] Applying decomposition
[2025-05-30 02:50:25] [INFO ] Flatten gal took : 103 ms
[2025-05-30 02:50:25] [INFO ] Decomposing Gal with order
[2025-05-30 02:50:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:50:26] [INFO ] Removed a total of 1504 redundant transitions.
[2025-05-30 02:50:26] [INFO ] Flatten gal took : 230 ms
[2025-05-30 02:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 68 ms.
[2025-05-30 02:50:26] [INFO ] Time to serialize gal into /tmp/LTLFireability8213243382637056681.gal : 9 ms
[2025-05-30 02:50:26] [INFO ] Time to serialize properties into /tmp/LTLFireability6786530733169616566.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/LTLFireability8213243382637056681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6786530733169616566.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 : !((G(F("((u39.p242==0)||(u76.p473==0))"))))
Formula 0 simplified : FG!"((u39.p242==0)||(u76.p473==0))"
Reverse transition relation is NOT exact ! Due to transitions t604, t931, t944, t945, t946, t949, t954, t961, t970, t979, t1009, t1038, t1061, t1111, t1137...620
Computing Next relation with stutter on 5.3497e+08 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
9097 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,91.0295,2180772,1,0,4.77459e+06,19169,4411,6.79749e+06,1216,98987,9208097
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ASLink-PT-03a-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1898667 ms.

BK_STOP 1748573659693

--------------------
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-03a"
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-03a, 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-174853729000316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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