Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.7K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:37 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 83K 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-H06T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H06T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749319837943

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H06T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 18:10:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 18:10:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:10:39] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-06-07 18:10:39] [INFO ] Transformed 399 places.
[2025-06-07 18:10:39] [INFO ] Transformed 528 transitions.
[2025-06-07 18:10:39] [INFO ] Found NUPN structural information;
[2025-06-07 18:10:39] [INFO ] Parsed PT model containing 399 places and 528 transitions and 1345 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H06T0R-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T0R-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T0R-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 93 place count 306 transition count 435
Iterating global reduction 0 with 93 rules applied. Total rules applied 186 place count 306 transition count 435
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 235 place count 257 transition count 386
Iterating global reduction 0 with 49 rules applied. Total rules applied 284 place count 257 transition count 386
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 314 place count 227 transition count 331
Iterating global reduction 0 with 30 rules applied. Total rules applied 344 place count 227 transition count 331
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 356 place count 227 transition count 319
Applied a total of 356 rules in 80 ms. Remains 227 /399 variables (removed 172) and now considering 319/528 (removed 209) transitions.
// Phase 1: matrix 319 rows 227 cols
[2025-06-07 18:10:39] [INFO ] Computed 20 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:39] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-07 18:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:40] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2025-06-07 18:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 319/546 variables, 227/247 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 0/546 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 247 constraints, problems are : Problem set: 0 solved, 318 unsolved in 18011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 319/546 variables, 227/247 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 318/565 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:04] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:07] [INFO ] Deduced a trap along path composed of 10 places in 46 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:08] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:09] [INFO ] Deduced a trap along path composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 3/569 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:11] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:12] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:12] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:12] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:12] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:13] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 6/575 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:15] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:19] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:20] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:21] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:25] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 580 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 48138ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 48150ms
Starting structural reductions in LTL mode, iteration 1 : 227/399 places, 319/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48690 ms. Remains : 227/399 places, 319/528 transitions.
Support contains 36 out of 227 places after structural reductions.
[2025-06-07 18:11:28] [INFO ] Flatten gal took : 41 ms
[2025-06-07 18:11:28] [INFO ] Flatten gal took : 21 ms
[2025-06-07 18:11:28] [INFO ] Input system was already deterministic with 319 transitions.
Support contains 35 out of 227 places (down from 36) after GAL structural reductions.
RANDOM walk for 36084 steps (170 resets) in 801 ms. (44 steps per ms) remains 0/33 properties
FORMULA Champagne-PT-H06T0R-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 30 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Graph (trivial) has 215 edges and 227 vertex of which 38 / 227 are part of one of the 7 SCC in 3 ms
Free SCC test removed 31 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 195 transition count 247
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 72 rules applied. Total rules applied 109 place count 159 transition count 211
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 127 place count 141 transition count 211
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 127 place count 141 transition count 202
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 145 place count 132 transition count 202
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 158 place count 119 transition count 180
Iterating global reduction 3 with 13 rules applied. Total rules applied 171 place count 119 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 174 place count 119 transition count 177
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 174 place count 119 transition count 174
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 180 place count 116 transition count 174
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 182 place count 114 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 114 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 186 place count 114 transition count 164
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 294 place count 60 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 58 transition count 108
Applied a total of 296 rules in 48 ms. Remains 58 /227 variables (removed 169) and now considering 108/319 (removed 211) transitions.
[2025-06-07 18:11:29] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
// Phase 1: matrix 56 rows 58 cols
[2025-06-07 18:11:29] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:11:29] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 18:11:29] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
[2025-06-07 18:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:11:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:11:29] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-07 18:11:29] [INFO ] Flow matrix only has 56 transitions (discarded 52 similar events)
[2025-06-07 18:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 78 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 65/143 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 143 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2352ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/227 places, 108/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2507 ms. Remains : 58/227 places, 108/319 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-01 finished in 2742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U p1)||F(!F(G(p2)))) U (X(p2) U p3)))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 211 transition count 294
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 211 transition count 294
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 211 transition count 290
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 203 transition count 276
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 203 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 203 transition count 273
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 200 transition count 267
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 200 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 200 transition count 266
Applied a total of 62 rules in 14 ms. Remains 200 /227 variables (removed 27) and now considering 266/319 (removed 53) transitions.
// Phase 1: matrix 266 rows 200 cols
[2025-06-07 18:11:31] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:11:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 18:11:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:11:32] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-07 18:11:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/466 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 0/466 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 220 constraints, problems are : Problem set: 0 solved, 265 unsolved in 12605 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/466 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 265/485 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:49] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:52] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:52] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:52] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:53] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:53] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:53] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 6/492 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:55] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:06] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/466 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 494 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42649ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 42650ms
Starting structural reductions in LTL mode, iteration 1 : 200/227 places, 266/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42836 ms. Remains : 200/227 places, 266/319 transitions.
Stuttering acceptance computed with spot in 557 ms :[(NOT p3), (AND p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) (NOT p1) p0 p2), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3)), p2, p2, (AND p2 (NOT p0)), (AND p2 (NOT p1) p0), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-02
Product exploration explored 100000 steps with 952 reset in 300 ms.
Product exploration explored 100000 steps with 956 reset in 214 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/200 stabilizing places and 23/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) p2 p1 (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 37 factoid took 311 ms. Reduced automaton from 12 states, 30 edges and 4 AP (stutter sensitive) to 12 states, 34 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 545 ms :[(NOT p3), (AND p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p3) p0 (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3)), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (204 resets) in 689 ms. (57 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40002 steps (18 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
[2025-06-07 18:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf9 is UNSAT
Problem apf17 is UNSAT
After SMT solving in domain Real declared 53/466 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p3) p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p3) p2 p1) (AND (NOT p3) p2 p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p3) p2 p1 (NOT p0))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p1) (NOT p2) p3)), (G (OR p0 (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1) p2) (OR (NOT p0) p2 (NOT p3))))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p1) (NOT p2) p3)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2) (OR p2 (NOT p3))))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F p0), (F p2), (F (NOT (AND (OR p0 (NOT p1) p2) (OR p0 p2 (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p3), (F p1)]
Knowledge based reduction with 39 factoid took 1723 ms. Reduced automaton from 12 states, 34 edges and 4 AP (stutter insensitive) to 10 states, 30 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 501 ms :[(NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p3) p2), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 454 ms :[(NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p3) p2), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
[2025-06-07 18:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:12:19] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2025-06-07 18:12:19] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-07 18:12:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:12:20] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2025-06-07 18:12:20] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-07 18:12:20] [INFO ] Computed and/alt/rep : 264/533/264 causal constraints (skipped 1 transitions) in 14 ms.
[2025-06-07 18:12:21] [INFO ] Added : 262 causal constraints over 53 iterations in 1028 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 266/266 transitions.
Graph (trivial) has 181 edges and 200 vertex of which 34 / 200 are part of one of the 7 SCC in 0 ms
Free SCC test removed 27 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 172 transition count 217
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 55 rules applied. Total rules applied 75 place count 153 transition count 181
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 93 place count 135 transition count 181
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 93 place count 135 transition count 168
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 119 place count 122 transition count 168
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 235 place count 64 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 62 transition count 108
Applied a total of 237 rules in 30 ms. Remains 62 /200 variables (removed 138) and now considering 108/266 (removed 158) transitions.
[2025-06-07 18:12:21] [INFO ] Flow matrix only has 64 transitions (discarded 44 similar events)
// Phase 1: matrix 64 rows 62 cols
[2025-06-07 18:12:21] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:12:21] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 18:12:21] [INFO ] Flow matrix only has 64 transitions (discarded 44 similar events)
[2025-06-07 18:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:12:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:12:21] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2025-06-07 18:12:21] [INFO ] Flow matrix only has 64 transitions (discarded 44 similar events)
[2025-06-07 18:12: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/58 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 63/125 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 82 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 4/62 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 63/125 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 72/154 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:23] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 155 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1888 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3220ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/200 places, 108/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3349 ms. Remains : 62/200 places, 108/266 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/62 stabilizing places and 4/108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p0 (NOT p2) p3)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p2) (NOT p3)) (AND p0 p1 p2 (NOT p3))))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p0 (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2) (NOT p3)) (AND p0 p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3))))), (X (NOT p3)), (X p3), (X (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3)))), (X p1), (X (NOT p1)), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3)))))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))))), (X (X (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 38 factoid took 1495 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter insensitive) to 10 states, 30 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 438 ms :[(NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p3) p2), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (1029 resets) in 409 ms. (97 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40002 steps (69 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (67 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2025-06-07 18:12:26] [INFO ] Flow matrix only has 64 transitions (discarded 44 similar events)
[2025-06-07 18:12:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf10 is UNSAT
Problem apf19 is UNSAT
After SMT solving in domain Real declared 18/126 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, State Equation: 0/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p0 (NOT p2) p3)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p2) (NOT p3)) (AND p0 p1 p2 (NOT p3))))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p0 p1 (NOT p2)) (AND p0 (NOT p2) p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2) (NOT p3)) (AND p0 p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1) (NOT p2) p3)), (G (OR (NOT p0) (NOT p1) (NOT p2) p3))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3))))), (X (NOT p3)), (X p3), (X (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3)))), (X p1), (X (NOT p1)), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3)))))), (X (X (NOT p3))), (X (X p3)), (X (X (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2)) (AND p1 (NOT p2)) (AND (NOT p2) p3))))), (X (X (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F (NOT (AND (OR (NOT p0) (NOT p2) p3) (OR p1 (NOT p2) p3)))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) p1 p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1), (F p0), (F (NOT (AND (OR p0 (NOT p1) p2) (OR p0 p2 (NOT p3))))), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (AND (OR (NOT p0) (NOT p1) p2) (OR (NOT p0) p2 (NOT p3))))), (F (NOT (AND (OR (NOT p0) p1 p2 p3) (OR (NOT p0) (NOT p1) (NOT p2) p3)))), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND (OR (NOT p0) (NOT p1) p3) (OR (NOT p0) p2) (OR (NOT p1) p2) (OR p2 (NOT p3))))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 p1 (NOT p2) p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p0 (NOT p2)))), (F p3)]
Knowledge based reduction with 40 factoid took 3289 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter insensitive) to 10 states, 30 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 467 ms :[(NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p3) p2), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 484 ms :[(NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p3) p2), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
[2025-06-07 18:12:30] [INFO ] Flow matrix only has 64 transitions (discarded 44 similar events)
[2025-06-07 18:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:12:30] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2025-06-07 18:12:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-07 18:12:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 18:12:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2025-06-07 18:12:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-07 18:12:31] [INFO ] Computed and/alt/rep : 70/114/32 causal constraints (skipped 1 transitions) in 3 ms.
[2025-06-07 18:12:31] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 428 ms :[(NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3))), (AND (NOT p3) p2), p2, p2, (AND p2 (NOT p0)), (AND p2 p0 (NOT p1)), (AND p2 (NOT p0)), (AND (NOT p1) p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-02 finished in 59555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(X(!p1)) U ((X(X(!p1))&&(p2 U (p3||G(p2))))||X(X(G(!p1)))))))'
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 212 transition count 298
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 212 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 212 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 203 transition count 281
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 203 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 203 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 198 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 198 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 198 transition count 269
Applied a total of 64 rules in 18 ms. Remains 198 /227 variables (removed 29) and now considering 269/319 (removed 50) transitions.
// Phase 1: matrix 269 rows 198 cols
[2025-06-07 18:12:31] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:12:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 18:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:12:31] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-07 18:12:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/467 variables, 198/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 0/467 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 218 constraints, problems are : Problem set: 0 solved, 268 unsolved in 12831 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/467 variables, 198/218 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 268/486 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:49] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 487 constraints, problems are : Problem set: 0 solved, 268 unsolved in 19974 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32825ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 32826ms
Starting structural reductions in LTL mode, iteration 1 : 198/227 places, 269/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33018 ms. Remains : 198/227 places, 269/319 transitions.
Stuttering acceptance computed with spot in 1210 ms :[p1, p1, p1, (AND p1 (NOT p2) (NOT p3)), p1, (AND p1 (NOT p0)), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p3) (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p3)), p1, p1, (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p0)), p1, (AND (NOT p0) p1), p1, (AND p1 (NOT p3) (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3) (NOT p2)), (AND p1 (NOT p3) (NOT p2) (NOT p0)), true, (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 125 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p3 p2 (NOT p0) (NOT p1)), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (OR p3 p2)), (X (NOT (AND (NOT p3) p2 p0))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND p2 p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 28 factoid took 21 ms. Reduced automaton from 25 states, 111 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H06T0R-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H06T0R-LTLFireability-03 finished in 34537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G(!p1))) U (p1||X((p2||G(p0))))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 212 transition count 298
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 212 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 212 transition count 295
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 204 transition count 281
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 204 transition count 281
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 204 transition count 278
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 200 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 200 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 200 transition count 270
Applied a total of 61 rules in 12 ms. Remains 200 /227 variables (removed 27) and now considering 270/319 (removed 49) transitions.
// Phase 1: matrix 270 rows 200 cols
[2025-06-07 18:13:06] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 18:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:06] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-07 18:13: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/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/470 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 0/470 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 220 constraints, problems are : Problem set: 0 solved, 269 unsolved in 13079 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/470 variables, 200/220 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 269/489 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:24] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:28] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:30] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:30] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:30] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 3/494 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:33] [INFO ] Deduced a trap composed of 30 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 18:13:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:33] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:38] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 498 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 43115ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 43115ms
Starting structural reductions in LTL mode, iteration 1 : 200/227 places, 270/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43290 ms. Remains : 200/227 places, 270/319 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), p1, (AND (NOT p0) p1)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-05 finished in 43510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(((G(p1) U p2)||(p0 U p3)))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 210 transition count 293
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 210 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 210 transition count 289
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 201 transition count 276
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 201 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 201 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 196 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 196 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 196 transition count 265
Applied a total of 69 rules in 15 ms. Remains 196 /227 variables (removed 31) and now considering 265/319 (removed 54) transitions.
// Phase 1: matrix 265 rows 196 cols
[2025-06-07 18:13:49] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:49] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 18:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-07 18:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/461 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 0/461 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 216 constraints, problems are : Problem set: 0 solved, 264 unsolved in 12487 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/461 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 264/480 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:07] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:10] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:10] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:10] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 3/484 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:12] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:14] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:14] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:15] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:15] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:17] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:26] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:27] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/461 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 492 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42521ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 42522ms
Starting structural reductions in LTL mode, iteration 1 : 196/227 places, 265/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42709 ms. Remains : 196/227 places, 265/319 transitions.
Stuttering acceptance computed with spot in 1321 ms :[(AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) p0), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2) p0 (NOT p3)), (AND p1 (NOT p2) (NOT p3) p0)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-06 finished in 44067 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 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Graph (trivial) has 215 edges and 227 vertex of which 38 / 227 are part of one of the 7 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 195 transition count 247
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 70 rules applied. Total rules applied 107 place count 159 transition count 213
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 125 place count 142 transition count 212
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 141 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 140 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 129 place count 140 transition count 201
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 147 place count 131 transition count 201
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 160 place count 118 transition count 179
Iterating global reduction 5 with 13 rules applied. Total rules applied 173 place count 118 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 176 place count 118 transition count 176
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 176 place count 118 transition count 172
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 184 place count 114 transition count 172
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 112 transition count 164
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 112 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 190 place count 112 transition count 162
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 296 place count 59 transition count 109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 297 place count 58 transition count 105
Iterating global reduction 7 with 1 rules applied. Total rules applied 298 place count 58 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 299 place count 58 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 301 place count 56 transition count 102
Applied a total of 301 rules in 39 ms. Remains 56 /227 variables (removed 171) and now considering 102/319 (removed 217) transitions.
[2025-06-07 18:14:33] [INFO ] Flow matrix only has 55 transitions (discarded 47 similar events)
// Phase 1: matrix 55 rows 56 cols
[2025-06-07 18:14:33] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:14:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 18:14:33] [INFO ] Flow matrix only has 55 transitions (discarded 47 similar events)
[2025-06-07 18:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:14:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:14:33] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-07 18:14:33] [INFO ] Flow matrix only has 55 transitions (discarded 47 similar events)
[2025-06-07 18:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 54/110 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 76 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 54/110 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 136 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2095ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2096ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/227 places, 102/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2235 ms. Remains : 56/227 places, 102/319 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-07 finished in 2292 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((X((p0 U X(X(p1))))&&(F(p2) U !p0)))))'
Support contains 4 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 211 transition count 297
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 211 transition count 297
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 211 transition count 294
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 201 transition count 278
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 201 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 201 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 196 transition count 267
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 196 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 196 transition count 266
Applied a total of 69 rules in 12 ms. Remains 196 /227 variables (removed 31) and now considering 266/319 (removed 53) transitions.
// Phase 1: matrix 266 rows 196 cols
[2025-06-07 18:14:35] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:14:35] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-07 18:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:14:36] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-07 18:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/462 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 0/462 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 216 constraints, problems are : Problem set: 0 solved, 265 unsolved in 12346 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/462 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 265/481 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:53] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:56] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:59] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:59] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:02] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:02] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:02] [INFO ] Deduced a trap composed of 44 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 18:15:02] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:12] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:12] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/462 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:14] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 492 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42384ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 42384ms
Starting structural reductions in LTL mode, iteration 1 : 196/227 places, 266/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42585 ms. Remains : 196/227 places, 266/319 transitions.
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), p0, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-09
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-09 finished in 43060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1))&&(p2||F(p3)))))'
Support contains 5 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 210 transition count 293
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 210 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 210 transition count 289
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 202 transition count 277
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 202 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 202 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 197 transition count 267
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 197 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 197 transition count 266
Applied a total of 67 rules in 11 ms. Remains 197 /227 variables (removed 30) and now considering 266/319 (removed 53) transitions.
// Phase 1: matrix 266 rows 197 cols
[2025-06-07 18:15:18] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:15:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 18:15:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:15:19] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-07 18:15:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/463 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 0/463 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 217 constraints, problems are : Problem set: 0 solved, 265 unsolved in 12798 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 266/463 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 265/482 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:37] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:39] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:39] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:40] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:42] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:42] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:45] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:48] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:49] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:49] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:49] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:56] [INFO ] Deduced a trap along path composed of 9 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:56] [INFO ] Deduced a trap along path composed of 8 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 18:15:56] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:56] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:56] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:56] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:15:56] [INFO ] Deduced a trap along path composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 500 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 42834ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 42834ms
Starting structural reductions in LTL mode, iteration 1 : 197/227 places, 266/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43035 ms. Remains : 197/227 places, 266/319 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p3)), true, (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-10 finished in 43267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 210 transition count 293
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 210 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 210 transition count 289
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 48 place count 200 transition count 273
Iterating global reduction 1 with 10 rules applied. Total rules applied 58 place count 200 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 200 transition count 270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 196 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 196 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 196 transition count 262
Applied a total of 70 rules in 10 ms. Remains 196 /227 variables (removed 31) and now considering 262/319 (removed 57) transitions.
// Phase 1: matrix 262 rows 196 cols
[2025-06-07 18:16:02] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 18:16:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:02] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-06-07 18:16:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/458 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 0/458 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 216 constraints, problems are : Problem set: 0 solved, 261 unsolved in 12126 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 262/458 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 261/477 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:19] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:22] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:24] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:24] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:25] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:25] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:25] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:28] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:28] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:30] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:41] [INFO ] Deduced a trap composed of 43 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 18:16:41] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/458 variables, 2/489 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 489 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42156ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 42157ms
Starting structural reductions in LTL mode, iteration 1 : 196/227 places, 262/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42367 ms. Remains : 196/227 places, 262/319 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-11
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-11 finished in 42490 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) U (G(p1)||(!p0&&F(p2)))))'
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Graph (trivial) has 209 edges and 227 vertex of which 36 / 227 are part of one of the 7 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 197 transition count 251
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 69 rules applied. Total rules applied 105 place count 162 transition count 217
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 19 rules applied. Total rules applied 124 place count 145 transition count 215
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 143 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 142 transition count 213
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 129 place count 142 transition count 205
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 145 place count 134 transition count 205
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 159 place count 120 transition count 182
Iterating global reduction 5 with 14 rules applied. Total rules applied 173 place count 120 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 176 place count 120 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 176 place count 120 transition count 175
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 184 place count 116 transition count 175
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 114 transition count 167
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 114 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 190 place count 114 transition count 165
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 294 place count 62 transition count 113
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 295 place count 61 transition count 109
Iterating global reduction 7 with 1 rules applied. Total rules applied 296 place count 61 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 297 place count 61 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 299 place count 59 transition count 106
Applied a total of 299 rules in 29 ms. Remains 59 /227 variables (removed 168) and now considering 106/319 (removed 213) transitions.
[2025-06-07 18:16:44] [INFO ] Flow matrix only has 63 transitions (discarded 43 similar events)
// Phase 1: matrix 63 rows 59 cols
[2025-06-07 18:16:44] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 18:16:44] [INFO ] Flow matrix only has 63 transitions (discarded 43 similar events)
[2025-06-07 18:16:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:16:44] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-07 18:16:44] [INFO ] Flow matrix only has 63 transitions (discarded 43 similar events)
[2025-06-07 18:16:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/59 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 62/121 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 79 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/59 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 62/121 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 64/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2317ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/227 places, 106/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2466 ms. Remains : 59/227 places, 106/319 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-12 finished in 2607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 210 transition count 293
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 210 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 210 transition count 289
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 201 transition count 278
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 201 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 201 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 196 transition count 268
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 196 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 196 transition count 267
Applied a total of 69 rules in 11 ms. Remains 196 /227 variables (removed 31) and now considering 267/319 (removed 52) transitions.
// Phase 1: matrix 267 rows 196 cols
[2025-06-07 18:16:47] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:47] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 18:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:16:47] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-07 18:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/463 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/463 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 216 constraints, problems are : Problem set: 0 solved, 266 unsolved in 12347 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/463 variables, 196/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 266/482 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:05] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:12] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/463 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:16] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:18] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:19] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:19] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:20] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:23] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:24] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:28] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 492 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42383ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 42384ms
Starting structural reductions in LTL mode, iteration 1 : 196/227 places, 267/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42590 ms. Remains : 196/227 places, 267/319 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-14
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-14 finished in 42779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
Support contains 3 out of 227 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 227/227 places, 319/319 transitions.
Graph (trivial) has 211 edges and 227 vertex of which 38 / 227 are part of one of the 7 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 195 transition count 247
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 72 rules applied. Total rules applied 109 place count 159 transition count 211
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 127 place count 141 transition count 211
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 127 place count 141 transition count 201
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 147 place count 131 transition count 201
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 161 place count 117 transition count 178
Iterating global reduction 3 with 14 rules applied. Total rules applied 175 place count 117 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 178 place count 117 transition count 175
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 178 place count 117 transition count 172
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 184 place count 114 transition count 172
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 113 transition count 167
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 113 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 113 transition count 166
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 289 place count 62 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 290 place count 61 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 291 place count 61 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 292 place count 61 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 294 place count 59 transition count 108
Applied a total of 294 rules in 24 ms. Remains 59 /227 variables (removed 168) and now considering 108/319 (removed 211) transitions.
[2025-06-07 18:17:30] [INFO ] Flow matrix only has 60 transitions (discarded 48 similar events)
// Phase 1: matrix 60 rows 59 cols
[2025-06-07 18:17:30] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 18:17:30] [INFO ] Flow matrix only has 60 transitions (discarded 48 similar events)
[2025-06-07 18:17:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 18:17:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:17:30] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
[2025-06-07 18:17:30] [INFO ] Flow matrix only has 60 transitions (discarded 48 similar events)
[2025-06-07 18:17:30] [INFO ] Invariant cache hit.
[2025-06-07 18:17:30] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 3/59 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 59/118 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 82 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 3/59 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 59/118 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 70/152 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 152 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2541ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2541ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/227 places, 108/319 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2669 ms. Remains : 59/227 places, 108/319 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Champagne-PT-H06T0R-LTLFireability-15
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H06T0R-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T0R-LTLFireability-15 finished in 2777 ms.
All properties solved by simple procedures.
Total runtime 413723 ms.

BK_STOP 1749320252907

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H06T0R"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H06T0R, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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