Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339100026.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Champagne-PT-H05T0R, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339100026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.6K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 60K Jun 5 20:08 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H05T0R-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749318187156

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-H05T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 17:43:08] [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:43:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:43:08] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-07 17:43:08] [INFO ] Transformed 299 places.
[2025-06-07 17:43:08] [INFO ] Transformed 386 transitions.
[2025-06-07 17:43:08] [INFO ] Found NUPN structural information;
[2025-06-07 17:43:08] [INFO ] Parsed PT model containing 299 places and 386 transitions and 966 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 88 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 386/386 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 248 transition count 335
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 248 transition count 335
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 126 place count 224 transition count 311
Iterating global reduction 0 with 24 rules applied. Total rules applied 150 place count 224 transition count 311
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 155 place count 219 transition count 306
Iterating global reduction 0 with 5 rules applied. Total rules applied 160 place count 219 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 161 place count 219 transition count 305
Applied a total of 161 rules in 68 ms. Remains 219 /299 variables (removed 80) and now considering 305/386 (removed 81) transitions.
// Phase 1: matrix 305 rows 219 cols
[2025-06-07 17:43:08] [INFO ] Computed 15 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:43:09] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-06-07 17:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:43:09] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-07 17:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:12] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:13] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:13] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:13] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:13] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:13] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:14] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/524 variables, 219/241 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/524 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 241 constraints, problems are : Problem set: 0 solved, 304 unsolved in 19669 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/524 variables, 219/241 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 304/545 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:32] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 43 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:43:33] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:33] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:34] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:34] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:34] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:37] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:37] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:38] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:38] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:38] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:38] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:38] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:38] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:39] [INFO ] Deduced a trap composed of 25 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:43:39] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 13/570 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:43] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:48] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:49] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:50] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:51] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 575 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49788ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 49800ms
Starting structural reductions in LTL mode, iteration 1 : 219/299 places, 305/386 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50321 ms. Remains : 219/299 places, 305/386 transitions.
Support contains 88 out of 219 places after structural reductions.
[2025-06-07 17:43:59] [INFO ] Flatten gal took : 41 ms
[2025-06-07 17:43:59] [INFO ] Flatten gal took : 18 ms
[2025-06-07 17:43:59] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 86 out of 219 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (225 resets) in 1631 ms. (24 steps per ms) remains 4/72 properties
BEST_FIRST walk for 40004 steps (21 resets) in 116 ms. (341 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (21 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (11 resets) in 112 ms. (353 steps per ms) remains 2/3 properties
[2025-06-07 17:43:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 133/140 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:00] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 79/219 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 305/524 variables, 219/235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/524 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 236 constraints, problems are : Problem set: 1 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/219 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 305/524 variables, 219/236 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/524 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 237 constraints, problems are : Problem set: 1 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 211 edges and 219 vertex of which 37 / 219 are part of one of the 6 SCC in 2 ms
Free SCC test removed 31 places
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 188 transition count 213
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 75 rules applied. Total rules applied 126 place count 138 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 138 place count 126 transition count 188
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 138 place count 126 transition count 185
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 123 transition count 185
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 171 place count 96 transition count 149
Iterating global reduction 3 with 27 rules applied. Total rules applied 198 place count 96 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 201 place count 96 transition count 146
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 201 place count 96 transition count 139
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 215 place count 89 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 218 place count 86 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 221 place count 86 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 224 place count 86 transition count 127
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 296 place count 50 transition count 91
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 301 place count 45 transition count 74
Iterating global reduction 5 with 5 rules applied. Total rules applied 306 place count 45 transition count 74
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 311 place count 45 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 315 place count 43 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 319 place count 43 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 323 place count 43 transition count 67
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 345 place count 43 transition count 45
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 7 with 54 rules applied. Total rules applied 399 place count 21 transition count 13
Ensure Unique test removed 8 places
Iterating post reduction 8 with 8 rules applied. Total rules applied 407 place count 13 transition count 13
Applied a total of 407 rules in 46 ms. Remains 13 /219 variables (removed 206) and now considering 13/305 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 13/219 places, 13/305 transitions.
RANDOM walk for 121 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-07 17:44:00] [INFO ] Flatten gal took : 13 ms
[2025-06-07 17:44:00] [INFO ] Flatten gal took : 13 ms
[2025-06-07 17:44:00] [INFO ] Input system was already deterministic with 305 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 180 transition count 257
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 180 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 82 place count 180 transition count 253
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 98 place count 164 transition count 237
Iterating global reduction 1 with 16 rules applied. Total rules applied 114 place count 164 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 164 transition count 236
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 128 place count 151 transition count 208
Iterating global reduction 2 with 13 rules applied. Total rules applied 141 place count 151 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 148 place count 151 transition count 201
Applied a total of 148 rules in 10 ms. Remains 151 /219 variables (removed 68) and now considering 201/305 (removed 104) transitions.
// Phase 1: matrix 201 rows 151 cols
[2025-06-07 17:44:00] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 17:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:00] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-06-07 17:44:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 201/352 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/352 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 166 constraints, problems are : Problem set: 0 solved, 200 unsolved in 7475 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 201/352 variables, 151/166 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 200/366 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:13] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:13] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 5 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/352 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:14] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:16] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:16] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:17] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:19] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:22] [INFO ] Deduced a trap along path composed of 9 places in 56 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:25] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:28] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 376 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37510ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 37512ms
Starting structural reductions in LTL mode, iteration 1 : 151/219 places, 201/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37683 ms. Remains : 151/219 places, 201/305 transitions.
[2025-06-07 17:44:38] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:44:38] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:44:38] [INFO ] Input system was already deterministic with 201 transitions.
[2025-06-07 17:44:38] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:44:38] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:44:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8495329311131235695.gal : 5 ms
[2025-06-07 17:44:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9190733960843266208.ctl : 4 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/CTLFireability8495329311131235695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9190733960843266208.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,2.50165e+14,0.075343,6384,2,897,5,12000,6,0,807,10226,0


Converting to forward existential form...Done !
original formula: EX(EF(AX(((p270==1) + (EX((p37==1)) * ((p65==1)||(p188==1)))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(!(((p270==1) + (EX((p37==1)) * ((p65==1)||(p188==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t61, t66, t70, t75, t76, t80, t86, t90,...303
(forward)formula 0,1,0.637184,26700,1,0,332,127551,421,177,4993,108457,418
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 185 transition count 265
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 185 transition count 265
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 71 place count 185 transition count 262
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 87 place count 169 transition count 246
Iterating global reduction 1 with 16 rules applied. Total rules applied 103 place count 169 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 169 transition count 244
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 116 place count 158 transition count 222
Iterating global reduction 2 with 11 rules applied. Total rules applied 127 place count 158 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 132 place count 158 transition count 217
Applied a total of 132 rules in 14 ms. Remains 158 /219 variables (removed 61) and now considering 217/305 (removed 88) transitions.
// Phase 1: matrix 217 rows 158 cols
[2025-06-07 17:44:38] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-07 17:44:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-07 17:44:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 25 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:44:41] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 24 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:44:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:41] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/375 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/375 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 186 constraints, problems are : Problem set: 0 solved, 216 unsolved in 10273 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/375 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 216/402 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:51] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:53] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:55] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:55] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:56] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:57] [INFO ] Deduced a trap composed of 31 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:44:57] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:59] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/375 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/375 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 410 constraints, problems are : Problem set: 0 solved, 216 unsolved in 23020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33324ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 33325ms
Starting structural reductions in LTL mode, iteration 1 : 158/219 places, 217/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33489 ms. Remains : 158/219 places, 217/305 transitions.
[2025-06-07 17:45:12] [INFO ] Flatten gal took : 11 ms
[2025-06-07 17:45:12] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:45:12] [INFO ] Input system was already deterministic with 217 transitions.
[2025-06-07 17:45:12] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:45:12] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:45:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2028639723500582108.gal : 3 ms
[2025-06-07 17:45:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17926805836874381846.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/CTLFireability2028639723500582108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17926805836874381846.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.84029e+14,0.099657,7896,2,1193,5,20203,6,0,851,17995,0


Converting to forward existential form...Done !
original formula: (E(AF(((E((p287==1) U (p277==1)) * (p262==1)) + AX(!(((p157==1)&&(p209==1)))))) U (((!(((p222==1) + A(((p138==1)&&(p190==1)) U (p238==1))...282
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(!(EG(!(((E((p287==1) U (p277==1)) * (p262==1)) + !(EX(!(!(((p157==1)&&(p209==1)))))))))) U ...397
Reverse transition relation is NOT exact ! Due to transitions t4, t11, t26, t27, t28, t32, t37, t40, t47, t48, t49, t53, t59, t60, t64, t66, t71, t75, t80,...347
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-07 17:45:42] [INFO ] Flatten gal took : 11 ms
[2025-06-07 17:45:42] [INFO ] Applying decomposition
[2025-06-07 17:45:42] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11799607392794025964.txt' '-o' '/tmp/graph11799607392794025964.bin' '-w' '/tmp/graph11799607392794025964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11799607392794025964.bin' '-l' '-1' '-v' '-w' '/tmp/graph11799607392794025964.weights' '-q' '0' '-e' '0.001'
[2025-06-07 17:45:42] [INFO ] Decomposing Gal with order
[2025-06-07 17:45:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:45:42] [INFO ] Removed a total of 138 redundant transitions.
[2025-06-07 17:45:42] [INFO ] Flatten gal took : 44 ms
[2025-06-07 17:45:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-07 17:45:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16407776002694806640.gal : 4 ms
[2025-06-07 17:45:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15259935489767032314.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/CTLFireability16407776002694806640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15259935489767032314.ctl'

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 -...264
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.84029e+14,0.07108,7216,1049,32,6733,630,435,5984,80,1405,0


Converting to forward existential form...Done !
original formula: (E(AF(((E((i15.u44.p287==1) U (i14.i1.u42.p277==1)) * (i14.i1.u42.p262==1)) + AX(!(((i8.u20.p157==1)&&(i11.u31.p209==1)))))) U (((!(((i12...417
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(!(EG(!(((E((i15.u44.p287==1) U (i14.i1.u42.p277==1)) * (i14.i1.u42.p262==1)) + !(EX(!(!(((i...548
Reverse transition relation is NOT exact ! Due to transitions t4, t27, t48, t59, t83, t103, t142, i1.t156, i2.t147, i3.u7.t133, i3.u8.t137, i4.t127, i5.t11...512
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,13.0516,419340,1,0,758025,1285,3084,1.14767e+06,492,3456,908257
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 192 edges and 219 vertex of which 29 / 219 are part of one of the 5 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 194 transition count 228
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 74 rules applied. Total rules applied 123 place count 146 transition count 202
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 139 place count 133 transition count 199
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 143 place count 130 transition count 198
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 143 place count 130 transition count 191
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 157 place count 123 transition count 191
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 185 place count 95 transition count 154
Iterating global reduction 4 with 28 rules applied. Total rules applied 213 place count 95 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 216 place count 95 transition count 151
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 216 place count 95 transition count 145
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 228 place count 89 transition count 145
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 231 place count 86 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 234 place count 86 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 237 place count 86 transition count 133
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 301 place count 54 transition count 101
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 305 place count 50 transition count 86
Iterating global reduction 6 with 4 rules applied. Total rules applied 309 place count 50 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 313 place count 50 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 315 place count 48 transition count 80
Applied a total of 315 rules in 31 ms. Remains 48 /219 variables (removed 171) and now considering 80/305 (removed 225) transitions.
[2025-06-07 17:45:55] [INFO ] Flow matrix only has 55 transitions (discarded 25 similar events)
// Phase 1: matrix 55 rows 48 cols
[2025-06-07 17:45:55] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:55] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 17:45:55] [INFO ] Flow matrix only has 55 transitions (discarded 25 similar events)
[2025-06-07 17:45:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:56] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:45:56] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-07 17:45:56] [INFO ] Flow matrix only has 55 transitions (discarded 25 similar events)
[2025-06-07 17:45:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 4/48 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 54/102 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/103 variables, and 63 constraints, problems are : Problem set: 0 solved, 51 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 4/48 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 54/102 variables, 48/63 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/103 variables, and 114 constraints, problems are : Problem set: 0 solved, 51 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1649ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1650ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/219 places, 80/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1784 ms. Remains : 48/219 places, 80/305 transitions.
[2025-06-07 17:45:57] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:45:57] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:45:57] [INFO ] Input system was already deterministic with 80 transitions.
[2025-06-07 17:45:57] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:45:57] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:45:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7093913789432938735.gal : 1 ms
[2025-06-07 17:45:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13362230231386152882.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/CTLFireability7093913789432938735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13362230231386152882.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.79159e+07,0.010355,4272,2,82,5,930,6,0,270,581,0


Converting to forward existential form...Done !
original formula: EF(AG(((AG((p179==0)) * A((p179==1) U (p217==1))) * (AG((p277==0)) + ((p217==0) * (EG((p99==1)) + EG((p283==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(E(TRUE U !((p179==0)))) * !((E(!((p217==1)) U (!((p179==1)) * !((p217==1)))...270
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 75/0/5
Hit Full ! (commute/partial/dont) 75/0/5
(forward)formula 0,0,0.083752,7600,1,0,29,21575,47,16,1374,20420,24
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-02 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 : 219/219 places, 305/305 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 177 transition count 254
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 177 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 88 place count 177 transition count 250
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 105 place count 160 transition count 233
Iterating global reduction 1 with 17 rules applied. Total rules applied 122 place count 160 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 160 transition count 232
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 137 place count 146 transition count 200
Iterating global reduction 2 with 14 rules applied. Total rules applied 151 place count 146 transition count 200
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 159 place count 146 transition count 192
Applied a total of 159 rules in 7 ms. Remains 146 /219 variables (removed 73) and now considering 192/305 (removed 113) transitions.
// Phase 1: matrix 192 rows 146 cols
[2025-06-07 17:45:57] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 17:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2025-06-07 17:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 192/338 variables, 146/161 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 161 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6956 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 192/338 variables, 146/161 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 191/352 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:08] [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/338 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:09] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:09] [INFO ] Deduced a trap composed of 29 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:46:10] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:10] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:11] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:16] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 11 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/338 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:21] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/338 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (OVERLAPS) 0/338 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 360 constraints, problems are : Problem set: 0 solved, 191 unsolved in 26425 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33395ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 33395ms
Starting structural reductions in LTL mode, iteration 1 : 146/219 places, 192/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33546 ms. Remains : 146/219 places, 192/305 transitions.
[2025-06-07 17:46:31] [INFO ] Flatten gal took : 13 ms
[2025-06-07 17:46:31] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:46:31] [INFO ] Input system was already deterministic with 192 transitions.
[2025-06-07 17:46:31] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:46:31] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:46:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12340530239451697302.gal : 1 ms
[2025-06-07 17:46:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15246324596287932902.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/CTLFireability12340530239451697302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15246324596287932902.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,1.52174e+14,0.057557,6112,2,824,5,10426,6,0,778,8345,0


Converting to forward existential form...Done !
original formula: AG(((p9==1) + EX(EX(((p216==1)||(p100==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p9==1))) * !(EX(EX(((p216==1)||(p100==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t23, t24, t28, t33, t37, t42, t43, t47, t53, t57, t62, t66, t71, t72, t76, t82, t86, t92,...297
(forward)formula 0,0,0.473464,21600,1,0,313,102458,402,168,4482,81473,396
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-03 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 : 219/219 places, 305/305 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 179 transition count 256
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 179 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 84 place count 179 transition count 252
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 101 place count 162 transition count 235
Iterating global reduction 1 with 17 rules applied. Total rules applied 118 place count 162 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 162 transition count 233
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 133 place count 149 transition count 202
Iterating global reduction 2 with 13 rules applied. Total rules applied 146 place count 149 transition count 202
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 154 place count 149 transition count 194
Applied a total of 154 rules in 14 ms. Remains 149 /219 variables (removed 70) and now considering 194/305 (removed 111) transitions.
// Phase 1: matrix 194 rows 149 cols
[2025-06-07 17:46:31] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 17:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:32] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-07 17:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:33] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:33] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/343 variables, 149/168 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 168 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8252 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/343 variables, 149/168 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 193/361 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:42] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:42] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:42] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:43] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:43] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:44] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:45] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:47] [INFO ] Deduced a trap along path composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:49] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:49] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:51] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:57] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:57] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 6 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/343 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 15 (OVERLAPS) 0/343 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 375 constraints, problems are : Problem set: 0 solved, 193 unsolved in 28985 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37250ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 37251ms
Starting structural reductions in LTL mode, iteration 1 : 149/219 places, 194/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37406 ms. Remains : 149/219 places, 194/305 transitions.
[2025-06-07 17:47:09] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:47:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:47:09] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-07 17:47:09] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:47:09] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:47:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11693366033703661370.gal : 1 ms
[2025-06-07 17:47:09] [INFO ] Time to serialize properties into /tmp/CTLFireability850582308083272757.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/CTLFireability11693366033703661370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability850582308083272757.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.97429e+14,0.08332,7032,2,1024,5,15656,6,0,792,13967,0


Converting to forward existential form...Done !
original formula: EX((EF((EF((p18==1)) * EG(((p173==1)&&(p142==1))))) * AG(EF((p98==0)))))
=> equivalent forward existential formula: [((EY(Init) * E(TRUE U (E(TRUE U (p18==1)) * EG(((p173==1)&&(p142==1)))))) * !(E(TRUE U !(E(TRUE U (p98==0))))))...165
Reverse transition relation is NOT exact ! Due to transitions t4, t23, t24, t28, t33, t37, t42, t43, t47, t53, t57, t62, t67, t74, t75, t79, t84, t86, t90,...314
(forward)formula 0,1,8.62904,243680,1,0,728,1.3453e+06,417,342,4819,1.42441e+06,924
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 206 edges and 219 vertex of which 31 / 219 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 192 transition count 222
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 75 rules applied. Total rules applied 128 place count 140 transition count 199
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 141 place count 129 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 127 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 143 place count 127 transition count 195
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 147 place count 125 transition count 195
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 175 place count 97 transition count 158
Iterating global reduction 4 with 28 rules applied. Total rules applied 203 place count 97 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 206 place count 97 transition count 155
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 206 place count 97 transition count 148
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 220 place count 90 transition count 148
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 223 place count 87 transition count 139
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 87 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 229 place count 87 transition count 136
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 299 place count 52 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 300 place count 52 transition count 100
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 304 place count 48 transition count 87
Iterating global reduction 7 with 4 rules applied. Total rules applied 308 place count 48 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 312 place count 48 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 314 place count 46 transition count 81
Applied a total of 314 rules in 27 ms. Remains 46 /219 variables (removed 173) and now considering 81/305 (removed 224) transitions.
[2025-06-07 17:47:18] [INFO ] Flow matrix only has 52 transitions (discarded 29 similar events)
// Phase 1: matrix 52 rows 46 cols
[2025-06-07 17:47:18] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 17:47:18] [INFO ] Flow matrix only has 52 transitions (discarded 29 similar events)
[2025-06-07 17:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:18] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:47:18] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2025-06-07 17:47:18] [INFO ] Flow matrix only has 52 transitions (discarded 29 similar events)
[2025-06-07 17:47: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/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 51/97 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/98 variables, and 61 constraints, problems are : Problem set: 0 solved, 49 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 51/97 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/98 variables, and 110 constraints, problems are : Problem set: 0 solved, 49 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1581ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/219 places, 81/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1701 ms. Remains : 46/219 places, 81/305 transitions.
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:47:19] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:47:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12033322974494819841.gal : 1 ms
[2025-06-07 17:47:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10974970295612378478.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/CTLFireability12033322974494819841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10974970295612378478.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,1.25971e+07,0.01674,4288,2,78,5,1171,6,0,263,848,0


Converting to forward existential form...Done !
original formula: !(E(EG(EF(((p104==1)||((p77==1)&&(p89==1))))) U (p70==1)))
=> equivalent forward existential formula: [(FwdU(Init,EG(E(TRUE U ((p104==1)||((p77==1)&&(p89==1)))))) * (p70==1))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.140971,10304,1,0,77,29357,26,73,1337,50802,115
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 182 transition count 259
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 182 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 182 transition count 255
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 93 place count 167 transition count 240
Iterating global reduction 1 with 15 rules applied. Total rules applied 108 place count 167 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 167 transition count 239
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 121 place count 155 transition count 214
Iterating global reduction 2 with 12 rules applied. Total rules applied 133 place count 155 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 155 transition count 208
Applied a total of 139 rules in 10 ms. Remains 155 /219 variables (removed 64) and now considering 208/305 (removed 97) transitions.
// Phase 1: matrix 208 rows 155 cols
[2025-06-07 17:47:19] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 17:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:20] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2025-06-07 17:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:21] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:21] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:22] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:22] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:22] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/363 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 0/363 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 175 constraints, problems are : Problem set: 0 solved, 207 unsolved in 9498 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/363 variables, 155/175 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 207/382 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:31] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:32] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:33] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:33] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:33] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:34] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:35] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:36] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:36] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:42] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/363 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 13 (OVERLAPS) 0/363 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 392 constraints, problems are : Problem set: 0 solved, 207 unsolved in 23478 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32990ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 32991ms
Starting structural reductions in LTL mode, iteration 1 : 155/219 places, 208/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33132 ms. Remains : 155/219 places, 208/305 transitions.
[2025-06-07 17:47:53] [INFO ] Flatten gal took : 16 ms
[2025-06-07 17:47:53] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:47:53] [INFO ] Input system was already deterministic with 208 transitions.
[2025-06-07 17:47:53] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:47:53] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:47:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15323342508701002152.gal : 1 ms
[2025-06-07 17:47:53] [INFO ] Time to serialize properties into /tmp/CTLFireability16570845816085358928.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/CTLFireability15323342508701002152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16570845816085358928.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,3.54345e+14,0.088278,7504,2,1118,5,17620,6,0,830,15302,0


