Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:35 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 60K 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-H05T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H05T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749318401190

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-H05T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 17:46:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:46:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:46:42] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-07 17:46:42] [INFO ] Transformed 299 places.
[2025-06-07 17:46:42] [INFO ] Transformed 386 transitions.
[2025-06-07 17:46:42] [INFO ] Found NUPN structural information;
[2025-06-07 17:46:42] [INFO ] Parsed PT model containing 299 places and 386 transitions and 966 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Champagne-PT-H05T0R-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 386/386 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 234 transition count 321
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 234 transition count 321
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 168 place count 196 transition count 283
Iterating global reduction 0 with 38 rules applied. Total rules applied 206 place count 196 transition count 283
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 227 place count 175 transition count 252
Iterating global reduction 0 with 21 rules applied. Total rules applied 248 place count 175 transition count 252
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 254 place count 175 transition count 246
Applied a total of 254 rules in 75 ms. Remains 175 /299 variables (removed 124) and now considering 246/386 (removed 140) transitions.
// Phase 1: matrix 246 rows 175 cols
[2025-06-07 17:46:42] [INFO ] Computed 15 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:43] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-07 17:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:43] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-07 17:46:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:46] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/421 variables, 175/191 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/421 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 191 constraints, problems are : Problem set: 0 solved, 245 unsolved in 13161 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/421 variables, 175/191 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 245/436 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:00] [INFO ] Deduced a trap along path composed of 9 places in 47 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:01] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:03] [INFO ] Deduced a trap composed of 32 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 17:47:04] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:06] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:09] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:16] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/421 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:20] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 444 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43270ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 43284ms
Starting structural reductions in LTL mode, iteration 1 : 175/299 places, 246/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43815 ms. Remains : 175/299 places, 246/386 transitions.
Support contains 32 out of 175 places after structural reductions.
[2025-06-07 17:47:26] [INFO ] Flatten gal took : 36 ms
[2025-06-07 17:47:26] [INFO ] Flatten gal took : 17 ms
[2025-06-07 17:47:26] [INFO ] Input system was already deterministic with 246 transitions.
Support contains 31 out of 175 places (down from 32) after GAL structural reductions.
RANDOM walk for 7365 steps (37 resets) in 215 ms. (34 steps per ms) remains 0/29 properties
Computed a total of 19 stabilizing places and 19 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1&&F(G(p2)))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 225
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 225
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 159 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 152 transition count 212
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 152 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 152 transition count 211
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 146 transition count 199
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 146 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 66 place count 146 transition count 195
Applied a total of 66 rules in 15 ms. Remains 146 /175 variables (removed 29) and now considering 195/246 (removed 51) transitions.
// Phase 1: matrix 195 rows 146 cols
[2025-06-07 17:47:27] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 17:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:27] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-07 17:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/341 variables, 146/161 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 0/341 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 161 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7230 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 195/341 variables, 146/161 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 194/355 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:37] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:39] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/341 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 357 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11764 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19013ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 19014ms
Starting structural reductions in LTL mode, iteration 1 : 146/175 places, 195/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19207 ms. Remains : 146/175 places, 195/246 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-01 finished in 19592 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)&&(p1||G((p2||X(X(X(G(p2))))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 160 transition count 223
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 160 transition count 223
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 160 transition count 220
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 153 transition count 210
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 153 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 153 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 147 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 147 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 147 transition count 193
Applied a total of 64 rules in 19 ms. Remains 147 /175 variables (removed 28) and now considering 193/246 (removed 53) transitions.
// Phase 1: matrix 193 rows 147 cols
[2025-06-07 17:47:47] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:47] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 17:47:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-07 17:47: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/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 193/340 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 162 constraints, problems are : Problem set: 0 solved, 192 unsolved in 6834 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 193/340 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 192/354 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:56] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:58] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:59] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 358 constraints, problems are : Problem set: 0 solved, 192 unsolved in 13705 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20556ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 20557ms
Starting structural reductions in LTL mode, iteration 1 : 147/175 places, 193/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20722 ms. Remains : 147/175 places, 193/246 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-03 finished in 21050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))||(F((p0 U (p1||G(p0))))&&X(p2)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 160 transition count 223
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 160 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 160 transition count 219
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 155 transition count 211
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 155 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 155 transition count 210
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 151 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 151 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 151 transition count 198
Applied a total of 55 rules in 11 ms. Remains 151 /175 variables (removed 24) and now considering 198/246 (removed 48) transitions.
// Phase 1: matrix 198 rows 151 cols
[2025-06-07 17:48:08] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 17:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:08] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-07 17:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 198/349 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 166 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7212 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 198/349 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 197/363 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:18] [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/349 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:22] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/349 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:25] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:30] [INFO ] Deduced a trap composed of 29 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 17:48:30] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:30] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/349 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:33] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (OVERLAPS) 0/349 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 370 constraints, problems are : Problem set: 0 solved, 197 unsolved in 28730 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35960ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 35961ms
Starting structural reductions in LTL mode, iteration 1 : 151/175 places, 198/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36113 ms. Remains : 151/175 places, 198/246 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 15 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T0R-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T0R-LTLFireability-04 finished in 36610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0 U (p1||G(p0))))&&(X(X(p0)) U ((X(X(p0))&&(p2 U (p3||G(p2))))||X(X(G(p0))))))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 222
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 159 transition count 218
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 153 transition count 209
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 153 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 149 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 149 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 149 transition count 199
Applied a total of 59 rules in 5 ms. Remains 149 /175 variables (removed 26) and now considering 199/246 (removed 47) transitions.
// Phase 1: matrix 199 rows 149 cols
[2025-06-07 17:48:44] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:44] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-07 17:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:45] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-07 17:48:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/348 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/348 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 164 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7120 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/348 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 198/362 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:55] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:00] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/348 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:04] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/348 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:06] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:07] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:09] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:15] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:15] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/348 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:17] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:18] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37149ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 37150ms
Starting structural reductions in LTL mode, iteration 1 : 149/175 places, 199/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37495 ms. Remains : 149/175 places, 199/246 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), true, (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2) p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-05
Product exploration explored 100000 steps with 19995 reset in 90 ms.
Product exploration explored 100000 steps with 19926 reset in 122 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p3) p2 p0), (X p2), (X (NOT p3)), (X p1), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p3) p2))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 140 ms. Reduced automaton from 11 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 10685 steps (67 resets) in 52 ms. (201 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 (NOT p3) p2 p0), (X p2), (X (NOT p3)), (X p1), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p3) p2))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 (NOT p3) p0))), (F p3), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p2 p3 p0)))]
Knowledge based reduction with 18 factoid took 408 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 345 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Support contains 4 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 149 /149 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2025-06-07 17:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:24] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 17:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:24] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-07 17:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/348 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/348 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 164 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7232 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/348 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 198/362 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:34] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:39] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/348 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:44] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 8 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/348 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:46] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:47] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/348 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:48] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:55] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:55] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/348 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:57] [INFO ] Deduced a trap composed of 29 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 17:49:57] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37255ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 37255ms
Finished structural reductions in LTL mode , in 1 iterations and 37391 ms. Remains : 149/149 places, 199/199 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 127 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 22529 steps (151 resets) in 65 ms. (341 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 p2 (NOT p3)), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3) p0))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (AND p2 (NOT p3)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p3))), (F (NOT (AND p2 (NOT p3)))), (F (NOT (OR p0 p2 p3))), (F (NOT p2)), (F p3), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (AND p0 p2 (NOT p3)))), (F (NOT (OR (NOT p0) p2 p3)))]
Knowledge based reduction with 10 factoid took 527 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 10 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 402 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 454 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 19989 reset in 86 ms.
Product exploration explored 100000 steps with 20060 reset in 115 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 417 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Support contains 4 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 199/199 transitions.
Graph (trivial) has 134 edges and 149 vertex of which 30 / 149 are part of one of the 6 SCC in 4 ms
Free SCC test removed 24 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 125 transition count 173
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 125 transition count 160
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 28 place count 125 transition count 160
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 125 transition count 160
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 52 place count 113 transition count 148
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 64 place count 113 transition count 148
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 116 place count 113 transition count 148
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 155 place count 74 transition count 109
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 194 place count 74 transition count 109
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 194 rules in 36 ms. Remains 74 /149 variables (removed 75) and now considering 109/199 (removed 90) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:50:05] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-07 17:50:05] [INFO ] Flow matrix only has 82 transitions (discarded 27 similar events)
// Phase 1: matrix 82 rows 74 cols
[2025-06-07 17:50:05] [INFO ] Computed 15 invariants in 1 ms
[2025-06-07 17:50:05] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD57 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:05] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 14/29 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 81/155 variables, 74/103 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 12/115 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/115 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/156 variables, 1/116 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/116 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/156 variables, 0/116 constraints. Problems are: Problem set: 27 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 116 constraints, problems are : Problem set: 27 solved, 81 unsolved in 3076 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 74/74 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 28/74 variables, 15/15 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 14/29 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 81/155 variables, 74/103 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 12/115 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 81/196 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/196 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/197 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/197 constraints. Problems are: Problem set: 27 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/156 variables, 0/197 constraints. Problems are: Problem set: 27 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 197 constraints, problems are : Problem set: 27 solved, 81 unsolved in 3722 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 74/74 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/108 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6814ms problems are : Problem set: 27 solved, 81 unsolved
Search for dead transitions found 27 dead transitions in 6816ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/149 places, 82/199 transitions.
Graph (complete) has 379 edges and 74 vertex of which 47 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 47 /74 variables (removed 27) and now considering 82/82 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/149 places, 82/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6874 ms. Remains : 47/149 places, 82/199 transitions.
Built C files in :
/tmp/ltsmin513889706844367862
[2025-06-07 17:50:11] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin513889706844367862
Running compilation step : cd /tmp/ltsmin513889706844367862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin513889706844367862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin513889706844367862;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12662490983105487253.hoa' '--buchi-type=spotba'
LTSmin run took 372 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H05T0R-LTLFireability-05 finished in 88101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 158 transition count 221
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 158 transition count 221
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 158 transition count 217
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 151 transition count 207
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 151 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 151 transition count 206
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 145 transition count 194
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 145 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 145 transition count 190
Applied a total of 69 rules in 13 ms. Remains 145 /175 variables (removed 30) and now considering 190/246 (removed 56) transitions.
// Phase 1: matrix 190 rows 145 cols
[2025-06-07 17:50:12] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 17:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-07 17:50:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 190/335 variables, 145/160 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/335 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 160 constraints, problems are : Problem set: 0 solved, 189 unsolved in 6531 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 190/335 variables, 145/160 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 189/349 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:22] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:23] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:27] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:28] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/335 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:30] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:32] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/335 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:38] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 5 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/335 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/335 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:44] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/335 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 0)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 1)
(t12 2)
(t13 2)
(t14 2)
(t15 1)
(t16 1)
(t17 0)
(t18 1)
(t19 1)
(t20 3)
(t21 2)
(t22 4)
(t23 1)
(t24 2)
(t25 0)
(t26 0)
(t27 1)
(t28 1)
(t29 3)
(t30 5)
(t31 2)
(t32 6)
(t33 1)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 1)
(t39 2)
(t40 2)
(t41 3)
(t42 1)
(t43 2)
(t44 0)
(t45 0)
(t46 1)
(t47 1)
(t48 2)
(t49 4)
(t50 2)
(t51 5)
(t52 1)
(t53 3)
(t54 2)
(t55 2)
(t56 0)
(t57 2)
(t58 4)
(t59 6)
(t60 1)
(t61 7)
(t62 2)
(t63 1)
(t64 1)
(t65 0)
(t66 1)
(t67 4)
(t68 6)
(t69 2)
(t70 7)
(t71 1)
(t72 4)
(t73 0)
(t74 0)
(t75 3)
(t76 3)
(t77 1)
(t78 5)
(t79 1)
(t80 6)
(t81 1)
(t82 3)
(t83 0)
(t84 0)
(t85 2)
(t86 2)
(t87 1)
(t88 4)
(t89 2)
(t90 5)
(t91 1)
(t92 3)
(t93 2)
(t94 2)
(t95 0)
(t96 2)
(t97 2)
(t98 5)
(t99 1)
(t100 6)
(t101 3)
(t102 2)
(t103 2)
(t104 0)
(t105 2)
(t106 1)
(t107 4)
(t108 1)
(t109 5)
(t110 1)
(t111 4)
(t112 2)
(t113 2)
(t114 0)
(t115 2)
(t116 1)
(t117 4)
(t118 2)
(t119 5)
(t120 1)
(t121 2)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 1)
(t127 2)
(t128 2)
(t129 timeout
3) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 357 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36562ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 36562ms
Starting structural reductions in LTL mode, iteration 1 : 145/175 places, 190/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36703 ms. Remains : 145/175 places, 190/246 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-06 finished in 36795 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 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Graph (trivial) has 168 edges and 175 vertex of which 37 / 175 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 143 transition count 183
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 49 rules applied. Total rules applied 76 place count 117 transition count 160
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 86 place count 107 transition count 160
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 86 place count 107 transition count 153
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 100 place count 100 transition count 153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 108 place count 92 transition count 137
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 place count 92 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 92 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 92 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 91 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 89 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 89 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 89 transition count 123
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 213 place count 46 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 44 transition count 78
Applied a total of 215 rules in 31 ms. Remains 44 /175 variables (removed 131) and now considering 78/246 (removed 168) transitions.
[2025-06-07 17:50:49] [INFO ] Flow matrix only has 43 transitions (discarded 35 similar events)
// Phase 1: matrix 43 rows 44 cols
[2025-06-07 17:50:49] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:49] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 17:50:49] [INFO ] Flow matrix only has 43 transitions (discarded 35 similar events)
[2025-06-07 17:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:49] [INFO ] Implicit Places using invariants and state equation in 38 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 17:50:49] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-07 17:50:49] [INFO ] Flow matrix only has 43 transitions (discarded 35 similar events)
[2025-06-07 17:50: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/42 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 42/86 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/86 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/87 variables, and 59 constraints, problems are : Problem set: 0 solved, 45 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 2/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 42/86 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 45/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/87 variables, and 104 constraints, problems are : Problem set: 0 solved, 45 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/175 places, 78/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1568 ms. Remains : 44/175 places, 78/246 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-07 finished in 1617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F(!p1))||X(G(p0))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 160 transition count 223
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 160 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 160 transition count 219
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 153 transition count 209
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 153 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 208
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 147 transition count 196
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 147 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 147 transition count 192
Applied a total of 65 rules in 11 ms. Remains 147 /175 variables (removed 28) and now considering 192/246 (removed 54) transitions.
// Phase 1: matrix 192 rows 147 cols
[2025-06-07 17:50:51] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 17:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:51] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-07 17:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/339 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 164 constraints, problems are : Problem set: 0 solved, 191 unsolved in 7907 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/339 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 191/355 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:00] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:00] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:01] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:02] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:04] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:05] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:06] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:06] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:06] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:11] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/339 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (OVERLAPS) 0/339 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 365 constraints, problems are : Problem set: 0 solved, 191 unsolved in 21120 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29039ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 29039ms
Starting structural reductions in LTL mode, iteration 1 : 147/175 places, 192/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29182 ms. Remains : 147/175 places, 192/246 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T0R-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T0R-LTLFireability-08 finished in 29549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F((p0&&X(p1)))&&F(p2)&&X(X(p0)))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 222
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 159 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 154 transition count 213
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 154 transition count 213
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 149 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 149 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 149 transition count 202
Applied a total of 59 rules in 11 ms. Remains 149 /175 variables (removed 26) and now considering 202/246 (removed 44) transitions.
// Phase 1: matrix 202 rows 149 cols
[2025-06-07 17:51:20] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:51:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 17:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:51:20] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-07 17:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 202/351 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 0/351 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 164 constraints, problems are : Problem set: 0 solved, 201 unsolved in 7112 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 202/351 variables, 149/164 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 201/365 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:31] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:32] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:32] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:34] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:35] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:37] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:38] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:51:40] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (OVERLAPS) 0/351 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 373 constraints, problems are : Problem set: 0 solved, 201 unsolved in 22761 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29889ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 29889ms
Starting structural reductions in LTL mode, iteration 1 : 149/175 places, 202/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30046 ms. Remains : 149/175 places, 202/246 transitions.
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-09
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-09 finished in 30532 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(X(p1))||p0))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 159 transition count 225
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 159 transition count 225
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 159 transition count 222
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 153 transition count 213
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 153 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 153 transition count 212
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 148 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 148 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 62 place count 148 transition count 197
Applied a total of 62 rules in 10 ms. Remains 148 /175 variables (removed 27) and now considering 197/246 (removed 49) transitions.
// Phase 1: matrix 197 rows 148 cols
[2025-06-07 17:51:51] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:51:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 17:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:51:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-07 17:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/345 variables, 148/163 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/345 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 163 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7140 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/345 variables, 148/163 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/345 variables, 196/359 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:01] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:01] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:06] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:06] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/345 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:08] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:08] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 365 constraints, problems are : Problem set: 0 solved, 196 unsolved in 19782 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 26935ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 26935ms
Starting structural reductions in LTL mode, iteration 1 : 148/175 places, 197/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27072 ms. Remains : 148/175 places, 197/246 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T0R-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T0R-LTLFireability-10 finished in 27401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Graph (trivial) has 170 edges and 175 vertex of which 37 / 175 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 143 transition count 182
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 78 place count 116 transition count 159
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 88 place count 106 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 88 place count 106 transition count 152
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 102 place count 99 transition count 152
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 111 place count 90 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 120 place count 90 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 90 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 123 place count 90 transition count 130
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 127 place count 88 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 129 place count 86 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 131 place count 86 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 133 place count 86 transition count 120
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 213 place count 46 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 214 place count 45 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 45 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 43 transition count 73
Applied a total of 218 rules in 28 ms. Remains 43 /175 variables (removed 132) and now considering 73/246 (removed 173) transitions.
[2025-06-07 17:52:18] [INFO ] Flow matrix only has 41 transitions (discarded 32 similar events)
// Phase 1: matrix 41 rows 43 cols
[2025-06-07 17:52:18] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 17:52:18] [INFO ] Flow matrix only has 41 transitions (discarded 32 similar events)
[2025-06-07 17:52:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-07 17:52:18] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:52:18] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-07 17:52:18] [INFO ] Flow matrix only has 41 transitions (discarded 32 similar events)
[2025-06-07 17:52:18] [INFO ] Invariant cache hit.
[2025-06-07 17:52:18] [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/40 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 40/83 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/84 variables, and 61 constraints, problems are : Problem set: 0 solved, 48 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 40/83 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 48/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/84 variables, and 109 constraints, problems are : Problem set: 0 solved, 48 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/175 places, 73/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1555 ms. Remains : 43/175 places, 73/246 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-11 finished in 1623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Graph (trivial) has 168 edges and 175 vertex of which 37 / 175 are part of one of the 6 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 143 transition count 183
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 48 rules applied. Total rules applied 75 place count 117 transition count 161
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 84 place count 108 transition count 161
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 84 place count 108 transition count 153
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 100 transition count 153
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 109 place count 91 transition count 136
Iterating global reduction 3 with 9 rules applied. Total rules applied 118 place count 91 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 91 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 121 place count 91 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 89 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 87 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 87 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 87 transition count 121
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 213 place count 46 transition count 80
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 214 place count 45 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 45 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 43 transition count 73
Applied a total of 218 rules in 17 ms. Remains 43 /175 variables (removed 132) and now considering 73/246 (removed 173) transitions.
[2025-06-07 17:52:20] [INFO ] Flow matrix only has 45 transitions (discarded 28 similar events)
// Phase 1: matrix 45 rows 43 cols
[2025-06-07 17:52:20] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 17:52:20] [INFO ] Flow matrix only has 45 transitions (discarded 28 similar events)
[2025-06-07 17:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:20] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:52:20] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2025-06-07 17:52:20] [INFO ] Flow matrix only has 45 transitions (discarded 28 similar events)
[2025-06-07 17:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 44/87 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 58 constraints, problems are : Problem set: 0 solved, 41 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 44/87 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 99 constraints, problems are : Problem set: 0 solved, 41 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1218ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/175 places, 73/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 43/175 places, 73/246 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-13
Stuttering criterion allowed to conclude after 81 steps with 3 reset in 2 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-13 finished in 1365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Graph (trivial) has 169 edges and 175 vertex of which 37 / 175 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 143 transition count 182
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 78 place count 116 transition count 159
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 88 place count 106 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 88 place count 106 transition count 152
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 102 place count 99 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 91 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 91 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 91 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 121 place count 91 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 89 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 87 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 87 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 87 transition count 121
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 209 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 47 transition count 78
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 47 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 47 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 45 transition count 75
Applied a total of 214 rules in 22 ms. Remains 45 /175 variables (removed 130) and now considering 75/246 (removed 171) transitions.
[2025-06-07 17:52:21] [INFO ] Flow matrix only has 43 transitions (discarded 32 similar events)
// Phase 1: matrix 43 rows 45 cols
[2025-06-07 17:52:21] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 17:52:21] [INFO ] Flow matrix only has 43 transitions (discarded 32 similar events)
[2025-06-07 17:52:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:52:21] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-07 17:52:21] [INFO ] Flow matrix only has 43 transitions (discarded 32 similar events)
[2025-06-07 17:52: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/41 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 4/45 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 42/87 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 60 constraints, problems are : Problem set: 0 solved, 51 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 4/45 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 42/87 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:23] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/87 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 112 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2079ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2079ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/175 places, 75/246 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2181 ms. Remains : 45/175 places, 75/246 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-14 finished in 2313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p0)) U (X(p1)||(p2&&X(F(!p1)))))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 246/246 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 161 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 161 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 161 transition count 223
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 156 transition count 218
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 156 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 151 transition count 207
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 151 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 151 transition count 203
Applied a total of 55 rules in 11 ms. Remains 151 /175 variables (removed 24) and now considering 203/246 (removed 43) transitions.
// Phase 1: matrix 203 rows 151 cols
[2025-06-07 17:52:23] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 17:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:52:24] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2025-06-07 17:52:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 203/354 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/354 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 166 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7483 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 203/354 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 202/368 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:34] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:39] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 6 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/354 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:41] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:42] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:43] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:45] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:47] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:47] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/354 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:55] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 6 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/354 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:52:57] [INFO ] Deduced a trap composed of 39 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 17:52:58] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 379 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37504ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 37505ms
Starting structural reductions in LTL mode, iteration 1 : 151/175 places, 203/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37662 ms. Remains : 151/175 places, 203/246 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H05T0R-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLFireability-15 finished in 37905 ms.
All properties solved by simple procedures.
Total runtime 379450 ms.

BK_STOP 1749318781886

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

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