Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 6 08:57 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.8K Jun 6 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:34 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 52K 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-H04T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H04T1U-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749317854108

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-H04T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 17:37:35] [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 17:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:37:35] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-07 17:37:35] [INFO ] Transformed 285 places.
[2025-06-07 17:37:35] [INFO ] Transformed 351 transitions.
[2025-06-07 17:37:35] [INFO ] Found NUPN structural information;
[2025-06-07 17:37:35] [INFO ] Parsed PT model containing 285 places and 351 transitions and 820 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H04T1U-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 351/351 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 228 transition count 294
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 228 transition count 294
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 146 place count 196 transition count 262
Iterating global reduction 0 with 32 rules applied. Total rules applied 178 place count 196 transition count 262
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 192 place count 182 transition count 248
Iterating global reduction 0 with 14 rules applied. Total rules applied 206 place count 182 transition count 248
Applied a total of 206 rules in 52 ms. Remains 182 /285 variables (removed 103) and now considering 248/351 (removed 103) transitions.
// Phase 1: matrix 248 rows 182 cols
[2025-06-07 17:37:35] [INFO ] Computed 11 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:35] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-07 17:37:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:36] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-07 17:37:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:39] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/430 variables, 182/194 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/430 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 430/430 variables, and 194 constraints, problems are : Problem set: 0 solved, 247 unsolved in 13337 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/430 variables, 182/194 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 247/441 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:52] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:52] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:52] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:52] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:54] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:57] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:00] [INFO ] Deduced a trap along path composed of 16 places in 42 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 0/430 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 430/430 variables, and 448 constraints, problems are : Problem set: 0 solved, 247 unsolved in 29245 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42653ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 42671ms
Starting structural reductions in LTL mode, iteration 1 : 182/285 places, 248/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43138 ms. Remains : 182/285 places, 248/351 transitions.
Support contains 43 out of 182 places after structural reductions.
[2025-06-07 17:38:19] [INFO ] Flatten gal took : 48 ms
[2025-06-07 17:38:19] [INFO ] Flatten gal took : 42 ms
[2025-06-07 17:38:19] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 42 out of 182 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (213 resets) in 904 ms. (44 steps per ms) remains 1/38 properties
BEST_FIRST walk for 29372 steps (16 resets) in 115 ms. (253 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H04T1U-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Champagne-PT-H04T1U-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 17 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(G(p0)))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Graph (trivial) has 190 edges and 182 vertex of which 89 / 182 are part of one of the 11 SCC in 2 ms
Free SCC test removed 78 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 103 transition count 132
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 45 rules applied. Total rules applied 73 place count 76 transition count 114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 81 place count 68 transition count 114
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 91 place count 58 transition count 97
Iterating global reduction 3 with 10 rules applied. Total rules applied 101 place count 58 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 105 place count 58 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 57 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 57 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 57 transition count 88
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 148 place count 37 transition count 68
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 150 place count 35 transition count 61
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 35 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 154 place count 35 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 156 place count 33 transition count 57
Applied a total of 156 rules in 40 ms. Remains 33 /182 variables (removed 149) and now considering 57/248 (removed 191) transitions.
[2025-06-07 17:38:20] [INFO ] Flow matrix only has 32 transitions (discarded 25 similar events)
// Phase 1: matrix 32 rows 33 cols
[2025-06-07 17:38:20] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:20] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 17:38:20] [INFO ] Flow matrix only has 32 transitions (discarded 25 similar events)
[2025-06-07 17:38:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 17:38:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:20] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-07 17:38:20] [INFO ] Flow matrix only has 32 transitions (discarded 25 similar events)
[2025-06-07 17:38:20] [INFO ] Invariant cache hit.
[2025-06-07 17:38:20] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 31/64 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 32 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 31/64 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 32/78 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/65 variables, and 78 constraints, problems are : Problem set: 0 solved, 32 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 979ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 980ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/182 places, 57/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1120 ms. Remains : 33/182 places, 57/248 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-00
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-00 finished in 1326 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 U (p1||G(!p0))))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Graph (trivial) has 188 edges and 182 vertex of which 88 / 182 are part of one of the 11 SCC in 0 ms
Free SCC test removed 77 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 104 transition count 136
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 40 rules applied. Total rules applied 66 place count 79 transition count 121
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 73 place count 73 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 72 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 72 transition count 119
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 76 place count 71 transition count 119
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 88 place count 59 transition count 100
Iterating global reduction 4 with 12 rules applied. Total rules applied 100 place count 59 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 104 place count 59 transition count 96
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 105 place count 58 transition count 92
Iterating global reduction 5 with 1 rules applied. Total rules applied 106 place count 58 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 58 transition count 91
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 149 place count 37 transition count 70
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 151 place count 35 transition count 63
Iterating global reduction 6 with 2 rules applied. Total rules applied 153 place count 35 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 155 place count 35 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 156 place count 35 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 158 place count 33 transition count 58
Applied a total of 158 rules in 22 ms. Remains 33 /182 variables (removed 149) and now considering 58/248 (removed 190) transitions.
[2025-06-07 17:38:21] [INFO ] Flow matrix only has 33 transitions (discarded 25 similar events)
// Phase 1: matrix 33 rows 33 cols
[2025-06-07 17:38:21] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:21] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 17:38:21] [INFO ] Flow matrix only has 33 transitions (discarded 25 similar events)
[2025-06-07 17:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:21] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:21] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-07 17:38:21] [INFO ] Flow matrix only has 33 transitions (discarded 25 similar events)
[2025-06-07 17:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 27 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 71 constraints, problems are : Problem set: 0 solved, 27 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 776ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 776ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/182 places, 58/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 903 ms. Remains : 33/182 places, 58/248 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-01
Stuttering criterion allowed to conclude after 47 steps with 1 reset in 1 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-01 finished in 1004 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||G(p1)||F(p2))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 164 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 164 transition count 230
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 157 transition count 223
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 157 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 153 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 153 transition count 219
Applied a total of 58 rules in 13 ms. Remains 153 /182 variables (removed 29) and now considering 219/248 (removed 29) transitions.
// Phase 1: matrix 219 rows 153 cols
[2025-06-07 17:38:22] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 17:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:22] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-07 17:38:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/372 variables, 153/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 0/372 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 164 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/372 variables, 153/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 218/382 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:34] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:36] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:37] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:38] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 386 constraints, problems are : Problem set: 0 solved, 218 unsolved in 18358 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26990ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 26991ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 219/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27162 ms. Remains : 153/182 places, 219/248 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T1U-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T1U-LTLFireability-02 finished in 27670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Graph (trivial) has 191 edges and 182 vertex of which 94 / 182 are part of one of the 11 SCC in 0 ms
Free SCC test removed 83 places
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 98 transition count 128
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 40 rules applied. Total rules applied 66 place count 73 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 67 transition count 113
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 83 place count 56 transition count 95
Iterating global reduction 3 with 11 rules applied. Total rules applied 94 place count 56 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 98 place count 56 transition count 91
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 55 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 55 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 55 transition count 86
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 143 place count 34 transition count 65
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 145 place count 32 transition count 58
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 32 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 32 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 30 transition count 54
Applied a total of 151 rules in 20 ms. Remains 30 /182 variables (removed 152) and now considering 54/248 (removed 194) transitions.
[2025-06-07 17:38:50] [INFO ] Flow matrix only has 29 transitions (discarded 25 similar events)
// Phase 1: matrix 29 rows 30 cols
[2025-06-07 17:38:50] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 17:38:50] [INFO ] Flow matrix only has 29 transitions (discarded 25 similar events)
[2025-06-07 17:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:50] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:50] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-07 17:38:50] [INFO ] Flow matrix only has 29 transitions (discarded 25 similar events)
[2025-06-07 17:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/58 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/59 variables, and 41 constraints, problems are : Problem set: 0 solved, 24 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 28/58 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 24/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/59 variables, and 65 constraints, problems are : Problem set: 0 solved, 24 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 640ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/182 places, 54/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 30/182 places, 54/248 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-03 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||((G(F(p0))||(F(p0)&&F(p1)))&&X(F(p2))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 163 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 163 transition count 229
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 154 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 154 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 150 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 150 transition count 216
Applied a total of 64 rules in 16 ms. Remains 150 /182 variables (removed 32) and now considering 216/248 (removed 32) transitions.
// Phase 1: matrix 216 rows 150 cols
[2025-06-07 17:38:51] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:51] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-07 17:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-07 17:38:51] [INFO ] Invariant cache hit.
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8087 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 215/376 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:02] [INFO ] Deduced a trap along path composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 377 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12563 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20681ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20683ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 216/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20902 ms. Remains : 150/182 places, 216/248 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 99 ms.
Product exploration explored 100000 steps with 33333 reset in 162 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/150 stabilizing places and 10/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T1U-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T1U-LTLFireability-04 finished in 21525 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' '!((!p0 U (G(!p0)||(!p0&&F(p1)&&X(p2)&&F((p3&&F(p4)))))))'
Support contains 6 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 164 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 164 transition count 230
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 156 transition count 222
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 156 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 153 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 153 transition count 219
Applied a total of 58 rules in 13 ms. Remains 153 /182 variables (removed 29) and now considering 219/248 (removed 29) transitions.
// Phase 1: matrix 219 rows 153 cols
[2025-06-07 17:39:12] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 17:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:12] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-07 17:39: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/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/372 variables, 153/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 0/372 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 164 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8408 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/372 variables, 153/164 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 218/382 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:24] [INFO ] Deduced a trap along path composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/372 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 383 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13259 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21682ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 21682ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 219/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21861 ms. Remains : 153/182 places, 219/248 transitions.
Stuttering acceptance computed with spot in 384 ms :[p0, true, (AND (NOT p1) p0), (AND p0 (NOT p2)), (OR (AND p0 (NOT p3)) (AND p0 (NOT p4))), (AND (NOT p4) p0), (NOT p1), (OR (NOT p3) (NOT p4)), (NOT p4)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-06
Stuttering criterion allowed to conclude after 352 steps with 2 reset in 2 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-06 finished in 22272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(((!p0 U p1)||G(p2))))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 162 transition count 228
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 162 transition count 228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 154 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 154 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 150 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 150 transition count 216
Applied a total of 64 rules in 9 ms. Remains 150 /182 variables (removed 32) and now considering 216/248 (removed 32) transitions.
// Phase 1: matrix 216 rows 150 cols
[2025-06-07 17:39:34] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 17:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-07 17:39:34] [INFO ] Invariant cache hit.
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8123 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 215/376 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:46] [INFO ] Deduced a trap along path composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 377 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12765 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20904ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20905ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 216/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21069 ms. Remains : 150/182 places, 216/248 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-07
Entered a terminal (fully accepting) state of product in 333 steps with 7 reset in 2 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-07 finished in 21521 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(p1) U (p0&&X(p1))))) U X((p2&&G(p3))))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 163 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 163 transition count 229
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 154 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 154 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 150 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 150 transition count 216
Applied a total of 64 rules in 10 ms. Remains 150 /182 variables (removed 32) and now considering 216/248 (removed 32) transitions.
// Phase 1: matrix 216 rows 150 cols
[2025-06-07 17:39:56] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 17:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:56] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-07 17:39:56] [INFO ] Invariant cache hit.
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8445 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 215/376 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:08] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:10] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 378 constraints, problems are : Problem set: 0 solved, 215 unsolved in 14776 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23236ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 23238ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 216/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23409 ms. Remains : 150/182 places, 216/248 transitions.
Stuttering acceptance computed with spot in 440 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p1)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-08
Product exploration explored 100000 steps with 18231 reset in 148 ms.
Stack based approach found an accepted trace after 7706 steps with 1378 reset with depth 6 and stack size 6 in 11 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-08 finished in 24036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1 U X(G(p2))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 164 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 164 transition count 230
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 156 transition count 222
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 156 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 153 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 153 transition count 219
Applied a total of 58 rules in 6 ms. Remains 153 /182 variables (removed 29) and now considering 219/248 (removed 29) transitions.
// Phase 1: matrix 219 rows 153 cols
[2025-06-07 17:40:20] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-07 17:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:20] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-07 17:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:22] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/372 variables, 153/165 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 165 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9588 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/372 variables, 153/165 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 218/383 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:32] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:32] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:32] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:34] [INFO ] Deduced a trap along path composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 387 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15197 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24800ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 24801ms
Starting structural reductions in LTL mode, iteration 1 : 153/182 places, 219/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25013 ms. Remains : 153/182 places, 219/248 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-10 finished in 25333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))&&(p1||X((X(p2) U (p1&&X(p2))))))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 164 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 164 transition count 230
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 156 transition count 222
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 156 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 152 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 152 transition count 218
Applied a total of 60 rules in 4 ms. Remains 152 /182 variables (removed 30) and now considering 218/248 (removed 30) transitions.
// Phase 1: matrix 218 rows 152 cols
[2025-06-07 17:40:45] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 17:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:45] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 17:40:45] [INFO ] Invariant cache hit.
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, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 163 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
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, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 217/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:57] [INFO ] Deduced a trap along path composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:59] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:05] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/370 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/370 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 383 constraints, problems are : Problem set: 0 solved, 217 unsolved in 22289 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30649ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30650ms
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 218/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30798 ms. Remains : 152/182 places, 218/248 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p0), true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-11
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-11 finished in 31029 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 (p1||G(p0)))))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 164 transition count 230
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 164 transition count 230
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 156 transition count 222
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 156 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 152 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 152 transition count 218
Applied a total of 60 rules in 6 ms. Remains 152 /182 variables (removed 30) and now considering 218/248 (removed 30) transitions.
// Phase 1: matrix 218 rows 152 cols
[2025-06-07 17:41:16] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 17:41:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:16] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 17:41: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/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/370 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 163 constraints, problems are : Problem set: 0 solved, 217 unsolved in 8367 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
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, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/370 variables, 152/163 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 217/380 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:28] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:31] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 382 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14957 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23341ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 23344ms
Starting structural reductions in LTL mode, iteration 1 : 152/182 places, 218/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23497 ms. Remains : 152/182 places, 218/248 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 10 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T1U-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T1U-LTLFireability-12 finished in 23793 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' '!(((p0 U X(p1))&&X(F(p2))&&F(p3)))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 166 transition count 232
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 166 transition count 232
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 159 transition count 225
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 159 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 156 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 156 transition count 222
Applied a total of 52 rules in 11 ms. Remains 156 /182 variables (removed 26) and now considering 222/248 (removed 26) transitions.
// Phase 1: matrix 222 rows 156 cols
[2025-06-07 17:41:40] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 17:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:40] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-06-07 17:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/378 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 0/378 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 167 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8671 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/378 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 221/388 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:53] [INFO ] Deduced a trap along path composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 389 constraints, problems are : Problem set: 0 solved, 221 unsolved in 13777 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 22460ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 22461ms
Starting structural reductions in LTL mode, iteration 1 : 156/182 places, 222/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22621 ms. Remains : 156/182 places, 222/248 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p3), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-14 finished in 22834 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) U p1)))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 163 transition count 229
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 163 transition count 229
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 154 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 154 transition count 220
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 150 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 150 transition count 216
Applied a total of 64 rules in 7 ms. Remains 150 /182 variables (removed 32) and now considering 216/248 (removed 32) transitions.
// Phase 1: matrix 216 rows 150 cols
[2025-06-07 17:42:03] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 17:42:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:03] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-07 17:42:03] [INFO ] Invariant cache hit.
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 161 constraints, problems are : Problem set: 0 solved, 215 unsolved in 8120 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
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, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/366 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 215/376 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:15] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 377 constraints, problems are : Problem set: 0 solved, 215 unsolved in 12850 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20983ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 20984ms
Starting structural reductions in LTL mode, iteration 1 : 150/182 places, 216/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21153 ms. Remains : 150/182 places, 216/248 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLFireability-15
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLFireability-15 finished in 21300 ms.
All properties solved by simple procedures.
Total runtime 289285 ms.

BK_STOP 1749318144647

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

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

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