Converting to forward existential form...Done !
original formula: EF((((p97==1) * AF(E((p80==1) U (p241==1)))) * ((AG((p91==0)) + AX((p223==0))) * ((EF((p76==0)) + (p225==0)) + ((p273==0)||((p20==0)&&(p6...166
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,TRUE) * ((p97==1) * !(EG(!(E((p80==1) U (p241==1))))))) * (!(E(TRUE U !((p91==0)))) + !(EX(...519
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t24, t25, t28, t35, t39, t45, t47, t48, t49, t53, t58, t59, t63, t68, t72, t77, t78,...347
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.66533,271560,1,0,1191,1.51822e+06,456,701,5479,1.86291e+06,1234
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 178 transition count 255
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 178 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 178 transition count 251
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 104 place count 160 transition count 233
Iterating global reduction 1 with 18 rules applied. Total rules applied 122 place count 160 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 160 transition count 231
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 137 place count 147 transition count 203
Iterating global reduction 2 with 13 rules applied. Total rules applied 150 place count 147 transition count 203
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 157 place count 147 transition count 196
Applied a total of 157 rules in 15 ms. Remains 147 /219 variables (removed 72) and now considering 196/305 (removed 109) transitions.
// Phase 1: matrix 196 rows 147 cols
[2025-06-07 17:48:01] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:01] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 17:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:01] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-07 17:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 196/343 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 162 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7216 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 196/343 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 195/357 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:12] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 358 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10550 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17789ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 17789ms
Starting structural reductions in LTL mode, iteration 1 : 147/219 places, 196/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17945 ms. Remains : 147/219 places, 196/305 transitions.
[2025-06-07 17:48:19] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:48:19] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:48:19] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-07 17:48:19] [INFO ] Flatten gal took : 19 ms
[2025-06-07 17:48:19] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability18386215762864451446.gal : 1 ms
[2025-06-07 17:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11415525940410152580.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/CTLFireability18386215762864451446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11415525940410152580.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,1.65239e+14,0.063069,6204,2,851,5,11048,6,0,786,9154,0


Converting to forward existential form...Done !
original formula: E(AX(AF((p88==1))) U AF(AG(EF((p198!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(EG(!((p88==1)))))))) * !(EG(!(!(E(TRUE U !(E(TRUE U (p198!=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t23, t24, t28, t33, t37, t42, t43, t47, t53, t57, t62, t66, t71, t72, t76, t82, t86, t92,...309
(forward)formula 0,1,5.29887,152012,1,0,1035,903074,430,504,4833,1.07171e+06,1203
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 178 transition count 255
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 178 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 178 transition count 251
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 103 place count 161 transition count 234
Iterating global reduction 1 with 17 rules applied. Total rules applied 120 place count 161 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 161 transition count 233
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 135 place count 147 transition count 201
Iterating global reduction 2 with 14 rules applied. Total rules applied 149 place count 147 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 157 place count 147 transition count 193
Applied a total of 157 rules in 10 ms. Remains 147 /219 variables (removed 72) and now considering 193/305 (removed 112) transitions.
// Phase 1: matrix 193 rows 147 cols
[2025-06-07 17:48:25] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 17:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:25] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-07 17:48: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/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 193/340 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 162 constraints, problems are : Problem set: 0 solved, 192 unsolved in 6967 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 193/340 variables, 147/162 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 192/354 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:35] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:37] [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:48:37] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:38] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:39] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:40] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:41] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:46] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/340 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:47] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:48] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 364 constraints, problems are : Problem set: 0 solved, 192 unsolved in 26186 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 33170ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 33171ms
Starting structural reductions in LTL mode, iteration 1 : 147/219 places, 193/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33323 ms. Remains : 147/219 places, 193/305 transitions.
[2025-06-07 17:48:58] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:48:58] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:48:58] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-07 17:48:58] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:48:58] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:48:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2764607944972582142.gal : 1 ms
[2025-06-07 17:48:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13528399750068893552.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/CTLFireability2764607944972582142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13528399750068893552.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.69404e+14,0.056076,6132,2,828,5,10559,6,0,783,8455,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(((p65==1)||(p238==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),((p65==1)||(p238==1)))] != FALSE
Hit Full ! (commute/partial/dont) 186/0/7
(forward)formula 0,1,0.613126,28176,1,0,42,109973,19,3,3675,133540,42
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-08 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 : 219/219 places, 305/305 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 178 transition count 255
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 178 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 178 transition count 251
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 102 place count 162 transition count 235
Iterating global reduction 1 with 16 rules applied. Total rules applied 118 place count 162 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 162 transition count 233
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 132 place count 150 transition count 209
Iterating global reduction 2 with 12 rules applied. Total rules applied 144 place count 150 transition count 209
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 150 place count 150 transition count 203
Applied a total of 150 rules in 11 ms. Remains 150 /219 variables (removed 69) and now considering 203/305 (removed 102) transitions.
// Phase 1: matrix 203 rows 150 cols
[2025-06-07 17:48:59] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-07 17:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:48:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2025-06-07 17:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:01] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:01] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:01] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/353 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/353 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 168 constraints, problems are : Problem set: 0 solved, 202 unsolved in 8577 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/353 variables, 150/168 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 202/370 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:10] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:10] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:11] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:13] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:13] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:13] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 376 constraints, problems are : Problem set: 0 solved, 202 unsolved in 13088 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21679ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 21679ms
Starting structural reductions in LTL mode, iteration 1 : 150/219 places, 203/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21824 ms. Remains : 150/219 places, 203/305 transitions.
[2025-06-07 17:49:21] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:49:21] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:49:21] [INFO ] Input system was already deterministic with 203 transitions.
[2025-06-07 17:49:21] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:49:21] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:49:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14092293742444890379.gal : 1 ms
[2025-06-07 17:49:21] [INFO ] Time to serialize properties into /tmp/CTLFireability8552587805278102933.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/CTLFireability14092293742444890379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8552587805278102933.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.19023e+14,0.107288,7600,2,1155,5,17691,6,0,805,17381,0


