fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339100011
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Champagne-PT-H04T1U

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 252399.00 0.00 0.00 FTFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-01
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-02
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-03
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-04
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-05
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-06
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-07
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-08
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-09
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-10
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-11
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-12
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-13
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-14
FORMULA_NAME Champagne-PT-H04T1U-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749317779615

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202505121319
[2025-06-07 17:36:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:36:20] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-06-07 17:36:20] [INFO ] Transformed 285 places.
[2025-06-07 17:36:21] [INFO ] Transformed 351 transitions.
[2025-06-07 17:36:21] [INFO ] Found NUPN structural information;
[2025-06-07 17:36:21] [INFO ] Parsed PT model containing 285 places and 351 transitions and 820 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H04T1U-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T1U-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T1U-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H04T1U-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 351/351 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 229 transition count 295
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 229 transition count 295
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 144 place count 197 transition count 263
Iterating global reduction 0 with 32 rules applied. Total rules applied 176 place count 197 transition count 263
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 189 place count 184 transition count 250
Iterating global reduction 0 with 13 rules applied. Total rules applied 202 place count 184 transition count 250
Applied a total of 202 rules in 63 ms. Remains 184 /285 variables (removed 101) and now considering 250/351 (removed 101) transitions.
// Phase 1: matrix 250 rows 184 cols
[2025-06-07 17:36:21] [INFO ] Computed 11 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:21] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-06-07 17:36:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:21] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-07 17:36: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/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:24] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:24] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:24] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:24] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:25] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:25] [INFO ] Deduced a trap composed of 35 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:36:25] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:25] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/434 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 203 constraints, problems are : Problem set: 0 solved, 249 unsolved in 13889 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/434 variables, 184/203 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 249/452 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:40] [INFO ] Deduced a trap along path composed of 16 places in 41 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:43] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:45] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:45] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/456 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:47] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:47] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 11 (OVERLAPS) 0/434 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 458 constraints, problems are : Problem set: 0 solved, 249 unsolved in 27244 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41208ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 41227ms
Starting structural reductions in LTL mode, iteration 1 : 184/285 places, 250/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41737 ms. Remains : 184/285 places, 250/351 transitions.
Support contains 35 out of 184 places after structural reductions.
[2025-06-07 17:37:03] [INFO ] Flatten gal took : 37 ms
[2025-06-07 17:37:03] [INFO ] Flatten gal took : 17 ms
[2025-06-07 17:37:03] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 33 out of 184 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 21 to 19
RANDOM walk for 11355 steps (65 resets) in 439 ms. (25 steps per ms) remains 0/19 properties
FORMULA Champagne-PT-H04T1U-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Champagne-PT-H04T1U-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 20 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' '!(G(F(((X(X(X(X(p0))))&&F(!p1))||G(p0)))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Graph (trivial) has 187 edges and 184 vertex of which 83 / 184 are part of one of the 10 SCC in 2 ms
Free SCC test removed 73 places
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 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 110 transition count 141
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 41 rules applied. Total rules applied 67 place count 85 transition count 125
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 75 place count 77 transition count 125
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 86 place count 66 transition count 107
Iterating global reduction 3 with 11 rules applied. Total rules applied 97 place count 66 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 101 place count 66 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 101 place count 66 transition count 102
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 65 transition count 102
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 147 place count 43 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 41 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 153 place count 41 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 155 place count 40 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 40 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 38 transition count 68
Applied a total of 159 rules in 41 ms. Remains 38 /184 variables (removed 146) and now considering 68/250 (removed 182) transitions.
[2025-06-07 17:37:03] [INFO ] Flow matrix only has 45 transitions (discarded 23 similar events)
// Phase 1: matrix 45 rows 38 cols
[2025-06-07 17:37:03] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-07 17:37:03] [INFO ] Flow matrix only has 45 transitions (discarded 23 similar events)
[2025-06-07 17:37:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-07 17:37:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:37:03] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2025-06-07 17:37:03] [INFO ] Flow matrix only has 45 transitions (discarded 23 similar events)
[2025-06-07 17:37:03] [INFO ] Invariant cache hit.
[2025-06-07 17:37:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 44/82 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/83 variables, and 50 constraints, problems are : Problem set: 0 solved, 37 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 2/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 44/82 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 37/87 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/83 variables, and 87 constraints, problems are : Problem set: 0 solved, 37 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/184 places, 68/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1200 ms. Remains : 38/184 places, 68/250 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-00
Stuttering criterion allowed to conclude after 46 steps with 1 reset in 3 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-00 finished in 1491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||G(p1))) U X(p2)))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 167 transition count 233
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 167 transition count 233
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 161 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 161 transition count 227
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 157 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 157 transition count 223
Applied a total of 54 rules in 14 ms. Remains 157 /184 variables (removed 27) and now considering 223/250 (removed 27) transitions.
// Phase 1: matrix 223 rows 157 cols
[2025-06-07 17:37:05] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-07 17:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-07 17:37:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:06] [INFO ] Deduced a trap composed of 30 places in 38 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:07] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:07] [INFO ] Deduced a trap composed of 30 places in 38 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:07] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:07] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/380 variables, 157/173 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 173 constraints, problems are : Problem set: 0 solved, 222 unsolved in 10083 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/380 variables, 157/173 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 222/395 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:18] [INFO ] Deduced a trap along path composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:20] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:20] [INFO ] Deduced a trap composed of 42 places in 33 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:21] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:22] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:29] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:29] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/380 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 402 constraints, problems are : Problem set: 0 solved, 222 unsolved in 27008 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37118ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 37120ms
Starting structural reductions in LTL mode, iteration 1 : 157/184 places, 223/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37285 ms. Remains : 157/184 places, 223/250 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 148 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 p0 p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X p2)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 16 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H04T1U-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H04T1U-LTLCardinality-01 finished in 37959 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))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 229
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 229
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 156 transition count 222
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 156 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 152 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 152 transition count 218
Applied a total of 64 rules in 9 ms. Remains 152 /184 variables (removed 32) and now considering 218/250 (removed 32) transitions.
// Phase 1: matrix 218 rows 152 cols
[2025-06-07 17:37:43] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 17:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:43] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 17:37:43] [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 8285 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:37:54] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 3 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:37:55] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 4 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:38:01] [INFO ] Deduced a trap along path composed of 12 places in 45 ms of which 1 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:11] [INFO ] Deduced a trap along path composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/370 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 384 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30025 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: 2/2 constraints]
After SMT, in 38329ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 38330ms
Starting structural reductions in LTL mode, iteration 1 : 152/184 places, 218/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38500 ms. Remains : 152/184 places, 218/250 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-02 finished in 38613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Graph (trivial) has 191 edges and 184 vertex of which 86 / 184 are part of one of the 11 SCC in 1 ms
Free SCC test removed 75 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 108 transition count 138
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 43 rules applied. Total rules applied 70 place count 82 transition count 121
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 79 place count 74 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 73 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 80 place count 73 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 82 place count 72 transition count 119
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 94 place count 60 transition count 100
Iterating global reduction 4 with 12 rules applied. Total rules applied 106 place count 60 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 110 place count 60 transition count 96
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 152 place count 39 transition count 75
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 37 transition count 68
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 37 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 158 place count 37 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 36 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 164 place count 36 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 34 transition count 63
Applied a total of 166 rules in 100 ms. Remains 34 /184 variables (removed 150) and now considering 63/250 (removed 187) transitions.
[2025-06-07 17:38:21] [INFO ] Flow matrix only has 35 transitions (discarded 28 similar events)
// Phase 1: matrix 35 rows 34 cols
[2025-06-07 17:38:21] [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:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 17:38:21] [INFO ] Flow matrix only has 35 transitions (discarded 28 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 36 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:21] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-07 17:38:21] [INFO ] Flow matrix only has 35 transitions (discarded 28 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/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/68 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/69 variables, and 45 constraints, problems are : Problem set: 0 solved, 32 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 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/32 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 34/68 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/69 variables, and 77 constraints, problems are : Problem set: 0 solved, 32 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 875ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/184 places, 63/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1065 ms. Remains : 34/184 places, 63/250 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-04
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-04 finished in 1116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 162 transition count 228
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 162 transition count 228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 154 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 154 transition count 220
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 149 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 149 transition count 215
Applied a total of 70 rules in 16 ms. Remains 149 /184 variables (removed 35) and now considering 215/250 (removed 35) transitions.
// Phase 1: matrix 215 rows 149 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 52 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 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 214 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/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/364 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 160 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8148 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/364 variables, 149/160 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 214/374 constraints. Problems are: Problem set: 0 solved, 214 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 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 214 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 51 places in 62 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 214 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 40 places in 58 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 377 constraints, problems are : Problem set: 0 solved, 214 unsolved in 17465 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25630ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 25631ms
Starting structural reductions in LTL mode, iteration 1 : 149/184 places, 215/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25784 ms. Remains : 149/184 places, 215/250 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-05
Stuttering criterion allowed to conclude after 219 steps with 1 reset in 3 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-05 finished in 25863 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(p1))||p0)))'
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 163 transition count 229
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 163 transition count 229
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 156 transition count 222
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 156 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 151 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 151 transition count 217
Applied a total of 66 rules in 9 ms. Remains 151 /184 variables (removed 33) and now considering 217/250 (removed 33) transitions.
// Phase 1: matrix 217 rows 151 cols
[2025-06-07 17:38:48] [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:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 17:38:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-07 17:38:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/368 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 0/368 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 162 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8257 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/368 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 216/378 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:00] [INFO ] Deduced a trap along path composed of 14 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:02] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:02] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:07] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:08] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/368 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:12] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:12] [INFO ] Deduced a trap along path composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/368 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 385 constraints, problems are : Problem set: 0 solved, 216 unsolved in 28778 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 37048ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 37049ms
Starting structural reductions in LTL mode, iteration 1 : 151/184 places, 217/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37184 ms. Remains : 151/184 places, 217/250 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 876 steps with 5 reset in 5 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-06 finished in 37335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)&&X((X(p2)&&p1)))))))'
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 164 transition count 230
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 164 transition count 230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 158 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 158 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 155 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 155 transition count 221
Applied a total of 58 rules in 9 ms. Remains 155 /184 variables (removed 29) and now considering 221/250 (removed 29) transitions.
// Phase 1: matrix 221 rows 155 cols
[2025-06-07 17:39:25] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 17:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:26] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 17:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/376 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 166 constraints, problems are : Problem set: 0 solved, 220 unsolved in 8540 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/376 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 220/386 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:38] [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/376 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:43] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/376 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:49] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/376 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:51] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/376 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 390 constraints, problems are : Problem set: 0 solved, 220 unsolved in 29525 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 38078ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 38078ms
Starting structural reductions in LTL mode, iteration 1 : 155/184 places, 221/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38228 ms. Remains : 155/184 places, 221/250 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-07
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-07 finished in 38631 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(G(p0))&&F(p1))))'
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Graph (trivial) has 188 edges and 184 vertex of which 87 / 184 are part of one of the 10 SCC in 2 ms
Free SCC test removed 77 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 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 106 transition count 135
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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 41 rules applied. Total rules applied 67 place count 81 transition count 119
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 74 place count 74 transition count 119
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 74 transition count 116
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 71 transition count 116
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 90 place count 61 transition count 99
Iterating global reduction 3 with 10 rules applied. Total rules applied 100 place count 61 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 104 place count 61 transition count 95
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 4 with 42 rules applied. Total rules applied 146 place count 40 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 148 place count 38 transition count 67
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 38 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 38 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 37 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 37 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 35 transition count 63
Applied a total of 159 rules in 23 ms. Remains 35 /184 variables (removed 149) and now considering 63/250 (removed 187) transitions.
[2025-06-07 17:40:04] [INFO ] Flow matrix only has 40 transitions (discarded 23 similar events)
// Phase 1: matrix 40 rows 35 cols
[2025-06-07 17:40:04] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-07 17:40:04] [INFO ] Flow matrix only has 40 transitions (discarded 23 similar events)
[2025-06-07 17:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-07 17:40:04] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:40:04] [INFO ] Redundant transitions in 2 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-07 17:40:04] [INFO ] Flow matrix only has 40 transitions (discarded 23 similar events)
[2025-06-07 17:40:04] [INFO ] Invariant cache hit.
[2025-06-07 17:40:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 39/74 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/75 variables, and 47 constraints, problems are : Problem set: 0 solved, 36 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 39/74 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/75 variables, and 83 constraints, problems are : Problem set: 0 solved, 36 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 35/35 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 967ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/184 places, 63/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1073 ms. Remains : 35/184 places, 63/250 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-08 finished in 1209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Graph (trivial) has 193 edges and 184 vertex of which 94 / 184 are part of one of the 11 SCC in 1 ms
Free SCC test removed 83 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 100 transition count 130
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 39 rules applied. Total rules applied 64 place count 76 transition count 115
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 71 place count 69 transition count 115
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 84 place count 56 transition count 95
Iterating global reduction 3 with 13 rules applied. Total rules applied 97 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 101 place count 56 transition count 91
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 4 with 40 rules applied. Total rules applied 141 place count 36 transition count 71
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 33 transition count 60
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 33 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 150 place count 33 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 31 transition count 55
Applied a total of 152 rules in 19 ms. Remains 31 /184 variables (removed 153) and now considering 55/250 (removed 195) transitions.
[2025-06-07 17:40:05] [INFO ] Flow matrix only has 33 transitions (discarded 22 similar events)
// Phase 1: matrix 33 rows 31 cols
[2025-06-07 17:40:05] [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:05] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-07 17:40:05] [INFO ] Flow matrix only has 33 transitions (discarded 22 similar events)
[2025-06-07 17:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:05] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:40:05] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-07 17:40:05] [INFO ] Flow matrix only has 33 transitions (discarded 22 similar events)
[2025-06-07 17:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/63 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 42 constraints, problems are : Problem set: 0 solved, 26 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/63 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 68 constraints, problems are : Problem set: 0 solved, 26 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 660ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 660ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/184 places, 55/250 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 745 ms. Remains : 31/184 places, 55/250 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-11 finished in 802 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((X(X(X((p1&&F(p2)))))||p0))))'
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 250/250 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 166 transition count 232
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 166 transition count 232
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 160 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 160 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 157 transition count 223
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 157 transition count 223
Applied a total of 54 rules in 8 ms. Remains 157 /184 variables (removed 27) and now considering 223/250 (removed 27) transitions.
// Phase 1: matrix 223 rows 157 cols
[2025-06-07 17:40:06] [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:06] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 17:40:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:40:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-07 17:40:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/380 variables, 157/168 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 0/380 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 168 constraints, problems are : Problem set: 0 solved, 222 unsolved in 8884 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/380 variables, 157/168 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 222/390 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:19] [INFO ] Deduced a trap along path composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:21] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:21] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/380 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 393 constraints, problems are : Problem set: 0 solved, 222 unsolved in 15994 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24892ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 24892ms
Starting structural reductions in LTL mode, iteration 1 : 157/184 places, 223/250 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25055 ms. Remains : 157/184 places, 223/250 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H04T1U-LTLCardinality-13
Stuttering criterion allowed to conclude after 28708 steps with 168 reset in 47 ms.
FORMULA Champagne-PT-H04T1U-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H04T1U-LTLCardinality-13 finished in 25399 ms.
All properties solved by simple procedures.
Total runtime 251161 ms.

BK_STOP 1749318032014

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-174931339100011"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;