About the Execution of ITS-Tools for Champagne-PT-H07T2O
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1296101.00 | 0.00 | 0.00 | FFFFFFTFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200092.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 Champagne-PT-H07T2O, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 11:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 193K Jun 5 20:08 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 Champagne-PT-H07T2O-LTLFireability-00
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-01
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-02
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-03
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-04
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-05
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-06
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-07
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-08
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-09
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-10
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-11
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-12
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-13
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-14
FORMULA_NAME Champagne-PT-H07T2O-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749325133785
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 19:38:55] [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-06-07 19:38:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:38:55] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-06-07 19:38:55] [INFO ] Transformed 1025 places.
[2025-06-07 19:38:55] [INFO ] Transformed 1282 transitions.
[2025-06-07 19:38:55] [INFO ] Found NUPN structural information;
[2025-06-07 19:38:55] [INFO ] Parsed PT model containing 1025 places and 1282 transitions and 3014 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H07T2O-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T2O-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1025 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1025/1025 places, 1282/1282 transitions.
Discarding 181 places :
Symmetric choice reduction at 0 with 181 rule applications. Total rules 181 place count 844 transition count 1101
Iterating global reduction 0 with 181 rules applied. Total rules applied 362 place count 844 transition count 1101
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 486 place count 720 transition count 977
Iterating global reduction 0 with 124 rules applied. Total rules applied 610 place count 720 transition count 977
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 682 place count 648 transition count 905
Iterating global reduction 0 with 72 rules applied. Total rules applied 754 place count 648 transition count 905
Applied a total of 754 rules in 288 ms. Remains 648 /1025 variables (removed 377) and now considering 905/1282 (removed 377) transitions.
// Phase 1: matrix 905 rows 648 cols
[2025-06-07 19:38:56] [INFO ] Computed 27 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:56] [INFO ] Implicit Places using invariants in 489 ms returned []
[2025-06-07 19:38:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:38:57] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Running 904 sub problems to find dead transitions.
[2025-06-07 19:38:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (OVERLAPS) 1/648 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/1553 variables, and 27 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/648 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/647 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (OVERLAPS) 1/648 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/1553 variables, and 27 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/648 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 648/1025 places, 905/1282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61820 ms. Remains : 648/1025 places, 905/1282 transitions.
Support contains 38 out of 648 places after structural reductions.
[2025-06-07 19:39:57] [INFO ] Flatten gal took : 74 ms
[2025-06-07 19:39:57] [INFO ] Flatten gal took : 40 ms
[2025-06-07 19:39:57] [INFO ] Input system was already deterministic with 905 transitions.
RANDOM walk for 40000 steps (57 resets) in 1729 ms. (23 steps per ms) remains 1/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
[2025-06-07 19:39:58] [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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 592/648 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 905/1553 variables, 648/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1553 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1553/1553 variables, and 675 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 592/648 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 905/1553 variables, 648/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1553 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1553 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1553/1553 variables, and 676 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 648/648 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 12 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 30 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1&&X(F(p2))&&F(!p1)))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 632 transition count 889
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 632 transition count 889
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 624 transition count 881
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 624 transition count 881
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 621 transition count 878
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 621 transition count 878
Applied a total of 54 rules in 95 ms. Remains 621 /648 variables (removed 27) and now considering 878/905 (removed 27) transitions.
// Phase 1: matrix 878 rows 621 cols
[2025-06-07 19:39:59] [INFO ] Computed 27 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:39:59] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-07 19:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:40:00] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-06-07 19:40:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 621/648 places, 878/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60748 ms. Remains : 621/648 places, 878/905 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p0), true, (NOT p2), p1]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-00
Stuttering criterion allowed to conclude after 503 steps with 1 reset in 9 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-00 finished in 61162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p1))))))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 631 transition count 888
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 631 transition count 888
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 623 transition count 880
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 623 transition count 880
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 620 transition count 877
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 620 transition count 877
Applied a total of 56 rules in 80 ms. Remains 620 /648 variables (removed 28) and now considering 877/905 (removed 28) transitions.
// Phase 1: matrix 877 rows 620 cols
[2025-06-07 19:41:00] [INFO ] Computed 27 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:41:01] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-07 19:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:41:01] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 876 sub problems to find dead transitions.
[2025-06-07 19:41:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 1/620 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1497 variables, and 27 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 876/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 876 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 1/620 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/1497 variables, and 27 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 0/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 876 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 620/648 places, 877/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 620/648 places, 877/905 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-01
Product exploration explored 100000 steps with 4944 reset in 260 ms.
Product exploration explored 100000 steps with 4901 reset in 214 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Detected a total of 26/620 stabilizing places and 26/877 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6787 steps (10 resets) in 36 ms. (183 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-07 19:42:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 19:42:03] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2025-06-07 19:42:03] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2025-06-07 19:42:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 19:42:03] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2025-06-07 19:42:04] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2025-06-07 19:42:04] [INFO ] Computed and/alt/rep : 861/1578/861 causal constraints (skipped 15 transitions) in 38 ms.
[2025-06-07 19:42:14] [INFO ] Added : 858 causal constraints over 172 iterations in 10497 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 620/620 places, 877/877 transitions.
Applied a total of 0 rules in 15 ms. Remains 620 /620 variables (removed 0) and now considering 877/877 (removed 0) transitions.
[2025-06-07 19:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:14] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-07 19:42:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:15] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 876 sub problems to find dead transitions.
[2025-06-07 19:42:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 1/620 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1497 variables, and 27 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 876/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 876 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 1/620 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/1497 variables, and 27 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 0/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 876 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in LTL mode , in 1 iterations and 60678 ms. Remains : 620/620 places, 877/877 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Detected a total of 26/620 stabilizing places and 26/877 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 936 steps (0 resets) in 10 ms. (85 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-07 19:43:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 19:43:16] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2025-06-07 19:43:16] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-07 19:43:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 19:43:17] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2025-06-07 19:43:17] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2025-06-07 19:43:17] [INFO ] Computed and/alt/rep : 861/1578/861 causal constraints (skipped 15 transitions) in 39 ms.
[2025-06-07 19:43:27] [INFO ] Added : 858 causal constraints over 172 iterations in 10408 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4917 reset in 175 ms.
Product exploration explored 100000 steps with 4853 reset in 174 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 620/620 places, 877/877 transitions.
Graph (trivial) has 661 edges and 620 vertex of which 407 / 620 are part of one of the 27 SCC in 8 ms
Free SCC test removed 380 places
Ensure Unique test removed 424 transitions
Reduce isomorphic transitions removed 424 transitions.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 240 transition count 453
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 92 place count 240 transition count 428
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 92 place count 240 transition count 428
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 119 place count 240 transition count 428
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 165 place count 194 transition count 312
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 211 place count 194 transition count 312
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 230 place count 194 transition count 293
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 249 place count 175 transition count 274
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 3 with 19 rules applied. Total rules applied 268 place count 175 transition count 274
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 3 with 48 rules applied. Total rules applied 316 place count 175 transition count 274
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 341 place count 150 transition count 249
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 3 with 25 rules applied. Total rules applied 366 place count 150 transition count 249
Deduced a syphon composed of 70 places in 0 ms
Applied a total of 366 rules in 82 ms. Remains 150 /620 variables (removed 470) and now considering 249/877 (removed 628) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:43:28] [INFO ] Redundant transitions in 10 ms returned []
Running 248 sub problems to find dead transitions.
[2025-06-07 19:43:28] [INFO ] Flow matrix only has 147 transitions (discarded 102 similar events)
// Phase 1: matrix 147 rows 150 cols
[2025-06-07 19:43:28] [INFO ] Computed 27 invariants in 1 ms
[2025-06-07 19:43:28] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:30] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:30] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:30] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:30] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:30] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 20/47 constraints. Problems are: Problem set: 57 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD93 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 7/54 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/54 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 146/296 variables, 150/204 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 21/225 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/225 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 1/297 variables, 1/226 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/226 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/297 variables, 0/226 constraints. Problems are: Problem set: 70 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 226 constraints, problems are : Problem set: 70 solved, 178 unsolved in 10847 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 150/150 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 70 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 71/150 variables, 27/27 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 27/54 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/54 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 146/296 variables, 150/204 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 21/225 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 178/403 constraints. Problems are: Problem set: 70 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:45] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/404 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/404 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 1/297 variables, 1/405 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/405 constraints. Problems are: Problem set: 70 solved, 178 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/405 constraints. Problems are: Problem set: 70 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 405 constraints, problems are : Problem set: 70 solved, 178 unsolved in 24673 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 150/150 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 178/248 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35552ms problems are : Problem set: 70 solved, 178 unsolved
Search for dead transitions found 70 dead transitions in 35559ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 150/620 places, 179/877 transitions.
Graph (complete) has 1051 edges and 150 vertex of which 80 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.2 ms
Discarding 70 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 80 /150 variables (removed 70) and now considering 179/179 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/620 places, 179/877 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35670 ms. Remains : 80/620 places, 179/877 transitions.
Built C files in :
/tmp/ltsmin13898398398612173477
[2025-06-07 19:44:04] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13898398398612173477
Running compilation step : cd /tmp/ltsmin13898398398612173477;'/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 1461 ms.
Running link step : cd /tmp/ltsmin13898398398612173477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13898398398612173477;'/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/stateBased3513238803425172854.hoa' '--buchi-type=spotba'
LTSmin run took 921 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H07T2O-LTLFireability-01 finished in 186201 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(G((p1&&(p2||X(p3))))))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 631 transition count 888
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 631 transition count 888
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 623 transition count 880
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 623 transition count 880
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 620 transition count 877
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 620 transition count 877
Applied a total of 56 rules in 62 ms. Remains 620 /648 variables (removed 28) and now considering 877/905 (removed 28) transitions.
// Phase 1: matrix 877 rows 620 cols
[2025-06-07 19:44:07] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:07] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-07 19:44:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:44:07] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 876 sub problems to find dead transitions.
[2025-06-07 19:44:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 1/620 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/1497 variables, and 27 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/620 constraints, PredecessorRefiner: 876/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 876 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/619 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (OVERLAPS) 1/620 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 3 (OVERLAPS) 877/1497 variables, 620/647 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 876/1523 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1497/1497 variables, and 1523 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 620/620 constraints, PredecessorRefiner: 876/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 876 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 620/648 places, 877/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60720 ms. Remains : 620/648 places, 877/905 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-02
Stuttering criterion allowed to conclude after 490 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-02 finished in 60976 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||G(p1)))&&F(p2))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Graph (trivial) has 684 edges and 648 vertex of which 414 / 648 are part of one of the 28 SCC in 1 ms
Free SCC test removed 386 places
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 427 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 261 transition count 396
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 128 rules applied. Total rules applied 210 place count 180 transition count 349
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 233 place count 158 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 157 transition count 348
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 234 place count 157 transition count 347
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 156 transition count 347
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 257 place count 135 transition count 269
Iterating global reduction 4 with 21 rules applied. Total rules applied 278 place count 135 transition count 269
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 294 place count 135 transition count 253
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 392 place count 86 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 396 place count 82 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 400 place count 82 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 404 place count 82 transition count 185
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 406 place count 80 transition count 183
Applied a total of 406 rules in 34 ms. Remains 80 /648 variables (removed 568) and now considering 183/905 (removed 722) transitions.
[2025-06-07 19:45:08] [INFO ] Flow matrix only has 84 transitions (discarded 99 similar events)
// Phase 1: matrix 84 rows 80 cols
[2025-06-07 19:45:08] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:45:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-07 19:45:08] [INFO ] Flow matrix only has 84 transitions (discarded 99 similar events)
[2025-06-07 19:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:45:08] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:45:08] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-07 19:45:08] [INFO ] Flow matrix only has 84 transitions (discarded 99 similar events)
[2025-06-07 19:45:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 3/80 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 83/163 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/164 variables, and 107 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2432 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 3/80 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 83/163 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 109/216 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/164 variables, and 216 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2413 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4880ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 4880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/648 places, 183/905 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5141 ms. Remains : 80/648 places, 183/905 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-03 finished in 5269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U (p1&&X(p1)))&&(G(p3)||p2))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 632 transition count 889
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 632 transition count 889
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 625 transition count 882
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 625 transition count 882
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 623 transition count 880
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 623 transition count 880
Applied a total of 50 rules in 44 ms. Remains 623 /648 variables (removed 25) and now considering 880/905 (removed 25) transitions.
// Phase 1: matrix 880 rows 623 cols
[2025-06-07 19:45:13] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:45:13] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-07 19:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:45:13] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 879 sub problems to find dead transitions.
[2025-06-07 19:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 623/648 places, 880/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60709 ms. Remains : 623/648 places, 880/905 transitions.
Stuttering acceptance computed with spot in 521 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-04
Stuttering criterion allowed to conclude after 913 steps with 0 reset in 6 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-04 finished in 61262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G((p1&&X(X(p1)))) U (p2&&G((p1&&X(X(p1)))))))||p0)))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 633 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 633 transition count 890
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 626 transition count 883
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 626 transition count 883
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 623 transition count 880
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 623 transition count 880
Applied a total of 50 rules in 50 ms. Remains 623 /648 variables (removed 25) and now considering 880/905 (removed 25) transitions.
// Phase 1: matrix 880 rows 623 cols
[2025-06-07 19:46:14] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:14] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-07 19:46:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:15] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 879 sub problems to find dead transitions.
[2025-06-07 19:46:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 timeout
0.0)
(s348 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 623/648 places, 880/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 623/648 places, 880/905 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T2O-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T2O-LTLFireability-06 finished in 61334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X((p1||G(p2)||(p2&&F(p3))))))||p0))))'
Support contains 5 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 634 transition count 891
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 634 transition count 891
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 628 transition count 885
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 628 transition count 885
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 626 transition count 883
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 626 transition count 883
Applied a total of 44 rules in 52 ms. Remains 626 /648 variables (removed 22) and now considering 883/905 (removed 22) transitions.
// Phase 1: matrix 883 rows 626 cols
[2025-06-07 19:47:15] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:47:16] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-07 19:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:47:16] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-06-07 19:47:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 626/648 places, 883/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60712 ms. Remains : 626/648 places, 883/905 transitions.
Stuttering acceptance computed with spot in 1061 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-08
Product exploration explored 100000 steps with 141 reset in 240 ms.
Product exploration explored 100000 steps with 152 reset in 310 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/626 stabilizing places and 29/883 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 4124 ms. Reduced automaton from 20 states, 64 edges and 4 AP (stutter sensitive) to 20 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1018 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (56 resets) in 309 ms. (129 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
[2025-06-07 19:48:23] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 498/626 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1509/1509 variables, and 653 constraints, problems are : Problem set: 0 solved, 6 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 498/626 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 6/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1509 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1509 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 659 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1669ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 177 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=59 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 218 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0 p2 p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p1 p2))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p1 p0 (NOT p2) p3))), (F (NOT (OR p0 p3))), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 4 factoid took 5173 ms. Reduced automaton from 20 states, 60 edges and 4 AP (stutter sensitive) to 20 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1025 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 1010 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 883/883 transitions.
Applied a total of 0 rules in 14 ms. Remains 626 /626 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2025-06-07 19:48:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:48:33] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-07 19:48:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:48:33] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-06-07 19:48:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 626/626 places, 883/883 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/626 stabilizing places and 29/883 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 4111 ms. Reduced automaton from 20 states, 60 edges and 4 AP (stutter sensitive) to 20 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1043 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 40000 steps (56 resets) in 435 ms. (91 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
[2025-06-07 19:49:38] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 498/626 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1509 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1509/1509 variables, and 653 constraints, problems are : Problem set: 0 solved, 6 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 123/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 498/626 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 883/1509 variables, 626/653 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1509 variables, 6/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1509 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1509 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 659 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1662ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 296 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=74 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 221 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p1 p0 p2 p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR p1 p2))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT p3)), (F (NOT (OR p1 p0 (NOT p2) p3))), (F (NOT (OR p0 p3))), (F (NOT (OR p1 p2 p3)))]
Knowledge based reduction with 4 factoid took 5229 ms. Reduced automaton from 20 states, 60 edges and 4 AP (stutter sensitive) to 20 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1073 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 1085 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 1118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 148 reset in 226 ms.
Product exploration explored 100000 steps with 153 reset in 221 ms.
Built C files in :
/tmp/ltsmin2313585692007726392
[2025-06-07 19:49:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2313585692007726392
Running compilation step : cd /tmp/ltsmin2313585692007726392;'/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 1324 ms.
Running link step : cd /tmp/ltsmin2313585692007726392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2313585692007726392;'/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/stateBased14817992855016154591.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 883/883 transitions.
Applied a total of 0 rules in 19 ms. Remains 626 /626 variables (removed 0) and now considering 883/883 (removed 0) transitions.
[2025-06-07 19:50:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:50:09] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-07 19:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:50:09] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 882 sub problems to find dead transitions.
[2025-06-07 19:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 882/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 882 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 882 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 882 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1509 variables, and 27 constraints, problems are : Problem set: 0 solved, 882 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/882 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 882 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 60664 ms. Remains : 626/626 places, 883/883 transitions.
Built C files in :
/tmp/ltsmin2846411744100486845
[2025-06-07 19:51:09] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2846411744100486845
Running compilation step : cd /tmp/ltsmin2846411744100486845;'/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 1382 ms.
Running link step : cd /tmp/ltsmin2846411744100486845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2846411744100486845;'/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/stateBased14131474083798962689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 19:51:24] [INFO ] Flatten gal took : 31 ms
[2025-06-07 19:51:24] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:51:24] [INFO ] Time to serialize gal into /tmp/LTL7804191662007169861.gal : 6 ms
[2025-06-07 19:51:24] [INFO ] Time to serialize properties into /tmp/LTL10673929365189541875.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/LTL7804191662007169861.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8161125721754090458.hoa' '-atoms' '/tmp/LTL10673929365189541875.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10673929365189541875.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8161125721754090458.hoa
Detected timeout of ITS tools.
[2025-06-07 19:51:39] [INFO ] Flatten gal took : 32 ms
[2025-06-07 19:51:39] [INFO ] Flatten gal took : 26 ms
[2025-06-07 19:51:40] [INFO ] Time to serialize gal into /tmp/LTL7339341748219922928.gal : 5 ms
[2025-06-07 19:51:40] [INFO ] Time to serialize properties into /tmp/LTL12609864746012125002.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7339341748219922928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12609864746012125002.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p947==0)||(p1007==0))")||(X(X(X((("(p835==0)")||(G("(p435!=1)")))||(("(p435!=1)")&&(F("(p749!=1)")))))))))))
Formula 0 simplified : GF(!"((p947==0)||(p1007==0))" & XXX(!"(p835==0)" & F!"(p435!=1)" & (!"(p435!=1)" | G!"(p749!=1)")))
Detected timeout of ITS tools.
[2025-06-07 19:51:55] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:51:55] [INFO ] Applying decomposition
[2025-06-07 19:51:55] [INFO ] Flatten gal took : 23 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/graph2871118046699192341.txt' '-o' '/tmp/graph2871118046699192341.bin' '-w' '/tmp/graph2871118046699192341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2871118046699192341.bin' '-l' '-1' '-v' '-w' '/tmp/graph2871118046699192341.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:51:55] [INFO ] Decomposing Gal with order
[2025-06-07 19:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:51:55] [INFO ] Removed a total of 534 redundant transitions.
[2025-06-07 19:51:55] [INFO ] Flatten gal took : 89 ms
[2025-06-07 19:51:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 12 ms.
[2025-06-07 19:51:55] [INFO ] Time to serialize gal into /tmp/LTL12643323370959302322.gal : 10 ms
[2025-06-07 19:51:55] [INFO ] Time to serialize properties into /tmp/LTL5590226632895055094.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/LTL12643323370959302322.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5590226632895055094.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i25.u221.p947==0)||(i27.u236.p1007==0))")||(X(X(X((("(i22.u185.p835==0)")||(G("(i11.u104.p435!=1)")))||(("(i11.u104.p435!=1...194
Formula 0 simplified : GF(!"((i25.u221.p947==0)||(i27.u236.p1007==0))" & XXX(!"(i22.u185.p835==0)" & F!"(i11.u104.p435!=1)" & (!"(i11.u104.p435!=1)" | G!"(...176
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H07T2O-LTLFireability-08 finished in 294607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
Support contains 2 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 632 transition count 889
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 632 transition count 889
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 624 transition count 881
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 624 transition count 881
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 621 transition count 878
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 621 transition count 878
Applied a total of 54 rules in 51 ms. Remains 621 /648 variables (removed 27) and now considering 878/905 (removed 27) transitions.
// Phase 1: matrix 878 rows 621 cols
[2025-06-07 19:52:10] [INFO ] Computed 27 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:52:10] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-06-07 19:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:52:10] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-06-07 19:52: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/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 621/648 places, 878/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 621/648 places, 878/905 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-09
Product exploration explored 100000 steps with 19966 reset in 140 ms.
Product exploration explored 100000 steps with 20017 reset in 152 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 6071 steps (7 resets) in 27 ms. (216 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 878/878 transitions.
Applied a total of 0 rules in 18 ms. Remains 621 /621 variables (removed 0) and now considering 878/878 (removed 0) transitions.
[2025-06-07 19:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:12] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-07 19:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:53:12] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-06-07 19:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 3 (OVERLAPS) 878/1499 variables, 621/648 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1499/1499 variables, and 1525 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 60663 ms. Remains : 621/621 places, 878/878 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 10728 steps (12 resets) in 66 ms. (160 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 19949 reset in 148 ms.
Product exploration explored 100000 steps with 19982 reset in 157 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 878/878 transitions.
Graph (trivial) has 661 edges and 621 vertex of which 405 / 621 are part of one of the 27 SCC in 2 ms
Free SCC test removed 378 places
Ensure Unique test removed 421 transitions
Reduce isomorphic transitions removed 421 transitions.
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 243 transition count 457
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 93 place count 243 transition count 433
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 93 place count 243 transition count 433
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 118 place count 243 transition count 433
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 163 place count 198 transition count 315
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 208 place count 198 transition count 315
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 228 place count 198 transition count 295
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 248 place count 178 transition count 275
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 268 place count 178 transition count 275
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 3 with 49 rules applied. Total rules applied 317 place count 178 transition count 275
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 341 place count 154 transition count 251
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 365 place count 154 transition count 251
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 367 place count 154 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 368 place count 153 transition count 256
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 153 transition count 256
Deduced a syphon composed of 74 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 371 place count 153 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 372 place count 152 transition count 253
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 152 transition count 253
Deduced a syphon composed of 73 places in 0 ms
Applied a total of 373 rules in 57 ms. Remains 152 /621 variables (removed 469) and now considering 253/878 (removed 625) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:54:14] [INFO ] Redundant transitions in 3 ms returned []
Running 252 sub problems to find dead transitions.
[2025-06-07 19:54:14] [INFO ] Flow matrix only has 154 transitions (discarded 99 similar events)
// Phase 1: matrix 154 rows 152 cols
[2025-06-07 19:54:14] [INFO ] Computed 27 invariants in 1 ms
[2025-06-07 19:54:14] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD73 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 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 TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 20/47 constraints. Problems are: Problem set: 57 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD82 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 7/54 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/54 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 153/305 variables, 152/206 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/226 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/226 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/227 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/227 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/227 constraints. Problems are: Problem set: 74 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 227 constraints, problems are : Problem set: 74 solved, 178 unsolved in 11047 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 152/152 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 74 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 74/152 variables, 27/27 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 27/54 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/54 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 153/305 variables, 152/206 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/226 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/404 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/404 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/405 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/405 constraints. Problems are: Problem set: 74 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/405 constraints. Problems are: Problem set: 74 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 405 constraints, problems are : Problem set: 74 solved, 178 unsolved in 19036 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 152/152 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 178/252 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30123ms problems are : Problem set: 74 solved, 178 unsolved
Search for dead transitions found 74 dead transitions in 30124ms
Found 74 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 74 transitions
Dead transitions reduction (with SMT) removed 74 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/621 places, 179/878 transitions.
Graph (complete) has 1047 edges and 152 vertex of which 79 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.2 ms
Discarding 73 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 79 /152 variables (removed 73) and now considering 179/179 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/621 places, 179/878 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30199 ms. Remains : 79/621 places, 179/878 transitions.
Built C files in :
/tmp/ltsmin14031773095279253302
[2025-06-07 19:54:44] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14031773095279253302
Running compilation step : cd /tmp/ltsmin14031773095279253302;'/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 1320 ms.
Running link step : cd /tmp/ltsmin14031773095279253302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14031773095279253302;'/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/stateBased3279018720512068080.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 878/878 transitions.
Applied a total of 0 rules in 23 ms. Remains 621 /621 variables (removed 0) and now considering 878/878 (removed 0) transitions.
// Phase 1: matrix 878 rows 621 cols
[2025-06-07 19:55:00] [INFO ] Computed 27 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:55:00] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-07 19:55:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:55:00] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 877 sub problems to find dead transitions.
[2025-06-07 19:55:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 877/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 877 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 877 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 877 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1499 variables, and 27 constraints, problems are : Problem set: 0 solved, 877 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/877 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 877 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 621/621 places, 878/878 transitions.
Built C files in :
/tmp/ltsmin13474879244597455306
[2025-06-07 19:56:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13474879244597455306
Running compilation step : cd /tmp/ltsmin13474879244597455306;'/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 1328 ms.
Running link step : cd /tmp/ltsmin13474879244597455306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13474879244597455306;'/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/stateBased7597738668388404338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 19:56:15] [INFO ] Flatten gal took : 18 ms
[2025-06-07 19:56:15] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:56:15] [INFO ] Time to serialize gal into /tmp/LTL11743930443092568802.gal : 3 ms
[2025-06-07 19:56:15] [INFO ] Time to serialize properties into /tmp/LTL10579045429636282175.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/LTL11743930443092568802.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1477294707775465296.hoa' '-atoms' '/tmp/LTL10579045429636282175.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/LTL10579045429636282175.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1477294707775465296.hoa
Detected timeout of ITS tools.
[2025-06-07 19:56:31] [INFO ] Flatten gal took : 18 ms
[2025-06-07 19:56:31] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:56:31] [INFO ] Time to serialize gal into /tmp/LTL5192635377842147524.gal : 4 ms
[2025-06-07 19:56:31] [INFO ] Time to serialize properties into /tmp/LTL9053955061346804520.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/LTL5192635377842147524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9053955061346804520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(p112==1)")||(X(X(X("((p112==0)||((p112==1)&&(p204==1)))")))))))
Formula 0 simplified : F(!"(p112==1)" & XXX!"((p112==0)||((p112==1)&&(p204==1)))")
Detected timeout of ITS tools.
[2025-06-07 19:56:46] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:56:46] [INFO ] Applying decomposition
[2025-06-07 19:56:46] [INFO ] Flatten gal took : 32 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/graph4085600570816400327.txt' '-o' '/tmp/graph4085600570816400327.bin' '-w' '/tmp/graph4085600570816400327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4085600570816400327.bin' '-l' '-1' '-v' '-w' '/tmp/graph4085600570816400327.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:56:46] [INFO ] Decomposing Gal with order
[2025-06-07 19:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:56:46] [INFO ] Removed a total of 539 redundant transitions.
[2025-06-07 19:56:46] [INFO ] Flatten gal took : 42 ms
[2025-06-07 19:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 11 ms.
[2025-06-07 19:56:46] [INFO ] Time to serialize gal into /tmp/LTL2213536902150270285.gal : 7 ms
[2025-06-07 19:56:46] [INFO ] Time to serialize properties into /tmp/LTL14901293041514220723.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/LTL2213536902150270285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14901293041514220723.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i3.u29.p112==1)")||(X(X(X("((i3.u29.p112==0)||((i3.u29.p112==1)&&(i6.u50.p204==1)))")))))))
Formula 0 simplified : F(!"(i3.u29.p112==1)" & XXX!"((i3.u29.p112==0)||((i3.u29.p112==1)&&(i6.u50.p204==1)))")
Detected timeout of ITS tools.
Treatment of property Champagne-PT-H07T2O-LTLFireability-09 finished in 291087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((G(p1)||X(F(p2)))))))'
Support contains 3 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 634 transition count 891
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 634 transition count 891
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 626 transition count 883
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 626 transition count 883
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 623 transition count 880
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 623 transition count 880
Applied a total of 50 rules in 54 ms. Remains 623 /648 variables (removed 25) and now considering 880/905 (removed 25) transitions.
// Phase 1: matrix 880 rows 623 cols
[2025-06-07 19:57:01] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:57:01] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-07 19:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:57:02] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 879 sub problems to find dead transitions.
[2025-06-07 19:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 879/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 879 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 879 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 879 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 623/1503 variables, and 27 constraints, problems are : Problem set: 0 solved, 879 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 0/879 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 879 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 623/648 places, 880/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60702 ms. Remains : 623/648 places, 880/905 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-10
Stuttering criterion allowed to conclude after 756 steps with 3 reset in 2 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-10 finished in 61011 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)&&F(G((p0||X(!p0)))))))'
Support contains 1 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Graph (trivial) has 690 edges and 648 vertex of which 423 / 648 are part of one of the 27 SCC in 1 ms
Free SCC test removed 396 places
Ensure Unique test removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 251 transition count 386
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 125 rules applied. Total rules applied 204 place count 173 transition count 339
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 226 place count 151 transition count 339
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 248 place count 129 transition count 254
Iterating global reduction 3 with 22 rules applied. Total rules applied 270 place count 129 transition count 254
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 287 place count 129 transition count 237
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 383 place count 81 transition count 189
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 386 place count 78 transition count 176
Iterating global reduction 4 with 3 rules applied. Total rules applied 389 place count 78 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 392 place count 78 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 76 transition count 171
Applied a total of 394 rules in 26 ms. Remains 76 /648 variables (removed 572) and now considering 171/905 (removed 734) transitions.
[2025-06-07 19:58:02] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
// Phase 1: matrix 72 rows 76 cols
[2025-06-07 19:58:02] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:58:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 19:58:02] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
[2025-06-07 19:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:58:02] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:58:02] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 19:58:02] [INFO ] Flow matrix only has 72 transitions (discarded 99 similar events)
[2025-06-07 19:58:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 103 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 199 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2099 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4132ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/648 places, 171/905 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4282 ms. Remains : 76/648 places, 171/905 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), false, false]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-11
Stuttering criterion allowed to conclude after 114 steps with 2 reset in 3 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-11 finished in 4460 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 U G(p1))&&!(p2 U p3)&&X(F(!p2)))))'
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 633 transition count 890
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 633 transition count 890
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 627 transition count 884
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 627 transition count 884
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 625 transition count 882
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 625 transition count 882
Applied a total of 46 rules in 54 ms. Remains 625 /648 variables (removed 23) and now considering 882/905 (removed 23) transitions.
// Phase 1: matrix 882 rows 625 cols
[2025-06-07 19:58:07] [INFO ] Computed 27 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:58:07] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-07 19:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:58:07] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 881 sub problems to find dead transitions.
[2025-06-07 19:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 881 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1507 variables, and 27 constraints, problems are : Problem set: 0 solved, 881 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 881/881 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 881 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 881 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1507 variables, and 27 constraints, problems are : Problem set: 0 solved, 881 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 0/881 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 881 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 625/648 places, 882/905 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 625/648 places, 882/905 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR p2 p3 p1), (OR p2 p3 p1), true, p1, p1, p3, p2]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-14
Stuttering criterion allowed to conclude after 1148 steps with 2 reset in 5 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-14 finished in 61080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 905/905 transitions.
Graph (trivial) has 691 edges and 648 vertex of which 427 / 648 are part of one of the 27 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 445 transitions
Reduce isomorphic transitions removed 445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 247 transition count 383
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 123 rules applied. Total rules applied 200 place count 171 transition count 336
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 222 place count 149 transition count 336
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 243 place count 128 transition count 252
Iterating global reduction 3 with 21 rules applied. Total rules applied 264 place count 128 transition count 252
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 281 place count 128 transition count 235
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 375 place count 81 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 378 place count 78 transition count 175
Iterating global reduction 4 with 3 rules applied. Total rules applied 381 place count 78 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 384 place count 78 transition count 172
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 386 place count 76 transition count 170
Applied a total of 386 rules in 28 ms. Remains 76 /648 variables (removed 572) and now considering 170/905 (removed 735) transitions.
[2025-06-07 19:59:08] [INFO ] Flow matrix only has 71 transitions (discarded 99 similar events)
// Phase 1: matrix 71 rows 76 cols
[2025-06-07 19:59:08] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:59:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 19:59:08] [INFO ] Flow matrix only has 71 transitions (discarded 99 similar events)
[2025-06-07 19:59:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:59:08] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:59:08] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-07 19:59:08] [INFO ] Flow matrix only has 71 transitions (discarded 99 similar events)
[2025-06-07 19:59:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 70/146 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 103 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2096 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 70/146 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 204 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2203 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4308ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4308ms
Starting structural reductions in SI_LTL mode, iteration 1 : 76/648 places, 170/905 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4464 ms. Remains : 76/648 places, 170/905 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T2O-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T2O-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T2O-LTLFireability-15 finished in 4521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X((p1||G(p2)||(p2&&F(p3))))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
[2025-06-07 19:59:20] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13918455898992839033
[2025-06-07 19:59:21] [INFO ] Applying decomposition
[2025-06-07 19:59:21] [INFO ] Computing symmetric may disable matrix : 905 transitions.
[2025-06-07 19:59:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 19:59:21] [INFO ] Computing symmetric may enable matrix : 905 transitions.
[2025-06-07 19:59:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 19:59:21] [INFO ] Flatten gal took : 17 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/graph5995189607053995556.txt' '-o' '/tmp/graph5995189607053995556.bin' '-w' '/tmp/graph5995189607053995556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5995189607053995556.bin' '-l' '-1' '-v' '-w' '/tmp/graph5995189607053995556.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:59:21] [INFO ] Decomposing Gal with order
[2025-06-07 19:59:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:59:21] [INFO ] Removed a total of 524 redundant transitions.
[2025-06-07 19:59:21] [INFO ] Flatten gal took : 39 ms
[2025-06-07 19:59:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2025-06-07 19:59:21] [INFO ] Computing Do-Not-Accords matrix : 905 transitions.
[2025-06-07 19:59:21] [INFO ] Time to serialize gal into /tmp/LTLFireability3054796964738393382.gal : 5 ms
[2025-06-07 19:59:21] [INFO ] Time to serialize properties into /tmp/LTLFireability5200339724596781325.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/LTLFireability3054796964738393382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5200339724596781325.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 2 LTL properties
[2025-06-07 19:59:21] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 19:59:21] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13918455898992839033
Running compilation step : cd /tmp/ltsmin13918455898992839033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F(G(("((i25.u235.p947==0)||(i27.u249.p1007==0))")||(X(X(X((("(i22.u207.p835==0)")||(G("(i12.u111.p435!=1)")))||(("(i12.u111.p435!=1...194
Formula 0 simplified : GF(!"((i25.u235.p947==0)||(i27.u249.p1007==0))" & XXX(!"(i22.u207.p835==0)" & F!"(i12.u111.p435!=1)" & (!"(i12.u111.p435!=1)" | G!"(...176
Compilation finished in 2476 ms.
Running link step : cd /tmp/ltsmin13918455898992839033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13918455898992839033;'/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' '--ltl' '<>([]((X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))||((LTLAPp2==true)&&<>((LTLAPp3==true)))))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t14, t63, t112, t190, t293, t393, i0.t680, i1.t654, i2.t627, i2.u30.t629, i3.t602, i4.t576, i...522
Computing Next relation with stutter on 3.48678e+09 deadlock states
12 unique states visited
12 strongly connected components in search stack
13 transitions explored
12 items max in DFS search stack
2781 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,27.8775,494292,1,0,1.08166e+06,479,7931,1.89048e+06,240,1041,1949556
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H07T2O-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("(i2.u31.p112==1)")||(X(X(X("((i2.u31.p112==0)||((i2.u31.p112==1)&&(i5.u56.p204==1)))")))))))
Formula 1 simplified : F(!"(i2.u31.p112==1)" & XXX!"((i2.u31.p112==0)||((i2.u31.p112==1)&&(i5.u56.p204==1)))")
Computing Next relation with stutter on 3.48678e+09 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
82 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,28.7049,508628,1,0,1.12524e+06,479,7950,1.91934e+06,241,1129,2051625
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Champagne-PT-H07T2O-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1294753 ms.
BK_STOP 1749326429886
--------------------
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="Champagne-PT-H07T2O"
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 Champagne-PT-H07T2O, 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 r254-tall-174931339200092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H07T2O.tgz
mv Champagne-PT-H07T2O 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 '
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 ;