About the Execution of ITS-Tools for Champagne-PT-H06T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | F?FTTTFTFFFTFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200058.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-H06T1U, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:38 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 102K 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-H06T1U-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H06T1U-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749320156696
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-H06T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 18:15:57] [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 18:15:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:15:58] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-07 18:15:58] [INFO ] Transformed 519 places.
[2025-06-07 18:15:58] [INFO ] Transformed 668 transitions.
[2025-06-07 18:15:58] [INFO ] Found NUPN structural information;
[2025-06-07 18:15:58] [INFO ] Parsed PT model containing 519 places and 668 transitions and 1625 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 96 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 668/668 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 421 transition count 570
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 421 transition count 570
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 244 place count 373 transition count 522
Iterating global reduction 0 with 48 rules applied. Total rules applied 292 place count 373 transition count 522
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 311 place count 354 transition count 503
Iterating global reduction 0 with 19 rules applied. Total rules applied 330 place count 354 transition count 503
Applied a total of 330 rules in 103 ms. Remains 354 /519 variables (removed 165) and now considering 503/668 (removed 165) transitions.
// Phase 1: matrix 503 rows 354 cols
[2025-06-07 18:15:58] [INFO ] Computed 20 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:15:58] [INFO ] Implicit Places using invariants in 315 ms returned []
[2025-06-07 18:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:15:58] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2025-06-07 18:15: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/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:07] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:08] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:08] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:08] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:09] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:09] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 33 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 18:16:10] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:10] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:11] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/857 variables, 354/389 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 857/857 variables, and 389 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/353 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/354 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 503/857 variables, 354/389 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/857 variables, 502/891 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:40] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:40] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:40] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:40] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:40] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:42] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:42] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:43] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 8/899 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:49] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:50] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:52] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:16:53] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/857 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 857/857 variables, and 903 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 354/519 places, 503/668 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61054 ms. Remains : 354/519 places, 503/668 transitions.
Support contains 96 out of 354 places after structural reductions.
[2025-06-07 18:16:59] [INFO ] Flatten gal took : 81 ms
[2025-06-07 18:16:59] [INFO ] Flatten gal took : 49 ms
[2025-06-07 18:16:59] [INFO ] Input system was already deterministic with 503 transitions.
RANDOM walk for 40000 steps (127 resets) in 1964 ms. (20 steps per ms) remains 5/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2025-06-07 18:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 298/354 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 503/857 variables, 354/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:01] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:01] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/857 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/857 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/857 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 857/857 variables, and 376 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 298/354 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:02] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 503/857 variables, 354/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/857 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/857 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/857 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 857/857 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 354/354 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 4 ms.
[2025-06-07 18:17:02] [INFO ] Flatten gal took : 35 ms
[2025-06-07 18:17:02] [INFO ] Flatten gal took : 30 ms
[2025-06-07 18:17:02] [INFO ] Input system was already deterministic with 503 transitions.
Computed a total of 37 stabilizing places and 37 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 310 transition count 459
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 310 transition count 459
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 113 place count 285 transition count 434
Iterating global reduction 0 with 25 rules applied. Total rules applied 138 place count 285 transition count 434
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 277 transition count 426
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 277 transition count 426
Applied a total of 154 rules in 58 ms. Remains 277 /354 variables (removed 77) and now considering 426/503 (removed 77) transitions.
// Phase 1: matrix 426 rows 277 cols
[2025-06-07 18:17:02] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:02] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-07 18:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:03] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-07 18:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:09] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:09] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:09] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:09] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:09] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:10] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:10] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:10] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/703 variables, 277/305 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (OVERLAPS) 0/703 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 305 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/703 variables, 277/305 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 425/730 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:50] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:52] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/703 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:56] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:57] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:57] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:58] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 4/736 constraints. Problems are: Problem set: 0 solved, 425 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 703/703 variables, and 736 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Starting structural reductions in LTL mode, iteration 1 : 277/354 places, 426/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 277/354 places, 426/503 transitions.
[2025-06-07 18:18:03] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:18:03] [INFO ] Flatten gal took : 23 ms
[2025-06-07 18:18:03] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-07 18:18:03] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:18:03] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:18:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15250601156440830028.gal : 17 ms
[2025-06-07 18:18:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14021566730534637545.ctl : 5 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/CTLFireability15250601156440830028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14021566730534637545.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.63058e+22,0.249868,10968,2,1855,5,34693,6,0,1536,29499,0
Converting to forward existential form...Done !
original formula: AG(EX(EF(((!(E((p171==1) U (p486==1))) * (p419==0)) * ((p156==0)||(p274==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U ((!(E((p171==1) U (p486==1))) * (p419==0)) * ((p156==0)||(p274==0)))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t5, t36, t41, t55, t65, t66, t71, t81, t86, t100, t110, t115, t130, t140, t145, t159, t169, t...320
(forward)formula 0,0,3.45477,123524,1,0,885,707672,879,492,9577,641062,1153
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 311 transition count 460
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 311 transition count 460
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 111 place count 286 transition count 435
Iterating global reduction 0 with 25 rules applied. Total rules applied 136 place count 286 transition count 435
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 145 place count 277 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 154 place count 277 transition count 426
Applied a total of 154 rules in 15 ms. Remains 277 /354 variables (removed 77) and now considering 426/503 (removed 77) transitions.
// Phase 1: matrix 426 rows 277 cols
[2025-06-07 18:18:07] [INFO ] Computed 20 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:18:07] [INFO ] Implicit Places using invariants in 430 ms returned []
[2025-06-07 18:18:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:18:07] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-07 18:18: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/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 297 constraints, problems are : Problem set: 0 solved, 425 unsolved in 28110 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 425/722 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:47] [INFO ] Deduced a trap along path composed of 13 places in 35 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:53] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:55] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:19:01] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 726 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58177ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 58178ms
Starting structural reductions in LTL mode, iteration 1 : 277/354 places, 426/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58860 ms. Remains : 277/354 places, 426/503 transitions.
[2025-06-07 18:19:06] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:19:06] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:19:06] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-07 18:19:06] [INFO ] Flatten gal took : 19 ms
[2025-06-07 18:19:06] [INFO ] Flatten gal took : 29 ms
[2025-06-07 18:19:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2446989506691212558.gal : 4 ms
[2025-06-07 18:19:06] [INFO ] Time to serialize properties into /tmp/CTLFireability185331967310893593.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/CTLFireability2446989506691212558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability185331967310893593.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63366e+22,0.193325,8832,2,1483,5,22328,6,0,1536,18009,0
Converting to forward existential form...Done !
original formula: EG(E(EF((p177==1)) U AG(AX(((p408==1)||((p156==1)&&(p243==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (p177==1)) U !(E(TRUE U !(!(EX(!(((p408==1)||((p156==1)&&(p243==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t63, t68, t85, t99, t109, t114, t129, t144, t158, t168, t173, t188, t202, ...291
Detected timeout of ITS tools.
[2025-06-07 18:19:36] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:19:36] [INFO ] Applying decomposition
[2025-06-07 18:19:36] [INFO ] Flatten gal took : 16 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/graph4575435696797798446.txt' '-o' '/tmp/graph4575435696797798446.bin' '-w' '/tmp/graph4575435696797798446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4575435696797798446.bin' '-l' '-1' '-v' '-w' '/tmp/graph4575435696797798446.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:19:36] [INFO ] Decomposing Gal with order
[2025-06-07 18:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:19:36] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-07 18:19:36] [INFO ] Flatten gal took : 176 ms
[2025-06-07 18:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2025-06-07 18:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11166026051325778847.gal : 6 ms
[2025-06-07 18:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10688758449293595921.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/CTLFireability11166026051325778847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10688758449293595921.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63366e+22,0.146023,10212,1547,25,10709,623,693,15113,68,1406,0
Converting to forward existential form...Done !
original formula: EG(E(EF((i8.i1.u31.p177==1)) U AG(AX(((i16.i1.u70.p408==1)||((i7.i0.u27.p156==1)&&(i10.u41.p243==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (i8.i1.u31.p177==1)) U !(E(TRUE U !(!(EX(!(((i16.i1.u70.p408==1)||((i7.i0.u27.p156==1)&&(i...190
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t63, t109, t168, i1.i1.u6.t292, i2.i0.u10.t278, i3.i1.t263, i4.i1.t248, i5.i1.u22.t2...401
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 312 transition count 461
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 312 transition count 461
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 108 place count 288 transition count 437
Iterating global reduction 0 with 24 rules applied. Total rules applied 132 place count 288 transition count 437
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 280 transition count 429
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 280 transition count 429
Applied a total of 148 rules in 29 ms. Remains 280 /354 variables (removed 74) and now considering 429/503 (removed 74) transitions.
// Phase 1: matrix 429 rows 280 cols
[2025-06-07 18:20:06] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:20:07] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-07 18:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:20:07] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2025-06-07 18:20: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/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:13] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 429/709 variables, 280/301 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/709 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 709/709 variables, and 301 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (OVERLAPS) 429/709 variables, 280/301 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 428/729 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:47] [INFO ] Deduced a trap along path composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:56] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:56] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:56] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/709 variables, 3/733 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:21:04] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 428 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 709/709 variables, and 734 constraints, problems are : Problem set: 0 solved, 428 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 280/354 places, 429/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 280/354 places, 429/503 transitions.
[2025-06-07 18:21:07] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:21:07] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:21:07] [INFO ] Input system was already deterministic with 429 transitions.
[2025-06-07 18:21:07] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:21:07] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:21:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3035418571125114675.gal : 2 ms
[2025-06-07 18:21:07] [INFO ] Time to serialize properties into /tmp/CTLFireability10639949529978530918.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/CTLFireability3035418571125114675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10639949529978530918.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05184e+22,0.194246,9508,2,1720,5,24969,6,0,1551,22162,0
Converting to forward existential form...Done !
original formula: AG((AF((((p78==1) + (((p483==1)&&(p127==1)) * ((p145==1) * AX(((p363==1)&&(p423==1)))))) + (p179==1))) + E(!(A(E((p130==1) U (p223==1)) U...182
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(!(!((E(!((p205==1)) U (!(E((p130==1) U (p223==1))) * !((p205==1)))) + EG(!((p205==1...290
Reverse transition relation is NOT exact ! Due to transitions t5, t28, t35, t40, t54, t64, t69, t84, t97, t99, t109, t114, t129, t144, t158, t168, t173, t1...313
Detected timeout of ITS tools.
[2025-06-07 18:21:37] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:21:37] [INFO ] Applying decomposition
[2025-06-07 18:21:37] [INFO ] Flatten gal took : 8 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/graph12949820435418359577.txt' '-o' '/tmp/graph12949820435418359577.bin' '-w' '/tmp/graph12949820435418359577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12949820435418359577.bin' '-l' '-1' '-v' '-w' '/tmp/graph12949820435418359577.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:21:37] [INFO ] Decomposing Gal with order
[2025-06-07 18:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:21:37] [INFO ] Removed a total of 323 redundant transitions.
[2025-06-07 18:21:37] [INFO ] Flatten gal took : 46 ms
[2025-06-07 18:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-06-07 18:21:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7357039914209499634.gal : 4 ms
[2025-06-07 18:21:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7998959353104392028.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/CTLFireability7357039914209499634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7998959353104392028.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05184e+22,0.174401,10344,1589,26,10706,686,701,15028,74,1485,0
Converting to forward existential form...Done !
original formula: AG((AF((((i3.i0.u14.p78==1) + (((i19.u86.p483==1)&&(i5.i0.u22.p127==1)) * ((i6.i0.u25.p145==1) * AX(((i14.i2.u65.p363==1)&&(i17.u79.p423=...286
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(!(!((E(!((i8.i0.u35.p205==1)) U (!(E((i0.i0.u0.p130==1) U (i9.u37.p223==1))) * !((i...414
Reverse transition relation is NOT exact ! Due to transitions t5, t35, t64, t109, t168, t228, i1.i1.u5.t294, i2.i0.t280, i3.i0.t265, i4.i0.t248, i5.i0.u22....426
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
(forward)formula 0,0,20.4155,517224,1,0,1.02539e+06,874,4609,1.20192e+06,393,2228,1080306
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Graph (trivial) has 357 edges and 354 vertex of which 158 / 354 are part of one of the 19 SCC in 7 ms
Free SCC test removed 139 places
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 214 transition count 298
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 85 rules applied. Total rules applied 137 place count 163 transition count 264
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 154 place count 146 transition count 264
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 154 place count 146 transition count 262
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 144 transition count 262
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 184 place count 118 transition count 226
Iterating global reduction 3 with 26 rules applied. Total rules applied 210 place count 118 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 214 place count 118 transition count 222
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 117 transition count 220
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 117 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 117 transition count 219
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 305 place count 73 transition count 175
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 312 place count 66 transition count 147
Iterating global reduction 5 with 7 rules applied. Total rules applied 319 place count 66 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 326 place count 66 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 328 place count 64 transition count 138
Applied a total of 328 rules in 124 ms. Remains 64 /354 variables (removed 290) and now considering 138/503 (removed 365) transitions.
[2025-06-07 18:21:58] [INFO ] Flow matrix only has 77 transitions (discarded 61 similar events)
// Phase 1: matrix 77 rows 64 cols
[2025-06-07 18:21:58] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:21:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-07 18:21:58] [INFO ] Flow matrix only has 77 transitions (discarded 61 similar events)
[2025-06-07 18:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:21:58] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:21:58] [INFO ] Redundant transitions in 3 ms returned []
Running 83 sub problems to find dead transitions.
[2025-06-07 18:21:58] [INFO ] Flow matrix only has 77 transitions (discarded 61 similar events)
[2025-06-07 18:21: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/61 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/141 variables, and 84 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/64 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 83/167 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/141 variables, and 167 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3457ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3457ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/354 places, 138/503 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3752 ms. Remains : 64/354 places, 138/503 transitions.
[2025-06-07 18:22:02] [INFO ] Flatten gal took : 15 ms
[2025-06-07 18:22:02] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:22:02] [INFO ] Input system was already deterministic with 138 transitions.
[2025-06-07 18:22:02] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:22:02] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:22:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11047218321866009952.gal : 1 ms
[2025-06-07 18:22:02] [INFO ] Time to serialize properties into /tmp/CTLFireability6474631655405601356.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/CTLFireability11047218321866009952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6474631655405601356.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.89776e+09,0.032399,4580,2,109,5,1271,6,0,378,736,0
Converting to forward existential form...Done !
original formula: EF((EF((((p193==1)&&(p181==1))&&(p324==1))) * EG(EF((p50==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(TRUE U (((p193==1)&&(p181==1))&&(p324==1)))),E(TRUE U (p50==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.126161,7140,1,0,16,18957,21,10,1859,16094,18
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-03 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 : 354/354 places, 503/503 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 310 transition count 459
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 310 transition count 459
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 113 place count 285 transition count 434
Iterating global reduction 0 with 25 rules applied. Total rules applied 138 place count 285 transition count 434
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 147 place count 276 transition count 425
Iterating global reduction 0 with 9 rules applied. Total rules applied 156 place count 276 transition count 425
Applied a total of 156 rules in 37 ms. Remains 276 /354 variables (removed 78) and now considering 425/503 (removed 78) transitions.
// Phase 1: matrix 425 rows 276 cols
[2025-06-07 18:22:02] [INFO ] Computed 20 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:22:02] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-07 18:22:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:22:02] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-06-07 18:22:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/701 variables, 276/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (OVERLAPS) 0/701 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 296 constraints, problems are : Problem set: 0 solved, 424 unsolved in 27860 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/701 variables, 276/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 424/720 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:42] [INFO ] Deduced a trap along path composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:50] [INFO ] Deduced a trap composed of 68 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 18:22:50] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 723 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57945ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 57946ms
Starting structural reductions in LTL mode, iteration 1 : 276/354 places, 425/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58413 ms. Remains : 276/354 places, 425/503 transitions.
[2025-06-07 18:23:00] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:23:00] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:23:00] [INFO ] Input system was already deterministic with 425 transitions.
[2025-06-07 18:23:00] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:23:00] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:23:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5030137759374065349.gal : 2 ms
[2025-06-07 18:23:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14306423024020469276.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/CTLFireability5030137759374065349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14306423024020469276.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.51815e+22,0.1405,8964,2,1478,5,22751,6,0,1531,18555,0
Converting to forward existential form...Done !
original formula: !(A((p191!=1) U EX(EX(AF(((p363==1)&&(p454==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(EX(!(EG(!(((p363==1)&&(p454==1))))))))) * !((p191!=1))) * !(EX(EX(!(EG(!(((p363==1)&&(p454==1...243
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t63, t68, t83, t97, t107, t112, t127, t142, t156, t166, t171, t186, t203, ...291
Detected timeout of ITS tools.
[2025-06-07 18:23:30] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:23:30] [INFO ] Applying decomposition
[2025-06-07 18:23:31] [INFO ] Flatten gal took : 8 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/graph12089375614711121726.txt' '-o' '/tmp/graph12089375614711121726.bin' '-w' '/tmp/graph12089375614711121726.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12089375614711121726.bin' '-l' '-1' '-v' '-w' '/tmp/graph12089375614711121726.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:23:31] [INFO ] Decomposing Gal with order
[2025-06-07 18:23:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:23:31] [INFO ] Removed a total of 316 redundant transitions.
[2025-06-07 18:23:31] [INFO ] Flatten gal took : 58 ms
[2025-06-07 18:23:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-06-07 18:23:31] [INFO ] Time to serialize gal into /tmp/CTLFireability12768270071119426268.gal : 20 ms
[2025-06-07 18:23:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12222195870765905412.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/CTLFireability12768270071119426268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12222195870765905412.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51815e+22,0.155616,10084,1585,25,10388,507,650,15705,68,1057,0
Converting to forward existential form...Done !
original formula: !(A((i8.i1.u33.p191!=1) U EX(EX(AF(((i14.u59.p363==1)&&(i17.u79.p454==1)))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EX(EX(!(EG(!(((i14.u59.p363==1)&&(i17.u79.p454==1))))))))) * !((i8.i1.u33.p191!=1))) * !(EX(EX(!...301
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t63, t107, t166, i0.i1.t291, i1.i0.t277, i2.i0.u13.t262, i3.i0.u17.t247, i4.i0.t232,...383
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local 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
(forward)formula 0,1,17.0441,446052,1,0,975810,732,4125,895531,382,1929,1045722
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 310 transition count 459
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 310 transition count 459
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 113 place count 285 transition count 434
Iterating global reduction 0 with 25 rules applied. Total rules applied 138 place count 285 transition count 434
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 147 place count 276 transition count 425
Iterating global reduction 0 with 9 rules applied. Total rules applied 156 place count 276 transition count 425
Applied a total of 156 rules in 40 ms. Remains 276 /354 variables (removed 78) and now considering 425/503 (removed 78) transitions.
// Phase 1: matrix 425 rows 276 cols
[2025-06-07 18:23:48] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:23:48] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-07 18:23:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:23:48] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-06-07 18:23:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/701 variables, 276/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (OVERLAPS) 0/701 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 296 constraints, problems are : Problem set: 0 solved, 424 unsolved in 27548 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/701 variables, 276/296 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 424/720 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:24:27] [INFO ] Deduced a trap along path composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:24:33] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 1/722 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:24:39] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:24:40] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 724 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57609ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 57611ms
Starting structural reductions in LTL mode, iteration 1 : 276/354 places, 425/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57890 ms. Remains : 276/354 places, 425/503 transitions.
[2025-06-07 18:24:46] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:24:46] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:24:46] [INFO ] Input system was already deterministic with 425 transitions.
[2025-06-07 18:24:46] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:24:46] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:24:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9141104127844551910.gal : 2 ms
[2025-06-07 18:24:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11476605804048586004.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/CTLFireability9141104127844551910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11476605804048586004.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.51698e+22,0.170137,8832,2,1476,5,22138,6,0,1531,17859,0
Converting to forward existential form...Done !
original formula: (AG(EF(EG(AX((p435==1))))) + EX(((p181==1)&&(p299==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(((p181==1)&&(p299==1))))),TRUE) * !(E(TRUE U EG(!(EX(!((p435==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t65, t70, t85, t99, t109, t114, t129, t144, t158, t168, t173, t188, t203, ...291
Using saturation style SCC detection
(forward)formula 0,1,4.20622,142976,1,0,680,824866,880,389,10087,672716,972
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-05 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 : 354/354 places, 503/503 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 309 transition count 458
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 309 transition count 458
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 116 place count 283 transition count 432
Iterating global reduction 0 with 26 rules applied. Total rules applied 142 place count 283 transition count 432
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 151 place count 274 transition count 423
Iterating global reduction 0 with 9 rules applied. Total rules applied 160 place count 274 transition count 423
Applied a total of 160 rules in 21 ms. Remains 274 /354 variables (removed 80) and now considering 423/503 (removed 80) transitions.
// Phase 1: matrix 423 rows 274 cols
[2025-06-07 18:24:50] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:24:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-07 18:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:24:50] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-06-07 18:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 423/697 variables, 274/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 294 constraints, problems are : Problem set: 0 solved, 422 unsolved in 27514 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 423/697 variables, 274/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 422/716 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:29] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:36] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:37] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:37] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:41] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 721 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57566ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 57567ms
Starting structural reductions in LTL mode, iteration 1 : 274/354 places, 423/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57843 ms. Remains : 274/354 places, 423/503 transitions.
[2025-06-07 18:25:48] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:25:48] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:25:48] [INFO ] Input system was already deterministic with 423 transitions.
[2025-06-07 18:25:48] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:25:48] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:25:48] [INFO ] Time to serialize gal into /tmp/CTLFireability943726797302105180.gal : 2 ms
[2025-06-07 18:25:48] [INFO ] Time to serialize properties into /tmp/CTLFireability15783333165740467179.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/CTLFireability943726797302105180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15783333165740467179.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.31581e+22,0.142462,8824,2,1466,5,22066,6,0,1521,17813,0
Converting to forward existential form...Done !
original formula: AG(EX(EF((EX((p117==0)) * ((p231==0)||(p268==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (EX((p117==0)) * ((p231==0)||(p268==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t63, t68, t83, t97, t107, t112, t127, t142, t156, t166, t171, t186, t201, ...291
(forward)formula 0,0,1.79679,68812,1,0,605,381173,868,350,9502,279927,863
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 311 transition count 460
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 311 transition count 460
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 112 place count 285 transition count 434
Iterating global reduction 0 with 26 rules applied. Total rules applied 138 place count 285 transition count 434
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 147 place count 276 transition count 425
Iterating global reduction 0 with 9 rules applied. Total rules applied 156 place count 276 transition count 425
Applied a total of 156 rules in 20 ms. Remains 276 /354 variables (removed 78) and now considering 425/503 (removed 78) transitions.
// Phase 1: matrix 425 rows 276 cols
[2025-06-07 18:25:50] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:25:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-07 18:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:25:50] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-06-07 18:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:56] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:56] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:57] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:25:57] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 425/701 variables, 276/300 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (OVERLAPS) 0/701 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 300 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 425/701 variables, 276/300 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 424/724 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:26:26] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:26:26] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:26:27] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/701 variables, 3/727 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:26:34] [INFO ] Deduced a trap along path composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:26:43] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/701 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 729 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 276/354 places, 425/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 276/354 places, 425/503 transitions.
[2025-06-07 18:26:50] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:26:50] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:26:50] [INFO ] Input system was already deterministic with 425 transitions.
[2025-06-07 18:26:50] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:26:50] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:26:50] [INFO ] Time to serialize gal into /tmp/CTLFireability940306040775200825.gal : 2 ms
[2025-06-07 18:26:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18249555388142927780.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/CTLFireability940306040775200825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18249555388142927780.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.52254e+22,0.27649,11268,2,1901,5,34446,6,0,1531,31389,0
Converting to forward existential form...Done !
original formula: E((p321==1) U EX((EF((p239==1)) + !(AX((p155!=1))))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,(p321==1))),TRUE) * (p239==1))] != FALSE + [(EY(EY(FwdU(Init,(p321==1)))) * !((p155!=1)))] ...164
Hit Full ! (commute/partial/dont) 423/0/2
(forward)formula 0,1,0.412754,11652,1,0,10,35777,16,1,2874,31389,7
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 319 transition count 468
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 319 transition count 468
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 89 place count 300 transition count 449
Iterating global reduction 0 with 19 rules applied. Total rules applied 108 place count 300 transition count 449
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 294 transition count 443
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 294 transition count 443
Applied a total of 120 rules in 11 ms. Remains 294 /354 variables (removed 60) and now considering 443/503 (removed 60) transitions.
// Phase 1: matrix 443 rows 294 cols
[2025-06-07 18:26:51] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:26:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 18:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:26:51] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2025-06-07 18:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:26:57] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 443/737 variables, 294/315 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/737 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/737 variables, and 315 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (OVERLAPS) 443/737 variables, 294/315 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/737 variables, 442/757 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:27:32] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:27:41] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:27:47] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:27:48] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:27:48] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:27:48] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/737 variables, and 763 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 294/354 places, 443/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60364 ms. Remains : 294/354 places, 443/503 transitions.
[2025-06-07 18:27:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:27:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:27:51] [INFO ] Input system was already deterministic with 443 transitions.
[2025-06-07 18:27:51] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:27:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:27:51] [INFO ] Time to serialize gal into /tmp/CTLFireability16430081458785826993.gal : 2 ms
[2025-06-07 18:27:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3240117840890629646.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/CTLFireability16430081458785826993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3240117840890629646.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.38953e+22,0.194201,10336,2,1923,5,27742,6,0,1621,26072,0
Converting to forward existential form...Done !
original formula: A(!(((((E((p357==1) U (p222==1)) + (p128==1)) * (p19!=1)) * (EG((p13==1)) * (p472==1))) + ((p25==1) * !((AX((p242==1)) * (p209!=1)))))) U...242
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E(!(((p440==1)&&(p39==1))) U (!(EG(!((p18==1)))) * E(TRUE U (p111==1)))) + E(TRUE...585
Reverse transition relation is NOT exact ! Due to transitions t5, t33, t36, t41, t55, t65, t70, t85, t100, t112, t117, t132, t147, t161, t169, t173, t177, ...327
Detected timeout of ITS tools.
[2025-06-07 18:28:21] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:28:21] [INFO ] Applying decomposition
[2025-06-07 18:28:21] [INFO ] Flatten gal took : 8 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/graph9587994117139631264.txt' '-o' '/tmp/graph9587994117139631264.bin' '-w' '/tmp/graph9587994117139631264.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9587994117139631264.bin' '-l' '-1' '-v' '-w' '/tmp/graph9587994117139631264.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:28:21] [INFO ] Decomposing Gal with order
[2025-06-07 18:28:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:28:21] [INFO ] Removed a total of 307 redundant transitions.
[2025-06-07 18:28:21] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:28:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-07 18:28:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7314838682112128142.gal : 3 ms
[2025-06-07 18:28:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5763615473128583875.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/CTLFireability7314838682112128142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5763615473128583875.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,5.38953e+22,0.146885,10980,1694,26,11583,631,749,17102,76,1448,0
Converting to forward existential form...Done !
original formula: A(!(((((E((i14.i1.u65.p357==1) U (i9.i1.u41.p222==1)) + (i4.i0.u19.p128==1)) * (i0.i0.u4.p19!=1)) * (EG((i0.i0.u3.p13==1)) * (i18.i1.u87....377
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E(!(((i17.u77.p440==1)&&(i1.i1.u7.p39==1))) U (!(EG(!((i0.i0.u4.p18==1)))) * E(TR...810
Reverse transition relation is NOT exact ! Due to transitions t5, t36, t65, t112, t190, t254, i0.i1.t305, i1.i0.u10.t289, i2.i0.u14.t274, i3.i1.u18.t259, i...468
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
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
(forward)formula 0,0,24.6288,711908,1,0,1.2695e+06,866,5038,1.94107e+06,395,1825,1718606
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 311 transition count 460
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 311 transition count 460
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 110 place count 287 transition count 436
Iterating global reduction 0 with 24 rules applied. Total rules applied 134 place count 287 transition count 436
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 143 place count 278 transition count 427
Iterating global reduction 0 with 9 rules applied. Total rules applied 152 place count 278 transition count 427
Applied a total of 152 rules in 12 ms. Remains 278 /354 variables (removed 76) and now considering 427/503 (removed 76) transitions.
// Phase 1: matrix 427 rows 278 cols
[2025-06-07 18:28:46] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:28:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-07 18:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:28:46] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-07 18:28:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:28:53] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:28:53] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/705 variables, 278/300 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (OVERLAPS) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 300 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 427/705 variables, 278/300 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 426/726 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:29:25] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:29:29] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:29:29] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:29:36] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:29:41] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/705 variables, and 731 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 278/354 places, 427/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60448 ms. Remains : 278/354 places, 427/503 transitions.
[2025-06-07 18:29:46] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:29:46] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:29:46] [INFO ] Input system was already deterministic with 427 transitions.
[2025-06-07 18:29:46] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:29:46] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:29:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15051512758520747001.gal : 1 ms
[2025-06-07 18:29:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10874043083513659229.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/CTLFireability15051512758520747001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10874043083513659229.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.76603e+22,0.214065,11788,2,2068,5,36578,6,0,1541,35686,0
Converting to forward existential form...Done !
original formula: AG(AX(E((EX((p160==1)) * !(E((p405==1) U (p409==1)))) U !(EG((p35==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E((EX((p160==1)) * !(E((p405==1) U (p409==1)))) U !(EG((p35==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t63, t67, t73, t80, t85, t99, t109, t114, t129, t139, t144, t158, t168, t1...319
(forward)formula 0,0,3.0898,99892,1,0,637,539351,885,367,9447,466813,904
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 315 transition count 464
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 315 transition count 464
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 102 place count 291 transition count 440
Iterating global reduction 0 with 24 rules applied. Total rules applied 126 place count 291 transition count 440
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 135 place count 282 transition count 431
Iterating global reduction 0 with 9 rules applied. Total rules applied 144 place count 282 transition count 431
Applied a total of 144 rules in 12 ms. Remains 282 /354 variables (removed 72) and now considering 431/503 (removed 72) transitions.
// Phase 1: matrix 431 rows 282 cols
[2025-06-07 18:29:50] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:29:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-07 18:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:29:50] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2025-06-07 18:29:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/713 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 0/713 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 713/713 variables, and 302 constraints, problems are : Problem set: 0 solved, 430 unsolved in 29741 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/713 variables, 430/732 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:30:32] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:30:41] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 1/734 constraints. Problems are: Problem set: 0 solved, 430 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 713/713 variables, and 734 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59797ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 59797ms
Starting structural reductions in LTL mode, iteration 1 : 282/354 places, 431/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60077 ms. Remains : 282/354 places, 431/503 transitions.
[2025-06-07 18:30:50] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:30:50] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:30:50] [INFO ] Input system was already deterministic with 431 transitions.
[2025-06-07 18:30:50] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:30:50] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12997335044726351133.gal : 2 ms
[2025-06-07 18:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15380599290859740781.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/CTLFireability12997335044726351133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15380599290859740781.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37894e+22,0.177331,9788,2,1603,5,26693,6,0,1561,23028,0
Converting to forward existential form...Done !
original formula: AX((AF((((p148==1)||(p246==1))&&(p13==0))) + (AG((!(E((p378==1) U ((p52==1)&&(p164==1)))) + (p142==0))) * EX(((AX((p97==0)) * (p415==0)) ...169
=> equivalent forward existential formula: ([(FwdU((FwdU((EY(Init) * !(!(EG(!((((p148==1)||(p246==1))&&(p13==0))))))),TRUE) * !((p142==0))),(p378==1)) * ((...314
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t65, t69, t80, t85, t99, t109, t114, t129, t144, t158, t169, t174, t189, t...308
Hit Full ! (commute/partial/dont) 428/0/3
(forward)formula 0,0,16.3711,502092,1,0,1425,2.88504e+06,900,765,10064,3.63726e+06,1746
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Graph (trivial) has 355 edges and 354 vertex of which 144 / 354 are part of one of the 17 SCC in 1 ms
Free SCC test removed 127 places
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 226 transition count 308
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 88 rules applied. Total rules applied 142 place count 173 transition count 273
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 160 place count 156 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 155 transition count 272
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 161 place count 155 transition count 268
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 169 place count 151 transition count 268
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 194 place count 126 transition count 232
Iterating global reduction 4 with 25 rules applied. Total rules applied 219 place count 126 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 223 place count 126 transition count 228
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 225 place count 124 transition count 221
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 124 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 229 place count 124 transition count 219
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 323 place count 77 transition count 172
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 329 place count 71 transition count 147
Iterating global reduction 6 with 6 rules applied. Total rules applied 335 place count 71 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 341 place count 71 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 343 place count 69 transition count 139
Applied a total of 343 rules in 41 ms. Remains 69 /354 variables (removed 285) and now considering 139/503 (removed 364) transitions.
[2025-06-07 18:31:06] [INFO ] Flow matrix only has 78 transitions (discarded 61 similar events)
// Phase 1: matrix 78 rows 69 cols
[2025-06-07 18:31:06] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 18:31:06] [INFO ] Flow matrix only has 78 transitions (discarded 61 similar events)
[2025-06-07 18:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:06] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:31:06] [INFO ] Redundant transitions in 3 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-07 18:31:06] [INFO ] Flow matrix only has 78 transitions (discarded 61 similar events)
[2025-06-07 18:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 77/146 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 89 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 3/69 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 77/146 variables, 69/89 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 88/177 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 177 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3556ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3556ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/354 places, 139/503 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3704 ms. Remains : 69/354 places, 139/503 transitions.
[2025-06-07 18:31:10] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:31:10] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:31:10] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-07 18:31:10] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:31:10] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:31:10] [INFO ] Time to serialize gal into /tmp/CTLFireability4758093981091727832.gal : 1 ms
[2025-06-07 18:31:10] [INFO ] Time to serialize properties into /tmp/CTLFireability776574145557359749.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/CTLFireability4758093981091727832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability776574145557359749.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.52342e+09,0.023871,4640,2,119,5,1433,6,0,400,837,0
Converting to forward existential form...Done !
original formula: E(A(!(AF(((p518==1)&&(p355==1)))) U ((p358==1)&&(p449==1))) U EG(EF((p388==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!(((p358==1)&&(p449==1))) U (!(!(!(EG(!(((p518==1)&&(p355==1))))))) * !(((p358==1)&&(p449==...227
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 135/0/4
Hit Full ! (commute/partial/dont) 135/0/4
Hit Full ! (commute/partial/dont) 135/0/4
(forward)formula 0,1,0.222512,12576,1,0,65,38945,42,69,2008,61332,80
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Graph (trivial) has 348 edges and 354 vertex of which 142 / 354 are part of one of the 18 SCC in 1 ms
Free SCC test removed 124 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 229 transition count 315
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 87 rules applied. Total rules applied 140 place count 177 transition count 280
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 20 rules applied. Total rules applied 160 place count 159 transition count 278
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 164 place count 157 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 156 transition count 276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 165 place count 156 transition count 273
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 171 place count 153 transition count 273
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 193 place count 131 transition count 240
Iterating global reduction 5 with 22 rules applied. Total rules applied 215 place count 131 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 219 place count 131 transition count 236
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 220 place count 130 transition count 234
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 130 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 130 transition count 233
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 314 place count 84 transition count 187
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 322 place count 76 transition count 155
Iterating global reduction 7 with 8 rules applied. Total rules applied 330 place count 76 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 338 place count 76 transition count 147
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 340 place count 74 transition count 145
Applied a total of 340 rules in 38 ms. Remains 74 /354 variables (removed 280) and now considering 145/503 (removed 358) transitions.
[2025-06-07 18:31:10] [INFO ] Flow matrix only has 91 transitions (discarded 54 similar events)
// Phase 1: matrix 91 rows 74 cols
[2025-06-07 18:31:10] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 18:31:10] [INFO ] Flow matrix only has 91 transitions (discarded 54 similar events)
[2025-06-07 18:31:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-07 18:31:10] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:31:10] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-07 18:31:10] [INFO ] Flow matrix only has 91 transitions (discarded 54 similar events)
[2025-06-07 18:31:10] [INFO ] Invariant cache hit.
[2025-06-07 18:31:10] [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/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 5/74 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 90/164 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/165 variables, and 98 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2172 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 74/74 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 5/74 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 90/164 variables, 74/94 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 102/200 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/165 variables, and 200 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2271 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 74/74 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4454ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 4454ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/354 places, 145/503 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4604 ms. Remains : 74/354 places, 145/503 transitions.
[2025-06-07 18:31:15] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:31:15] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:31:15] [INFO ] Input system was already deterministic with 145 transitions.
[2025-06-07 18:31:15] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:31:15] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:31:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10751781226159607460.gal : 1 ms
[2025-06-07 18:31:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5482364867762779379.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/CTLFireability10751781226159607460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5482364867762779379.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.23788e+10,0.026957,4716,2,149,5,1580,6,0,424,908,0
Converting to forward existential form...Done !
original formula: (AF((p109==1)) + AG(((((p206==1) * (EG(E((p286==1) U (p333==1))) + (p485==0))) * (EG((p236==0)) * E((p378==1) U (p76==1)))) * (p29==1))))
=> equivalent forward existential formula: ((([(FwdU((Init * !(!(EG(!((p109==1)))))),TRUE) * !((p206==1)))] = FALSE * [((FwdU((Init * !(!(EG(!((p109==1))))...461
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 143/0/2
(forward)formula 0,0,0.080265,6252,1,0,14,13616,23,7,2139,7993,12
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 311 transition count 460
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 311 transition count 460
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 111 place count 286 transition count 435
Iterating global reduction 0 with 25 rules applied. Total rules applied 136 place count 286 transition count 435
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 145 place count 277 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 154 place count 277 transition count 426
Applied a total of 154 rules in 20 ms. Remains 277 /354 variables (removed 77) and now considering 426/503 (removed 77) transitions.
// Phase 1: matrix 426 rows 277 cols
[2025-06-07 18:31:15] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:15] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-07 18:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:31:15] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-07 18:31:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 297 constraints, problems are : Problem set: 0 solved, 425 unsolved in 29079 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 425/722 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:31:56] [INFO ] Deduced a trap along path composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:02] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:03] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:10] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:11] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:11] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:12] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:32:12] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 5/730 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 730 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59140ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 59142ms
Starting structural reductions in LTL mode, iteration 1 : 277/354 places, 426/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59414 ms. Remains : 277/354 places, 426/503 transitions.
[2025-06-07 18:32:14] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:32:14] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:32:14] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-07 18:32:14] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:32:14] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:32:14] [INFO ] Time to serialize gal into /tmp/CTLFireability12287965492530973152.gal : 2 ms
[2025-06-07 18:32:14] [INFO ] Time to serialize properties into /tmp/CTLFireability9939768582250712543.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/CTLFireability12287965492530973152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9939768582250712543.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.63517e+22,0.183876,9988,2,1797,5,27051,6,0,1536,24687,0
Converting to forward existential form...Done !
original formula: AG(EF(((AG(((p102==1)&&(p189==1))) + AF(((p317==1)||(p400==1)))) + (EX((p260==0)) * (((p491==1)||(p335==1))||(((p413==1)&&(p454==1))||((p...180
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(E(TRUE U !(((p102==1)&&(p189==1))))) + !(EG(!(((p317==1)||(p400==1)))))) + (E...258
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t53, t63, t68, t74, t85, t99, t109, t114, t122, t130, t145, t159, t169, t174, t...302
(forward)formula 0,0,19.6917,547612,1,0,1451,3.14291e+06,884,780,9805,3.72313e+06,1760
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 503/503 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 311 transition count 460
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 311 transition count 460
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 111 place count 286 transition count 435
Iterating global reduction 0 with 25 rules applied. Total rules applied 136 place count 286 transition count 435
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 145 place count 277 transition count 426
Iterating global reduction 0 with 9 rules applied. Total rules applied 154 place count 277 transition count 426
Applied a total of 154 rules in 13 ms. Remains 277 /354 variables (removed 77) and now considering 426/503 (removed 77) transitions.
// Phase 1: matrix 426 rows 277 cols
[2025-06-07 18:32:34] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:32:34] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-07 18:32:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:32:34] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-07 18:32: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/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 297 constraints, problems are : Problem set: 0 solved, 425 unsolved in 28422 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 425/722 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:33:15] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:33:21] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:33:21] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:33:22] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 3/726 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:33:29] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 727 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58501ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 58502ms
Starting structural reductions in LTL mode, iteration 1 : 277/354 places, 426/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58810 ms. Remains : 277/354 places, 426/503 transitions.
[2025-06-07 18:33:33] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:33:33] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:33:33] [INFO ] Input system was already deterministic with 426 transitions.
[2025-06-07 18:33:33] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:33:33] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:33:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8015081192669884823.gal : 1 ms
[2025-06-07 18:33:33] [INFO ] Time to serialize properties into /tmp/CTLFireability10989113000713872849.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/CTLFireability8015081192669884823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10989113000713872849.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.63456e+22,0.146766,8968,2,1534,5,22770,6,0,1536,18546,0
Converting to forward existential form...Done !
original formula: EF((AX(((p127==1)&&(p214==1))) * AF((((p75==1)||(p306==1)) + AX((p446==0))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(((p127==1)&&(p214==1)))))) * !(EG(!((((p75==1)||(p306==1)) + !(EX(!((p446==0))))))))...166
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t39, t48, t55, t65, t70, t85, t99, t109, t114, t128, t145, t159, t169, t174, t189, t...296
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.9289,70484,1,0,635,396540,880,368,9789,301029,899
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-14 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 : 354/354 places, 503/503 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 316 transition count 465
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 316 transition count 465
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 297 transition count 446
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 297 transition count 446
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 120 place count 291 transition count 440
Iterating global reduction 0 with 6 rules applied. Total rules applied 126 place count 291 transition count 440
Applied a total of 126 rules in 11 ms. Remains 291 /354 variables (removed 63) and now considering 440/503 (removed 63) transitions.
// Phase 1: matrix 440 rows 291 cols
[2025-06-07 18:33:35] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:35] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-07 18:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:33:35] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2025-06-07 18:33: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/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:33:42] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 440/731 variables, 291/312 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/731 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 731/731 variables, and 312 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/291 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 440/731 variables, 291/312 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/731 variables, 439/751 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:12] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:13] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:13] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:13] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 4/755 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:18] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:18] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:18] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:19] [INFO ] Deduced a trap composed of 45 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 18:34:20] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 5/760 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:34:25] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 731/731 variables, and 761 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 291/354 places, 440/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60437 ms. Remains : 291/354 places, 440/503 transitions.
[2025-06-07 18:34:35] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:34:35] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:34:35] [INFO ] Input system was already deterministic with 440 transitions.
[2025-06-07 18:34:35] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:34:35] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:34:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7067528395372164658.gal : 2 ms
[2025-06-07 18:34:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14790322267261282893.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/CTLFireability7067528395372164658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14790322267261282893.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.35617e+22,0.22521,12496,2,2086,5,39771,6,0,1606,38558,0
Converting to forward existential form...Done !
original formula: E(EF((((p516==1)&&(!((p181==1)&&(p447==1)))) * EX((((p481==1)&&(p465==1))&&(p505==1))))) U ((AG(((p279!=1)||(p421==1))) * A((EF((p135==1)...222
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,E(TRUE U (((p516==1)&&(!((p181==1)&&(p447==1)))) * EX((((p481==1)&&(p465==1))&&(p505==1))))))...634
Reverse transition relation is NOT exact ! Due to transitions t5, t37, t42, t50, t57, t66, t69, t70, t74, t87, t92, t103, t107, t118, t123, t138, t148, t15...336
Using saturation style SCC detection
(forward)formula 0,0,22.6233,608540,1,0,845,3.39379e+06,922,473,10491,3.3559e+06,1169
FORMULA Champagne-PT-H06T1U-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 18:34:58] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:34:58] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:34:58] [INFO ] Applying decomposition
[2025-06-07 18:34:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17924393302523503505.txt' '-o' '/tmp/graph17924393302523503505.bin' '-w' '/tmp/graph17924393302523503505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17924393302523503505.bin' '-l' '-1' '-v' '-w' '/tmp/graph17924393302523503505.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:34:58] [INFO ] Decomposing Gal with order
[2025-06-07 18:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:34:58] [INFO ] Removed a total of 308 redundant transitions.
[2025-06-07 18:34:58] [INFO ] Flatten gal took : 34 ms
[2025-06-07 18:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2025-06-07 18:34:58] [INFO ] Time to serialize gal into /tmp/CTLFireability626214728037714075.gal : 3 ms
[2025-06-07 18:34:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3962868176115325285.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/CTLFireability626214728037714075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3962868176115325285.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 -...261
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.21281e+24,0.264213,11272,1203,37,13973,892,935,19598,86,2427,0
Converting to forward existential form...Done !
original formula: EG(E(EF((i6.i1.u37.p177==1)) U AG(AX(((i16.i1.u91.p408==1)||((i5.i1.u33.p156==1)&&(i10.i1.u52.p243==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (i6.i1.u37.p177==1)) U !(E(TRUE U !(!(EX(!(((i16.i1.u91.p408==1)||((i5.i1.u33.p156==1)&&(i...193
Reverse transition relation is NOT exact ! Due to transitions t5, t42, t104, t140, t157, t229, t248, t304, i0.i0.u2.t358, i0.i0.u7.t362, i1.t345, i2.i0.t32...821
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 an SCC at level 1
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
Detected timeout of ITS tools.
[2025-06-07 19:01:19] [INFO ] Applying decomposition
[2025-06-07 19:01:19] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:01:19] [INFO ] Decomposing Gal with order
[2025-06-07 19:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:01:19] [INFO ] Removed a total of 184 redundant transitions.
[2025-06-07 19:01:19] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 4 ms.
[2025-06-07 19:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12302222735979617984.gal : 2 ms
[2025-06-07 19:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16982065219152450012.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/CTLFireability12302222735979617984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16982065219152450012.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21281e+24,0.181771,8900,473,493,6938,3127,429,15359,296,14115,0
Converting to forward existential form...Done !
original formula: EG(E(EF((i1.i0.i0.i0.u15.p177==1)) U AG(AX(((i1.i1.i1.i0.u31.p408==1)||((i1.i0.i0.i0.u14.p156==1)&&(i1.i1.i0.i0.i0.u22.p243==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (i1.i0.i0.i0.u15.p177==1)) U !(E(TRUE U !(!(EX(!(((i1.i1.i1.i0.u31.p408==1)||((i1.i0.i0.i0...218
Reverse transition relation is NOT exact ! Due to transitions i0.u9.t285, i0.u9.t289, i0.i0.t304, i0.i0.u8.t309, i0.i0.i0.u7.t324, i0.i0.i0.u7.t328, i0.i0....1233
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-H06T1U"
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-H06T1U, 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-174931339200058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H06T1U.tgz
mv Champagne-PT-H06T1U 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 '
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 ;