Converting to forward existential form...Done !
original formula: E(!(AF((p189==1))) U AX(AX(E(((p81==1)||(p104==1)) U ((p107==1)||(p257==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EG(!((p189==1)))))) * !(EX(!(!(EX(!(E(((p81==1)||(p104==1)) U ((p107==1)||(p257==1))))))))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t4, t23, t24, t28, t33, t37, t42, t43, t47, t52, t53, t57, t59, t64, t68, t73, t74, t78, t84,...331
(forward)formula 0,1,16.8447,492772,1,0,1661,2.43985e+06,438,902,4828,3.9363e+06,1841
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-09 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 : 219/219 places, 305/305 transitions.
Graph (trivial) has 188 edges and 219 vertex of which 26 / 219 are part of one of the 5 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 197 transition count 239
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 65 rules applied. Total rules applied 108 place count 155 transition count 216
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 120 place count 144 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 143 transition count 215
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 121 place count 143 transition count 209
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 133 place count 137 transition count 209
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 158 place count 112 transition count 175
Iterating global reduction 4 with 25 rules applied. Total rules applied 183 place count 112 transition count 175
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 112 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 189 place count 111 transition count 170
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 189 place count 111 transition count 166
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 197 place count 107 transition count 166
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 198 place count 106 transition count 162
Iterating global reduction 6 with 1 rules applied. Total rules applied 199 place count 106 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 200 place count 106 transition count 161
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 276 place count 68 transition count 123
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 281 place count 63 transition count 107
Iterating global reduction 7 with 5 rules applied. Total rules applied 286 place count 63 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 291 place count 63 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 293 place count 61 transition count 100
Applied a total of 293 rules in 31 ms. Remains 61 /219 variables (removed 158) and now considering 100/305 (removed 205) transitions.
[2025-06-07 17:49:38] [INFO ] Flow matrix only has 72 transitions (discarded 28 similar events)
// Phase 1: matrix 72 rows 61 cols
[2025-06-07 17:49:38] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 17:49:38] [INFO ] Flow matrix only has 72 transitions (discarded 28 similar events)
[2025-06-07 17:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:38] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:38] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2025-06-07 17:49:38] [INFO ] Flow matrix only has 72 transitions (discarded 28 similar events)
[2025-06-07 17:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/133 variables, and 76 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 4/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/76 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 68/144 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/133 variables, and 144 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2604ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2604ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/219 places, 100/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2762 ms. Remains : 61/219 places, 100/305 transitions.
[2025-06-07 17:49:40] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:49:40] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:40] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-07 17:49:40] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:40] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9435868658065119820.gal : 1 ms
[2025-06-07 17:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability209859065423212185.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/CTLFireability9435868658065119820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability209859065423212185.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 -...282
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.96809e+08,0.018132,4316,2,108,5,1262,6,0,339,769,0


Converting to forward existential form...Done !
original formula: A((EF((AF((p199==1)) * (p244==1))) * ((EG(AF((p244==1))) + (p120==1)) + (A(((p47==1)&&((p177==1)||(p119==1))) U AG((p225==1))) * (p297!=1...214
=> equivalent forward existential formula: [((Init * !(EG(!(EG(E(!(E(TRUE U (p292==1))) U !(E(TRUE U !(((p176==1)||(p12==1))))))))))) * !(E(!(EG(E(!(E(TRUE...556
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 98/0/2
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 98/0/2
(forward)formula 0,0,0.177876,11484,1,0,34,46391,54,18,1765,38564,37
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 200 edges and 219 vertex of which 35 / 219 are part of one of the 6 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 189 transition count 228
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 66 rules applied. Total rules applied 110 place count 146 transition count 205
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 124 place count 135 transition count 202
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 129 place count 132 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 131 transition count 200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 130 place count 131 transition count 196
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 138 place count 127 transition count 196
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 161 place count 104 transition count 164
Iterating global reduction 5 with 23 rules applied. Total rules applied 184 place count 104 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 187 place count 104 transition count 161
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 187 place count 104 transition count 156
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 197 place count 99 transition count 156
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 200 place count 96 transition count 147
Iterating global reduction 6 with 3 rules applied. Total rules applied 203 place count 96 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 206 place count 96 transition count 144
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 278 place count 60 transition count 108
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 281 place count 57 transition count 97
Iterating global reduction 7 with 3 rules applied. Total rules applied 284 place count 57 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 287 place count 57 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 289 place count 55 transition count 92
Applied a total of 289 rules in 29 ms. Remains 55 /219 variables (removed 164) and now considering 92/305 (removed 213) transitions.
[2025-06-07 17:49:41] [INFO ] Flow matrix only has 63 transitions (discarded 29 similar events)
// Phase 1: matrix 63 rows 55 cols
[2025-06-07 17:49:41] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:41] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 17:49:41] [INFO ] Flow matrix only has 63 transitions (discarded 29 similar events)
[2025-06-07 17:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:41] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-07 17:49:41] [INFO ] Flow matrix only has 63 transitions (discarded 29 similar events)
[2025-06-07 17:49: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/51 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/117 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/117 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 70 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 62/117 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:42] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 130 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2441ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2442ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/219 places, 92/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2573 ms. Remains : 55/219 places, 92/305 transitions.
[2025-06-07 17:49:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:43] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-07 17:49:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14252258580963232013.gal : 1 ms
[2025-06-07 17:49:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3681880636735453734.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/CTLFireability14252258580963232013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3681880636735453734.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.34369e+08,0.017437,4340,2,96,5,1175,6,0,307,770,0


Converting to forward existential form...Done !
original formula: EG(((p218==1) + !(E(!(AF((p22==1))) U ((EF((p90==1)) + ((p178==1)&&(p33==1))) + ((p267==1)||(p294==1)))))))
=> equivalent forward existential formula: [FwdG(Init,((p218==1) + !(E(!(!(EG(!((p22==1))))) U ((E(TRUE U (p90==1)) + ((p178==1)&&(p33==1))) + ((p267==1)||...180
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 90/0/2
(forward)formula 0,0,0.137238,10228,1,0,42,32878,35,25,1552,43699,32
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 213 edges and 219 vertex of which 37 / 219 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 187 transition count 216
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 77 rules applied. Total rules applied 130 place count 135 transition count 191
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 142 place count 123 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 142 place count 123 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 122 transition count 190
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 172 place count 94 transition count 153
Iterating global reduction 3 with 28 rules applied. Total rules applied 200 place count 94 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 203 place count 94 transition count 150
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 203 place count 94 transition count 142
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 219 place count 86 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 221 place count 84 transition count 137
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 84 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 225 place count 84 transition count 135
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 293 place count 50 transition count 101
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 298 place count 45 transition count 84
Iterating global reduction 5 with 5 rules applied. Total rules applied 303 place count 45 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 308 place count 45 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 310 place count 43 transition count 77
Applied a total of 310 rules in 15 ms. Remains 43 /219 variables (removed 176) and now considering 77/305 (removed 228) transitions.
[2025-06-07 17:49:43] [INFO ] Flow matrix only has 42 transitions (discarded 35 similar events)
// Phase 1: matrix 42 rows 43 cols
[2025-06-07 17:49:43] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 17:49:43] [INFO ] Flow matrix only has 42 transitions (discarded 35 similar events)
[2025-06-07 17:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:43] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-07 17:49:43] [INFO ] Flow matrix only has 42 transitions (discarded 35 similar events)
[2025-06-07 17:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 58 constraints, problems are : Problem set: 0 solved, 44 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 44/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 102 constraints, problems are : Problem set: 0 solved, 44 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1347ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/219 places, 77/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1444 ms. Remains : 43/219 places, 77/305 transitions.
[2025-06-07 17:49:45] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:49:45] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:45] [INFO ] Input system was already deterministic with 77 transitions.
RANDOM walk for 303 steps (10 resets) in 5 ms. (50 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 17:49:45] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:49:45] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13270309341106948929.gal : 1 ms
[2025-06-07 17:49:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17076301048238052037.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/ReachabilityCardinality13270309341106948929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17076301048238052037.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 : 219/219 places, 305/305 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 181 transition count 258
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 181 transition count 258
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 181 transition count 254
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 95 place count 166 transition count 239
Iterating global reduction 1 with 15 rules applied. Total rules applied 110 place count 166 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 112 place count 166 transition count 237
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 123 place count 155 transition count 217
Iterating global reduction 2 with 11 rules applied. Total rules applied 134 place count 155 transition count 217
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 139 place count 155 transition count 212
Applied a total of 139 rules in 7 ms. Remains 155 /219 variables (removed 64) and now considering 212/305 (removed 93) transitions.
// Phase 1: matrix 212 rows 155 cols
[2025-06-07 17:49:45] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:45] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-07 17:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:45] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-07 17:49:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/367 variables, 155/170 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 0/367 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 170 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8216 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/367 variables, 155/170 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 211/381 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:57] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:57] [INFO ] Deduced a trap along path composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:59] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:59] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:59] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 3/386 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:04] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/367 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:06] [INFO ] Deduced a trap composed of 28 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:50:06] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:50:06] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 3/390 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/367 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 390 constraints, problems are : Problem set: 0 solved, 211 unsolved in 23176 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 31425ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 31426ms
Starting structural reductions in LTL mode, iteration 1 : 155/219 places, 212/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31698 ms. Remains : 155/219 places, 212/305 transitions.
[2025-06-07 17:50:17] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:50:17] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:50:17] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-07 17:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:50:17] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:50:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3970699019856946544.gal : 1 ms
[2025-06-07 17:50:17] [INFO ] Time to serialize properties into /tmp/CTLFireability15942933449968771858.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/CTLFireability3970699019856946544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15942933449968771858.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.70916e+14,0.08067,6648,2,980,5,12981,6,0,834,11510,0


Converting to forward existential form...Done !
original formula: E(EF((EX(!(((p296==1)||(p259==1)))) + !((E((p23==1) U (p91==1)) * (p172==1))))) U (EF((AX(A((p106==1) U (p197==1))) * ((p0!=1) + AX(((p13...190
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,E(TRUE U (EX(!(((p296==1)||(p259==1)))) + !((E((p23==1) U (p91==1)) * (p172==1)))))),TRUE) *...625
Reverse transition relation is NOT exact ! Due to transitions t4, t23, t25, t28, t32, t35, t39, t44, t45, t49, t55, t59, t65, t68, t70, t75, t76, t80, t86,...326
(forward)formula 0,1,6.88629,201440,1,0,1173,1.20555e+06,466,577,5401,1.41454e+06,1348
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 189 edges and 219 vertex of which 27 / 219 are part of one of the 4 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 195 transition count 230
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 71 rules applied. Total rules applied 120 place count 147 transition count 207
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 134 place count 136 transition count 204
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 139 place count 133 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 132 transition count 202
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 140 place count 132 transition count 196
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 152 place count 126 transition count 196
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 177 place count 101 transition count 171
Iterating global reduction 5 with 25 rules applied. Total rules applied 202 place count 101 transition count 171
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 202 place count 101 transition count 165
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 214 place count 95 transition count 165
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 217 place count 92 transition count 156
Iterating global reduction 5 with 3 rules applied. Total rules applied 220 place count 92 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 223 place count 92 transition count 153
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 291 place count 58 transition count 118
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 295 place count 54 transition count 105
Iterating global reduction 6 with 4 rules applied. Total rules applied 299 place count 54 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 303 place count 54 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 305 place count 52 transition count 99
Applied a total of 305 rules in 28 ms. Remains 52 /219 variables (removed 167) and now considering 99/305 (removed 206) transitions.
[2025-06-07 17:50:24] [INFO ] Flow matrix only has 79 transitions (discarded 20 similar events)
// Phase 1: matrix 79 rows 52 cols
[2025-06-07 17:50:24] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:24] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 17:50:24] [INFO ] Flow matrix only has 79 transitions (discarded 20 similar events)
[2025-06-07 17:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:24] [INFO ] Implicit Places using invariants and state equation in 46 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:50:24] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2025-06-07 17:50:24] [INFO ] Flow matrix only has 79 transitions (discarded 20 similar events)
[2025-06-07 17:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 6/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 78/130 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/131 variables, and 67 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 6/52 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 78/130 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 68/135 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/131 variables, and 135 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2484ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2485ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/219 places, 99/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2601 ms. Remains : 52/219 places, 99/305 transitions.
[2025-06-07 17:50:26] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:50:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:50:26] [INFO ] Input system was already deterministic with 99 transitions.
[2025-06-07 17:50:26] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:50:26] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:50:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13704817259611859696.gal : 1 ms
[2025-06-07 17:50:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8691423027176293336.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/CTLFireability13704817259611859696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8691423027176293336.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,6.71846e+07,0.019263,4392,2,90,5,1613,6,0,306,1269,0


Converting to forward existential form...Done !
original formula: AG((AF((EF((p157==0)) * (p270==0))) + (AF((((p39==1)&&(p146==1))&&(p24==0))) * (E((AF((p156==1)) + EF(((p39==1)&&(p127==1)))) U !(((p100=...199
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!(EG(!((E(TRUE U (p157==0)) * (p270==0))))))),!((((p39==1)&&(p146==1))&&(p24==0))))]...365
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 94/0/5
Using saturation style SCC detection
(forward)formula 0,0,0.091458,7592,1,0,28,19234,39,18,1623,19044,24
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 305/305 transitions.
Graph (trivial) has 208 edges and 219 vertex of which 37 / 219 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 187 transition count 217
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 76 rules applied. Total rules applied 128 place count 136 transition count 192
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 140 place count 124 transition count 192
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 140 place count 124 transition count 189
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 121 transition count 189
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 175 place count 92 transition count 151
Iterating global reduction 3 with 29 rules applied. Total rules applied 204 place count 92 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 92 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 207 place count 92 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 221 place count 85 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 224 place count 82 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 82 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 230 place count 82 transition count 129
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 296 place count 49 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 300 place count 45 transition count 82
Iterating global reduction 5 with 4 rules applied. Total rules applied 304 place count 45 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 308 place count 45 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 310 place count 43 transition count 76
Applied a total of 310 rules in 23 ms. Remains 43 /219 variables (removed 176) and now considering 76/305 (removed 229) transitions.
[2025-06-07 17:50:26] [INFO ] Flow matrix only has 45 transitions (discarded 31 similar events)
// Phase 1: matrix 45 rows 43 cols
[2025-06-07 17:50:26] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 17:50:26] [INFO ] Flow matrix only has 45 transitions (discarded 31 similar events)
[2025-06-07 17:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:26] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:50:26] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-07 17:50:26] [INFO ] Flow matrix only has 45 transitions (discarded 31 similar events)
[2025-06-07 17:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 44/87 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 58 constraints, problems are : Problem set: 0 solved, 44 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 44/87 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 44/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 102 constraints, problems are : Problem set: 0 solved, 44 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1343ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1343ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/219 places, 76/305 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1470 ms. Remains : 43/219 places, 76/305 transitions.
[2025-06-07 17:50:28] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:28] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:28] [INFO ] Input system was already deterministic with 76 transitions.
[2025-06-07 17:50:28] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:28] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5776717791093914854.gal : 0 ms
[2025-06-07 17:50:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17298031845039065997.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/CTLFireability5776717791093914854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17298031845039065997.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,5.03885e+06,0.009619,4252,2,72,5,662,6,0,245,378,0


Converting to forward existential form...Done !
original formula: EF(EG(((p217==1)&&(p246==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p217==1)&&(p246==1)))] != FALSE
Hit Full ! (commute/partial/dont) 67/8/9
(forward)formula 0,1,0.019992,4508,1,0,8,2630,19,2,1224,1201,8
FORMULA Champagne-PT-H05T0R-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-07 17:50:28] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:50:28] [INFO ] Flatten gal took : 5 ms
Total runtime 439768 ms.

BK_STOP 1749318628263

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

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