Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1749318327016

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H05T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 17:45:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:45:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:45:28] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-07 17:45:28] [INFO ] Transformed 299 places.
[2025-06-07 17:45:28] [INFO ] Transformed 386 transitions.
[2025-06-07 17:45:28] [INFO ] Found NUPN structural information;
[2025-06-07 17:45:28] [INFO ] Parsed PT model containing 299 places and 386 transitions and 966 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H05T0R-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T0R-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 386/386 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 235 transition count 322
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 235 transition count 322
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 162 place count 201 transition count 288
Iterating global reduction 0 with 34 rules applied. Total rules applied 196 place count 201 transition count 288
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 216 place count 181 transition count 249
Iterating global reduction 0 with 20 rules applied. Total rules applied 236 place count 181 transition count 249
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 245 place count 181 transition count 240
Applied a total of 245 rules in 69 ms. Remains 181 /299 variables (removed 118) and now considering 240/386 (removed 146) transitions.
// Phase 1: matrix 240 rows 181 cols
[2025-06-07 17:45:28] [INFO ] Computed 15 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:28] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-07 17:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:28] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2025-06-07 17:45:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:31] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/421 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 0/421 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 197 constraints, problems are : Problem set: 0 solved, 239 unsolved in 12281 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 240/421 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 239/436 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:43] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:44] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:46] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:47] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:48] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:50] [INFO ] Deduced a trap composed of 51 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:45:50] [INFO ] Deduced a trap composed of 63 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:45:51] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 3/450 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:53] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:56] [INFO ] Deduced a trap along path composed of 10 places in 55 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 452 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42357ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 42368ms
Starting structural reductions in LTL mode, iteration 1 : 181/299 places, 240/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42872 ms. Remains : 181/299 places, 240/386 transitions.
Support contains 29 out of 181 places after structural reductions.
[2025-06-07 17:46:11] [INFO ] Flatten gal took : 34 ms
[2025-06-07 17:46:11] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:46:11] [INFO ] Input system was already deterministic with 240 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (245 resets) in 647 ms. (61 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40004 steps (25 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2025-06-07 17:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/181 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/421 variables, 181/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/421 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 162/181 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/421 variables, 181/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/421 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 75 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 5 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G((p1 U p2)) U p1))))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 165 transition count 224
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 165 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 165 transition count 223
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 155 transition count 211
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 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 54 place count 155 transition count 210
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 148 transition count 197
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 148 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 72 place count 148 transition count 193
Applied a total of 72 rules in 11 ms. Remains 148 /181 variables (removed 33) and now considering 193/240 (removed 47) transitions.
// Phase 1: matrix 193 rows 148 cols
[2025-06-07 17:46: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:46:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 17:46:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:12] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-07 17:46: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/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 193/341 variables, 148/163 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 0/341 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 163 constraints, problems are : Problem set: 0 solved, 192 unsolved in 6804 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 148/148 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/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 193/341 variables, 148/163 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 192/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:46:22] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 356 constraints, problems are : Problem set: 0 solved, 192 unsolved in 8182 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 15008ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 15009ms
Starting structural reductions in LTL mode, iteration 1 : 148/181 places, 193/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15151 ms. Remains : 148/181 places, 193/240 transitions.
Stuttering acceptance computed with spot in 429 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/148 stabilizing places and 15/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 27 factoid took 18 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T0R-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T0R-LTLCardinality-00 finished in 15990 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) U G(!p1))&&X(p1)))||X(X(G(p1)))))'
Support contains 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 165 transition count 224
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 165 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 165 transition count 223
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 155 transition count 211
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 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 54 place count 155 transition count 210
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 150 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 150 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 150 transition count 199
Applied a total of 67 rules in 16 ms. Remains 150 /181 variables (removed 31) and now considering 199/240 (removed 41) transitions.
// Phase 1: matrix 199 rows 150 cols
[2025-06-07 17:46:28] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 17:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-07 17:46:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/349 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 165 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7129 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 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/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/349 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 198/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:46:38] [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, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:40] [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:46:40] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:40] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 3/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:46:41] [INFO ] Deduced a trap composed of 38 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:46:42] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 2/369 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:46:43] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:43] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/371 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:46:45] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19795 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26942ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 26943ms
Starting structural reductions in LTL mode, iteration 1 : 150/181 places, 199/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27102 ms. Remains : 150/181 places, 199/240 transitions.
Stuttering acceptance computed with spot in 649 ms :[(NOT p1), false, (NOT p1), false, (NOT p1), false, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-01
Product exploration explored 100000 steps with 33241 reset in 116 ms.
Product exploration explored 100000 steps with 33194 reset in 146 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (NOT p1) p0)), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (NOT p1) p0))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 145 ms. Reduced automaton from 15 states, 62 edges and 2 AP (stutter sensitive) to 12 states, 47 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 530 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 7291 steps (49 resets) in 68 ms. (105 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (NOT p1) p0)), (X p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR (NOT p1) p0))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 407 ms. Reduced automaton from 12 states, 47 edges and 2 AP (stutter sensitive) to 12 states, 47 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 517 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Stuttering acceptance computed with spot in 541 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Applied a total of 0 rules in 6 ms. Remains 150 /150 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2025-06-07 17:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-07 17:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:58] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-07 17:46:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/349 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 165 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6990 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 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/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/349 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 198/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:47:08] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 1/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:47:10] [INFO ] Deduced a trap composed of 29 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:47:10] [INFO ] Deduced a trap composed of 36 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:47:10] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 3/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:47:11] [INFO ] Deduced a trap composed of 38 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:47:12] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 2/369 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:47:13] [INFO ] Deduced a trap composed of 45 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:47:13] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 2/371 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:47:15] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 0/349 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 372 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19832 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26838ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 26838ms
Finished structural reductions in LTL mode , in 1 iterations and 26982 ms. Remains : 150/150 places, 199/199 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 12 states, 47 edges and 2 AP (stutter sensitive) to 12 states, 47 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 9227 steps (60 resets) in 37 ms. (242 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 12 states, 47 edges and 2 AP (stutter sensitive) to 12 states, 47 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Stuttering acceptance computed with spot in 495 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Stuttering acceptance computed with spot in 535 ms :[false, false, false, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), p1, (AND p1 (NOT p0)), p1, true, (NOT p0)]
Product exploration explored 100000 steps with 19975 reset in 125 ms.
Product exploration explored 100000 steps with 19942 reset in 144 ms.
Built C files in :
/tmp/ltsmin7942195232451131024
[2025-06-07 17:47:28] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7942195232451131024
Running compilation step : cd /tmp/ltsmin7942195232451131024;'/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 382 ms.
Running link step : cd /tmp/ltsmin7942195232451131024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7942195232451131024;'/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/stateBased9852509022683178456.hoa' '--buchi-type=spotba'
LTSmin run took 337 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H05T0R-LTLCardinality-01 finished in 61087 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(X(G(p0)))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 165 transition count 224
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 165 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 165 transition count 223
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 154 transition count 210
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 154 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 56 place count 154 transition count 209
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 147 transition count 196
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 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 74 place count 147 transition count 192
Applied a total of 74 rules in 11 ms. Remains 147 /181 variables (removed 34) and now considering 192/240 (removed 48) transitions.
// Phase 1: matrix 192 rows 147 cols
[2025-06-07 17:47:29] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 17:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-07 17:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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, 0/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 192/339 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 0/339 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 162 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6637 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 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, 0/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 192/339 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 191/353 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:47:39] [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/339 variables, 1/354 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:47:40] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:40] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 2/356 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:47:41] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 1/357 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:47:43] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/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:47:48] [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:47:48] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:48] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/339 variables, 3/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:47:50] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (OVERLAPS) 0/339 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 362 constraints, problems are : Problem set: 0 solved, 191 unsolved in 25473 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32121ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 32122ms
Starting structural reductions in LTL mode, iteration 1 : 147/181 places, 192/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32261 ms. Remains : 147/181 places, 192/240 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLCardinality-05 finished in 32442 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(X(F(p0)))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 164 transition count 223
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 164 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 164 transition count 222
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 154 transition count 210
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 154 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 56 place count 154 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 148 transition count 200
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 148 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 148 transition count 197
Applied a total of 71 rules in 12 ms. Remains 148 /181 variables (removed 33) and now considering 197/240 (removed 43) transitions.
// Phase 1: matrix 197 rows 148 cols
[2025-06-07 17:48:01] [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:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 17:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:01] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-07 17:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 6945 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:48:11] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 1/360 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:48:13] [INFO ] Deduced a trap composed of 29 places in 53 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:13] [INFO ] Deduced a trap composed of 29 places in 50 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:13] [INFO ] Deduced a trap composed of 28 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:48:14] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/364 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:48:18] [INFO ] Deduced a trap composed of 47 places in 52 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:18] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/345 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 366 constraints, problems are : Problem set: 0 solved, 196 unsolved in 19851 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26811ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 26811ms
Starting structural reductions in LTL mode, iteration 1 : 148/181 places, 197/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26954 ms. Remains : 148/181 places, 197/240 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Product exploration explored 100000 steps with 25000 reset in 107 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2274 steps (14 resets) in 14 ms. (151 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2025-06-07 17:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 17:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:29] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-07 17:48:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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 6928 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:48:39] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 1/360 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:48:41] [INFO ] Deduced a trap composed of 29 places in 48 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:41] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:42] [INFO ] Deduced a trap composed of 28 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:48:42] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/364 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:48:46] [INFO ] Deduced a trap composed of 47 places in 54 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:46] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/345 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 366 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27014ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 27015ms
Finished structural reductions in LTL mode , in 1 iterations and 27153 ms. Remains : 148/148 places, 197/197 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2808 steps (17 resets) in 14 ms. (187 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 197/197 transitions.
Graph (trivial) has 136 edges and 148 vertex of which 30 / 148 are part of one of the 6 SCC in 6 ms
Free SCC test removed 24 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 124 transition count 171
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 124 transition count 158
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 124 transition count 158
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 39 place count 124 transition count 158
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 51 place count 112 transition count 146
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 63 place count 112 transition count 146
Performed 53 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 53 rules applied. Total rules applied 116 place count 112 transition count 146
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 156 place count 72 transition count 106
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 196 place count 72 transition count 106
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 196 rules in 40 ms. Remains 72 /148 variables (removed 76) and now considering 106/197 (removed 91) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:48:58] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-07 17:48:58] [INFO ] Flow matrix only has 73 transitions (discarded 33 similar events)
// Phase 1: matrix 73 rows 72 cols
[2025-06-07 17:48:58] [INFO ] Computed 15 invariants in 1 ms
[2025-06-07 17:48:58] [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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:58] [INFO ] Deduced a trap composed of 4 places in 25 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:58] [INFO ] Deduced a trap composed of 4 places in 24 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:48:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:59] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 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:48:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 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:48:59] [INFO ] Deduced a trap composed of 4 places in 23 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:48:59] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:59] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/29 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 72/144 variables, 72/101 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 12/113 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/113 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/114 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/114 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/114 constraints. Problems are: Problem set: 26 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 114 constraints, problems are : Problem set: 26 solved, 79 unsolved in 2750 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 27/72 variables, 15/15 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 14/29 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 72/144 variables, 72/101 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 12/113 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 79/192 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/192 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/193 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/193 constraints. Problems are: Problem set: 26 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/193 constraints. Problems are: Problem set: 26 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 193 constraints, problems are : Problem set: 26 solved, 79 unsolved in 3666 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 72/72 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/105 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6431ms problems are : Problem set: 26 solved, 79 unsolved
Search for dead transitions found 26 dead transitions in 6432ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 72/148 places, 80/197 transitions.
Graph (complete) has 381 edges and 72 vertex of which 46 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 46 /72 variables (removed 26) and now considering 80/80 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 46/148 places, 80/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6493 ms. Remains : 46/148 places, 80/197 transitions.
Built C files in :
/tmp/ltsmin15533494989883707889
[2025-06-07 17:49:04] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15533494989883707889
Running compilation step : cd /tmp/ltsmin15533494989883707889;'/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 281 ms.
Running link step : cd /tmp/ltsmin15533494989883707889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15533494989883707889;'/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/stateBased15149150239927061035.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H05T0R-LTLCardinality-07 finished in 63411 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(X(X(X(G((F((G(p0)&&X(p1))) U p2))))))))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 166 transition count 225
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 166 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 157 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 157 transition count 216
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 150 transition count 203
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 150 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 150 transition count 199
Applied a total of 66 rules in 13 ms. Remains 150 /181 variables (removed 31) and now considering 199/240 (removed 41) transitions.
// Phase 1: matrix 199 rows 150 cols
[2025-06-07 17:49:05] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:05] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 17:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:05] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-07 17:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/349 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 165 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7096 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 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/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 199/349 variables, 150/165 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 198/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:15] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 1/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:17] [INFO ] Deduced a trap composed of 31 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:49:17] [INFO ] Deduced a trap composed of 31 places in 57 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:17] [INFO ] Deduced a trap composed of 38 places in 60 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:17] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 368 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12726 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19835ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 19836ms
Starting structural reductions in LTL mode, iteration 1 : 150/181 places, 199/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19974 ms. Remains : 150/181 places, 199/240 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-08
Stuttering criterion allowed to conclude after 421 steps with 2 reset in 3 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLCardinality-08 finished in 20478 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(p1)||p0))&&(F(p2) U p3)))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 167 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 167 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 167 transition count 225
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 159 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 159 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 159 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 154 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 154 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 154 transition count 207
Applied a total of 58 rules in 15 ms. Remains 154 /181 variables (removed 27) and now considering 207/240 (removed 33) transitions.
// Phase 1: matrix 207 rows 154 cols
[2025-06-07 17:49:25] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 17:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:25] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2025-06-07 17:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:27] [INFO ] Deduced a trap composed of 25 places in 42 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:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:27] [INFO ] Deduced a trap composed of 25 places in 44 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:27] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:27] [INFO ] Deduced a trap composed of 24 places in 45 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:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/361 variables, 154/175 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/361 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 175 constraints, problems are : Problem set: 0 solved, 206 unsolved in 8707 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 207/361 variables, 154/175 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 206/381 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:37] [INFO ] Deduced a trap along path composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 206 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 29 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:39] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/361 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 384 constraints, problems are : Problem set: 0 solved, 206 unsolved in 15595 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24315ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 24317ms
Starting structural reductions in LTL mode, iteration 1 : 154/181 places, 207/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24464 ms. Remains : 154/181 places, 207/240 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p3), true, (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p3 p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X p2), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H05T0R-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H05T0R-LTLCardinality-10 finished in 24897 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 4 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Graph (trivial) has 169 edges and 181 vertex of which 37 / 181 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 149 transition count 172
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 51 rules applied. Total rules applied 83 place count 118 transition count 152
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 92 place count 109 transition count 152
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 92 place count 109 transition count 145
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 106 place count 102 transition count 145
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 115 place count 93 transition count 136
Iterating global reduction 3 with 9 rules applied. Total rules applied 124 place count 93 transition count 136
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 124 place count 93 transition count 132
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 89 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 88 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 88 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 88 transition count 128
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 209 place count 51 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 49 transition count 83
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 49 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 215 place count 49 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 47 transition count 79
Applied a total of 217 rules in 31 ms. Remains 47 /181 variables (removed 134) and now considering 79/240 (removed 161) transitions.
[2025-06-07 17:49:50] [INFO ] Flow matrix only has 54 transitions (discarded 25 similar events)
// Phase 1: matrix 54 rows 47 cols
[2025-06-07 17:49:50] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 17:49:50] [INFO ] Flow matrix only has 54 transitions (discarded 25 similar events)
[2025-06-07 17:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:50] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-07 17:49:50] [INFO ] Flow matrix only has 54 transitions (discarded 25 similar events)
[2025-06-07 17:49:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 53/100 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 62 constraints, problems are : Problem set: 0 solved, 48 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 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/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 53/100 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 48/110 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 110 constraints, problems are : Problem set: 0 solved, 48 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/181 places, 79/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1623 ms. Remains : 47/181 places, 79/240 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLCardinality-11 finished in 1756 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 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Graph (trivial) has 174 edges and 181 vertex of which 34 / 181 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 152 transition count 171
Reduce places removed 36 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 59 rules applied. Total rules applied 96 place count 116 transition count 148
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 106 place count 106 transition count 148
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 106 place count 106 transition count 142
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 100 transition count 142
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 128 place count 90 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 90 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 138 place count 90 transition count 128
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 86 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 85 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 85 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 85 transition count 124
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 225 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 227 place count 45 transition count 78
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 45 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 45 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 43 transition count 74
Applied a total of 233 rules in 25 ms. Remains 43 /181 variables (removed 138) and now considering 74/240 (removed 166) transitions.
[2025-06-07 17:49:52] [INFO ] Flow matrix only has 42 transitions (discarded 32 similar events)
// Phase 1: matrix 42 rows 43 cols
[2025-06-07 17:49:52] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 17:49:52] [INFO ] Flow matrix only has 42 transitions (discarded 32 similar events)
[2025-06-07 17:49:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:52] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2025-06-07 17:49:52] [INFO ] Flow matrix only has 42 transitions (discarded 32 similar events)
[2025-06-07 17:49:52] [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) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 58 constraints, problems are : Problem set: 0 solved, 41 unsolved in 536 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) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 99 constraints, problems are : Problem set: 0 solved, 41 unsolved in 618 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 1159ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/181 places, 74/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1264 ms. Remains : 43/181 places, 74/240 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLCardinality-13 finished in 1359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 240/240 transitions.
Graph (trivial) has 172 edges and 181 vertex of which 34 / 181 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 152 transition count 173
Reduce places removed 34 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 57 rules applied. Total rules applied 92 place count 118 transition count 150
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 102 place count 108 transition count 150
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 102 place count 108 transition count 143
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 116 place count 101 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 125 place count 92 transition count 134
Iterating global reduction 3 with 9 rules applied. Total rules applied 134 place count 92 transition count 134
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 134 place count 92 transition count 130
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 88 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 87 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 87 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 87 transition count 126
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 221 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 47 transition count 80
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 47 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 227 place count 47 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 45 transition count 76
Applied a total of 229 rules in 22 ms. Remains 45 /181 variables (removed 136) and now considering 76/240 (removed 164) transitions.
[2025-06-07 17:49:53] [INFO ] Flow matrix only has 44 transitions (discarded 32 similar events)
// Phase 1: matrix 44 rows 45 cols
[2025-06-07 17:49:53] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 17:49:53] [INFO ] Flow matrix only has 44 transitions (discarded 32 similar events)
[2025-06-07 17:49:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:53] [INFO ] Implicit Places using invariants and state equation in 37 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:49:53] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-07 17:49:53] [INFO ] Flow matrix only has 44 transitions (discarded 32 similar events)
[2025-06-07 17:49:53] [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, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 43/88 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 60 constraints, problems are : Problem set: 0 solved, 44 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 43/88 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 104 constraints, problems are : Problem set: 0 solved, 44 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1335ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/181 places, 76/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1433 ms. Remains : 45/181 places, 76/240 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T0R-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T0R-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T0R-LTLCardinality-15 finished in 1483 ms.
All properties solved by simple procedures.
Total runtime 267042 ms.

BK_STOP 1749318595232

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H05T0R, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339100027"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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