Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 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 119K 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-H07T0R-LTLCardinality-00
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-01
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-02
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-03
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-04
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-05
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-06
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-07
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-08
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-09
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-10
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-11
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-12
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-13
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-14
FORMULA_NAME Champagne-PT-H07T0R-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749321686991

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-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 18:41: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 18:41:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:41:28] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-06-07 18:41:28] [INFO ] Transformed 539 places.
[2025-06-07 18:41:28] [INFO ] Transformed 742 transitions.
[2025-06-07 18:41:28] [INFO ] Found NUPN structural information;
[2025-06-07 18:41:28] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 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-H07T0R-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 126 place count 413 transition count 616
Iterating global reduction 0 with 126 rules applied. Total rules applied 252 place count 413 transition count 616
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 321 place count 344 transition count 547
Iterating global reduction 0 with 69 rules applied. Total rules applied 390 place count 344 transition count 547
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 435 place count 299 transition count 442
Iterating global reduction 0 with 45 rules applied. Total rules applied 480 place count 299 transition count 442
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 503 place count 299 transition count 419
Applied a total of 503 rules in 117 ms. Remains 299 /539 variables (removed 240) and now considering 419/742 (removed 323) transitions.
// Phase 1: matrix 419 rows 299 cols
[2025-06-07 18:41:28] [INFO ] Computed 27 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:28] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-06-07 18:41:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:29] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2025-06-07 18:41: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/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 419/718 variables, 299/326 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/718 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (OVERLAPS) 0/718 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 718/718 variables, and 326 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (OVERLAPS) 1/299 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 419/718 variables, 299/326 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/718 variables, 418/744 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:07] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:08] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:08] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:08] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:08] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/718 variables, 5/749 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:12] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:12] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:13] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:13] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:13] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:14] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:23] [INFO ] Deduced a trap along path composed of 11 places in 57 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/718 variables, and 756 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 299/539 places, 419/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60847 ms. Remains : 299/539 places, 419/742 transitions.
Support contains 29 out of 299 places after structural reductions.
[2025-06-07 18:42:29] [INFO ] Flatten gal took : 48 ms
[2025-06-07 18:42:29] [INFO ] Flatten gal took : 24 ms
[2025-06-07 18:42:29] [INFO ] Input system was already deterministic with 419 transitions.
RANDOM walk for 40000 steps (147 resets) in 932 ms. (42 steps per ms) remains 1/16 properties
BEST_FIRST walk for 34439 steps (8 resets) in 113 ms. (302 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T0R-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 42 stabilizing places and 42 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)||X(G(p1))))'
Support contains 5 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 284 transition count 404
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 284 transition count 404
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 273 transition count 384
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 273 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 273 transition count 381
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 268 transition count 372
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 268 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 268 transition count 371
Applied a total of 66 rules in 20 ms. Remains 268 /299 variables (removed 31) and now considering 371/419 (removed 48) transitions.
// Phase 1: matrix 371 rows 268 cols
[2025-06-07 18:42:30] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:42:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 18:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:42:30] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-07 18:42:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/639 variables, 268/295 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 0/639 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 295 constraints, problems are : Problem set: 0 solved, 370 unsolved in 23409 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/639 variables, 268/295 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 370/665 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:03] [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/639 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:08] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:09] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:09] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 3/669 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:13] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:13] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:13] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:14] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:14] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:14] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:15] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:15] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 8/677 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:20] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 678 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53491ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 53494ms
Starting structural reductions in LTL mode, iteration 1 : 268/299 places, 371/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53741 ms. Remains : 268/299 places, 371/419 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-00 finished in 54051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 284 transition count 404
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 284 transition count 404
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 275 transition count 393
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 275 transition count 393
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 275 transition count 392
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 269 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 269 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 269 transition count 381
Applied a total of 62 rules in 22 ms. Remains 269 /299 variables (removed 30) and now considering 381/419 (removed 38) transitions.
// Phase 1: matrix 381 rows 269 cols
[2025-06-07 18:43:24] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:43:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 18:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:43:24] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-07 18:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/650 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 0/650 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 296 constraints, problems are : Problem set: 0 solved, 380 unsolved in 24140 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/650 variables, 269/296 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 380/676 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:58] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:59] [INFO ] Deduced a trap along path composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:03] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:04] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:05] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 3/681 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:09] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:14] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 683 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54201ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 54202ms
Starting structural reductions in LTL mode, iteration 1 : 269/299 places, 381/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54460 ms. Remains : 269/299 places, 381/419 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H07T0R-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H07T0R-LTLCardinality-02 finished in 54974 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 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Graph (trivial) has 279 edges and 299 vertex of which 42 / 299 are part of one of the 9 SCC in 2 ms
Free SCC test removed 33 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 265 transition count 333
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 99 rules applied. Total rules applied 150 place count 215 transition count 284
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 175 place count 191 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 190 transition count 283
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 176 place count 190 transition count 268
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 206 place count 175 transition count 268
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 218 place count 163 transition count 256
Iterating global reduction 4 with 12 rules applied. Total rules applied 230 place count 163 transition count 256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 230 place count 163 transition count 254
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 234 place count 161 transition count 254
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 237 place count 158 transition count 242
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 158 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 243 place count 158 transition count 239
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 399 place count 80 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 401 place count 78 transition count 159
Applied a total of 401 rules in 75 ms. Remains 78 /299 variables (removed 221) and now considering 159/419 (removed 260) transitions.
[2025-06-07 18:44:19] [INFO ] Flow matrix only has 77 transitions (discarded 82 similar events)
// Phase 1: matrix 77 rows 78 cols
[2025-06-07 18:44:19] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-07 18:44:19] [INFO ] Flow matrix only has 77 transitions (discarded 82 similar events)
[2025-06-07 18:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:19] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:44:19] [INFO ] Redundant transitions in 4 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-07 18:44:19] [INFO ] Flow matrix only has 77 transitions (discarded 82 similar events)
[2025-06-07 18:44:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 76/154 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 105 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2142 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 76/154 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 102/207 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 207 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2328 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4486ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 4486ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/299 places, 159/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4702 ms. Remains : 78/299 places, 159/419 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-04 finished in 4752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X((p1||X(F((p1&&F(p2))))))))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 285 transition count 405
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 285 transition count 405
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 276 transition count 387
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 276 transition count 387
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 276 transition count 384
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 271 transition count 375
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 271 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 271 transition count 374
Applied a total of 60 rules in 14 ms. Remains 271 /299 variables (removed 28) and now considering 374/419 (removed 45) transitions.
// Phase 1: matrix 374 rows 271 cols
[2025-06-07 18:44:23] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-07 18:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:24] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-06-07 18:44:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 374/645 variables, 271/298 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 0/645 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 298 constraints, problems are : Problem set: 0 solved, 373 unsolved in 23601 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 374/645 variables, 271/298 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 373/671 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:57] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:02] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:02] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:07] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:08] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:09] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 3/677 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:12] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:14] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 679 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53655ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 53656ms
Starting structural reductions in LTL mode, iteration 1 : 271/299 places, 374/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53894 ms. Remains : 271/299 places, 374/419 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-05
Stuttering criterion allowed to conclude after 266 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-05 finished in 54110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Graph (trivial) has 281 edges and 299 vertex of which 42 / 299 are part of one of the 9 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 265 transition count 330
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 102 rules applied. Total rules applied 156 place count 212 transition count 281
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 180 place count 188 transition count 281
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 180 place count 188 transition count 267
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 208 place count 174 transition count 267
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 222 place count 160 transition count 253
Iterating global reduction 3 with 14 rules applied. Total rules applied 236 place count 160 transition count 253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 236 place count 160 transition count 249
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 244 place count 156 transition count 249
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 153 transition count 237
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 153 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 253 place count 153 transition count 234
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 405 place count 77 transition count 158
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 406 place count 76 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 407 place count 76 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 408 place count 76 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 410 place count 74 transition count 150
Applied a total of 410 rules in 45 ms. Remains 74 /299 variables (removed 225) and now considering 150/419 (removed 269) transitions.
[2025-06-07 18:45:18] [INFO ] Flow matrix only has 69 transitions (discarded 81 similar events)
// Phase 1: matrix 69 rows 74 cols
[2025-06-07 18:45:18] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 18:45:18] [INFO ] Flow matrix only has 69 transitions (discarded 81 similar events)
[2025-06-07 18:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:45:18] [INFO ] Redundant transitions in 4 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-07 18:45:18] [INFO ] Flow matrix only has 69 transitions (discarded 81 similar events)
[2025-06-07 18:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 68/142 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/143 variables, and 101 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 68/142 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 94/195 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/143 variables, and 195 constraints, problems are : Problem set: 0 solved, 94 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3890ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 3892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/299 places, 150/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4072 ms. Remains : 74/299 places, 150/419 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-06
Stuttering criterion allowed to conclude after 125 steps with 2 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-06 finished in 4120 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(p0)))))'
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 283 transition count 403
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 283 transition count 403
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 273 transition count 384
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 273 transition count 384
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 273 transition count 381
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 267 transition count 371
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 267 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 267 transition count 370
Applied a total of 68 rules in 12 ms. Remains 267 /299 variables (removed 32) and now considering 370/419 (removed 49) transitions.
// Phase 1: matrix 370 rows 267 cols
[2025-06-07 18:45:22] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:22] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-07 18:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:22] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 18:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 294 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23130 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 369/663 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:55] [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/637 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:07] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:07] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:08] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/637 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:11] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:13] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/637 variables, and 669 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53191ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53193ms
Starting structural reductions in LTL mode, iteration 1 : 267/299 places, 370/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53455 ms. Remains : 267/299 places, 370/419 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-08
Product exploration explored 100000 steps with 20000 reset in 103 ms.
Product exploration explored 100000 steps with 20000 reset in 113 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 303 steps (0 resets) in 6 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 370/370 transitions.
Applied a total of 0 rules in 6 ms. Remains 267 /267 variables (removed 0) and now considering 370/370 (removed 0) transitions.
[2025-06-07 18:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:46:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-07 18:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:46:17] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 18:46:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 294 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23207 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 369/663 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:49] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:01] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:01] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:02] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/637 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:06] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:07] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/637 variables, and 669 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53255ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53256ms
Finished structural reductions in LTL mode , in 1 iterations and 53495 ms. Remains : 267/267 places, 370/370 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 469 steps (0 resets) in 14 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 105 ms.
Product exploration explored 100000 steps with 20000 reset in 123 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 370/370 transitions.
Graph (trivial) has 246 edges and 267 vertex of which 42 / 267 are part of one of the 9 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 234 transition count 335
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 52 place count 234 transition count 310
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 234 transition count 310
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 234 transition count 310
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 105 place count 207 transition count 283
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 132 place count 207 transition count 283
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 103 rules applied. Total rules applied 235 place count 207 transition count 283
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 312 place count 130 transition count 206
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 389 place count 130 transition count 206
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 389 rules in 41 ms. Remains 130 /267 variables (removed 137) and now considering 206/370 (removed 164) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:47:11] [INFO ] Redundant transitions in 6 ms returned []
Running 205 sub problems to find dead transitions.
[2025-06-07 18:47:11] [INFO ] Flow matrix only has 129 transitions (discarded 77 similar events)
// Phase 1: matrix 129 rows 130 cols
[2025-06-07 18:47:11] [INFO ] Computed 27 invariants in 1 ms
[2025-06-07 18:47:11] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 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 18:47:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 3 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 18:47:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD91 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD109 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 20/47 constraints. Problems are: Problem set: 45 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD151 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD163 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD180 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 6/53 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 128/258 variables, 130/183 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/203 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/203 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/259 variables, 1/204 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/204 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/204 constraints. Problems are: Problem set: 51 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 204 constraints, problems are : Problem set: 51 solved, 154 unsolved in 8767 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 130/130 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 52/130 variables, 27/27 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 26/53 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/53 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 128/258 variables, 130/183 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/203 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 154/357 constraints. Problems are: Problem set: 51 solved, 154 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:23] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 1/358 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/358 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 1/259 variables, 1/359 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/359 constraints. Problems are: Problem set: 51 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/259 variables, 0/359 constraints. Problems are: Problem set: 51 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 359 constraints, problems are : Problem set: 51 solved, 154 unsolved in 18599 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 130/130 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 154/205 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27388ms problems are : Problem set: 51 solved, 154 unsolved
Search for dead transitions found 51 dead transitions in 27388ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 130/267 places, 155/370 transitions.
Graph (complete) has 1040 edges and 130 vertex of which 79 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.4 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 79 /130 variables (removed 51) and now considering 155/155 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/267 places, 155/370 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27455 ms. Remains : 79/267 places, 155/370 transitions.
Built C files in :
/tmp/ltsmin714278891680628925
[2025-06-07 18:47:39] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin714278891680628925
Running compilation step : cd /tmp/ltsmin714278891680628925;'/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 600 ms.
Running link step : cd /tmp/ltsmin714278891680628925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin714278891680628925;'/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/stateBased7305110902796457880.hoa' '--buchi-type=spotba'
LTSmin run took 162 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H07T0R-LTLCardinality-08 finished in 137881 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(p0)) U ((!p1&&X(X(p0)))||X(X(G(p0))))))'
Support contains 4 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 282 transition count 402
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 282 transition count 402
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 271 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 271 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 271 transition count 379
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 265 transition count 369
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 265 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 265 transition count 368
Applied a total of 72 rules in 23 ms. Remains 265 /299 variables (removed 34) and now considering 368/419 (removed 51) transitions.
// Phase 1: matrix 368 rows 265 cols
[2025-06-07 18:47:40] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:47:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-07 18:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:47:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2025-06-07 18:47:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/633 variables, 265/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 0/633 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 292 constraints, problems are : Problem set: 0 solved, 367 unsolved in 22919 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 368/633 variables, 265/292 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 367/659 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:12] [INFO ] Deduced a trap along path composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:17] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:18] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:19] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:19] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 4/664 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:23] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:24] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:28] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:29] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 668 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52964ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 52966ms
Starting structural reductions in LTL mode, iteration 1 : 265/299 places, 368/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53219 ms. Remains : 265/299 places, 368/419 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 281 steps with 63 reset in 1 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-11 finished in 53346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Graph (trivial) has 278 edges and 299 vertex of which 42 / 299 are part of one of the 9 SCC in 0 ms
Free SCC test removed 33 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 265 transition count 332
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 98 rules applied. Total rules applied 150 place count 214 transition count 285
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 174 place count 191 transition count 284
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 177 place count 190 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 189 transition count 282
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 178 place count 189 transition count 268
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 206 place count 175 transition count 268
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 219 place count 162 transition count 255
Iterating global reduction 5 with 13 rules applied. Total rules applied 232 place count 162 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 232 place count 162 transition count 252
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 238 place count 159 transition count 252
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 156 transition count 240
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 156 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 247 place count 156 transition count 237
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 399 place count 80 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 401 place count 78 transition count 159
Applied a total of 401 rules in 42 ms. Remains 78 /299 variables (removed 221) and now considering 159/419 (removed 260) transitions.
[2025-06-07 18:48:33] [INFO ] Flow matrix only has 78 transitions (discarded 81 similar events)
// Phase 1: matrix 78 rows 78 cols
[2025-06-07 18:48:33] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:48:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-07 18:48:33] [INFO ] Flow matrix only has 78 transitions (discarded 81 similar events)
[2025-06-07 18:48:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:48:33] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:48:33] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-07 18:48:33] [INFO ] Flow matrix only has 78 transitions (discarded 81 similar events)
[2025-06-07 18:48:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 77/155 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/155 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/156 variables, and 105 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2110 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/78 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 77/155 variables, 78/105 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 102/207 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/156 variables, and 207 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4466ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 4466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/299 places, 159/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4654 ms. Remains : 78/299 places, 159/419 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-14 finished in 4696 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((F(p0)&&G(p1)))))))'
Support contains 3 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 419/419 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 283 transition count 403
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 283 transition count 403
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 271 transition count 382
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 271 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 271 transition count 379
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 66 place count 264 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 73 place count 264 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 264 transition count 367
Applied a total of 74 rules in 16 ms. Remains 264 /299 variables (removed 35) and now considering 367/419 (removed 52) transitions.
// Phase 1: matrix 367 rows 264 cols
[2025-06-07 18:48:38] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:48:38] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 18:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:48:38] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2025-06-07 18:48:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 367/631 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/631 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 0/631 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Real declared 631/631 variables, and 291 constraints, problems are : Problem set: 0 solved, 366 unsolved in 22914 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 367/631 variables, 264/291 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/631 variables, 366/657 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:10] [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/631 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:14] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:15] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:16] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:16] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 4/662 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:20] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:20] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:25] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:25] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:25] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:26] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/631 variables, 4/668 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 631/631 variables, and 668 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 264/264 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52956ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 52957ms
Starting structural reductions in LTL mode, iteration 1 : 264/299 places, 367/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53200 ms. Remains : 264/299 places, 367/419 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H07T0R-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H07T0R-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H07T0R-LTLCardinality-15 finished in 53446 ms.
All properties solved by simple procedures.
Total runtime 483367 ms.

BK_STOP 1749322171583

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-H07T0R"
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-H07T0R, 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-174931339200075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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