Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 13:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 13:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 13:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 13:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 13:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 13:11 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 42K 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-H04T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H04T0R-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749317704888

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H04T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 17:35:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:35:06] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2025-06-07 17:35:06] [INFO ] Transformed 219 places.
[2025-06-07 17:35:06] [INFO ] Transformed 274 transitions.
[2025-06-07 17:35:06] [INFO ] Found NUPN structural information;
[2025-06-07 17:35:06] [INFO ] Parsed PT model containing 219 places and 274 transitions and 666 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 62 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 274/274 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 178 transition count 233
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 178 transition count 233
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 166 transition count 221
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 166 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 109 place count 163 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 112 place count 163 transition count 218
Applied a total of 112 rules in 46 ms. Remains 163 /219 variables (removed 56) and now considering 218/274 (removed 56) transitions.
// Phase 1: matrix 218 rows 163 cols
[2025-06-07 17:35:06] [INFO ] Computed 11 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:06] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-07 17:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:06] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 17:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:09] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:09] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:09] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:09] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/381 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/381 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 178 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11315 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/381 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 217/395 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:20] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:20] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:21] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:21] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:22] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:22] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:22] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:22] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:22] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:22] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:23] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:23] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:25] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:25] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:28] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:36] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/381 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 411 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41403ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 41425ms
Starting structural reductions in LTL mode, iteration 1 : 163/219 places, 218/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41910 ms. Remains : 163/219 places, 218/274 transitions.
Support contains 62 out of 163 places after structural reductions.
[2025-06-07 17:35:48] [INFO ] Flatten gal took : 37 ms
[2025-06-07 17:35:48] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:35:48] [INFO ] Input system was already deterministic with 218 transitions.
Reduction of identical properties reduced properties to check from 55 to 54
RANDOM walk for 40000 steps (291 resets) in 1290 ms. (30 steps per ms) remains 0/54 properties
[2025-06-07 17:35:48] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:35:49] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:35:49] [INFO ] Input system was already deterministic with 218 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Graph (trivial) has 161 edges and 163 vertex of which 41 / 163 are part of one of the 6 SCC in 2 ms
Free SCC test removed 35 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 127 transition count 138
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 95 place count 89 transition count 120
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 104 place count 80 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 104 place count 80 transition count 118
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 78 transition count 118
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 124 place count 62 transition count 97
Iterating global reduction 3 with 16 rules applied. Total rules applied 140 place count 62 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 62 transition count 95
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 142 place count 62 transition count 92
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 59 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 57 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 57 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 154 place count 57 transition count 83
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 196 place count 36 transition count 62
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 34 transition count 58
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 34 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 202 place count 34 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 204 place count 32 transition count 54
Applied a total of 204 rules in 36 ms. Remains 32 /163 variables (removed 131) and now considering 54/218 (removed 164) transitions.
[2025-06-07 17:35:49] [INFO ] Flow matrix only has 31 transitions (discarded 23 similar events)
// Phase 1: matrix 31 rows 32 cols
[2025-06-07 17:35:49] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 17:35:49] [INFO ] Flow matrix only has 31 transitions (discarded 23 similar events)
[2025-06-07 17:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:49] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:35:49] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-07 17:35:49] [INFO ] Flow matrix only has 31 transitions (discarded 23 similar events)
[2025-06-07 17:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/62 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/62 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/63 variables, and 43 constraints, problems are : Problem set: 0 solved, 29 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/62 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/63 variables, and 72 constraints, problems are : Problem set: 0 solved, 29 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 799ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/163 places, 54/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 923 ms. Remains : 32/163 places, 54/218 transitions.
[2025-06-07 17:35:49] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:35:49] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:35:49] [INFO ] Input system was already deterministic with 54 transitions.
[2025-06-07 17:35:50] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:35:50] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:35:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17436763521747367278.gal : 2 ms
[2025-06-07 17:35:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7095068701917942091.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17436763521747367278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7095068701917942091.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,69984,0.0178,4132,2,134,5,827,6,0,179,530,0


Converting to forward existential form...Done !
original formula: AG(AF((p127==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p127==0)))] = FALSE
Hit Full ! (commute/partial/dont) 52/0/2
(forward)formula 0,0,0.027664,4388,1,0,8,3296,20,2,870,1759,8
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Graph (trivial) has 161 edges and 163 vertex of which 38 / 163 are part of one of the 6 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 130 transition count 140
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 58 rules applied. Total rules applied 99 place count 90 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 108 place count 81 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 108 place count 81 transition count 120
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 79 transition count 120
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 129 place count 62 transition count 98
Iterating global reduction 3 with 17 rules applied. Total rules applied 146 place count 62 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 62 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 148 place count 62 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 156 place count 58 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 56 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 56 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 56 transition count 83
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 202 place count 36 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 33 transition count 55
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 33 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 211 place count 33 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 31 transition count 50
Applied a total of 213 rules in 22 ms. Remains 31 /163 variables (removed 132) and now considering 50/218 (removed 168) transitions.
[2025-06-07 17:35:50] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
// Phase 1: matrix 30 rows 31 cols
[2025-06-07 17:35:50] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 17:35:50] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-07 17:35:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:50] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:35:50] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-07 17:35:50] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-07 17:35:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 29/60 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 42 constraints, problems are : Problem set: 0 solved, 25 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 29/60 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 67 constraints, problems are : Problem set: 0 solved, 25 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 670ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/163 places, 50/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 770 ms. Remains : 31/163 places, 50/218 transitions.
[2025-06-07 17:35:50] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:35:50] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:35:50] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 79 steps (2 resets) in 4 ms. (15 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 17:35:50] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:35:50] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:35:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14387352873784714262.gal : 0 ms
[2025-06-07 17:35:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17116687604381412120.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14387352873784714262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17116687604381412120.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 136 transition count 186
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 136 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 136 transition count 183
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 118 transition count 162
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 118 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 95 place count 118 transition count 160
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 111 transition count 150
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 111 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 111 transition count 147
Applied a total of 112 rules in 9 ms. Remains 111 /163 variables (removed 52) and now considering 147/218 (removed 71) transitions.
// Phase 1: matrix 147 rows 111 cols
[2025-06-07 17:35:50] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 17:35:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:35:51] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-07 17:35:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/258 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 0/258 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 122 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4006 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/258 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 146/268 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:56] [INFO ] Deduced a trap along path composed of 10 places in 40 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:57] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:35:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 271 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7172 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11194ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 11196ms
Starting structural reductions in LTL mode, iteration 1 : 111/163 places, 147/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11327 ms. Remains : 111/163 places, 147/218 transitions.
[2025-06-07 17:36:02] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:36:02] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:36:02] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-07 17:36:02] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:36:02] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7607660752572205958.gal : 2 ms
[2025-06-07 17:36:02] [INFO ] Time to serialize properties into /tmp/CTLFireability2592020052595991940.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7607660752572205958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2592020052595991940.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.83498e+10,0.035346,5188,2,557,5,6066,6,0,593,4890,0


