Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:36 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 101K 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-H05T2O-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H05T2O-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749318962138

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-H05T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 17:56:03] [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:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:56:03] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-07 17:56:03] [INFO ] Transformed 569 places.
[2025-06-07 17:56:03] [INFO ] Transformed 686 transitions.
[2025-06-07 17:56:03] [INFO ] Found NUPN structural information;
[2025-06-07 17:56:03] [INFO ] Parsed PT model containing 569 places and 686 transitions and 1566 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 106 out of 569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 686/686 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 488 transition count 605
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 488 transition count 605
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 203 place count 447 transition count 564
Iterating global reduction 0 with 41 rules applied. Total rules applied 244 place count 447 transition count 564
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 263 place count 428 transition count 545
Iterating global reduction 0 with 19 rules applied. Total rules applied 282 place count 428 transition count 545
Applied a total of 282 rules in 118 ms. Remains 428 /569 variables (removed 141) and now considering 545/686 (removed 141) transitions.
// Phase 1: matrix 545 rows 428 cols
[2025-06-07 17:56:03] [INFO ] Computed 15 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:04] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-07 17:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:04] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2025-06-07 17:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (OVERLAPS) 1/428 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:15] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:15] [INFO ] Deduced a trap composed of 120 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:18] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 545/973 variables, 428/446 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:30] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:30] [INFO ] Deduced a trap composed of 61 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:56:30] [INFO ] Deduced a trap composed of 62 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:56:31] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 973/973 variables, and 450 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (OVERLAPS) 1/428 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:38] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (OVERLAPS) 545/973 variables, 428/451 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 544/995 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:51] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:51] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:51] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:51] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:51] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:52] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:53] [INFO ] Deduced a trap composed of 82 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:56:57] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:57] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 9/1004 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 973/973 variables, and 1004 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 428/569 places, 545/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61000 ms. Remains : 428/569 places, 545/686 transitions.
Support contains 106 out of 428 places after structural reductions.
[2025-06-07 17:57:04] [INFO ] Flatten gal took : 52 ms
[2025-06-07 17:57:04] [INFO ] Flatten gal took : 24 ms
[2025-06-07 17:57:04] [INFO ] Input system was already deterministic with 545 transitions.
Support contains 101 out of 428 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (100 resets) in 2057 ms. (19 steps per ms) remains 2/76 properties
BEST_FIRST walk for 40003 steps (13 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2025-06-07 17:57:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
After SMT solving in domain Real declared 202/973 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 7/15 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-07 17:57:05] [INFO ] Flatten gal took : 20 ms
[2025-06-07 17:57:05] [INFO ] Flatten gal took : 20 ms
[2025-06-07 17:57:05] [INFO ] Input system was already deterministic with 545 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Graph (trivial) has 434 edges and 428 vertex of which 219 / 428 are part of one of the 13 SCC in 2 ms
Free SCC test removed 206 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 221 transition count 230
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 105 rules applied. Total rules applied 191 place count 136 transition count 210
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 14 rules applied. Total rules applied 205 place count 127 transition count 205
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 211 place count 122 transition count 204
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 211 place count 122 transition count 197
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 225 place count 115 transition count 197
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 247 place count 93 transition count 167
Iterating global reduction 4 with 22 rules applied. Total rules applied 269 place count 93 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 272 place count 93 transition count 164
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 276 place count 89 transition count 151
Iterating global reduction 5 with 4 rules applied. Total rules applied 280 place count 89 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 284 place count 89 transition count 147
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 338 place count 62 transition count 120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 339 place count 61 transition count 118
Iterating global reduction 6 with 1 rules applied. Total rules applied 340 place count 61 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 341 place count 61 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 342 place count 61 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 344 place count 59 transition count 114
Applied a total of 344 rules in 59 ms. Remains 59 /428 variables (removed 369) and now considering 114/545 (removed 431) transitions.
[2025-06-07 17:57:05] [INFO ] Flow matrix only has 80 transitions (discarded 34 similar events)
// Phase 1: matrix 80 rows 59 cols
[2025-06-07 17:57:05] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-07 17:57:05] [INFO ] Flow matrix only has 80 transitions (discarded 34 similar events)
[2025-06-07 17:57:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:57:05] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2025-06-07 17:57:05] [INFO ] Flow matrix only has 80 transitions (discarded 34 similar events)
[2025-06-07 17:57:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 79/138 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/138 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/139 variables, and 74 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1452 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 4/59 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 79/138 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 75/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/139 variables, and 149 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2858ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/428 places, 114/545 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3025 ms. Remains : 59/428 places, 114/545 transitions.
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:08] [INFO ] Input system was already deterministic with 114 transitions.
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:57:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17530704508725178587.gal : 6 ms
[2025-06-07 17:57:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3889727958523862835.ctl : 7 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/CTLFireability17530704508725178587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3889727958523862835.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.41088e+08,0.032459,4420,2,524,5,4245,6,0,340,2879,0


Converting to forward existential form...Done !
original formula: A((((EG(EF((p227==1))) + (p189==1)) + ((p125!=1)||(p210==1))) + ((p301==1)&&(p388==1))) U (p412==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p412==1))))) * !(E(!((p412==1)) U (!((((EG(E(TRUE U (p227==1))) + (p189==1)) + ((p125!=1)||(p2...219
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 112/0/2
Hit Full ! (commute/partial/dont) 112/0/2
(forward)formula 0,0,0.250855,14468,1,0,26,71505,33,14,1772,44089,18
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 388 transition count 505
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 388 transition count 505
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 105 place count 363 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 130 place count 363 transition count 480
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 355 transition count 472
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 355 transition count 472
Applied a total of 146 rules in 33 ms. Remains 355 /428 variables (removed 73) and now considering 472/545 (removed 73) transitions.
// Phase 1: matrix 472 rows 355 cols
[2025-06-07 17:57:09] [INFO ] Computed 15 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:09] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-07 17:57:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:09] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2025-06-07 17:57: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/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:17] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 472/827 variables, 355/371 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 827/827 variables, and 371 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/355 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 472/827 variables, 355/371 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/827 variables, 471/842 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:53] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 1)
(t3 1)
(t4 1)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 0)
(t10 0)
(t11 0)
(t12 0)
(t13 0)
(t14 0)
(t15 0)
(t16 0)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 3)
(t33 1)
(t34 1)
(t35 0)
(t36 1)
(t37 1)
(t38 1)
(t39 1)
(t40 2)
(t41 2)
(t42 0)
(t43 2)
(t44 2)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 0)
(t52 0)
(t53 1)
(t54 1)
(t55 3)
(t56 0)
(t57 3)
(t58 1)
(t59 4)
(t60 0)
(t61 0)
(t62 1)
(t63 1)
(t64 1)
(t65 3)
(t66 3)
(t67 1)
(t68 2)
(t69 2)
(t70 3)
(t71 3)
(t72 1)
(t73 3)
(t74 3)
(t75 1)
(t76 2)
(t77 2)
(t78 3)
(t79 3)
(t80 4)
(t81 0)
(t82 3)
(t83 3)
(t84 1)
(t85 1)
(t86 0)
(t87 1)
(t88 1)
(t89 1)
(t90 1)
(t91 1)
(t92 0)
(t93 0)
(t94 1)
(t95 1)
(t96 1)
(t97 2)
(t98 2)
(t99 1)
(t100 1)
(t101 1)
(t102 2)
(t103 2)
(t104 3)
(t105 0)
(t106 3)
(t107 0)
(t108 4)
(t109 2)
(t110 2)
(t111 0)
(t112 2)
(t113 1)
(t114 1)
(t115 1)
(t116 1)
(t117 0)
(t118 0)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 1)
(t124 1)
(t125 0)
(t126 0)
(t127 1)
(t128 1)
(t129 4)
(t130 0)
(t131 4)
(t132 0)
(t133 2)
(t134 2)
(t135 2)
(t136 0)
(t137 2)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 2)
(t158 0)
(t159 2)
(t160 2)
(t161 0)
(t162 0)
(t163 1)
(t164 1)
(t165 1)
(t166 2)
(t167 2)
(t168 1)
(t169 1)
(t170 1)
(t171 2)
(t172 2)
(t173 2)
(t174 1)
(t175 1)
(t176 1)
(t177 1)
(t178 0)
(t179 0)
(t180 1)
(t181 1)
(t182 1)
(t183 0)
(t184 3)
(t185 0)
(t186 2)
(t187 0)
(t188 0)
(t189 1)
(t190 1)
(t191 0)
(t192 1)
(t193 1)
(t194 0)
(t195 1)
(t196 1)
(t197 1)
(t198 1)
(t199 1)
(t200 2)
(t201 2)
(t202 1)
(t203 1)
(t204 1)
(t205 2)
(t206 2)
(t207 2)
(t208 0)
(t209 2)
(t210 0)
(t211 1)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 1)
(t225 1)
(t226 1)
(t227 1)
(t228 0)
(t229 0)
(t230 1)
(t231 1)
(t232 1)
(t233 0)
(t234 1)
(t235 0)
(t236 1)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 1)
(t242 1)
(t243 1)
(t244 1)
(t245 0)
(t246 0)
(t247 1)
(t248 1)
(t249 1)
(t250 1)
(t251 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 827/827 variables, and 843 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 355/428 places, 472/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60424 ms. Remains : 355/428 places, 472/545 transitions.
[2025-06-07 17:58:09] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:58:09] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:58:09] [INFO ] Input system was already deterministic with 472 transitions.
[2025-06-07 17:58:09] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:58:09] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:58:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3837515048444783342.gal : 9 ms
[2025-06-07 17:58:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14138808922875727836.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/CTLFireability3837515048444783342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14138808922875727836.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.22574e+20,0.186511,10092,2,1954,5,26454,6,0,1894,22134,0


Converting to forward existential form...Done !
original formula: (A((p311==1) U !((((AF((p362==1)) + EX(((p149==1)&&(p163==1)))) + (((p264==1)&&(p363==1))||(p441==1))) + (((p197!=1)&&(p75==1))&&((p274==...375
=> equivalent forward existential formula: ([((EY((Init * !(!((E(!(!((((!(EG(!((p362==1)))) + EX(((p149==1)&&(p163==1)))) + (((p264==1)&&(p363==1))||(p441=...1379
Reverse transition relation is NOT exact ! Due to transitions t7, t46, t58, t63, t87, t107, t112, t137, t145, t156, t164, t185, t190, t215, t240, t265, t29...282
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-07 17:58:39] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:58:39] [INFO ] Applying decomposition
[2025-06-07 17:58:39] [INFO ] Flatten gal took : 13 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/graph13174373581674657451.txt' '-o' '/tmp/graph13174373581674657451.bin' '-w' '/tmp/graph13174373581674657451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13174373581674657451.bin' '-l' '-1' '-v' '-w' '/tmp/graph13174373581674657451.weights' '-q' '0' '-e' '0.001'
[2025-06-07 17:58:39] [INFO ] Decomposing Gal with order
[2025-06-07 17:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 17:58:40] [INFO ] Removed a total of 289 redundant transitions.
[2025-06-07 17:58:40] [INFO ] Flatten gal took : 67 ms
[2025-06-07 17:58:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-07 17:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4687684645545347269.gal : 7 ms
[2025-06-07 17:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3173735724547358430.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/CTLFireability4687684645545347269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3173735724547358430.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 -...262
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.22574e+20,0.098378,7408,695,20,5840,273,615,7028,48,567,0


Converting to forward existential form...Done !
original formula: (A((i9.u73.p311==1) U !((((AF((i10.u88.p362==1)) + EX(((i3.u34.p149==1)&&(i4.u39.p163==1)))) + (((i7.u63.p264==1)&&(i10.u88.p363==1))||(i...563
=> equivalent forward existential formula: ([((EY((Init * !(!((E(!(!((((!(EG(!((i10.u88.p362==1)))) + EX(((i3.u34.p149==1)&&(i4.u39.p163==1)))) + (((i7.u63...2026
Reverse transition relation is NOT exact ! Due to transitions t7, t58, t107, t185, i0.t363, i0.u2.t365, i1.t340, i2.t315, i3.t290, i4.t265, i5.t240, i7.t21...349
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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,0.903303,41456,1,0,80581,306,4969,124032,251,577,173394
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Graph (trivial) has 447 edges and 428 vertex of which 246 / 428 are part of one of the 15 SCC in 1 ms
Free SCC test removed 231 places
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 196 transition count 211
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 98 rules applied. Total rules applied 176 place count 119 transition count 190
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 186 place count 110 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 109 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 187 place count 109 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 108 transition count 188
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 211 place count 86 transition count 157
Iterating global reduction 4 with 22 rules applied. Total rules applied 233 place count 86 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 86 transition count 154
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 240 place count 82 transition count 141
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 82 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 248 place count 82 transition count 137
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 302 place count 55 transition count 110
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 304 place count 53 transition count 104
Iterating global reduction 6 with 2 rules applied. Total rules applied 306 place count 53 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 308 place count 53 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 310 place count 51 transition count 100
Applied a total of 310 rules in 27 ms. Remains 51 /428 variables (removed 377) and now considering 100/545 (removed 445) transitions.
[2025-06-07 17:58:41] [INFO ] Flow matrix only has 57 transitions (discarded 43 similar events)
// Phase 1: matrix 57 rows 51 cols
[2025-06-07 17:58:41] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 17:58:41] [INFO ] Flow matrix only has 57 transitions (discarded 43 similar events)
[2025-06-07 17:58:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:58:41] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-07 17:58:41] [INFO ] Flow matrix only has 57 transitions (discarded 43 similar events)
[2025-06-07 17:58: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/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/51 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 56/107 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/107 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/108 variables, and 66 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/51 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 56/107 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 56/122 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/107 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/108 variables, and 122 constraints, problems are : Problem set: 0 solved, 56 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2051ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2052ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/428 places, 100/545 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2210 ms. Remains : 51/428 places, 100/545 transitions.
[2025-06-07 17:58:43] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:58:43] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:58:43] [INFO ] Input system was already deterministic with 100 transitions.
[2025-06-07 17:58:43] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:58:43] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:58:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8304274827623164442.gal : 1 ms
[2025-06-07 17:58:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12738875318727654784.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/CTLFireability8304274827623164442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12738875318727654784.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.67416e+07,0.012849,4364,2,88,5,1107,6,0,292,674,0


Converting to forward existential form...Done !
original formula: E((!(EF((p211==1))) + !(EG(E((p85==1) U (p183==1))))) U (p423==1))
=> equivalent forward existential formula: [(FwdU(Init,(!(E(TRUE U (p211==1))) + !(EG(E((p85==1) U (p183==1)))))) * (p423==1))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 98/0/2
Using saturation style SCC detection
(forward)formula 0,1,0.104898,8588,1,0,58,23945,34,48,1493,32697,77
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-02 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 : 428/428 places, 545/545 transitions.
Graph (trivial) has 444 edges and 428 vertex of which 235 / 428 are part of one of the 15 SCC in 1 ms
Free SCC test removed 220 places
Ensure Unique test removed 243 transitions
Reduce isomorphic transitions removed 243 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 207 transition count 221
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 102 rules applied. Total rules applied 183 place count 127 transition count 199
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 192 place count 118 transition count 199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 192 place count 118 transition count 196
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 198 place count 115 transition count 196
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 219 place count 94 transition count 167
Iterating global reduction 3 with 21 rules applied. Total rules applied 240 place count 94 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 243 place count 94 transition count 164
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 91 transition count 155
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 91 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 252 place count 91 transition count 152
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 316 place count 59 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 318 place count 57 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 57 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 322 place count 57 transition count 112
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 323 place count 57 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 55 transition count 110
Applied a total of 325 rules in 30 ms. Remains 55 /428 variables (removed 373) and now considering 110/545 (removed 435) transitions.
[2025-06-07 17:58:43] [INFO ] Flow matrix only has 60 transitions (discarded 50 similar events)
// Phase 1: matrix 60 rows 55 cols
[2025-06-07 17:58: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:58:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 17:58:43] [INFO ] Flow matrix only has 60 transitions (discarded 50 similar events)
[2025-06-07 17:58:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:43] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:58:43] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-07 17:58:43] [INFO ] Flow matrix only has 60 transitions (discarded 50 similar events)
[2025-06-07 17:58: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/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 59/114 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 70 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 59/114 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 65/135 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 135 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2162ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2162ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/428 places, 110/545 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2403 ms. Remains : 55/428 places, 110/545 transitions.
[2025-06-07 17:58:45] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:58:45] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:58:45] [INFO ] Input system was already deterministic with 110 transitions.
[2025-06-07 17:58:45] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:58:45] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:58:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11712032138053047471.gal : 1 ms
[2025-06-07 17:58:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9572471926037865423.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/CTLFireability11712032138053047471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9572471926037865423.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,7.05439e+07,0.012615,4348,2,96,5,950,6,0,318,540,0


Converting to forward existential form...Done !
original formula: AG(E((p278==1) U (E((p48==1) U AF((p275==1))) + !((EG((p353==1)) * (p332==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((p278==1) U (E((p48==1) U !(EG(!((p275==1))))) + !((EG((p353==1)) * (p332==1)))))))] = F...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 108/0/2
Hit Full ! (commute/partial/dont) 108/0/2
Hit Full ! (commute/partial/dont) 107/0/3
(forward)formula 0,0,0.052858,5884,1,0,23,11223,42,11,1607,8032,18
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 386 transition count 503
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 386 transition count 503
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 109 place count 361 transition count 478
Iterating global reduction 0 with 25 rules applied. Total rules applied 134 place count 361 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 141 place count 354 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 148 place count 354 transition count 471
Applied a total of 148 rules in 36 ms. Remains 354 /428 variables (removed 74) and now considering 471/545 (removed 74) transitions.
// Phase 1: matrix 471 rows 354 cols
[2025-06-07 17:58:45] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:46] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-07 17:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:46] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2025-06-07 17:58:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:54] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 471/825 variables, 354/370 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/825 variables, and 370 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 471/825 variables, 354/370 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 470/840 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:30] [INFO ] Deduced a trap along path composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/825 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:37] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:38] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/825 variables, 2/843 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 843 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 354/428 places, 471/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 354/428 places, 471/545 transitions.
[2025-06-07 17:59:46] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:59:46] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:59:46] [INFO ] Input system was already deterministic with 471 transitions.
[2025-06-07 17:59:46] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:59:46] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:59:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4584941780992020800.gal : 7 ms
[2025-06-07 17:59:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16163162479785550808.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/CTLFireability4584941780992020800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16163162479785550808.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.12053e+20,0.190325,10464,2,2002,5,28419,6,0,1889,24558,0


Converting to forward existential form...Done !
original formula: !(A((EF((E((p530==1) U (p153==1)) * !(E((p483==1) U (p220==1))))) * !((EX(AG(((p75==1)&&(p274==1)))) * (p311!=1)))) U EX((AX((p568==1)) *...242
=> equivalent forward existential formula: ([((FwdU(Init,!(EX((!(EX(!((p568==1)))) * ((!(EX(!((p190==1)))) + !(((p38==1)&&(p249==1)))) + (((p112==1)&&(p212...591
Reverse transition relation is NOT exact ! Due to transitions t9, t35, t59, t64, t72, t89, t109, t114, t139, t163, t171, t185, t190, t215, t239, t241, t265...281
Detected timeout of ITS tools.
[2025-06-07 18:00:16] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:00:16] [INFO ] Applying decomposition
[2025-06-07 18:00:16] [INFO ] Flatten gal took : 9 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/graph15773590102791178401.txt' '-o' '/tmp/graph15773590102791178401.bin' '-w' '/tmp/graph15773590102791178401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15773590102791178401.bin' '-l' '-1' '-v' '-w' '/tmp/graph15773590102791178401.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:00:16] [INFO ] Decomposing Gal with order
[2025-06-07 18:00:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:00:16] [INFO ] Removed a total of 297 redundant transitions.
[2025-06-07 18:00:16] [INFO ] Flatten gal took : 23 ms
[2025-06-07 18:00:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-07 18:00:16] [INFO ] Time to serialize gal into /tmp/CTLFireability418578923600583933.gal : 14 ms
[2025-06-07 18:00:16] [INFO ] Time to serialize properties into /tmp/CTLFireability12367629228099855510.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/CTLFireability418578923600583933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12367629228099855510.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 -...262
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.12053e+20,0.087345,7256,590,21,4817,403,658,5750,52,794,0


Converting to forward existential form...Done !
original formula: !(A((EF((E((i14.i0.u117.p530==1) U (i4.i1.u32.p153==1)) * !(E((i13.i2.u114.p483==1) U (i6.i2.u44.p220==1))))) * !((EX(AG(((i1.i2.u15.p75=...387
=> equivalent forward existential formula: ([((FwdU(Init,!(EX((!(EX(!((i15.i3.u127.p568==1)))) * ((!(EX(!((i5.i2.u42.p190==1)))) + !(((i0.i0.u8.p38==1)&&(i...878
Reverse transition relation is NOT exact ! Due to transitions t59, t109, t185, i0.i0.t364, i1.i2.t340, i2.i0.t315, i3.i0.t290, i5.i2.t265, i6.i2.t239, i6.i...411
(forward)formula 0,1,10.2777,265048,1,0,521570,403,4878,532788,248,878,491440
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Graph (trivial) has 448 edges and 428 vertex of which 252 / 428 are part of one of the 15 SCC in 0 ms
Free SCC test removed 237 places
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 190 transition count 207
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 96 rules applied. Total rules applied 171 place count 116 transition count 185
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 180 place count 107 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 180 place count 107 transition count 184
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 182 place count 106 transition count 184
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 206 place count 82 transition count 149
Iterating global reduction 3 with 24 rules applied. Total rules applied 230 place count 82 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 233 place count 82 transition count 146
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 77 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 243 place count 77 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 248 place count 77 transition count 124
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 302 place count 50 transition count 97
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 304 place count 48 transition count 91
Iterating global reduction 5 with 2 rules applied. Total rules applied 306 place count 48 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 308 place count 48 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 310 place count 46 transition count 87
Applied a total of 310 rules in 20 ms. Remains 46 /428 variables (removed 382) and now considering 87/545 (removed 458) transitions.
[2025-06-07 18:00:26] [INFO ] Flow matrix only has 49 transitions (discarded 38 similar events)
// Phase 1: matrix 49 rows 46 cols
[2025-06-07 18:00:26] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 18:00:27] [INFO ] Flow matrix only has 49 transitions (discarded 38 similar events)
[2025-06-07 18:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:27] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:00:27] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-07 18:00:27] [INFO ] Flow matrix only has 49 transitions (discarded 38 similar events)
[2025-06-07 18:00:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 48/94 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/95 variables, and 61 constraints, problems are : Problem set: 0 solved, 44 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 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/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/46 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 48/94 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/95 variables, and 105 constraints, problems are : Problem set: 0 solved, 44 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1378ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1378ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/428 places, 87/545 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1497 ms. Remains : 46/428 places, 87/545 transitions.
[2025-06-07 18:00:28] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:00:28] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:00:28] [INFO ] Input system was already deterministic with 87 transitions.
RANDOM walk for 198 steps (5 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 18:00:28] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:00:28] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:00:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13317717784166162560.gal : 1 ms
[2025-06-07 18:00:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13635797908728346256.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13317717784166162560.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13635797908728346256.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 : 428/428 places, 545/545 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 386 transition count 503
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 386 transition count 503
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 109 place count 361 transition count 478
Iterating global reduction 0 with 25 rules applied. Total rules applied 134 place count 361 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 141 place count 354 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 148 place count 354 transition count 471
Applied a total of 148 rules in 19 ms. Remains 354 /428 variables (removed 74) and now considering 471/545 (removed 74) transitions.
// Phase 1: matrix 471 rows 354 cols
[2025-06-07 18:00:28] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-07 18:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:28] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2025-06-07 18:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (OVERLAPS) 471/825 variables, 354/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 825/825 variables, and 369 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (OVERLAPS) 471/825 variables, 354/369 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 470/839 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:01:15] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 825/825 variables, and 840 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 354/428 places, 471/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60377 ms. Remains : 354/428 places, 471/545 transitions.
[2025-06-07 18:01:28] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:01:28] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:01:28] [INFO ] Input system was already deterministic with 471 transitions.
[2025-06-07 18:01:28] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:01:28] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:01:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18183539540364103069.gal : 2 ms
[2025-06-07 18:01:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6537989578344705290.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/CTLFireability18183539540364103069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6537989578344705290.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.11402e+20,0.190279,10264,2,1956,5,27179,6,0,1889,23356,0


Converting to forward existential form...Done !
original formula: AG(((E(AG(A((p198==1) U (p509==1))) U !(EX((p312==1)))) + (p372==1)) * (AX(AF((p222==1))) + EX(A(((p264==1)&&(p400==1)) U (p415==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((p372==1))) * !(E(!(E(TRUE U !(!((E(!((p509==1)) U (!((p198==1)) * !((p509==1)))) + EG(!...351
Reverse transition relation is NOT exact ! Due to transitions t4, t49, t54, t59, t83, t103, t108, t134, t160, t178, t182, t187, t212, t237, t257, t265, t28...282
Hit Full ! (commute/partial/dont) 469/0/2
(forward)formula 0,0,17.9257,542972,1,0,1334,3.24408e+06,978,772,11159,3.78306e+06,1751
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 383 transition count 500
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 383 transition count 500
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 118 place count 355 transition count 472
Iterating global reduction 0 with 28 rules applied. Total rules applied 146 place count 355 transition count 472
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 154 place count 347 transition count 464
Iterating global reduction 0 with 8 rules applied. Total rules applied 162 place count 347 transition count 464
Applied a total of 162 rules in 20 ms. Remains 347 /428 variables (removed 81) and now considering 464/545 (removed 81) transitions.
// Phase 1: matrix 464 rows 347 cols
[2025-06-07 18:01:47] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:47] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-07 18:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:47] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-07 18:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:33] [INFO ] Deduced a trap along path composed of 22 places in 38 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:35] [INFO ] Deduced a trap along path composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:41] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:42] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:44] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/811 variables, 3/830 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 830 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 347/428 places, 464/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60340 ms. Remains : 347/428 places, 464/545 transitions.
[2025-06-07 18:02:47] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:02:47] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:02:47] [INFO ] Input system was already deterministic with 464 transitions.
[2025-06-07 18:02:47] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:02:47] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:02:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5595743960446500338.gal : 1 ms
[2025-06-07 18:02:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18352981825747756532.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/CTLFireability5595743960446500338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18352981825747756532.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.57551e+20,0.177308,9668,2,1799,5,24762,6,0,1854,19670,0


Converting to forward existential form...Done !
original formula: AX(EX((EX((p501==0)) * EG((p266==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX((EX((p501==0)) * EG((p266==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t50, t55, t60, t84, t104, t109, t134, t158, t178, t183, t209, t234, t258, t283, t308, t33...264
(forward)formula 0,1,20.1817,605604,1,0,1292,3.60952e+06,951,750,10429,4.3143e+06,1728
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 382 transition count 499
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 382 transition count 499
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 121 place count 353 transition count 470
Iterating global reduction 0 with 29 rules applied. Total rules applied 150 place count 353 transition count 470
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 158 place count 345 transition count 462
Iterating global reduction 0 with 8 rules applied. Total rules applied 166 place count 345 transition count 462
Applied a total of 166 rules in 16 ms. Remains 345 /428 variables (removed 83) and now considering 462/545 (removed 83) transitions.
// Phase 1: matrix 462 rows 345 cols
[2025-06-07 18:03:07] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-07 18:03:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:07] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-07 18:03:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/807 variables, and 360 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 461/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:03:53] [INFO ] Deduced a trap along path composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:05] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 823 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 345/428 places, 462/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60329 ms. Remains : 345/428 places, 462/545 transitions.
[2025-06-07 18:04:08] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:04:08] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:04:08] [INFO ] Input system was already deterministic with 462 transitions.
[2025-06-07 18:04:08] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:04:08] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:04:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12872342389014127539.gal : 1 ms
[2025-06-07 18:04:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8964125696505280991.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/CTLFireability12872342389014127539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8964125696505280991.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.44423e+20,0.192205,9520,2,1761,5,24016,6,0,1844,19067,0


Converting to forward existential form...Done !
original formula: A(AX(FALSE) U (p484==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p484==1))))) * !(E(!((p484==1)) U (!(!(EX(!(FALSE)))) * !((p484==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t53, t57, t59, t83, t103, t108, t133, t157, t177, t182, t207, t232, t256, t281, t306, t33...264
(forward)formula 0,0,19.7875,589184,1,0,1281,3.46071e+06,947,751,10375,4.11836e+06,1720
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-08 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 : 428/428 places, 545/545 transitions.
Graph (trivial) has 453 edges and 428 vertex of which 256 / 428 are part of one of the 15 SCC in 0 ms
Free SCC test removed 241 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 186 transition count 201
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 97 rules applied. Total rules applied 173 place count 111 transition count 179
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 182 place count 102 transition count 179
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 205 place count 79 transition count 145
Iterating global reduction 3 with 23 rules applied. Total rules applied 228 place count 79 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 232 place count 79 transition count 141
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 236 place count 75 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 240 place count 75 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 244 place count 75 transition count 123
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 300 place count 47 transition count 95
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 302 place count 45 transition count 89
Iterating global reduction 5 with 2 rules applied. Total rules applied 304 place count 45 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 306 place count 45 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 308 place count 43 transition count 85
Applied a total of 308 rules in 16 ms. Remains 43 /428 variables (removed 385) and now considering 85/545 (removed 460) transitions.
[2025-06-07 18:04:28] [INFO ] Flow matrix only has 42 transitions (discarded 43 similar events)
// Phase 1: matrix 42 rows 43 cols
[2025-06-07 18:04:28] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-07 18:04:28] [INFO ] Flow matrix only has 42 transitions (discarded 43 similar events)
[2025-06-07 18:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:04:28] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2025-06-07 18:04:28] [INFO ] Flow matrix only has 42 transitions (discarded 43 similar events)
[2025-06-07 18:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 58 constraints, problems are : Problem set: 0 solved, 43 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 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, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 101 constraints, problems are : Problem set: 0 solved, 43 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1209ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1209ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/428 places, 85/545 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1301 ms. Remains : 43/428 places, 85/545 transitions.
[2025-06-07 18:04:29] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:04:29] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:04:29] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-07 18:04:29] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:04:29] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9912472892909827650.gal : 0 ms
[2025-06-07 18:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13256942830898593557.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/CTLFireability9912472892909827650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13256942830898593557.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.72392e+06,0.009607,4276,2,72,5,694,6,0,245,397,0


Converting to forward existential form...Done !
original formula: AG(EF((p475==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p475==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.017998,4532,1,0,7,2524,14,1,1088,980,5
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-09 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 : 428/428 places, 545/545 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 382 transition count 499
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 382 transition count 499
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 121 place count 353 transition count 470
Iterating global reduction 0 with 29 rules applied. Total rules applied 150 place count 353 transition count 470
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 158 place count 345 transition count 462
Iterating global reduction 0 with 8 rules applied. Total rules applied 166 place count 345 transition count 462
Applied a total of 166 rules in 27 ms. Remains 345 /428 variables (removed 83) and now considering 462/545 (removed 83) transitions.
// Phase 1: matrix 462 rows 345 cols
[2025-06-07 18:04:29] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 18:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:29] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2025-06-07 18:04:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/807 variables, and 360 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 461/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:05:15] [INFO ] Deduced a trap along path composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:05:26] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 823 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 345/428 places, 462/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60327 ms. Remains : 345/428 places, 462/545 transitions.
[2025-06-07 18:05:29] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:05:29] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:29] [INFO ] Input system was already deterministic with 462 transitions.
[2025-06-07 18:05:29] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:29] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12311048230587861947.gal : 1 ms
[2025-06-07 18:05:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11221309347198563391.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/CTLFireability12311048230587861947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11221309347198563391.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.44423e+20,0.165286,9520,2,1761,5,24016,6,0,1844,19067,0


Converting to forward existential form...Done !
original formula: EF(EX((p484==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p484==1))] != FALSE
(forward)formula 0,1,0.220025,9776,1,0,8,24016,8,1,2937,19067,2
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 381 transition count 498
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 381 transition count 498
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 123 place count 352 transition count 469
Iterating global reduction 0 with 29 rules applied. Total rules applied 152 place count 352 transition count 469
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 160 place count 344 transition count 461
Iterating global reduction 0 with 8 rules applied. Total rules applied 168 place count 344 transition count 461
Applied a total of 168 rules in 27 ms. Remains 344 /428 variables (removed 84) and now considering 461/545 (removed 84) transitions.
// Phase 1: matrix 461 rows 344 cols
[2025-06-07 18:05:29] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-07 18:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:30] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 18:05:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/805 variables, and 359 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 460/819 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:15] [INFO ] Deduced a trap along path composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:24] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:25] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 823 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 344/428 places, 461/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60335 ms. Remains : 344/428 places, 461/545 transitions.
[2025-06-07 18:06:30] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:06:30] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:06:30] [INFO ] Input system was already deterministic with 461 transitions.
[2025-06-07 18:06:30] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:06:30] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7715080690371331190.gal : 1 ms
[2025-06-07 18:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16576288307436337066.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/CTLFireability7715080690371331190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16576288307436337066.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.38161e+20,0.163734,9396,2,1756,5,23975,6,0,1839,19036,0


Converting to forward existential form...Done !
original formula: AG(AX((p215==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p215==0)))] = FALSE
(forward)formula 0,0,0.218185,9652,1,0,9,23975,9,2,2930,19036,2
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-11 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 : 428/428 places, 545/545 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 386 transition count 503
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 386 transition count 503
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 108 place count 362 transition count 479
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 362 transition count 479
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 137 place count 357 transition count 474
Iterating global reduction 0 with 5 rules applied. Total rules applied 142 place count 357 transition count 474
Applied a total of 142 rules in 20 ms. Remains 357 /428 variables (removed 71) and now considering 474/545 (removed 71) transitions.
// Phase 1: matrix 474 rows 357 cols
[2025-06-07 18:06:30] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-07 18:06:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:30] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2025-06-07 18:06:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:38] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:40] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/831 variables, 357/374 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 831/831 variables, and 374 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/831 variables, 357/374 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 473/847 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:09] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:11] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:11] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 4/851 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:17] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 831/831 variables, and 852 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 357/428 places, 474/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60333 ms. Remains : 357/428 places, 474/545 transitions.
[2025-06-07 18:07:30] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:07:30] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:07:30] [INFO ] Input system was already deterministic with 474 transitions.
[2025-06-07 18:07:30] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:07:30] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:07:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17719601810248308805.gal : 1 ms
[2025-06-07 18:07:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6053640739219524900.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/CTLFireability17719601810248308805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6053640739219524900.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.39856e+20,0.235671,12560,2,2337,5,39265,6,0,1904,36936,0


Converting to forward existential form...Done !
original formula: A((AG(((p75==1)&&(p200==1))) * ((!(EX(((p79==1)||(p477==1)))) + (p520!=1)) + (p544==1))) U A((p336==1) U (EG(!(AG((p73==1)))) + AG((((p38...188
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG(!(!(E(TRUE U !((p73==1)))))) + !(E(TRUE U !((((p384==1)&&(p492==1))&&(p229!=1)))))))...1114
Reverse transition relation is NOT exact ! Due to transitions t7, t46, t58, t61, t65, t89, t109, t114, t136, t141, t165, t187, t192, t217, t239, t243, t267...293
(forward)formula 0,1,7.73284,234680,1,0,674,1.33063e+06,984,443,11209,1.10598e+06,1089
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-12 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 : 428/428 places, 545/545 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 393 transition count 510
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 393 transition count 510
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 91 place count 372 transition count 489
Iterating global reduction 0 with 21 rules applied. Total rules applied 112 place count 372 transition count 489
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 366 transition count 483
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 366 transition count 483
Applied a total of 124 rules in 26 ms. Remains 366 /428 variables (removed 62) and now considering 483/545 (removed 62) transitions.
// Phase 1: matrix 483 rows 366 cols
[2025-06-07 18:07:38] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-07 18:07:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:39] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2025-06-07 18:07: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/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:46] [INFO ] Deduced a trap composed of 51 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 18:07:47] [INFO ] Deduced a trap composed of 51 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:47] [INFO ] Deduced a trap composed of 51 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 18:07:48] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:48] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:48] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:49] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:49] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:51] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (OVERLAPS) 483/849 variables, 366/390 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 849/849 variables, and 390 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (OVERLAPS) 483/849 variables, 366/390 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 482/872 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:24] [INFO ] Deduced a trap along path composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 873 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 366/428 places, 483/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 366/428 places, 483/545 transitions.
[2025-06-07 18:08:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:08:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:08:39] [INFO ] Input system was already deterministic with 483 transitions.
[2025-06-07 18:08:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:08:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:08:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14021509159108093055.gal : 2 ms
[2025-06-07 18:08:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1365958668275952915.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/CTLFireability14021509159108093055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1365958668275952915.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.43091e+20,0.290605,14112,2,2883,5,47344,6,0,1949,42598,0


Converting to forward existential form...Done !
original formula: E(((A(((p301==1)&&(p388==1)) U AF((p561==1))) * A(!(EX((p484==1))) U ((AX((p218==1)) + ((p397==1)&&(p222==1))) + ((p318==1)||(p462==1))))...355
=> equivalent forward existential formula: [FwdG((FwdU(FwdU(Init,((!((E(!(!(EG(!((p561==1))))) U (!(((p301==1)&&(p388==1))) * !(!(EG(!((p561==1))))))) + EG...687
Reverse transition relation is NOT exact ! Due to transitions t9, t36, t39, t63, t67, t69, t87, t95, t115, t120, t128, t142, t147, t171, t191, t196, t221, ...315
Detected timeout of ITS tools.
[2025-06-07 18:09:09] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:09:09] [INFO ] Applying decomposition
[2025-06-07 18:09:09] [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/graph13836472774739749484.txt' '-o' '/tmp/graph13836472774739749484.bin' '-w' '/tmp/graph13836472774739749484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13836472774739749484.bin' '-l' '-1' '-v' '-w' '/tmp/graph13836472774739749484.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:09:09] [INFO ] Decomposing Gal with order
[2025-06-07 18:09:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:09:09] [INFO ] Removed a total of 289 redundant transitions.
[2025-06-07 18:09:09] [INFO ] Flatten gal took : 19 ms
[2025-06-07 18:09:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 18:09:09] [INFO ] Time to serialize gal into /tmp/CTLFireability6428318789785601099.gal : 4 ms
[2025-06-07 18:09:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16791094614722099534.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/CTLFireability6428318789785601099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16791094614722099534.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 -...263
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.43091e+20,0.11804,8620,752,20,8857,545,735,9197,49,1302,0


Converting to forward existential form...Done !
original formula: E(((A(((i8.u75.p301==1)&&(i11.i0.i1.u99.p388==1)) U AF((i15.i1.i0.u147.p561==1))) * A(!(EX((i13.u125.p484==1))) U ((AX((i6.u55.p218==1)) ...567
=> equivalent forward existential formula: [FwdG((FwdU(FwdU(Init,((!((E(!(!(EG(!((i15.i1.i0.u147.p561==1))))) U (!(((i8.u75.p301==1)&&(i11.i0.i1.u99.p388==...1019
Reverse transition relation is NOT exact ! Due to transitions t9, t63, t115, t142, t191, t296, i1.t376, i1.u2.t372, i2.i1.i1.t351, i3.t326, i4.t301, i5.t27...421
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
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 a local 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,12.6664,329004,1,0,581062,653,6499,929123,291,1564,690759
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Graph (trivial) has 452 edges and 428 vertex of which 254 / 428 are part of one of the 15 SCC in 0 ms
Free SCC test removed 239 places
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 188 transition count 204
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 97 rules applied. Total rules applied 173 place count 113 transition count 182
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 183 place count 104 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 184 place count 103 transition count 181
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 208 place count 79 transition count 146
Iterating global reduction 4 with 24 rules applied. Total rules applied 232 place count 79 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 236 place count 79 transition count 142
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 241 place count 74 transition count 125
Iterating global reduction 5 with 5 rules applied. Total rules applied 246 place count 74 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 251 place count 74 transition count 120
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 307 place count 46 transition count 92
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 309 place count 44 transition count 86
Iterating global reduction 6 with 2 rules applied. Total rules applied 311 place count 44 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 313 place count 44 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 315 place count 42 transition count 82
Applied a total of 315 rules in 14 ms. Remains 42 /428 variables (removed 386) and now considering 82/545 (removed 463) transitions.
[2025-06-07 18:09:22] [INFO ] Flow matrix only has 41 transitions (discarded 41 similar events)
// Phase 1: matrix 41 rows 42 cols
[2025-06-07 18:09:22] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 18:09:22] [INFO ] Flow matrix only has 41 transitions (discarded 41 similar events)
[2025-06-07 18:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:22] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:09:22] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-07 18:09:22] [INFO ] Flow matrix only has 41 transitions (discarded 41 similar events)
[2025-06-07 18:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/82 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/82 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/83 variables, and 57 constraints, problems are : Problem set: 0 solved, 40 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 40/82 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/83 variables, and 97 constraints, problems are : Problem set: 0 solved, 40 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1151ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1151ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/428 places, 82/545 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1267 ms. Remains : 42/428 places, 82/545 transitions.
[2025-06-07 18:09:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:09:23] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:09:23] [INFO ] Input system was already deterministic with 82 transitions.
[2025-06-07 18:09:23] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:09:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:09:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1818665013371975483.gal : 0 ms
[2025-06-07 18:09:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3141740482413386987.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/CTLFireability1818665013371975483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3141740482413386987.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,4.25153e+06,0.016182,4248,2,70,5,645,6,0,238,362,0


Converting to forward existential form...Done !
original formula: AF((p12==1))
=> equivalent forward existential formula: [FwdG(Init,!((p12==1)))] = FALSE
Hit Full ! (commute/partial/dont) 80/0/2
(forward)formula 0,0,0.027477,4504,1,0,8,3117,20,4,1151,2032,8
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 545/545 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 388 transition count 505
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 388 transition count 505
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 104 place count 364 transition count 481
Iterating global reduction 0 with 24 rules applied. Total rules applied 128 place count 364 transition count 481
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 358 transition count 475
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 358 transition count 475
Applied a total of 140 rules in 23 ms. Remains 358 /428 variables (removed 70) and now considering 475/545 (removed 70) transitions.
// Phase 1: matrix 475 rows 358 cols
[2025-06-07 18:09:23] [INFO ] Computed 15 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:23] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-07 18:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:23] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2025-06-07 18:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:31] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 475/833 variables, 358/374 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/833 variables, and 374 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 475/833 variables, 358/374 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 474/848 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:08] [INFO ] Deduced a trap along path composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:18] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 850 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 358/428 places, 475/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60378 ms. Remains : 358/428 places, 475/545 transitions.
[2025-06-07 18:10:23] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:10:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:23] [INFO ] Input system was already deterministic with 475 transitions.
[2025-06-07 18:10:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:23] [INFO ] Time to serialize gal into /tmp/CTLFireability1276745566828054414.gal : 2 ms
[2025-06-07 18:10:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13377219707453826091.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/CTLFireability1276745566828054414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13377219707453826091.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.52491e+20,0.193408,10272,2,1930,5,27032,6,0,1909,22925,0


Converting to forward existential form...Done !
original formula: A(!(((((E(AG((p36==1)) U AF((p203==1))) * !(((p316==1)&&(p423==1)))) + !(EF((p516==1)))) + (EX((p546==1)) + EG((p518==1)))) + (!(((AX((p2...267
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((p177==1)) U (!(!(E(TRUE U !(!(!((E(!((p63==1)) U (!((p312==1)) * !((p63==1)))) + EG(!((...776
Reverse transition relation is NOT exact ! Due to transitions t9, t30, t59, t64, t88, t110, t115, t140, t164, t182, t186, t191, t216, t242, t266, t291, t31...270
Detected timeout of ITS tools.
[2025-06-07 18:10:53] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:10:53] [INFO ] Applying decomposition
[2025-06-07 18:10:53] [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/graph10318037972560311622.txt' '-o' '/tmp/graph10318037972560311622.bin' '-w' '/tmp/graph10318037972560311622.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10318037972560311622.bin' '-l' '-1' '-v' '-w' '/tmp/graph10318037972560311622.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:10:53] [INFO ] Decomposing Gal with order
[2025-06-07 18:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:10:53] [INFO ] Removed a total of 282 redundant transitions.
[2025-06-07 18:10:53] [INFO ] Flatten gal took : 30 ms
[2025-06-07 18:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2025-06-07 18:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability4838640414729403890.gal : 3 ms
[2025-06-07 18:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10136323998042992244.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/CTLFireability4838640414729403890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10136323998042992244.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 -...263
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.52491e+20,0.096343,7828,972,20,7285,326,659,5729,49,743,0


Converting to forward existential form...Done !
original formula: A(!(((((E(AG((i1.u9.p36==1)) U AF((i6.u50.p203==1))) * !(((i9.u75.p316==1)&&(i12.i0.i0.u102.p423==1)))) + !(EF((i14.u121.p516==1)))) + (E...395
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((i5.i1.i1.u44.p177==1)) U (!(!(E(TRUE U !(!(!((E(!((i2.u15.p63==1)) U (!((i9.u72.p312==1...1078
Reverse transition relation is NOT exact ! Due to transitions t9, t59, t110, t186, i1.t368, i2.t342, i3.t316, i4.t291, i5.i0.t266, i6.t242, i7.t216, i8.t19...334
Using saturation style SCC detection
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
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,0,6.24263,210708,1,0,454675,327,5185,514706,265,743,632490
FORMULA Champagne-PT-H05T2O-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 18:11:00] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:11:00] [INFO ] Flatten gal took : 8 ms
Total runtime 896981 ms.

BK_STOP 1749319860355

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

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