Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.4K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 11:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 18K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:45 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 380K 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-H10T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H10T0R-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749333105086

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-H10T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 21:51:46] [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 21:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 21:51:46] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2025-06-07 21:51:46] [INFO ] Transformed 1259 places.
[2025-06-07 21:51:46] [INFO ] Transformed 2192 transitions.
[2025-06-07 21:51:46] [INFO ] Found NUPN structural information;
[2025-06-07 21:51:46] [INFO ] Parsed PT model containing 1259 places and 2192 transitions and 6374 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 157 out of 1259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1259/1259 places, 2192/2192 transitions.
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 283 place count 976 transition count 1909
Iterating global reduction 0 with 283 rules applied. Total rules applied 566 place count 976 transition count 1909
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 725 place count 817 transition count 1750
Iterating global reduction 0 with 159 rules applied. Total rules applied 884 place count 817 transition count 1750
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 955 place count 746 transition count 1619
Iterating global reduction 0 with 71 rules applied. Total rules applied 1026 place count 746 transition count 1619
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 1044 place count 746 transition count 1601
Applied a total of 1044 rules in 230 ms. Remains 746 /1259 variables (removed 513) and now considering 1601/2192 (removed 591) transitions.
// Phase 1: matrix 1601 rows 746 cols
[2025-06-07 21:51:46] [INFO ] Computed 63 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:51:47] [INFO ] Implicit Places using invariants in 482 ms returned []
[2025-06-07 21:51:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:51:47] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2025-06-07 21:51:48] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 745/2347 variables, and 0 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/746 constraints, PredecessorRefiner: 1600/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 745/2347 variables, and 0 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, State Equation: 0/746 constraints, PredecessorRefiner: 1/1599 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60702ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 60722ms
Starting structural reductions in LTL mode, iteration 1 : 746/1259 places, 1601/2192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62119 ms. Remains : 746/1259 places, 1601/2192 transitions.
Support contains 157 out of 746 places after structural reductions.
[2025-06-07 21:52:49] [INFO ] Flatten gal took : 116 ms
[2025-06-07 21:52:49] [INFO ] Flatten gal took : 72 ms
[2025-06-07 21:52:49] [INFO ] Input system was already deterministic with 1601 transitions.
RANDOM walk for 40000 steps (41 resets) in 1933 ms. (20 steps per ms) remains 16/109 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
[2025-06-07 21:52:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 386/422 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 324/746 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1601/2347 variables, 746/809 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:50] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:50] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:51] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:51] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 11 ms to minimize.
Problem AtomicPropp7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:51] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2347 variables, 5/814 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2347 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/2347 variables, 0/814 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2347/2347 variables, and 814 constraints, problems are : Problem set: 1 solved, 15 unsolved in 3231 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 746/746 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 356/390 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 356/746 variables, 34/63 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 5/68 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:53] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:53] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:53] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:53] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:54] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:54] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 6/74 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1601/2347 variables, 746/820 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2347 variables, 15/835 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:54] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:55] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:55] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:55] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:55] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:56] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:56] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:56] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:56] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2347 variables, 9/844 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:56] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2347 variables, 1/845 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:52:57] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2347 variables, 1/846 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2347/2347 variables, and 846 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 746/746 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8262ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 642 edges and 746 vertex of which 67 / 746 are part of one of the 14 SCC in 3 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 693 transition count 1419
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 1 with 221 rules applied. Total rules applied 333 place count 582 transition count 1309
Reduce places removed 53 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 57 rules applied. Total rules applied 390 place count 529 transition count 1305
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 396 place count 525 transition count 1303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 397 place count 524 transition count 1303
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 397 place count 524 transition count 1274
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 455 place count 495 transition count 1274
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 501 place count 449 transition count 1025
Iterating global reduction 5 with 46 rules applied. Total rules applied 547 place count 449 transition count 1025
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 567 place count 449 transition count 1005
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 567 place count 449 transition count 1000
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 577 place count 444 transition count 1000
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 581 place count 440 transition count 963
Iterating global reduction 6 with 4 rules applied. Total rules applied 585 place count 440 transition count 963
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 589 place count 440 transition count 959
Performed 205 Post agglomeration using F-continuation condition.Transition count delta: 205
Deduced a syphon composed of 205 places in 0 ms
Reduce places removed 205 places and 0 transitions.
Iterating global reduction 7 with 410 rules applied. Total rules applied 999 place count 235 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1000 place count 235 transition count 753
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1004 place count 231 transition count 732
Iterating global reduction 8 with 4 rules applied. Total rules applied 1008 place count 231 transition count 732
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1012 place count 231 transition count 728
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1018 place count 228 transition count 750
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1022 place count 228 transition count 746
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 1030 place count 228 transition count 738
Free-agglomeration rule applied 105 times.
Iterating global reduction 10 with 105 rules applied. Total rules applied 1135 place count 228 transition count 633
Reduce places removed 105 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 340 transitions
Reduce isomorphic transitions removed 340 transitions.
Iterating post reduction 10 with 445 rules applied. Total rules applied 1580 place count 123 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 11 with 23 rules applied. Total rules applied 1603 place count 123 transition count 270
Applied a total of 1603 rules in 294 ms. Remains 123 /746 variables (removed 623) and now considering 270/1601 (removed 1331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 123/746 places, 270/1601 transitions.
RANDOM walk for 40000 steps (8 resets) in 1246 ms. (32 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
[2025-06-07 21:52:59] [INFO ] Flow matrix only has 123 transitions (discarded 147 similar events)
// Phase 1: matrix 123 rows 123 cols
[2025-06-07 21:52:59] [INFO ] Computed 63 invariants in 1 ms
[2025-06-07 21:52:59] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 108/123 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 123/246 variables, 123/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 32/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 218 constraints, problems are : Problem set: 0 solved, 6 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 123/123 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 108/123 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 123/246 variables, 123/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 32/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 224 constraints, problems are : Problem set: 0 solved, 6 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 123/123 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 6 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 6 properties in 6 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-07 21:52:59] [INFO ] Flatten gal took : 56 ms
[2025-06-07 21:52:59] [INFO ] Flatten gal took : 46 ms
[2025-06-07 21:52:59] [INFO ] Input system was already deterministic with 1601 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 675 edges and 746 vertex of which 73 / 746 are part of one of the 14 SCC in 2 ms
Free SCC test removed 59 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 686 transition count 1416
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 1 with 235 rules applied. Total rules applied 355 place count 567 transition count 1300
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 57 rules applied. Total rules applied 412 place count 511 transition count 1299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 413 place count 510 transition count 1299
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 413 place count 510 transition count 1270
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 471 place count 481 transition count 1270
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 532 place count 420 transition count 972
Iterating global reduction 4 with 61 rules applied. Total rules applied 593 place count 420 transition count 972
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 618 place count 420 transition count 947
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 618 place count 420 transition count 930
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 652 place count 403 transition count 930
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 655 place count 400 transition count 907
Iterating global reduction 5 with 3 rules applied. Total rules applied 658 place count 400 transition count 907
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 661 place count 400 transition count 904
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 6 with 388 rules applied. Total rules applied 1049 place count 206 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1050 place count 206 transition count 709
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1058 place count 198 transition count 661
Iterating global reduction 7 with 8 rules applied. Total rules applied 1066 place count 198 transition count 661
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1074 place count 198 transition count 653
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1076 place count 196 transition count 651
Applied a total of 1076 rules in 132 ms. Remains 196 /746 variables (removed 550) and now considering 651/1601 (removed 950) transitions.
[2025-06-07 21:52:59] [INFO ] Flow matrix only has 257 transitions (discarded 394 similar events)
// Phase 1: matrix 257 rows 196 cols
[2025-06-07 21:52:59] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:53:00] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-07 21:53:00] [INFO ] Flow matrix only has 257 transitions (discarded 394 similar events)
[2025-06-07 21:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:53:00] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:53:00] [INFO ] Redundant transitions in 36 ms returned []
Running 528 sub problems to find dead transitions.
[2025-06-07 21:53:00] [INFO ] Flow matrix only has 257 transitions (discarded 394 similar events)
[2025-06-07 21:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 2 (OVERLAPS) 8/196 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 256/452 variables, 196/259 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 528 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/453 variables, and 259 constraints, problems are : Problem set: 0 solved, 528 unsolved in 26696 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 528/527 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 528 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 2 (OVERLAPS) 8/196 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 4 (OVERLAPS) 256/452 variables, 196/259 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 527/786 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 528 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/453 variables, and 786 constraints, problems are : Problem set: 0 solved, 528 unsolved in 29354 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 528/527 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56153ms problems are : Problem set: 0 solved, 528 unsolved
Search for dead transitions found 0 dead transitions in 56154ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/746 places, 651/1601 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56660 ms. Remains : 196/746 places, 651/1601 transitions.
[2025-06-07 21:53:56] [INFO ] Flatten gal took : 19 ms
[2025-06-07 21:53:56] [INFO ] Flatten gal took : 18 ms
[2025-06-07 21:53:56] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-07 21:53:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 21:53:56] [INFO ] Flatten gal took : 16 ms
[2025-06-07 21:53:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12281882459703735925.gal : 13 ms
[2025-06-07 21:53:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16252183608264995343.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12281882459703735925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16252183608264995343.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.13204e+30,0.147554,8372,2,336,5,8481,6,0,1422,3309,0


Converting to forward existential form...Done !
original formula: AG(((AF((p380==1)) + EG(A(((p970==1)&&(p947==1)) U EF(((p622==1)&&(p846==1)))))) + ((AG(A((p178==1) U ((p87==1)&&(p357==1)))) * (p405==1)...224
=> equivalent forward existential formula: ((([(FwdU(FwdU((FwdU(Init,TRUE) * !((!(EG(!((p380==1)))) + EG(!((E(!(E(TRUE U ((p622==1)&&(p846==1)))) U (!(((p9...1131
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 649/0/2
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.5523,352792,1,0,252,1.45243e+06,37,170,7663,2.6101e+06,172
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 686 edges and 746 vertex of which 69 / 746 are part of one of the 14 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 124 place count 690 transition count 1417
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 241 rules applied. Total rules applied 365 place count 567 transition count 1299
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 60 rules applied. Total rules applied 425 place count 509 transition count 1297
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 429 place count 507 transition count 1295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 430 place count 506 transition count 1295
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 430 place count 506 transition count 1264
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 492 place count 475 transition count 1264
Discarding 65 places :
Symmetric choice reduction at 5 with 65 rule applications. Total rules 557 place count 410 transition count 957
Iterating global reduction 5 with 65 rules applied. Total rules applied 622 place count 410 transition count 957
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 647 place count 410 transition count 932
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 647 place count 410 transition count 915
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 681 place count 393 transition count 915
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 685 place count 389 transition count 878
Iterating global reduction 6 with 4 rules applied. Total rules applied 689 place count 389 transition count 878
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 693 place count 389 transition count 874
Performed 194 Post agglomeration using F-continuation condition.Transition count delta: 194
Deduced a syphon composed of 194 places in 0 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 7 with 388 rules applied. Total rules applied 1081 place count 195 transition count 680
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1091 place count 185 transition count 620
Iterating global reduction 7 with 10 rules applied. Total rules applied 1101 place count 185 transition count 620
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1111 place count 185 transition count 610
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1113 place count 183 transition count 608
Applied a total of 1113 rules in 132 ms. Remains 183 /746 variables (removed 563) and now considering 608/1601 (removed 993) transitions.
[2025-06-07 21:54:08] [INFO ] Flow matrix only has 198 transitions (discarded 410 similar events)
// Phase 1: matrix 198 rows 183 cols
[2025-06-07 21:54:08] [INFO ] Computed 63 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:54:08] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-07 21:54:08] [INFO ] Flow matrix only has 198 transitions (discarded 410 similar events)
[2025-06-07 21:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:54:08] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:54:08] [INFO ] Redundant transitions in 7 ms returned []
Running 480 sub problems to find dead transitions.
[2025-06-07 21:54:08] [INFO ] Flow matrix only has 198 transitions (discarded 410 similar events)
[2025-06-07 21:54:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 4/183 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 197/380 variables, 183/246 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (OVERLAPS) 0/380 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 480 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/381 variables, and 246 constraints, problems are : Problem set: 0 solved, 480 unsolved in 22088 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 480/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 4/183 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (OVERLAPS) 197/380 variables, 183/246 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 479/725 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 480 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/381 variables, and 725 constraints, problems are : Problem set: 0 solved, 480 unsolved in 24114 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 480/479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46260ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 46262ms
Starting structural reductions in SI_CTL mode, iteration 1 : 183/746 places, 608/1601 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46752 ms. Remains : 183/746 places, 608/1601 transitions.
[2025-06-07 21:54:55] [INFO ] Flatten gal took : 13 ms
[2025-06-07 21:54:55] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:54:55] [INFO ] Input system was already deterministic with 608 transitions.
[2025-06-07 21:54:55] [INFO ] Flatten gal took : 13 ms
[2025-06-07 21:54:55] [INFO ] Flatten gal took : 13 ms
[2025-06-07 21:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2308535075849209581.gal : 4 ms
[2025-06-07 21:54:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11664635920401674962.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/CTLFireability2308535075849209581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11664635920401674962.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.13043e+28,0.13399,8100,2,304,5,8548,6,0,1329,4201,0


Converting to forward existential form...Done !
original formula: (EG(((p957==0)||(p1007==0))) * (AG((p992==0)) + (AF(((p239==1)&&(p373==1))) * E((p1236==1) U (p683==1)))))
=> equivalent forward existential formula: ([(Init * !(EG(((p957==0)||(p1007==0)))))] = FALSE * ([FwdG((Init * !(!(E(TRUE U !((p992==0)))))),!(((p239==1)&&...261
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 606/0/2
(forward)formula 0,0,0.449797,12580,1,0,11,47502,23,4,5956,15324,9
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 669 transition count 1300
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 669 transition count 1300
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 177 place count 669 transition count 1277
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 203 place count 643 transition count 1231
Iterating global reduction 1 with 26 rules applied. Total rules applied 229 place count 643 transition count 1231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 234 place count 643 transition count 1226
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 252 place count 625 transition count 1154
Iterating global reduction 2 with 18 rules applied. Total rules applied 270 place count 625 transition count 1154
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 283 place count 625 transition count 1141
Applied a total of 283 rules in 52 ms. Remains 625 /746 variables (removed 121) and now considering 1141/1601 (removed 460) transitions.
// Phase 1: matrix 1141 rows 625 cols
[2025-06-07 21:54:55] [INFO ] Computed 63 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:54:55] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-07 21:54:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:54:56] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 1140 sub problems to find dead transitions.
[2025-06-07 21:54:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 30216ms
Starting structural reductions in LTL mode, iteration 1 : 625/746 places, 1141/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31004 ms. Remains : 625/746 places, 1141/1601 transitions.
[2025-06-07 21:55:26] [INFO ] Flatten gal took : 26 ms
[2025-06-07 21:55:26] [INFO ] Flatten gal took : 26 ms
[2025-06-07 21:55:26] [INFO ] Input system was already deterministic with 1141 transitions.
[2025-06-07 21:55:26] [INFO ] Flatten gal took : 25 ms
[2025-06-07 21:55:26] [INFO ] Flatten gal took : 27 ms
[2025-06-07 21:55:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2784018792952655275.gal : 6 ms
[2025-06-07 21:55:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12430128444937859627.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/CTLFireability2784018792952655275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12430128444937859627.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.
Detected timeout of ITS tools.
[2025-06-07 21:55:56] [INFO ] Flatten gal took : 25 ms
[2025-06-07 21:55:56] [INFO ] Applying decomposition
[2025-06-07 21:55:56] [INFO ] Flatten gal took : 24 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/graph14077881389748084039.txt' '-o' '/tmp/graph14077881389748084039.bin' '-w' '/tmp/graph14077881389748084039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14077881389748084039.bin' '-l' '-1' '-v' '-w' '/tmp/graph14077881389748084039.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:55:57] [INFO ] Decomposing Gal with order
[2025-06-07 21:55:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:55:57] [INFO ] Removed a total of 1135 redundant transitions.
[2025-06-07 21:55:57] [INFO ] Flatten gal took : 114 ms
[2025-06-07 21:55:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 61 ms.
[2025-06-07 21:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6566971714906125509.gal : 14 ms
[2025-06-07 21:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16952893822367992625.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/CTLFireability6566971714906125509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16952893822367992625.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,7.69727e+59,0.63824,27104,2837,23,48298,820,1446,72599,59,1478,0


Converting to forward existential form...Done !
original formula: E(EG(AF((i5.u63.p352==1))) U (!((!(EX((((i43.u201.p1161==1)&&(i13.u81.p460==1))&&(i33.u123.p709==1)))) + (EX(AX(((i22.u84.p479==1)&&(i31....252
=> equivalent forward existential formula: (([((FwdU(Init,EG(!(EG(!((i5.u63.p352==1)))))) * !(!(EX((((i43.u201.p1161==1)&&(i13.u81.p460==1))&&(i33.u123.p70...512
Reverse transition relation is NOT exact ! Due to transitions t58, t77, t116, t155, t276, t377, t500, i0.t205, i0.t204, i0.u149.t209, i1.t545, i2.t565, i3....1636
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 668 transition count 1301
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 668 transition count 1301
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 179 place count 668 transition count 1278
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 208 place count 639 transition count 1229
Iterating global reduction 1 with 29 rules applied. Total rules applied 237 place count 639 transition count 1229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 241 place count 639 transition count 1225
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 261 place count 619 transition count 1129
Iterating global reduction 2 with 20 rules applied. Total rules applied 281 place count 619 transition count 1129
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 296 place count 619 transition count 1114
Applied a total of 296 rules in 70 ms. Remains 619 /746 variables (removed 127) and now considering 1114/1601 (removed 487) transitions.
// Phase 1: matrix 1114 rows 619 cols
[2025-06-07 21:56:27] [INFO ] Computed 63 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:56:27] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-07 21:56:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:56:28] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Running 1113 sub problems to find dead transitions.
[2025-06-07 21:56: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/618 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
At refinement iteration 1 (OVERLAPS) 1/619 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/1733 variables, and 63 constraints, problems are : Problem set: 0 solved, 1113 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/619 constraints, PredecessorRefiner: 1113/1112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
At refinement iteration 1 (OVERLAPS) 1/619 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(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 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)timeout

(s224 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/1733 variables, and 63 constraints, problems are : Problem set: 0 solved, 1113 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/619 constraints, PredecessorRefiner: 1/1112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 1113 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 619/746 places, 1114/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61037 ms. Remains : 619/746 places, 1114/1601 transitions.
[2025-06-07 21:57:28] [INFO ] Flatten gal took : 53 ms
[2025-06-07 21:57:28] [INFO ] Flatten gal took : 26 ms
[2025-06-07 21:57:28] [INFO ] Input system was already deterministic with 1114 transitions.
[2025-06-07 21:57:28] [INFO ] Flatten gal took : 21 ms
[2025-06-07 21:57:28] [INFO ] Flatten gal took : 22 ms
[2025-06-07 21:57:28] [INFO ] Time to serialize gal into /tmp/CTLFireability17212716366150381558.gal : 4 ms
[2025-06-07 21:57:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9761192407925088865.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/CTLFireability17212716366150381558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9761192407925088865.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.
Detected timeout of ITS tools.
[2025-06-07 21:57:58] [INFO ] Flatten gal took : 23 ms
[2025-06-07 21:57:58] [INFO ] Applying decomposition
[2025-06-07 21:57:58] [INFO ] Flatten gal took : 22 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/graph2749353730931736899.txt' '-o' '/tmp/graph2749353730931736899.bin' '-w' '/tmp/graph2749353730931736899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2749353730931736899.bin' '-l' '-1' '-v' '-w' '/tmp/graph2749353730931736899.weights' '-q' '0' '-e' '0.001'
[2025-06-07 21:57:59] [INFO ] Decomposing Gal with order
[2025-06-07 21:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 21:57:59] [INFO ] Removed a total of 1072 redundant transitions.
[2025-06-07 21:57:59] [INFO ] Flatten gal took : 46 ms
[2025-06-07 21:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 17 ms.
[2025-06-07 21:57:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18402385772152271704.gal : 7 ms
[2025-06-07 21:57:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7882879430419493460.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/CTLFireability18402385772152271704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7882879430419493460.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,4.38405e+59,1.08835,45880,5555,28,88291,989,1487,130931,61,2172,0


Converting to forward existential form...Done !
original formula: AF(AG(!(A(((((i7.u26.p144==1)&&(i12.u86.p506==1))||((i16.u58.p327==1)&&(i27.u92.p538==1)))||((i0.u27.p155==1)&&(i36.u125.p742==1))) U EX(...178
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(!((E(!(EX((i37.u140.p835==1))) U (!(((((i7.u26.p144==1)&&(i12.u86.p506==1))||((i16.u...308
Reverse transition relation is NOT exact ! Due to transitions t47, t203, t273, t373, i0.u28.t558, i1.t599, i2.t628, i3.t619, i4.t609, i5.t589, i6.t579, i7....1633
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 688 edges and 746 vertex of which 79 / 746 are part of one of the 15 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 681 transition count 1411
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 237 rules applied. Total rules applied 356 place count 563 transition count 1292
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 59 rules applied. Total rules applied 415 place count 505 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 416 place count 504 transition count 1291
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 416 place count 504 transition count 1261
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 476 place count 474 transition count 1261
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 535 place count 415 transition count 978
Iterating global reduction 4 with 59 rules applied. Total rules applied 594 place count 415 transition count 978
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 617 place count 415 transition count 955
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 14 Pre rules applied. Total rules applied 617 place count 415 transition count 941
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 645 place count 401 transition count 941
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 649 place count 397 transition count 904
Iterating global reduction 5 with 4 rules applied. Total rules applied 653 place count 397 transition count 904
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 657 place count 397 transition count 900
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 197
Deduced a syphon composed of 197 places in 0 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 6 with 394 rules applied. Total rules applied 1051 place count 200 transition count 703
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1061 place count 190 transition count 633
Iterating global reduction 6 with 10 rules applied. Total rules applied 1071 place count 190 transition count 633
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1081 place count 190 transition count 623
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1083 place count 188 transition count 621
Applied a total of 1083 rules in 93 ms. Remains 188 /746 variables (removed 558) and now considering 621/1601 (removed 980) transitions.
[2025-06-07 21:58:29] [INFO ] Flow matrix only has 201 transitions (discarded 420 similar events)
// Phase 1: matrix 201 rows 188 cols
[2025-06-07 21:58:29] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:58:29] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-07 21:58:29] [INFO ] Flow matrix only has 201 transitions (discarded 420 similar events)
[2025-06-07 21:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:58:29] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 21:58:29] [INFO ] Redundant transitions in 6 ms returned []
Running 494 sub problems to find dead transitions.
[2025-06-07 21:58:29] [INFO ] Flow matrix only has 201 transitions (discarded 420 similar events)
[2025-06-07 21:58: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/182 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 6/188 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:58:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 200/388 variables, 188/252 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 7 (OVERLAPS) 0/388 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 494 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/389 variables, and 252 constraints, problems are : Problem set: 0 solved, 494 unsolved in 25765 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 494/493 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (OVERLAPS) 6/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 200/388 variables, 188/252 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 493/745 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:59:09] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 21:59:09] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/389 variables, and 747 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 494/493 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55842ms problems are : Problem set: 0 solved, 494 unsolved
Search for dead transitions found 0 dead transitions in 55843ms
Starting structural reductions in SI_CTL mode, iteration 1 : 188/746 places, 621/1601 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56260 ms. Remains : 188/746 places, 621/1601 transitions.
[2025-06-07 21:59:25] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:59:25] [INFO ] Flatten gal took : 13 ms
[2025-06-07 21:59:25] [INFO ] Input system was already deterministic with 621 transitions.
[2025-06-07 21:59:25] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:59:25] [INFO ] Flatten gal took : 12 ms
[2025-06-07 21:59:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2798119751693763862.gal : 2 ms
[2025-06-07 21:59:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13902841521666813932.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/CTLFireability2798119751693763862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13902841521666813932.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.01195e+29,0.139015,8180,2,429,5,8602,6,0,1359,4138,0


Converting to forward existential form...Done !
original formula: EF(((E((p664==1) U ((((p1039==1) + AF(((p144==1)&&(p414==1)))) * (p1129!=1)) + EG(E((p1127==1) U (p1118==1))))) * (p641==1)) * (p732==1))...156
=> equivalent forward existential formula: (([((FwdU(((FwdU(Init,TRUE) * (p732==1)) * (p641==1)),(p664==1)) * (p1129!=1)) * (p1039==1))] != FALSE + [((FwdU...378
Hit Full ! (commute/partial/dont) 619/0/2
(forward)formula 0,1,0.178686,8436,1,0,15,8602,18,4,2417,4138,7
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 675 transition count 1303
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 675 transition count 1303
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 164 place count 675 transition count 1281
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 188 place count 651 transition count 1250
Iterating global reduction 1 with 24 rules applied. Total rules applied 212 place count 651 transition count 1250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 216 place count 651 transition count 1246
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 232 place count 635 transition count 1189
Iterating global reduction 2 with 16 rules applied. Total rules applied 248 place count 635 transition count 1189
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 259 place count 635 transition count 1178
Applied a total of 259 rules in 50 ms. Remains 635 /746 variables (removed 111) and now considering 1178/1601 (removed 423) transitions.
// Phase 1: matrix 1178 rows 635 cols
[2025-06-07 21:59:25] [INFO ] Computed 63 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:59:26] [INFO ] Implicit Places using invariants in 252 ms returned []
[2025-06-07 21:59:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 21:59:26] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 1177 sub problems to find dead transitions.
[2025-06-07 21:59:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/634 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
SMT process timed out in 30233ms, After SMT, problems are : Problem set: 0 solved, 1177 unsolved
Search for dead transitions found 0 dead transitions in 30237ms
Starting structural reductions in LTL mode, iteration 1 : 635/746 places, 1178/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31041 ms. Remains : 635/746 places, 1178/1601 transitions.
[2025-06-07 21:59:56] [INFO ] Flatten gal took : 19 ms
[2025-06-07 21:59:56] [INFO ] Flatten gal took : 19 ms
[2025-06-07 21:59:56] [INFO ] Input system was already deterministic with 1178 transitions.
[2025-06-07 21:59:56] [INFO ] Flatten gal took : 19 ms
[2025-06-07 21:59:56] [INFO ] Flatten gal took : 22 ms
[2025-06-07 21:59:56] [INFO ] Time to serialize gal into /tmp/CTLFireability5394878135435744607.gal : 4 ms
[2025-06-07 21:59:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12366097303852353711.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/CTLFireability5394878135435744607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12366097303852353711.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.
Detected timeout of ITS tools.
[2025-06-07 22:00:26] [INFO ] Flatten gal took : 19 ms
[2025-06-07 22:00:26] [INFO ] Applying decomposition
[2025-06-07 22:00:27] [INFO ] Flatten gal took : 18 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/graph115583220096194072.txt' '-o' '/tmp/graph115583220096194072.bin' '-w' '/tmp/graph115583220096194072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph115583220096194072.bin' '-l' '-1' '-v' '-w' '/tmp/graph115583220096194072.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:00:27] [INFO ] Decomposing Gal with order
[2025-06-07 22:00:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:00:27] [INFO ] Removed a total of 1160 redundant transitions.
[2025-06-07 22:00:27] [INFO ] Flatten gal took : 40 ms
[2025-06-07 22:00:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 18 ms.
[2025-06-07 22:00:27] [INFO ] Time to serialize gal into /tmp/CTLFireability1204334355362686207.gal : 7 ms
[2025-06-07 22:00:27] [INFO ] Time to serialize properties into /tmp/CTLFireability10140335717497456976.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/CTLFireability1204334355362686207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10140335717497456976.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.02123e+60,2.02767,77888,3208,34,101328,832,1563,574455,76,1615,0


Converting to forward existential form...Done !
original formula: E((!((A(!(A((i26.u112.p636==1) U (i10.u41.p239==1))) U !(AG((i20.u33.p185==1)))) * A(((i37.u196.p1167==1)||(((i4.u16.p83==1)&&(i13.u44.p2...636
=> equivalent forward existential formula: [((FwdU(Init,(!((!((E(!(!(!(E(TRUE U !((i20.u33.p185==1)))))) U (!(!(!((E(!((i10.u41.p239==1)) U (!((i26.u112.p6...1104
Reverse transition relation is NOT exact ! Due to transitions t9, t28, t47, t60, t100, t160, t191, t210, t260, t279, t361, t380, t488, t508, t629, i0.t583,...1749
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 698 edges and 746 vertex of which 80 / 746 are part of one of the 16 SCC in 2 ms
Free SCC test removed 64 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 681 transition count 1406
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 243 rules applied. Total rules applied 368 place count 557 transition count 1287
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 426 place count 499 transition count 1287
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 426 place count 499 transition count 1259
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 482 place count 471 transition count 1259
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 546 place count 407 transition count 960
Iterating global reduction 3 with 64 rules applied. Total rules applied 610 place count 407 transition count 960
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 634 place count 407 transition count 936
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 634 place count 407 transition count 918
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 670 place count 389 transition count 918
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 674 place count 385 transition count 881
Iterating global reduction 4 with 4 rules applied. Total rules applied 678 place count 385 transition count 881
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 682 place count 385 transition count 877
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 5 with 386 rules applied. Total rules applied 1068 place count 192 transition count 684
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1079 place count 181 transition count 610
Iterating global reduction 5 with 11 rules applied. Total rules applied 1090 place count 181 transition count 610
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1101 place count 181 transition count 599
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1103 place count 179 transition count 597
Applied a total of 1103 rules in 84 ms. Remains 179 /746 variables (removed 567) and now considering 597/1601 (removed 1004) transitions.
[2025-06-07 22:00:57] [INFO ] Flow matrix only has 180 transitions (discarded 417 similar events)
// Phase 1: matrix 180 rows 179 cols
[2025-06-07 22:00:57] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:00:57] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-07 22:00:57] [INFO ] Flow matrix only has 180 transitions (discarded 417 similar events)
[2025-06-07 22:00:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:00:57] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:00:57] [INFO ] Redundant transitions in 7 ms returned []
Running 468 sub problems to find dead transitions.
[2025-06-07 22:00:57] [INFO ] Flow matrix only has 180 transitions (discarded 417 similar events)
[2025-06-07 22:00:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 179/358 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 6 (OVERLAPS) 0/358 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 468 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/359 variables, and 242 constraints, problems are : Problem set: 0 solved, 468 unsolved in 20950 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 468/467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 179/358 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 467/709 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 7 (OVERLAPS) 0/358 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 468 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/359 variables, and 709 constraints, problems are : Problem set: 0 solved, 468 unsolved in 21206 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 468/467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42220ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 42221ms
Starting structural reductions in SI_CTL mode, iteration 1 : 179/746 places, 597/1601 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42592 ms. Remains : 179/746 places, 597/1601 transitions.
[2025-06-07 22:01:39] [INFO ] Flatten gal took : 8 ms
[2025-06-07 22:01:39] [INFO ] Flatten gal took : 9 ms
[2025-06-07 22:01:39] [INFO ] Input system was already deterministic with 597 transitions.
[2025-06-07 22:01:39] [INFO ] Flatten gal took : 9 ms
[2025-06-07 22:01:39] [INFO ] Flatten gal took : 9 ms
[2025-06-07 22:01:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11223917385393730374.gal : 2 ms
[2025-06-07 22:01:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3294064040125716027.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/CTLFireability11223917385393730374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3294064040125716027.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.39402e+28,0.130081,7920,2,296,5,5933,6,0,1300,2270,0


Converting to forward existential form...Done !
original formula: EF(!(A(!(AG(!(((p517==1)&&(p687==1))))) U (p226!=1))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!((p226!=1))) * !((p226!=1))) * !(E(TRUE U !(!(((p517==1)&&(p687==1)))))))] != FALSE + ...201
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 595/0/2
(forward)formula 0,1,0.48056,13168,1,0,12,51840,22,5,6579,18707,9
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-06 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 : 746/746 places, 1601/1601 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 671 transition count 1311
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 671 transition count 1311
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 172 place count 671 transition count 1289
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 199 place count 644 transition count 1242
Iterating global reduction 1 with 27 rules applied. Total rules applied 226 place count 644 transition count 1242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 231 place count 644 transition count 1237
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 249 place count 626 transition count 1149
Iterating global reduction 2 with 18 rules applied. Total rules applied 267 place count 626 transition count 1149
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 281 place count 626 transition count 1135
Applied a total of 281 rules in 61 ms. Remains 626 /746 variables (removed 120) and now considering 1135/1601 (removed 466) transitions.
// Phase 1: matrix 1135 rows 626 cols
[2025-06-07 22:01:40] [INFO ] Computed 63 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:01:40] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-07 22:01:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:01:41] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 1134 sub problems to find dead transitions.
[2025-06-07 22:01: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/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1134 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1761 variables, and 63 constraints, problems are : Problem set: 0 solved, 1134 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 1134/1133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1134 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/625 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1134 unsolved
At refinement iteration 1 (OVERLAPS) 1/626 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1134 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(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 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 timeout
0)
(s331 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1761 variables, and 63 constraints, problems are : Problem set: 0 solved, 1134 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 1/1133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 1134 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 626/746 places, 1135/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60996 ms. Remains : 626/746 places, 1135/1601 transitions.
[2025-06-07 22:02:41] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:02:41] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:02:41] [INFO ] Input system was already deterministic with 1135 transitions.
[2025-06-07 22:02:41] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:02:41] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:02:41] [INFO ] Time to serialize gal into /tmp/CTLFireability4688913886052654901.gal : 4 ms
[2025-06-07 22:02:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11129132792519450472.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/CTLFireability4688913886052654901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11129132792519450472.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.
Detected timeout of ITS tools.
[2025-06-07 22:03:11] [INFO ] Flatten gal took : 22 ms
[2025-06-07 22:03:11] [INFO ] Applying decomposition
[2025-06-07 22:03:11] [INFO ] Flatten gal took : 18 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/graph17953469749677447875.txt' '-o' '/tmp/graph17953469749677447875.bin' '-w' '/tmp/graph17953469749677447875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17953469749677447875.bin' '-l' '-1' '-v' '-w' '/tmp/graph17953469749677447875.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:03:11] [INFO ] Decomposing Gal with order
[2025-06-07 22:03:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:03:11] [INFO ] Removed a total of 1111 redundant transitions.
[2025-06-07 22:03:11] [INFO ] Flatten gal took : 50 ms
[2025-06-07 22:03:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 13 ms.
[2025-06-07 22:03:11] [INFO ] Time to serialize gal into /tmp/CTLFireability18229435085930219341.gal : 7 ms
[2025-06-07 22:03:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4833320054713048730.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/CTLFireability18229435085930219341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4833320054713048730.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,9.07536e+59,2.03236,75232,4852,25,162220,880,1458,247709,61,2303,0


Converting to forward existential form...Done !
original formula: E(EX((AX(!(((i21.u80.p460==1)&&(i29.u106.p614==1)))) * ((i11.u45.p252!=1)||((i28.u105.p603==1)&&(i27.u133.p773==1))))) U (!(AX(EG((i20.u7...384
=> equivalent forward existential formula: [(FwdU((FwdU(Init,EX((!(EX(!(!(((i21.u80.p460==1)&&(i29.u106.p614==1)))))) * ((i11.u45.p252!=1)||((i28.u105.p603...449
Reverse transition relation is NOT exact ! Due to transitions t9, t28, t115, t155, i0.t379, i0.t378, i0.t278, i0.t277, i0.u88.t383, i0.u122.t282, i1.t535, ...1612
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 74 place count 672 transition count 1318
Iterating global reduction 0 with 74 rules applied. Total rules applied 148 place count 672 transition count 1318
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 170 place count 672 transition count 1296
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 195 place count 647 transition count 1255
Iterating global reduction 1 with 25 rules applied. Total rules applied 220 place count 647 transition count 1255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 224 place count 647 transition count 1251
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 241 place count 630 transition count 1165
Iterating global reduction 2 with 17 rules applied. Total rules applied 258 place count 630 transition count 1165
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 271 place count 630 transition count 1152
Applied a total of 271 rules in 57 ms. Remains 630 /746 variables (removed 116) and now considering 1152/1601 (removed 449) transitions.
// Phase 1: matrix 1152 rows 630 cols
[2025-06-07 22:03:41] [INFO ] Computed 63 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:03:42] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-06-07 22:03:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:03:42] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 1151 sub problems to find dead transitions.
[2025-06-07 22:03:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (OVERLAPS) 1/630 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:04:12] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/1782 variables, and 64 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1151/1150 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (OVERLAPS) 1/630 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
(s34 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(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 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0timeout
)
(s35 0)
(s36 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/1782 variables, and 64 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1/1150 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60225ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 630/746 places, 1152/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60955 ms. Remains : 630/746 places, 1152/1601 transitions.
[2025-06-07 22:04:42] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:04:42] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:04:42] [INFO ] Input system was already deterministic with 1152 transitions.
[2025-06-07 22:04:42] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:04:43] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:04:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5419690443252486446.gal : 4 ms
[2025-06-07 22:04:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6245783170758269970.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/CTLFireability5419690443252486446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6245783170758269970.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.
Detected timeout of ITS tools.
[2025-06-07 22:05:13] [INFO ] Flatten gal took : 24 ms
[2025-06-07 22:05:13] [INFO ] Applying decomposition
[2025-06-07 22:05:13] [INFO ] Flatten gal took : 18 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/graph2873725607268309697.txt' '-o' '/tmp/graph2873725607268309697.bin' '-w' '/tmp/graph2873725607268309697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2873725607268309697.bin' '-l' '-1' '-v' '-w' '/tmp/graph2873725607268309697.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:05:13] [INFO ] Decomposing Gal with order
[2025-06-07 22:05:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:05:13] [INFO ] Removed a total of 1148 redundant transitions.
[2025-06-07 22:05:13] [INFO ] Flatten gal took : 45 ms
[2025-06-07 22:05:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 27 ms.
[2025-06-07 22:05:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1193467502626922333.gal : 6 ms
[2025-06-07 22:05:13] [INFO ] Time to serialize properties into /tmp/CTLFireability17057191465865745115.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/CTLFireability1193467502626922333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17057191465865745115.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,1.27255e+60,2.08869,73296,8444,23,142727,1074,1445,279463,64,2902,0


Converting to forward existential form...Done !
original formula: E((i28.u106.p599==1) U (((EX(!(((i46.u212.p1224==1)&&(i34.u160.p928==1)))) * AX(EG(EX((i46.u207.p1213==1))))) * ((EF(((i1.u36.p201==1)&&(...328
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,(i28.u106.p599==1)) * (EX(!(((i46.u212.p1224==1)&&(i34.u160.p928==1)))) * !(EX(!(EG(EX((i46...742
Reverse transition relation is NOT exact ! Due to transitions t80, t119, t212, t283, t384, i0.t520, i1.t550, i2.t580, i3.t639, i3.t446, i3.u71.t450, i4.t63...1632
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 674 transition count 1327
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 674 transition count 1327
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 165 place count 674 transition count 1306
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 189 place count 650 transition count 1265
Iterating global reduction 1 with 24 rules applied. Total rules applied 213 place count 650 transition count 1265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 217 place count 650 transition count 1261
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 233 place count 634 transition count 1185
Iterating global reduction 2 with 16 rules applied. Total rules applied 249 place count 634 transition count 1185
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 262 place count 634 transition count 1172
Applied a total of 262 rules in 44 ms. Remains 634 /746 variables (removed 112) and now considering 1172/1601 (removed 429) transitions.
// Phase 1: matrix 1172 rows 634 cols
[2025-06-07 22:05:43] [INFO ] Computed 63 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:05:43] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-07 22:05:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:05:44] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 1171 sub problems to find dead transitions.
[2025-06-07 22:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1171 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 1171 unsolved
Search for dead transitions found 0 dead transitions in 30211ms
Starting structural reductions in LTL mode, iteration 1 : 634/746 places, 1172/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30931 ms. Remains : 634/746 places, 1172/1601 transitions.
[2025-06-07 22:06:14] [INFO ] Flatten gal took : 19 ms
[2025-06-07 22:06:14] [INFO ] Flatten gal took : 19 ms
[2025-06-07 22:06:14] [INFO ] Input system was already deterministic with 1172 transitions.
[2025-06-07 22:06:14] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:06:14] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:06:14] [INFO ] Time to serialize gal into /tmp/CTLFireability3266043104055163116.gal : 4 ms
[2025-06-07 22:06:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4479875619040653951.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/CTLFireability3266043104055163116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4479875619040653951.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.
Detected timeout of ITS tools.
[2025-06-07 22:06:44] [INFO ] Flatten gal took : 31 ms
[2025-06-07 22:06:44] [INFO ] Applying decomposition
[2025-06-07 22:06:44] [INFO ] Flatten gal took : 19 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/graph13248167598406428941.txt' '-o' '/tmp/graph13248167598406428941.bin' '-w' '/tmp/graph13248167598406428941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13248167598406428941.bin' '-l' '-1' '-v' '-w' '/tmp/graph13248167598406428941.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:06:44] [INFO ] Decomposing Gal with order
[2025-06-07 22:06:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:06:44] [INFO ] Removed a total of 1176 redundant transitions.
[2025-06-07 22:06:44] [INFO ] Flatten gal took : 37 ms
[2025-06-07 22:06:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 9 ms.
[2025-06-07 22:06:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5662041792206201074.gal : 6 ms
[2025-06-07 22:06:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8455305017660012831.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/CTLFireability5662041792206201074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8455305017660012831.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,1.75792e+60,4.10214,156648,5146,30,363921,989,1475,531452,62,2846,0


Converting to forward existential form...Done !
original formula: E(!(((i30.u124.p717==1)&&(i32.u137.p792==1))) U ((EX(EX((i2.u9.p15==1))) + (i23.u86.p497==1)) + (((EX((i41.u199.p1146==1)) * A(((i5.u18.p...424
=> equivalent forward existential formula: (([(EY(EY(FwdU(Init,!(((i30.u124.p717==1)&&(i32.u137.p792==1)))))) * (i2.u9.p15==1))] != FALSE + [(FwdU(Init,!((...724
(forward)formula 0,1,11.0908,356072,1,0,874565,989,3234,1.05078e+06,105,2846,1474625
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 670 transition count 1296
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 670 transition count 1296
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 175 place count 670 transition count 1273
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 202 place count 643 transition count 1226
Iterating global reduction 1 with 27 rules applied. Total rules applied 229 place count 643 transition count 1226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 234 place count 643 transition count 1221
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 252 place count 625 transition count 1129
Iterating global reduction 2 with 18 rules applied. Total rules applied 270 place count 625 transition count 1129
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 283 place count 625 transition count 1116
Applied a total of 283 rules in 42 ms. Remains 625 /746 variables (removed 121) and now considering 1116/1601 (removed 485) transitions.
// Phase 1: matrix 1116 rows 625 cols
[2025-06-07 22:06:55] [INFO ] Computed 63 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:06:56] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-06-07 22:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:06:56] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 1115 sub problems to find dead transitions.
[2025-06-07 22:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1741 variables, and 63 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 1115/1114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 625/1741 variables, and 63 constraints, problems are : Problem set: 0 solved, 1115 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 1/1114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 1115 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 625/746 places, 1116/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60943 ms. Remains : 625/746 places, 1116/1601 transitions.
[2025-06-07 22:07:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:07:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:07:56] [INFO ] Input system was already deterministic with 1116 transitions.
[2025-06-07 22:07:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:07:56] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:07:56] [INFO ] Time to serialize gal into /tmp/CTLFireability7320037867925785267.gal : 4 ms
[2025-06-07 22:07:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16662063429511097969.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/CTLFireability7320037867925785267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16662063429511097969.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.
Detected timeout of ITS tools.
[2025-06-07 22:08:27] [INFO ] Flatten gal took : 21 ms
[2025-06-07 22:08:27] [INFO ] Applying decomposition
[2025-06-07 22:08:27] [INFO ] Flatten gal took : 17 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/graph5298944246161226649.txt' '-o' '/tmp/graph5298944246161226649.bin' '-w' '/tmp/graph5298944246161226649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5298944246161226649.bin' '-l' '-1' '-v' '-w' '/tmp/graph5298944246161226649.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:08:27] [INFO ] Decomposing Gal with order
[2025-06-07 22:08:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:08:27] [INFO ] Removed a total of 1072 redundant transitions.
[2025-06-07 22:08:27] [INFO ] Flatten gal took : 33 ms
[2025-06-07 22:08:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 7 ms.
[2025-06-07 22:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5351069482284347716.gal : 5 ms
[2025-06-07 22:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7163327030878077790.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/CTLFireability5351069482284347716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7163327030878077790.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,7.92275e+59,1.57492,63180,3282,25,140732,955,1448,181405,77,2104,0


Converting to forward existential form...Done !
original formula: EX((EX(((i16.u60.p327==1)&&(i25.u100.p573==1))) + (A(AG((i43.u184.p1098!=1)) U !(((EG((i24.u90.p517==1)) * (i41.u183.p1078==1)) * ((i33.i...313
=> equivalent forward existential formula: ([(EY(EY(Init)) * ((i16.u60.p327==1)&&(i25.u100.p573==1)))] != FALSE + ([((EY(Init) * !((E(!(!(((EG((i24.u90.p51...1029
Reverse transition relation is NOT exact ! Due to transitions t9, t158, t208, t277, t378, i0.t339, i0.u104.t343, i1.t512, i2.t585, i3.t634, i3.t615, i4.t62...1552
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 666 transition count 1297
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 666 transition count 1297
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 183 place count 666 transition count 1274
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 212 place count 637 transition count 1225
Iterating global reduction 1 with 29 rules applied. Total rules applied 241 place count 637 transition count 1225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 246 place count 637 transition count 1220
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 266 place count 617 transition count 1124
Iterating global reduction 2 with 20 rules applied. Total rules applied 286 place count 617 transition count 1124
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 301 place count 617 transition count 1109
Applied a total of 301 rules in 42 ms. Remains 617 /746 variables (removed 129) and now considering 1109/1601 (removed 492) transitions.
// Phase 1: matrix 1109 rows 617 cols
[2025-06-07 22:08:57] [INFO ] Computed 63 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:08:57] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-07 22:08:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:08:58] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Running 1108 sub problems to find dead transitions.
[2025-06-07 22:08:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (OVERLAPS) 1/617 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1726 variables, and 63 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1108/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (OVERLAPS) 1/617 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1726 variables, and 63 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 1108 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 617/746 places, 1109/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 617/746 places, 1109/1601 transitions.
[2025-06-07 22:09:58] [INFO ] Flatten gal took : 16 ms
[2025-06-07 22:09:58] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:09:58] [INFO ] Input system was already deterministic with 1109 transitions.
[2025-06-07 22:09:58] [INFO ] Flatten gal took : 22 ms
[2025-06-07 22:09:58] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:09:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18182260274145340206.gal : 4 ms
[2025-06-07 22:09:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6184173536716272106.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/CTLFireability18182260274145340206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6184173536716272106.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.
Detected timeout of ITS tools.
[2025-06-07 22:10:28] [INFO ] Flatten gal took : 22 ms
[2025-06-07 22:10:28] [INFO ] Applying decomposition
[2025-06-07 22:10:28] [INFO ] Flatten gal took : 17 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/graph8874642660069955148.txt' '-o' '/tmp/graph8874642660069955148.bin' '-w' '/tmp/graph8874642660069955148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8874642660069955148.bin' '-l' '-1' '-v' '-w' '/tmp/graph8874642660069955148.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:10:28] [INFO ] Decomposing Gal with order
[2025-06-07 22:10:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:10:28] [INFO ] Removed a total of 1081 redundant transitions.
[2025-06-07 22:10:28] [INFO ] Flatten gal took : 32 ms
[2025-06-07 22:10:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 8 ms.
[2025-06-07 22:10:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1130909749786204620.gal : 5 ms
[2025-06-07 22:10:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1642893205708610640.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/CTLFireability1130909749786204620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1642893205708610640.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,3.51152e+59,0.940701,39752,4607,24,75983,905,1426,101998,61,1679,0


Converting to forward existential form...Done !
original formula: AG((EX(AX(((i27.u104.p603==1)&&(i28.u131.p773==1)))) + EF(AG(((i11.u42.p239==1)&&(i21.u75.p433==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((i11.u42.p239==1)&&(i21.u75.p433==1)))))))) * !(EX(!(EX(!(((i27.u1...202
Reverse transition relation is NOT exact ! Due to transitions t203, t273, t372, i0.t497, i0.t403, i0.u79.t407, i1.t527, i2.t567, i3.t617, i4.t607, i5.t597,...1589
(forward)formula 0,0,5.09977,241992,1,0,712635,905,8962,578252,289,1679,1496268
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 679 edges and 746 vertex of which 78 / 746 are part of one of the 16 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 683 transition count 1415
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 1 with 231 rules applied. Total rules applied 350 place count 565 transition count 1302
Reduce places removed 55 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 57 rules applied. Total rules applied 407 place count 510 transition count 1300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 413 place count 508 transition count 1296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 415 place count 506 transition count 1296
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 415 place count 506 transition count 1267
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 473 place count 477 transition count 1267
Discarding 61 places :
Symmetric choice reduction at 5 with 61 rule applications. Total rules 534 place count 416 transition count 989
Iterating global reduction 5 with 61 rules applied. Total rules applied 595 place count 416 transition count 989
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 617 place count 416 transition count 967
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 617 place count 416 transition count 951
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 649 place count 400 transition count 951
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 653 place count 396 transition count 914
Iterating global reduction 6 with 4 rules applied. Total rules applied 657 place count 396 transition count 914
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 661 place count 396 transition count 910
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 7 with 378 rules applied. Total rules applied 1039 place count 207 transition count 721
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1049 place count 197 transition count 661
Iterating global reduction 7 with 10 rules applied. Total rules applied 1059 place count 197 transition count 661
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1069 place count 197 transition count 651
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1071 place count 195 transition count 649
Applied a total of 1071 rules in 86 ms. Remains 195 /746 variables (removed 551) and now considering 649/1601 (removed 952) transitions.
[2025-06-07 22:10:33] [INFO ] Flow matrix only has 241 transitions (discarded 408 similar events)
// Phase 1: matrix 241 rows 195 cols
[2025-06-07 22:10:33] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:10:33] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-07 22:10:33] [INFO ] Flow matrix only has 241 transitions (discarded 408 similar events)
[2025-06-07 22:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:10:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-07 22:10:34] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:10:34] [INFO ] Redundant transitions in 9 ms returned []
Running 529 sub problems to find dead transitions.
[2025-06-07 22:10:34] [INFO ] Flow matrix only has 241 transitions (discarded 408 similar events)
[2025-06-07 22:10:34] [INFO ] Invariant cache hit.
[2025-06-07 22:10:34] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (OVERLAPS) 6/195 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (OVERLAPS) 240/435 variables, 195/258 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (OVERLAPS) 0/435 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 529 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/436 variables, and 262 constraints, problems are : Problem set: 0 solved, 529 unsolved in 27253 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 195/195 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 529/528 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 2 (OVERLAPS) 6/195 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 4 (OVERLAPS) 240/435 variables, 195/258 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 528/790 constraints. Problems are: Problem set: 0 solved, 529 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 529 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 22:11:28] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/435 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 529 unsolved
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 Int declared 435/436 variables, and 791 constraints, problems are : Problem set: 0 solved, 529 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 195/195 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 529/528 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57345ms problems are : Problem set: 0 solved, 529 unsolved
Search for dead transitions found 0 dead transitions in 57346ms
Starting structural reductions in SI_CTL mode, iteration 1 : 195/746 places, 649/1601 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57750 ms. Remains : 195/746 places, 649/1601 transitions.
[2025-06-07 22:11:31] [INFO ] Flatten gal took : 13 ms
[2025-06-07 22:11:31] [INFO ] Flatten gal took : 12 ms
[2025-06-07 22:11:31] [INFO ] Input system was already deterministic with 649 transitions.
[2025-06-07 22:11:31] [INFO ] Flatten gal took : 11 ms
[2025-06-07 22:11:31] [INFO ] Flatten gal took : 11 ms
[2025-06-07 22:11:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10326062486176613034.gal : 2 ms
[2025-06-07 22:11:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10577390305691936910.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/CTLFireability10326062486176613034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10577390305691936910.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.73193e+29,0.145182,8404,2,350,5,8634,6,0,1415,3312,0


Converting to forward existential form...Done !
original formula: (E(EF(((p384==1)&&(p687==1))) U EF((((AF((p78==1)) * ((p374==1)||(p862==1))) * (p381==1)) + !(((EG((p516==1)) * (p603==1)) * ((p773==1)&&...212
=> equivalent forward existential formula: [(FwdU((Init * E(E(TRUE U ((p384==1)&&(p687==1))) U E(TRUE U (((!(EG(!((p78==1)))) * ((p374==1)||(p862==1))) * (...282
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 647/0/2
(forward)formula 0,1,2.76443,83088,1,0,28,374197,41,16,7646,379670,25
FORMULA Champagne-PT-H10T0R-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 : 746/746 places, 1601/1601 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 666 transition count 1292
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 666 transition count 1292
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 183 place count 666 transition count 1269
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 212 place count 637 transition count 1220
Iterating global reduction 1 with 29 rules applied. Total rules applied 241 place count 637 transition count 1220
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 246 place count 637 transition count 1215
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 266 place count 617 transition count 1119
Iterating global reduction 2 with 20 rules applied. Total rules applied 286 place count 617 transition count 1119
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 301 place count 617 transition count 1104
Applied a total of 301 rules in 54 ms. Remains 617 /746 variables (removed 129) and now considering 1104/1601 (removed 497) transitions.
// Phase 1: matrix 1104 rows 617 cols
[2025-06-07 22:11:34] [INFO ] Computed 63 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:11:34] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-07 22:11:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:11:35] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 1103 sub problems to find dead transitions.
[2025-06-07 22:11:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (OVERLAPS) 1/617 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
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 617/1721 variables, and 63 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1103/1102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/616 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (OVERLAPS) 1/617 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1721 variables, and 63 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 0/617 constraints, PredecessorRefiner: 1/1102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60229ms problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 617/746 places, 1104/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60938 ms. Remains : 617/746 places, 1104/1601 transitions.
[2025-06-07 22:12:35] [INFO ] Flatten gal took : 16 ms
[2025-06-07 22:12:35] [INFO ] Flatten gal took : 21 ms
[2025-06-07 22:12:35] [INFO ] Input system was already deterministic with 1104 transitions.
[2025-06-07 22:12:35] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:12:35] [INFO ] Flatten gal took : 17 ms
[2025-06-07 22:12:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1265935839127841624.gal : 3 ms
[2025-06-07 22:12:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6508122097422676960.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/CTLFireability1265935839127841624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6508122097422676960.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.
Detected timeout of ITS tools.
[2025-06-07 22:13:05] [INFO ] Flatten gal took : 22 ms
[2025-06-07 22:13:05] [INFO ] Applying decomposition
[2025-06-07 22:13:05] [INFO ] Flatten gal took : 17 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/graph13860216495700736237.txt' '-o' '/tmp/graph13860216495700736237.bin' '-w' '/tmp/graph13860216495700736237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13860216495700736237.bin' '-l' '-1' '-v' '-w' '/tmp/graph13860216495700736237.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:13:05] [INFO ] Decomposing Gal with order
[2025-06-07 22:13:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:13:05] [INFO ] Removed a total of 1061 redundant transitions.
[2025-06-07 22:13:05] [INFO ] Flatten gal took : 33 ms
[2025-06-07 22:13:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 35 ms.
[2025-06-07 22:13:05] [INFO ] Time to serialize gal into /tmp/CTLFireability9479555998699836255.gal : 9 ms
[2025-06-07 22:13:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4557659669618135735.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/CTLFireability9479555998699836255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4557659669618135735.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,3.50677e+59,0.855757,36724,3290,25,67833,957,1421,117786,70,1858,0


Converting to forward existential form...Done !
original formula: EX((AF(((i10.u35.p201==1)&&(i2.u57.p316==1))) + EG(!(E((i21.u80.p460!=1) U (((i39.u151.p900==1)&&(i40.i1.i2.u167.p1010==1))&&(i40.i0.i3.u...173
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(((i10.u35.p201==1)&&(i2.u57.p316==1))))))] != FALSE + [FwdG(EY(Init),!(E((i21.u80.p460!=1) ...246
Reverse transition relation is NOT exact ! Due to transitions t47, t76, t115, t204, t273, i0.t527, i1.t567, i2.t626, i2.t473, i2.u58.t477, i3.t617, i4.t607...1560
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 677 transition count 1360
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 677 transition count 1360
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 156 place count 677 transition count 1342
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 182 place count 651 transition count 1296
Iterating global reduction 1 with 26 rules applied. Total rules applied 208 place count 651 transition count 1296
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 212 place count 651 transition count 1292
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 230 place count 633 transition count 1204
Iterating global reduction 2 with 18 rules applied. Total rules applied 248 place count 633 transition count 1204
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 262 place count 633 transition count 1190
Applied a total of 262 rules in 43 ms. Remains 633 /746 variables (removed 113) and now considering 1190/1601 (removed 411) transitions.
// Phase 1: matrix 1190 rows 633 cols
[2025-06-07 22:13:35] [INFO ] Computed 63 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:13:35] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-07 22:13:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:13:36] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Running 1189 sub problems to find dead transitions.
[2025-06-07 22:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1189 unsolved
SMT process timed out in 30223ms, After SMT, problems are : Problem set: 0 solved, 1189 unsolved
Search for dead transitions found 0 dead transitions in 30226ms
Starting structural reductions in LTL mode, iteration 1 : 633/746 places, 1190/1601 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30946 ms. Remains : 633/746 places, 1190/1601 transitions.
[2025-06-07 22:14:06] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:14:06] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:14:06] [INFO ] Input system was already deterministic with 1190 transitions.
[2025-06-07 22:14:06] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:14:06] [INFO ] Flatten gal took : 18 ms
[2025-06-07 22:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3172728148361963473.gal : 4 ms
[2025-06-07 22:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3453051119233847064.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/CTLFireability3172728148361963473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3453051119233847064.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.
Detected timeout of ITS tools.
[2025-06-07 22:14:36] [INFO ] Flatten gal took : 19 ms
[2025-06-07 22:14:36] [INFO ] Applying decomposition
[2025-06-07 22:14:36] [INFO ] Flatten gal took : 19 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/graph5181625414982291936.txt' '-o' '/tmp/graph5181625414982291936.bin' '-w' '/tmp/graph5181625414982291936.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5181625414982291936.bin' '-l' '-1' '-v' '-w' '/tmp/graph5181625414982291936.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:14:36] [INFO ] Decomposing Gal with order
[2025-06-07 22:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:14:37] [INFO ] Removed a total of 1227 redundant transitions.
[2025-06-07 22:14:37] [INFO ] Flatten gal took : 33 ms
[2025-06-07 22:14:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 8 ms.
[2025-06-07 22:14:37] [INFO ] Time to serialize gal into /tmp/CTLFireability6666901900780364366.gal : 5 ms
[2025-06-07 22:14:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17495690383304517819.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/CTLFireability6666901900780364366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17495690383304517819.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,1.84247e+60,1.9263,70384,7616,34,140674,993,1468,231410,73,1882,0


Converting to forward existential form...Done !
original formula: E(((!((((i3.u62.p342!=1) + !(E(((i7.u34.p182==1)&&(i19.u85.p490==1)) U (i5.u26.p138==1)))) * E(((i13.u98.p546==1)&&(i25.u128.p732==1)) U ...726
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((!((((i3.u62.p342!=1) + !(E(((i7.u34.p182==1)&&(i19.u85.p490==1)) U (i5.u26.p138==1)))) * E(((...1067
Reverse transition relation is NOT exact ! Due to transitions t9, t118, t157, t218, t278, t379, i0.t528, i1.t642, i2.t633, i2.t421, i2.u77.t425, i3.t603, i...1594
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 746/746 places, 1601/1601 transitions.
Graph (trivial) has 696 edges and 746 vertex of which 81 / 746 are part of one of the 16 SCC in 2 ms
Free SCC test removed 65 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 680 transition count 1407
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 1 with 239 rules applied. Total rules applied 362 place count 558 transition count 1290
Reduce places removed 57 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 59 rules applied. Total rules applied 421 place count 501 transition count 1288
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 425 place count 499 transition count 1286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 426 place count 498 transition count 1286
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 426 place count 498 transition count 1258
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 482 place count 470 transition count 1258
Discarding 64 places :
Symmetric choice reduction at 5 with 64 rule applications. Total rules 546 place count 406 transition count 948
Iterating global reduction 5 with 64 rules applied. Total rules applied 610 place count 406 transition count 948
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 635 place count 406 transition count 923
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 635 place count 406 transition count 906
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 669 place count 389 transition count 906
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 673 place count 385 transition count 869
Iterating global reduction 6 with 4 rules applied. Total rules applied 677 place count 385 transition count 869
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 681 place count 385 transition count 865
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 193
Deduced a syphon composed of 193 places in 0 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 7 with 386 rules applied. Total rules applied 1067 place count 192 transition count 672
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1078 place count 181 transition count 598
Iterating global reduction 7 with 11 rules applied. Total rules applied 1089 place count 181 transition count 598
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1100 place count 181 transition count 587
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1102 place count 179 transition count 585
Applied a total of 1102 rules in 80 ms. Remains 179 /746 variables (removed 567) and now considering 585/1601 (removed 1016) transitions.
[2025-06-07 22:15:07] [INFO ] Flow matrix only has 182 transitions (discarded 403 similar events)
// Phase 1: matrix 182 rows 179 cols
[2025-06-07 22:15:07] [INFO ] Computed 63 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:15:07] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-07 22:15:07] [INFO ] Flow matrix only has 182 transitions (discarded 403 similar events)
[2025-06-07 22:15:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 22:15:07] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 22:15:07] [INFO ] Redundant transitions in 5 ms returned []
Running 457 sub problems to find dead transitions.
[2025-06-07 22:15:07] [INFO ] Flow matrix only has 182 transitions (discarded 403 similar events)
[2025-06-07 22:15: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/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 181/360 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (OVERLAPS) 0/360 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 457 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/361 variables, and 242 constraints, problems are : Problem set: 0 solved, 457 unsolved in 19883 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 457/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (OVERLAPS) 3/179 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (OVERLAPS) 181/360 variables, 179/242 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 456/698 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (OVERLAPS) 0/360 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 457 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/361 variables, and 698 constraints, problems are : Problem set: 0 solved, 457 unsolved in 22248 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 457/456 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42187ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 42188ms
Starting structural reductions in SI_CTL mode, iteration 1 : 179/746 places, 585/1601 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42610 ms. Remains : 179/746 places, 585/1601 transitions.
[2025-06-07 22:15:49] [INFO ] Flatten gal took : 9 ms
[2025-06-07 22:15:49] [INFO ] Flatten gal took : 9 ms
[2025-06-07 22:15:49] [INFO ] Input system was already deterministic with 585 transitions.
[2025-06-07 22:15:49] [INFO ] Flatten gal took : 8 ms
[2025-06-07 22:15:49] [INFO ] Flatten gal took : 8 ms
[2025-06-07 22:15:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3654347914828974800.gal : 1 ms
[2025-06-07 22:15:49] [INFO ] Time to serialize properties into /tmp/CTLFireability4365476237771197415.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/CTLFireability3654347914828974800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4365476237771197415.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39402e+28,0.130331,7932,2,296,5,7754,6,0,1288,3701,0


Converting to forward existential form...Done !
original formula: (EG(EF((p79==0))) * AG(EF(((AG((p728==0)) + EG((p498==0))) * (p1036==0)))))
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (p79==0)))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E(TRUE U !((p728==0)))) + EG(...193
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 572/0/13
(forward)formula 0,1,2.38944,68988,1,0,19,307466,28,9,6629,320570,21
FORMULA Champagne-PT-H10T0R-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 22:15:52] [INFO ] Flatten gal took : 25 ms
[2025-06-07 22:15:52] [INFO ] Flatten gal took : 26 ms
[2025-06-07 22:15:52] [INFO ] Applying decomposition
[2025-06-07 22:15:52] [INFO ] Flatten gal took : 36 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/graph17906286689073086450.txt' '-o' '/tmp/graph17906286689073086450.bin' '-w' '/tmp/graph17906286689073086450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17906286689073086450.bin' '-l' '-1' '-v' '-w' '/tmp/graph17906286689073086450.weights' '-q' '0' '-e' '0.001'
[2025-06-07 22:15:52] [INFO ] Decomposing Gal with order
[2025-06-07 22:15:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:15:52] [INFO ] Removed a total of 1769 redundant transitions.
[2025-06-07 22:15:52] [INFO ] Flatten gal took : 45 ms
[2025-06-07 22:15:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 230 labels/synchronizations in 29 ms.
[2025-06-07 22:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15321547493002559620.gal : 6 ms
[2025-06-07 22:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8532778458833875046.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/CTLFireability15321547493002559620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8532778458833875046.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91372e+64,9.24297,301412,9963,57,602334,1950,1819,1.64274e+06,96,6236,0


Converting to forward existential form...Done !
original formula: E(EG(AF((i14.u69.p352==1))) U (!((!(EX((((i32.u221.p1161==1)&&(i4.u91.p460==1))&&(i22.u135.p709==1)))) + (EX(AX(((i11.u95.p479==1)&&(i19....252
=> equivalent forward existential formula: (([((FwdU(Init,EG(!(EG(!((i14.u69.p352==1)))))) * !(!(EX((((i32.u221.p1161==1)&&(i4.u91.p460==1))&&(i22.u135.p70...513
Reverse transition relation is NOT exact ! Due to transitions t71, t125, t171, t196, t232, t264, t315, t430, t451, t574, t595, t734, i0.t611, i1.t715, i2.t...2031
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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Detected timeout of ITS tools.
[2025-06-07 22:43:54] [INFO ] Applying decomposition
[2025-06-07 22:43:54] [INFO ] Flatten gal took : 26 ms
[2025-06-07 22:43:54] [INFO ] Decomposing Gal with order
[2025-06-07 22:43:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 22:43:54] [INFO ] Removed a total of 1516 redundant transitions.
[2025-06-07 22:43:54] [INFO ] Flatten gal took : 40 ms
[2025-06-07 22:43:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 33 ms.
[2025-06-07 22:43:54] [INFO ] Time to serialize gal into /tmp/CTLFireability6187612264451240619.gal : 5 ms
[2025-06-07 22:43:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4840834893978010908.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/CTLFireability6187612264451240619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4840834893978010908.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91372e+64,0.578711,28072,1666,497,45679,2527,1308,123045,246,24635,0


Converting to forward existential form...Done !
original formula: E(EG(AF((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u43.p352==1))) U (!((!(EX((((i1.i1.i1.i1.i1.i1.i1.i0.u117.p1161==1)&&(i1.i0.i0.i0.i0.u48.p460==1))...367
=> equivalent forward existential formula: (([((FwdU(Init,EG(!(EG(!((i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.u43.p352==1)))))) * !(!(EX((((i1.i1.i1.i1.i1.i1.i1.i0.u1...716
Reverse transition relation is NOT exact ! Due to transitions i0.t595, i0.u27.t600, i0.i0.u26.t611, i0.i0.i0.u25.t623, i0.i0.i0.u25.t631, i0.i0.i0.i0.u24.t...5096

BK_TIME_CONFINEMENT_REACHED

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

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