Converting to forward existential form...Done !
original formula: AX(A((p190==1) U (((p76==1) + A(!((((p177==1)&&(p208==1))||(p67==1))) U EF(((p20==1)&&(p110==1))))) + ((p137==1) * (AF((p19==1)) + (p176!...163
=> equivalent forward existential formula: (([(((FwdU(EY(Init),!((((p76==1) + !((E(!(E(TRUE U ((p20==1)&&(p110==1)))) U (!(!((((p177==1)&&(p208==1))||(p67=...1282
Reverse transition relation is NOT exact ! Due to transitions t3, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t64, t68, t78, t91, t101, t110, Inters...248
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.0123,152160,1,0,1189,856671,350,699,3709,1.15122e+06,1367
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 134 transition count 184
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 134 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 134 transition count 181
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 114 transition count 155
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 114 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 114 transition count 152
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 105 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 105 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 105 transition count 134
Applied a total of 127 rules in 8 ms. Remains 105 /163 variables (removed 58) and now considering 134/218 (removed 84) transitions.
// Phase 1: matrix 134 rows 105 cols
[2025-06-07 17:36:06] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 17:36:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:06] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-07 17:36:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/239 variables, 105/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 0/239 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 116 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3607 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/239 variables, 105/116 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 133/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:11] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:13] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:14] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:14] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/239 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 254 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8051 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11670ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 11674ms
Starting structural reductions in LTL mode, iteration 1 : 105/163 places, 134/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11786 ms. Remains : 105/163 places, 134/218 transitions.
[2025-06-07 17:36:18] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:18] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:36:18] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-07 17:36:18] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:36:18] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11532182326293510696.gal : 2 ms
[2025-06-07 17:36:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8319834615166232032.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11532182326293510696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8319834615166232032.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03756e+10,0.03279,5044,2,530,5,5603,6,0,556,4564,0


Converting to forward existential form...Done !
original formula: AF(AG(EX(AX((p118==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX(!(EX(!((p118==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t27, t32, t36, t41, t42, t46, t52, t56, t61, t65, t75, t85, t95, t104, Interse...247
(forward)formula 0,0,0.653685,27612,1,0,284,131977,294,147,3472,129742,368
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 135 transition count 185
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 135 transition count 185
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 135 transition count 182
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 77 place count 117 transition count 158
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 117 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 117 transition count 155
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 110 transition count 144
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 110 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 110 transition count 140
Applied a total of 116 rules in 7 ms. Remains 110 /163 variables (removed 53) and now considering 140/218 (removed 78) transitions.
// Phase 1: matrix 140 rows 110 cols
[2025-06-07 17:36:18] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 17:36:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:18] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-07 17:36: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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/250 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 121 constraints, problems are : Problem set: 0 solved, 139 unsolved in 3931 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 140/250 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 139/260 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:24] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:24] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:27] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:27] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/250 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:30] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:30] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:33] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/250 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 267 constraints, problems are : Problem set: 0 solved, 139 unsolved in 15685 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 19626ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 19627ms
Starting structural reductions in LTL mode, iteration 1 : 110/163 places, 140/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19750 ms. Remains : 110/163 places, 140/218 transitions.
[2025-06-07 17:36:38] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:36:38] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:38] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-07 17:36:38] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:38] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2477659525840586848.gal : 2 ms
[2025-06-07 17:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16769285401567894049.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2477659525840586848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16769285401567894049.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.39223e+10,0.037262,5268,2,595,5,6408,6,0,582,5621,0


Converting to forward existential form...Done !
original formula: EX(!(E(AF(EG((p216==1))) U ((AG((p178!=1)) + EF((p136==1))) + AX((p68==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(EG(!(EG((p216==1))))) U ((!(E(TRUE U !((p178!=1)))) + E(TRUE U (p136==1))) + !(EX(!((p68==1))...171
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t25, t28, t34, t35, t39, t44, t45, t49, t55, t59, t64, t68, t78, t90, t100, t109, I...253
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.00232,101244,1,0,930,545066,321,552,3599,712426,1028
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 140 transition count 191
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 123 transition count 170
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 123 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 123 transition count 168
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 116 transition count 157
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 116 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 116 transition count 152
Applied a total of 102 rules in 15 ms. Remains 116 /163 variables (removed 47) and now considering 152/218 (removed 66) transitions.
// Phase 1: matrix 152 rows 116 cols
[2025-06-07 17:36:41] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 17:36:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:36:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-07 17:36:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/268 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 0/268 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 127 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4569 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/268 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 151/278 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:47] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:48] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:49] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:50] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:51] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:51] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:36:51] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 11 (OVERLAPS) 0/268 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 285 constraints, problems are : Problem set: 0 solved, 151 unsolved in 10500 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 15084ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 15085ms
Starting structural reductions in LTL mode, iteration 1 : 116/163 places, 152/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15239 ms. Remains : 116/163 places, 152/218 transitions.
[2025-06-07 17:36:56] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:36:56] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:36:56] [INFO ] Input system was already deterministic with 152 transitions.
[2025-06-07 17:36:56] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:56] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability291399775728738551.gal : 1 ms
[2025-06-07 17:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17416003313343443473.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability291399775728738551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17416003313343443473.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.01289e+10,0.049114,5872,2,738,5,8531,6,0,618,8714,0


Converting to forward existential form...Done !
original formula: E(EX(((p152==1) + EF(AX((p165==1))))) U ((AG(AX(A((p218==1) U ((p99==1)&&(p150==1))))) + (p50==1)) + (EF(!(EX((p56==1)))) * (p139==1))))
=> equivalent forward existential formula: (([(FwdU(Init,EX(((p152==1) + E(TRUE U !(EX(!((p165==1)))))))) * !(E(TRUE U !(!(EX(!(!((E(!(((p99==1)&&(p150==1)...456
Reverse transition relation is NOT exact ! Due to transitions t3, t24, t25, t29, t33, t36, t41, t51, t54, t58, t61, t62, t66, t71, t75, t80, t85, t95, t106...263
(forward)formula 0,1,5.98032,205868,1,0,1053,1.04427e+06,343,611,3725,1.55257e+06,1273
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 134 transition count 184
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 134 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 134 transition count 181
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 80 place count 115 transition count 159
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 115 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 115 transition count 157
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 106 transition count 144
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 106 transition count 144
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 106 transition count 139
Applied a total of 124 rules in 11 ms. Remains 106 /163 variables (removed 57) and now considering 139/218 (removed 79) transitions.
// Phase 1: matrix 139 rows 106 cols
[2025-06-07 17:37:02] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-07 17:37:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:03] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-06-07 17:37:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/245 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 0/245 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 117 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3840 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/245 variables, 106/117 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 138/255 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:08] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:09] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:10] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:10] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 259 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7681 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11533ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 11534ms
Starting structural reductions in LTL mode, iteration 1 : 106/163 places, 139/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11656 ms. Remains : 106/163 places, 139/218 transitions.
[2025-06-07 17:37:14] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:37:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:37:14] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-07 17:37:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:37:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability13886987538800438954.gal : 1 ms
[2025-06-07 17:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability6579488166611683220.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13886987538800438954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6579488166611683220.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26156e+10,0.032984,5148,2,537,5,5765,6,0,565,4665,0


Converting to forward existential form...Done !
original formula: AX(AX(AG(((p77==0)||(p107==0)))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(((p77==0)||(p107==0))))] = FALSE
(forward)formula 0,0,0.05177,5404,1,0,11,6650,10,2,1065,5416,5
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 142 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 142 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 142 transition count 193
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 130 transition count 178
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 130 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 130 transition count 177
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 124 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 124 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 124 transition count 166
Applied a total of 83 rules in 12 ms. Remains 124 /163 variables (removed 39) and now considering 166/218 (removed 52) transitions.
// Phase 1: matrix 166 rows 124 cols
[2025-06-07 17:37:14] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 17:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:14] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-07 17:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:15] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/290 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 136 constraints, problems are : Problem set: 0 solved, 165 unsolved in 5849 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/290 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 165/301 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:22] [INFO ] Deduced a trap along path composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:26] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:26] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:26] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/290 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (OVERLAPS) 0/290 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 305 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11892 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17753ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 17753ms
Starting structural reductions in LTL mode, iteration 1 : 124/163 places, 166/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17898 ms. Remains : 124/163 places, 166/218 transitions.
[2025-06-07 17:37:32] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:37:32] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:37:32] [INFO ] Input system was already deterministic with 166 transitions.
[2025-06-07 17:37:32] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:37:32] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:37:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9705883568527732464.gal : 1 ms
[2025-06-07 17:37:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11200514657886762295.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9705883568527732464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11200514657886762295.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.34816e+11,0.046126,5552,2,703,5,7288,6,0,664,6334,0


Converting to forward existential form...Done !
original formula: E((EX(E(EF((p16==1)) U (((p39==1)&&(p88==1))&&((p72==1)&&((p178==1)||(p53==1)))))) + (p10==1)) U E(EF(((p206==1)&&(((p65==1)||((p137==1)&...207
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(EX(E(E(TRUE U (p16==1)) U (((p39==1)&&(p88==1))&&((p72==1)&&((p178==1)||(p53==1)))))) + (p10==...266
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t26, t29, t32, t39, t40, t44, t49, t50, t54, t60, t64, t69, t73, t84, t98, t110, t11...258
(forward)formula 0,1,17.6449,544372,1,0,1261,2.86739e+06,368,811,4012,4.27497e+06,1334
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 136 transition count 186
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 136 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 136 transition count 183
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 73 place count 120 transition count 165
Iterating global reduction 1 with 16 rules applied. Total rules applied 89 place count 120 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 120 transition count 164
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 98 place count 112 transition count 152
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 112 transition count 152
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 112 transition count 147
Applied a total of 111 rules in 8 ms. Remains 112 /163 variables (removed 51) and now considering 147/218 (removed 71) transitions.
// Phase 1: matrix 147 rows 112 cols
[2025-06-07 17:37:50] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 17:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:37:50] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-07 17:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/259 variables, 112/123 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 0/259 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 123 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4219 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/259 variables, 112/123 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 146/269 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:56] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:57] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:37:57] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:00] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/259 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:01] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 274 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11195 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 15425ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 15425ms
Starting structural reductions in LTL mode, iteration 1 : 112/163 places, 147/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15569 ms. Remains : 112/163 places, 147/218 transitions.
[2025-06-07 17:38:06] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:38:06] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:38:06] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-07 17:38:06] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:38:06] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:38:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4157530008488562648.gal : 1 ms
[2025-06-07 17:38:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14519534160114023120.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4157530008488562648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14519534160114023120.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.16214e+10,0.036458,5192,2,572,5,6107,6,0,597,4938,0


Converting to forward existential form...Done !
original formula: EG(((EF((((p177==1)&&(p189==1)) * ((p152==1) + AF(((p177==1)&&(p189==1)))))) + E(EX(((p41==1)&&(p118==1))) U ((p58==1)&&(p110==1)))) + AG...168
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (((p177==1)&&(p189==1)) * ((p152==1) + !(EG(!(((p177==1)&&(p189==1)))))))) + E(EX(((p41==1...235
Reverse transition relation is NOT exact ! Due to transitions t3, t23, t24, t28, t33, t38, t45, t46, t50, t56, t60, t66, t70, t80, t90, t101, t110, Inters...248
(forward)formula 0,1,6.69144,193488,1,0,1178,952233,334,661,3610,1.4775e+06,1277
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Graph (trivial) has 162 edges and 163 vertex of which 41 / 163 are part of one of the 6 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 127 transition count 137
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 57 rules applied. Total rules applied 97 place count 88 transition count 119
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 106 place count 79 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 106 place count 79 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 77 transition count 117
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 126 place count 61 transition count 96
Iterating global reduction 3 with 16 rules applied. Total rules applied 142 place count 61 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 61 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 144 place count 61 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 150 place count 58 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 56 transition count 84
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 56 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 56 transition count 82
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 198 place count 35 transition count 61
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 201 place count 32 transition count 53
Iterating global reduction 5 with 3 rules applied. Total rules applied 204 place count 32 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 207 place count 32 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 30 transition count 48
Applied a total of 209 rules in 17 ms. Remains 30 /163 variables (removed 133) and now considering 48/218 (removed 170) transitions.
[2025-06-07 17:38:12] [INFO ] Flow matrix only has 28 transitions (discarded 20 similar events)
// Phase 1: matrix 28 rows 30 cols
[2025-06-07 17:38:12] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-07 17:38:12] [INFO ] Flow matrix only has 28 transitions (discarded 20 similar events)
[2025-06-07 17:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:12] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-07 17:38:12] [INFO ] Flow matrix only has 28 transitions (discarded 20 similar events)
[2025-06-07 17:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/57 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/58 variables, and 41 constraints, problems are : Problem set: 0 solved, 24 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 27/57 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 24/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/57 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/58 variables, and 65 constraints, problems are : Problem set: 0 solved, 24 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 610ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/163 places, 48/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 705 ms. Remains : 30/163 places, 48/218 transitions.
[2025-06-07 17:38:13] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:38:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:13] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 708 steps (38 resets) in 7 ms. (88 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 17:38:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:13] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:38:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7105006037050365099.gal : 1 ms
[2025-06-07 17:38:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1236051130448166177.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7105006037050365099.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1236051130448166177.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 135 transition count 185
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 135 transition count 185
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 135 transition count 182
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 78 place count 116 transition count 157
Iterating global reduction 1 with 19 rules applied. Total rules applied 97 place count 116 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 100 place count 116 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 108 place count 108 transition count 142
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 108 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 108 transition count 138
Applied a total of 120 rules in 4 ms. Remains 108 /163 variables (removed 55) and now considering 138/218 (removed 80) transitions.
// Phase 1: matrix 138 rows 108 cols
[2025-06-07 17:38:13] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:13] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 17:38:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:13] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2025-06-07 17:38:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/246 variables, 108/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 119 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3716 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/246 variables, 108/119 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 137/256 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:19] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:20] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:20] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 259 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7827 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 11550ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 11550ms
Starting structural reductions in LTL mode, iteration 1 : 108/163 places, 138/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11661 ms. Remains : 108/163 places, 138/218 transitions.
[2025-06-07 17:38:25] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:38:25] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:38:25] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-07 17:38:25] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:38:25] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:38:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13821924590997718033.gal : 0 ms
[2025-06-07 17:38:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10033826874592205226.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13821924590997718033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10033826874592205226.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.78836e+10,0.033868,5100,2,551,5,5720,6,0,572,4653,0


Converting to forward existential form...Done !
original formula: AG(AX((AG((p117==0)) * (p26==0))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),TRUE) * !((p117==0)))] = FALSE * [(EY(FwdU(Init,TRUE)) * !((p26==0)))] = FALSE)
(forward)formula 0,0,0.041617,5356,1,0,9,5720,9,2,926,4653,2
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Graph (trivial) has 132 edges and 163 vertex of which 26 / 163 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 140 transition count 161
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 46 rules applied. Total rules applied 78 place count 109 transition count 146
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 89 place count 102 transition count 142
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 93 place count 98 transition count 142
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 93 place count 98 transition count 136
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 105 place count 92 transition count 136
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 122 place count 75 transition count 114
Iterating global reduction 4 with 17 rules applied. Total rules applied 139 place count 75 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 75 transition count 112
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 141 place count 75 transition count 110
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 73 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 72 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 72 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 148 place count 72 transition count 106
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 194 place count 49 transition count 82
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 48 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 48 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 48 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 199 place count 46 transition count 75
Applied a total of 199 rules in 27 ms. Remains 46 /163 variables (removed 117) and now considering 75/218 (removed 143) transitions.
[2025-06-07 17:38:25] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
// Phase 1: matrix 66 rows 46 cols
[2025-06-07 17:38:25] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-07 17:38:25] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
[2025-06-07 17:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:25] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-07 17:38:25] [INFO ] Flow matrix only has 66 transitions (discarded 9 similar events)
[2025-06-07 17:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 5/46 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 65/111 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 57 constraints, problems are : Problem set: 0 solved, 50 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 5/46 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 65/111 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 107 constraints, problems are : Problem set: 0 solved, 50 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1584ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1585ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/163 places, 75/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1691 ms. Remains : 46/163 places, 75/218 transitions.
[2025-06-07 17:38:26] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:38:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:26] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-07 17:38:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2765080281571488428.gal : 0 ms
[2025-06-07 17:38:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12081036015227794533.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2765080281571488428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12081036015227794533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.6288e+06,0.013737,4216,2,82,5,840,6,0,258,588,0


Converting to forward existential form...Done !
original formula: EG((E(((p58==1)&&(p107==1)) U ((A((p185==1) U (p66==1)) * (E((p170==1) U (p131==1)) + E((p12==1) U (p16==1)))) + (AF(((p158==1)&&(p205==1...207
=> equivalent forward existential formula: [FwdG(Init,(E(((p58==1)&&(p107==1)) U ((!((E(!((p66==1)) U (!((p185==1)) * !((p66==1)))) + EG(!((p66==1))))) * (...313
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 73/0/2
Hit Full ! (commute/partial/dont) 73/0/2
Hit Full ! (commute/partial/dont) 73/0/2
Hit Full ! (commute/partial/dont) 73/0/2
Hit Full ! (commute/partial/dont) 66/0/9
Hit Full ! (commute/partial/dont) 64/10/11
(forward)formula 0,1,0.164495,11128,1,0,69,34922,66,57,1466,51791,79
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Graph (trivial) has 161 edges and 163 vertex of which 38 / 163 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 130 transition count 140
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 58 rules applied. Total rules applied 99 place count 90 transition count 122
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 108 place count 81 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 108 place count 81 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 79 transition count 120
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 129 place count 62 transition count 98
Iterating global reduction 3 with 17 rules applied. Total rules applied 146 place count 62 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 62 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 148 place count 62 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 156 place count 58 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 56 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 56 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 56 transition count 83
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 202 place count 36 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 33 transition count 55
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 33 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 211 place count 33 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 31 transition count 50
Applied a total of 213 rules in 15 ms. Remains 31 /163 variables (removed 132) and now considering 50/218 (removed 168) transitions.
[2025-06-07 17:38:27] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
// Phase 1: matrix 30 rows 31 cols
[2025-06-07 17:38:27] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 17:38:27] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-07 17:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:27] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-07 17:38:27] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-07 17:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 29/60 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 42 constraints, problems are : Problem set: 0 solved, 25 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/31 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 29/60 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 67 constraints, problems are : Problem set: 0 solved, 25 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 634ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/163 places, 50/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 720 ms. Remains : 31/163 places, 50/218 transitions.
[2025-06-07 17:38:27] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:38:27] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:38:27] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 132 steps (4 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 17:38:27] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:27] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13367967550109134823.gal : 1 ms
[2025-06-07 17:38:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2686361350584987523.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13367967550109134823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2686361350584987523.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 194
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 141 transition count 192
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 127 transition count 175
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 127 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 127 transition count 173
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 121 transition count 164
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 121 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 121 transition count 162
Applied a total of 90 rules in 5 ms. Remains 121 /163 variables (removed 42) and now considering 162/218 (removed 56) transitions.
// Phase 1: matrix 162 rows 121 cols
[2025-06-07 17:38:27] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 17:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:28] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-07 17:38:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:29] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/283 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 133 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5598 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/283 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 161/294 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:35] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:36] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:37] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:37] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 298 constraints, problems are : Problem set: 0 solved, 161 unsolved in 9203 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14810ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14811ms
Starting structural reductions in LTL mode, iteration 1 : 121/163 places, 162/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14937 ms. Remains : 121/163 places, 162/218 transitions.
[2025-06-07 17:38:42] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:38:42] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:38:42] [INFO ] Input system was already deterministic with 162 transitions.
[2025-06-07 17:38:42] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:38:42] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:38:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8199787678708205589.gal : 1 ms
[2025-06-07 17:38:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9794943138893659210.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8199787678708205589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9794943138893659210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04789e+11,0.044105,5536,2,702,5,7538,6,0,648,6899,0


Converting to forward existential form...Done !
original formula: (AX(AF((((p58==1)&&(p91==1)) + EF((((p58==1)&&(p107==1))&&(p8==1)))))) + AG((((p109==1) + EX((p72==0))) + (((!(A((p26==1) U (p207==1))) +...208
=> equivalent forward existential formula: [(((FwdU((Init * !(!(EX(!(!(EG(!((((p58==1)&&(p91==1)) + E(TRUE U (((p58==1)&&(p107==1))&&(p8==1)))))))))))),TRU...336
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t60, t65, t69, t75, t80, t91, t93,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.34832,213132,1,0,1640,1.22502e+06,374,892,4062,1.61057e+06,1871
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Graph (trivial) has 159 edges and 163 vertex of which 41 / 163 are part of one of the 6 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 127 transition count 141
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 53 rules applied. Total rules applied 89 place count 92 transition count 123
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 98 place count 83 transition count 123
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 98 place count 83 transition count 119
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 79 transition count 119
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 121 place count 64 transition count 99
Iterating global reduction 3 with 15 rules applied. Total rules applied 136 place count 64 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 64 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 138 place count 64 transition count 94
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 144 place count 61 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 146 place count 59 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 59 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 150 place count 59 transition count 85
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 192 place count 38 transition count 64
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 195 place count 35 transition count 56
Iterating global reduction 5 with 3 rules applied. Total rules applied 198 place count 35 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 201 place count 35 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 203 place count 33 transition count 51
Applied a total of 203 rules in 16 ms. Remains 33 /163 variables (removed 130) and now considering 51/218 (removed 167) transitions.
[2025-06-07 17:38:50] [INFO ] Flow matrix only has 35 transitions (discarded 16 similar events)
// Phase 1: matrix 35 rows 33 cols
[2025-06-07 17:38:50] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 17:38:50] [INFO ] Flow matrix only has 35 transitions (discarded 16 similar events)
[2025-06-07 17:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:50] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:38:50] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-07 17:38:50] [INFO ] Flow matrix only has 35 transitions (discarded 16 similar events)
[2025-06-07 17:38:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 34/67 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/67 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/68 variables, and 44 constraints, problems are : Problem set: 0 solved, 27 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 34/67 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/68 variables, and 71 constraints, problems are : Problem set: 0 solved, 27 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 729ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/163 places, 51/218 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 819 ms. Remains : 33/163 places, 51/218 transitions.
[2025-06-07 17:38:51] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:38:51] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:38:51] [INFO ] Input system was already deterministic with 51 transitions.
[2025-06-07 17:38:51] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:38:51] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4955482519083788351.gal : 0 ms
[2025-06-07 17:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4056691622361636907.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4955482519083788351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4056691622361636907.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,97200,0.008132,4148,2,56,5,710,6,0,180,453,0


Converting to forward existential form...Done !
original formula: AG((EF((p113==1)) + (p93==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p93==1))) * !(E(TRUE U (p113==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.018628,4532,1,0,12,2865,16,5,825,1981,6
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 218/218 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 135 transition count 185
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 135 transition count 185
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 135 transition count 182
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 77 place count 117 transition count 160
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 117 transition count 160
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 97 place count 117 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 110 transition count 147
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 110 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 116 place count 110 transition count 142
Applied a total of 116 rules in 4 ms. Remains 110 /163 variables (removed 53) and now considering 142/218 (removed 76) transitions.
// Phase 1: matrix 142 rows 110 cols
[2025-06-07 17:38:51] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 17:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:38:51] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2025-06-07 17:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/252 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 0/252 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 121 constraints, problems are : Problem set: 0 solved, 141 unsolved in 4013 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/252 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 141/262 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:57] [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/252 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:57] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:57] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:38:58] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:39:01] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/252 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 267 constraints, problems are : Problem set: 0 solved, 141 unsolved in 10173 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14195ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 14195ms
Starting structural reductions in LTL mode, iteration 1 : 110/163 places, 142/218 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14302 ms. Remains : 110/163 places, 142/218 transitions.
[2025-06-07 17:39:05] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:39:05] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:39:05] [INFO ] Input system was already deterministic with 142 transitions.
[2025-06-07 17:39:05] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:39:05] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:39:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6824983554725427675.gal : 1 ms
[2025-06-07 17:39:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11755616414435033481.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6824983554725427675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11755616414435033481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.34545e+10,0.04484,5284,2,590,5,6488,6,0,584,5586,0


Converting to forward existential form...Done !
original formula: E(EX(EF((AX(((p99==1)&&(p169==1))) * EF((p95==1))))) U (p159==1))
=> equivalent forward existential formula: [(FwdU(Init,EX(E(TRUE U (!(EX(!(((p99==1)&&(p169==1))))) * E(TRUE U (p95==1)))))) * (p159==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t23, t27, t35, t38, t44, t45, t46, t50, t56, t60, t65, t68, t80, t90, t100, t109, I...253
(forward)formula 0,1,4.27553,143076,1,0,613,699610,312,385,3504,975691,766
FORMULA Champagne-PT-H04T0R-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2025-06-07 17:39:09] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:39:09] [INFO ] Flatten gal took : 4 ms
Total runtime 243684 ms.

BK_STOP 1749317949848

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-H04T0R"
export BK_EXAMINATION="CTLFireability"
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-H04T0R, examination is CTLFireability"
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-174931339100002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H04T0R.tgz
mv Champagne-PT-H04T0R execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;