Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524000161.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 MedleyA-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524000161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 99K May 29 14:32 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 MedleyA-PT-09-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2024-15
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-00
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-01
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-02
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-03
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-04
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-05
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-06
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-07
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-08
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-09
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-10
FORMULA_NAME MedleyA-PT-09-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748851659916

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 08:07:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 08:07:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:07:42] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-06-02 08:07:42] [INFO ] Transformed 147 places.
[2025-06-02 08:07:42] [INFO ] Transformed 315 transitions.
[2025-06-02 08:07:42] [INFO ] Found NUPN structural information;
[2025-06-02 08:07:42] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
Support contains 87 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 133 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 133 transition count 301
Applied a total of 24 rules in 58 ms. Remains 133 /145 variables (removed 12) and now considering 301/313 (removed 12) transitions.
// Phase 1: matrix 301 rows 133 cols
[2025-06-02 08:07:43] [INFO ] Computed 12 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:07:43] [INFO ] Implicit Places using invariants in 516 ms returned []
[2025-06-02 08:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:07:43] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2025-06-02 08:07:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/133 variables, 7/12 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:50] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:51] [INFO ] Deduced a trap composed of 17 places in 248 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:51] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:51] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:52] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:52] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:52] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:52] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:52] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:53] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:53] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:53] [INFO ] Deduced a trap composed of 26 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-02 08:07:53] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:54] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:54] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:54] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:54] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 17/29 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:56] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:57] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 2/31 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:59] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/32 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/32 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 301/434 variables, 133/165 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:05] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:05] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 2/167 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:11] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 1/168 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 168 constraints, problems are : Problem set: 64 solved, 236 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 5/5 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/5 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 3/133 variables, 7/12 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 22/34 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 301/434 variables, 133/167 constraints. Problems are: Problem set: 64 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 236/403 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:23] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:23] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:24] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:25] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:25] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:26] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:26] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:27] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:27] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:28] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 10/413 constraints. Problems are: Problem set: 64 solved, 236 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:44] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 414 constraints, problems are : Problem set: 64 solved, 236 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 236/300 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 61005ms problems are : Problem set: 64 solved, 236 unsolved
Search for dead transitions found 64 dead transitions in 61040ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 133/145 places, 237/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62186 ms. Remains : 133/145 places, 237/313 transitions.
Support contains 87 out of 133 places after structural reductions.
[2025-06-02 08:08:45] [INFO ] Flatten gal took : 115 ms
[2025-06-02 08:08:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-09-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 08:08:45] [INFO ] Flatten gal took : 57 ms
[2025-06-02 08:08:45] [INFO ] Input system was already deterministic with 237 transitions.
Support contains 83 out of 133 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (1313 resets) in 2571 ms. (15 steps per ms) remains 19/64 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (25 resets) in 32 ms. (121 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 67 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (27 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (28 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (26 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (27 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (30 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (26 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (29 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
// Phase 1: matrix 237 rows 133 cols
[2025-06-02 08:08:46] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 64/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 6/97 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 36/133 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 237/370 variables, 133/145 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 145 constraints, problems are : Problem set: 0 solved, 18 unsolved in 956 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 64/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:47] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 6/97 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 36/133 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:48] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:48] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:49] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:49] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 237/370 variables, 133/150 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 18/168 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:50] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 25 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:50] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:51] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:51] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 23 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:52] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 173 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5994ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 237/237 transitions.
Graph (complete) has 431 edges and 133 vertex of which 128 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 128 transition count 222
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 117 transition count 218
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 114 transition count 217
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 114 transition count 211
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 108 transition count 211
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 56 place count 96 transition count 198
Iterating global reduction 3 with 12 rules applied. Total rules applied 68 place count 96 transition count 198
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 103 place count 78 transition count 181
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 119 place count 70 transition count 218
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 127 place count 70 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 156 place count 70 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 70 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 69 transition count 180
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 69 transition count 177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 164 place count 66 transition count 177
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 66 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 166 place count 65 transition count 176
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 170 place count 65 transition count 176
Applied a total of 170 rules in 160 ms. Remains 65 /133 variables (removed 68) and now considering 176/237 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 65/133 places, 176/237 transitions.
RANDOM walk for 40000 steps (4720 resets) in 497 ms. (80 steps per ms) remains 1/18 properties
BEST_FIRST walk for 12390 steps (353 resets) in 83 ms. (147 steps per ms) remains 0/1 properties
[2025-06-02 08:08:53] [INFO ] Flatten gal took : 39 ms
[2025-06-02 08:08:53] [INFO ] Flatten gal took : 43 ms
[2025-06-02 08:08:53] [INFO ] Input system was already deterministic with 237 transitions.
Computed a total of 17 stabilizing places and 19 stable transitions
Graph (complete) has 431 edges and 133 vertex of which 128 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 237
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 108 transition count 209
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 108 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 106 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 106 transition count 205
Applied a total of 53 rules in 22 ms. Remains 106 /133 variables (removed 27) and now considering 205/237 (removed 32) transitions.
// Phase 1: matrix 205 rows 106 cols
[2025-06-02 08:08:53] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:08:53] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 08:08:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:08:53] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 08:08:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:57] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:58] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:58] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:58] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/311 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:02] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:02] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:02] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:03] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:07] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 132 constraints, problems are : Problem set: 0 solved, 204 unsolved in 25250 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/106 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/311 variables, 106/131 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 204/335 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:23] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:23] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:23] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:24] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:24] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:25] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:39] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:40] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 344 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55538ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 55541ms
Starting structural reductions in LTL mode, iteration 1 : 106/133 places, 205/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55963 ms. Remains : 106/133 places, 205/237 transitions.
[2025-06-02 08:09:49] [INFO ] Flatten gal took : 27 ms
[2025-06-02 08:09:49] [INFO ] Flatten gal took : 35 ms
[2025-06-02 08:09:49] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 08:09:49] [INFO ] Flatten gal took : 33 ms
[2025-06-02 08:09:49] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:09:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17877050171269194840.gal : 14 ms
[2025-06-02 08:09:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10404795705155203140.ctl : 6 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/CTLCardinality17877050171269194840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10404795705155203140.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,5.56388e+07,2.68678,58828,2,4315,5,184296,6,0,627,232435,0


Converting to forward existential form...Done !
original formula: EX((((p78==0)||(p122==1)) + EF(EX(((p46==0)&&(p123==1))))))
=> equivalent forward existential formula: ([(EY(Init) * ((p78==0)||(p122==1)))] != FALSE + [(EY(FwdU(EY(Init),TRUE)) * ((p46==0)&&(p123==1)))] != FALSE)
(forward)formula 0,1,2.69977,58828,1,0,8,184296,8,1,866,232435,2
FORMULA MedleyA-PT-09-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 112 transition count 214
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 112 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 110 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 110 transition count 210
Applied a total of 44 rules in 12 ms. Remains 110 /133 variables (removed 23) and now considering 210/237 (removed 27) transitions.
// Phase 1: matrix 210 rows 110 cols
[2025-06-02 08:09:52] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:09:52] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 08:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:09:52] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-02 08:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:56] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:56] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:56] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:56] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:58] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 210/320 variables, 110/125 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:03] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:03] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:03] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:04] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:04] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:07] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:16] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/320 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 320/320 variables, and 132 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:24] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:24] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:24] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:25] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 210/320 variables, 110/134 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 209/343 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:30] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:30] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:31] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:43] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:43] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 209 unsolved
SMT process timed out in 60165ms, After SMT, problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 110/133 places, 210/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60526 ms. Remains : 110/133 places, 210/237 transitions.
[2025-06-02 08:10:52] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:10:52] [INFO ] Flatten gal took : 16 ms
[2025-06-02 08:10:52] [INFO ] Input system was already deterministic with 210 transitions.
[2025-06-02 08:10:52] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:10:52] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:10:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3963640274426006966.gal : 4 ms
[2025-06-02 08:10:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7155192582174002422.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/CTLCardinality3963640274426006966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7155192582174002422.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,7.14902e+07,5.38913,106720,2,8211,5,296609,6,0,650,464972,0


Converting to forward existential form...Done !
original formula: (EF(((((p96==0)||(p13==1)) * A(AF((p97==1)) U (p23==1))) * (AX((p61==0)) + (p2==0)))) + (AX(AX((((p56==1) * A((p21==1) U (p98==1))) + EX(...308
=> equivalent forward existential formula: (([((EY(EY((Init * !(E(TRUE U ((((p96==0)||(p13==1)) * !((E(!((p23==1)) U (!(!(EG(!((p97==1))))) * !((p23==1))))...1430
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t23, t24, t25, t26, t28, t29, t32, t33, t34, t37, t39, t41, t42, t45, t46,...458
Detected timeout of ITS tools.
[2025-06-02 08:11:23] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:11:23] [INFO ] Applying decomposition
[2025-06-02 08:11:23] [INFO ] Flatten gal took : 12 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/graph2910951005247123341.txt' '-o' '/tmp/graph2910951005247123341.bin' '-w' '/tmp/graph2910951005247123341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2910951005247123341.bin' '-l' '-1' '-v' '-w' '/tmp/graph2910951005247123341.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:11:23] [INFO ] Decomposing Gal with order
[2025-06-02 08:11:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:11:23] [INFO ] Removed a total of 396 redundant transitions.
[2025-06-02 08:11:23] [INFO ] Flatten gal took : 125 ms
[2025-06-02 08:11:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 26 ms.
[2025-06-02 08:11:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9071813398840708919.gal : 9 ms
[2025-06-02 08:11:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality10896163003187251851.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/CTLCardinality9071813398840708919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10896163003187251851.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.14902e+07,0.684895,18060,887,242,22979,3419,450,77347,115,20169,0


Converting to forward existential form...Done !
original formula: (EF(((((i5.u21.p96==0)||(i2.u2.p13==1)) * A(AF((i5.u20.p97==1)) U (i6.i0.u4.p23==1))) * (AX((i0.i0.u15.p61==0)) + (i0.i0.u15.p2==0)))) + ...452
=> equivalent forward existential formula: (([((EY(EY((Init * !(E(TRUE U ((((i5.u21.p96==0)||(i2.u2.p13==1)) * !((E(!((i6.i0.u4.p23==1)) U (!(!(EG(!((i5.u2...1965
Reverse transition relation is NOT exact ! Due to transitions t25, t65, i0.i1.t16, i0.i1.u28.t8, i0.i1.u29.t14, i1.t84, i1.t81, i1.t80, i1.u6.t88, i1.u6.t8...768
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Graph (complete) has 431 edges and 133 vertex of which 128 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 127 transition count 210
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 104 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 102 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 101 transition count 203
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 57 place count 101 transition count 197
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 69 place count 95 transition count 197
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 87 place count 77 transition count 173
Iterating global reduction 4 with 18 rules applied. Total rules applied 105 place count 77 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 105 place count 77 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 76 transition count 172
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 139 place count 59 transition count 157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 58 transition count 155
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 58 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 147 place count 58 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 58 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 151 place count 56 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 151 place count 56 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 155 place count 54 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 159 place count 52 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 50 transition count 141
Applied a total of 161 rules in 67 ms. Remains 50 /133 variables (removed 83) and now considering 141/237 (removed 96) transitions.
// Phase 1: matrix 141 rows 50 cols
[2025-06-02 08:11:53] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:11:53] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 08:11:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:11:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:11:53] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:11:53] [INFO ] Redundant transitions in 6 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-02 08:11:53] [INFO ] Invariant cache hit.
[2025-06-02 08:11:53] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/191 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 74 constraints, problems are : Problem set: 0 solved, 135 unsolved in 5494 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 2/50 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 141/191 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 135/209 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 209 constraints, problems are : Problem set: 0 solved, 135 unsolved in 20188 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25754ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 25755ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/133 places, 141/237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26048 ms. Remains : 50/133 places, 141/237 transitions.
[2025-06-02 08:12:19] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:12:19] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:12:19] [INFO ] Input system was already deterministic with 141 transitions.
[2025-06-02 08:12:19] [INFO ] Flatten gal took : 25 ms
[2025-06-02 08:12:19] [INFO ] Flatten gal took : 19 ms
[2025-06-02 08:12:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6409889351427600125.gal : 6 ms
[2025-06-02 08:12:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8632310388518002504.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6409889351427600125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8632310388518002504.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (5162 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (1031 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8632310388518002504.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 88
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :88 after 283
Invariant property MedleyA-PT-09-CTLCardinality-2025-02 does not hold.
FORMULA MedleyA-PT-09-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1588,0.085685,5324,2,339,11,1739,6,0,337,888,0
Total reachable state count : 1588

Verifying 1 reachability properties.
Invariant property MedleyA-PT-09-CTLCardinality-2025-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-09-CTLCardinality-2025-02,1,0.086222,5324,2,51,11,1739,7,0,343,888,0
Finished probabilistic random walk after 41521 steps, run visited all 1 properties in 266 ms. (steps per millisecond=156 )
Probabilistic random walk after 41521 steps, saw 10601 distinct states, run finished after 271 ms. (steps per millisecond=153 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 108 transition count 211
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 108 transition count 211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 106 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 106 transition count 207
Applied a total of 52 rules in 8 ms. Remains 106 /133 variables (removed 27) and now considering 207/237 (removed 30) transitions.
// Phase 1: matrix 207 rows 106 cols
[2025-06-02 08:12:20] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:12:20] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 08:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:12:20] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2025-06-02 08:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:23] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:23] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:24] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:24] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:24] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:24] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:28] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:28] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:29] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:33] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:37] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 0/313 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 128 constraints, problems are : Problem set: 0 solved, 206 unsolved in 27347 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/313 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 206/332 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:51] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:52] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:53] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:53] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57456ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 57456ms
Starting structural reductions in LTL mode, iteration 1 : 106/133 places, 207/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57752 ms. Remains : 106/133 places, 207/237 transitions.
[2025-06-02 08:13:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:13:17] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:13:17] [INFO ] Input system was already deterministic with 207 transitions.
[2025-06-02 08:13:17] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:13:18] [INFO ] Flatten gal took : 25 ms
[2025-06-02 08:13:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality10768902285717990492.gal : 4 ms
[2025-06-02 08:13:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17753128423796796438.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/CTLCardinality10768902285717990492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17753128423796796438.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,5.53522e+07,2.28923,56508,2,4121,5,167016,6,0,631,232434,0


Converting to forward existential form...Done !
original formula: EF(AX(EF((EG(((p102==0)||(p27==1))) * AX((p108==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U (EG(((p102==0)||(p27==1))) * !(EX(!((p108==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t26, t27, t29, t30, t32, t33, t34, t35, t39, t40, t42,...442
Detected timeout of ITS tools.
[2025-06-02 08:13:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:13:48] [INFO ] Applying decomposition
[2025-06-02 08:13:48] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10218990044876070421.txt' '-o' '/tmp/graph10218990044876070421.bin' '-w' '/tmp/graph10218990044876070421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10218990044876070421.bin' '-l' '-1' '-v' '-w' '/tmp/graph10218990044876070421.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:13:48] [INFO ] Decomposing Gal with order
[2025-06-02 08:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:13:48] [INFO ] Removed a total of 331 redundant transitions.
[2025-06-02 08:13:48] [INFO ] Flatten gal took : 25 ms
[2025-06-02 08:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 6 ms.
[2025-06-02 08:13:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality11897374442287260992.gal : 3 ms
[2025-06-02 08:13:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17456506997808237498.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/CTLCardinality11897374442287260992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17456506997808237498.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,5.53522e+07,0.287131,12148,732,186,13707,1247,373,34368,120,7612,0


Converting to forward existential form...Done !
original formula: EF(AX(EF((EG(((i6.u21.p102==0)||(i1.u6.p27==1))) * AX((i5.u24.p108==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U (EG(((i6.u21.p102==0)||(i1.u6.p27==1))) * !(EX(!((i5.u24.p108==0))))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t40, t65, i0.u2.t96, i0.u4.t93, i1.t85, i1.t81, i1.t80, i1.u6.t63, i1.u6.t91, i1.u6....678
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Graph (complete) has 431 edges and 133 vertex of which 128 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 127 transition count 210
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 104 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 102 transition count 204
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 55 place count 102 transition count 197
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 69 place count 95 transition count 197
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 88 place count 76 transition count 171
Iterating global reduction 3 with 19 rules applied. Total rules applied 107 place count 76 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 107 place count 76 transition count 170
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 75 transition count 170
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 141 place count 58 transition count 155
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 57 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 57 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 57 transition count 147
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 151 place count 57 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 153 place count 55 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 153 place count 55 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 53 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 51 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 49 transition count 139
Applied a total of 163 rules in 67 ms. Remains 49 /133 variables (removed 84) and now considering 139/237 (removed 98) transitions.
// Phase 1: matrix 139 rows 49 cols
[2025-06-02 08:14:18] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:18] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-02 08:14:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:14:18] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:14:18] [INFO ] Redundant transitions in 4 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-02 08:14:18] [INFO ] Invariant cache hit.
[2025-06-02 08:14:18] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/188 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 73 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4423 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/188 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 133/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 206 constraints, problems are : Problem set: 0 solved, 133 unsolved in 14311 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18794ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 18799ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/133 places, 139/237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19283 ms. Remains : 49/133 places, 139/237 transitions.
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:14:37] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 374 steps (49 resets) in 8 ms. (41 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-09-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:14:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10339833222102954179.gal : 2 ms
[2025-06-02 08:14:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7201271707451707653.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10339833222102954179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7201271707451707653.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Graph (complete) has 431 edges and 133 vertex of which 129 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 128 transition count 214
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 108 transition count 210
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 106 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 105 transition count 207
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 51 place count 105 transition count 201
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 63 place count 99 transition count 201
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 80 place count 82 transition count 178
Iterating global reduction 4 with 17 rules applied. Total rules applied 97 place count 82 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 97 place count 82 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 81 transition count 177
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 128 place count 66 transition count 163
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 65 transition count 161
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 65 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 65 transition count 155
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 65 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 140 place count 63 transition count 153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 140 place count 63 transition count 151
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 144 place count 61 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 148 place count 59 transition count 149
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 59 transition count 149
Applied a total of 149 rules in 60 ms. Remains 59 /133 variables (removed 74) and now considering 149/237 (removed 88) transitions.
// Phase 1: matrix 149 rows 59 cols
[2025-06-02 08:14:37] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:37] [INFO ] Implicit Places using invariants in 68 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 58/133 places, 149/237 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 137 ms. Remains : 58/133 places, 149/237 transitions.
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:14:37] [INFO ] Input system was already deterministic with 149 transitions.
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:14:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:14:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality9385365527067943904.gal : 2 ms
[2025-06-02 08:14:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality2208386157678061742.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/CTLCardinality9385365527067943904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2208386157678061742.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.13572e+06,0.255939,10000,2,778,5,23785,6,0,379,24246,0


Converting to forward existential form...Done !
original formula: E(EG(!(AF((EF(((p121==0)||(p71==1))) * A(((p134==0)||(p118==1)) U (p125==1)))))) U (p82==1))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(!(EG(!((E(TRUE U ((p121==0)||(p71==1))) * !((E(!((p125==1)) U (!(((p134==0)||(p118==1))) * !((p...215
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t6, t7, t8, t11, t12, t13, t14, t16, t19, t21, t22, t23, t25, t26, t29, t30, t32,...367
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,11.4699,276040,1,0,834,1.53701e+06,342,435,3964,1.56768e+06,1000
FORMULA MedleyA-PT-09-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 110 transition count 212
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 110 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 109 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 109 transition count 210
Applied a total of 46 rules in 4 ms. Remains 109 /133 variables (removed 24) and now considering 210/237 (removed 27) transitions.
// Phase 1: matrix 210 rows 109 cols
[2025-06-02 08:14:49] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:49] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 08:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:14:49] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-06-02 08:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:53] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:53] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:53] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:53] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:53] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:54] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:54] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/319 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:58] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:58] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:58] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:14:58] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:04] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:06] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:09] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 133 constraints, problems are : Problem set: 0 solved, 209 unsolved in 29165 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/109 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/319 variables, 109/131 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 209/340 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:22] [INFO ] Deduced a trap composed of 17 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-02 08:15:22] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:22] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:22] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:23] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:23] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:24] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:24] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:24] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 9/349 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:30] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 352 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 59279ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 59279ms
Starting structural reductions in LTL mode, iteration 1 : 109/133 places, 210/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59679 ms. Remains : 109/133 places, 210/237 transitions.
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:15:49] [INFO ] Input system was already deterministic with 210 transitions.
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:15:49] [INFO ] Flatten gal took : 26 ms
[2025-06-02 08:15:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality4390713713374346777.gal : 3 ms
[2025-06-02 08:15:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10051961728450944571.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/CTLCardinality4390713713374346777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10051961728450944571.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.16024e+07,3.72456,82316,2,5481,5,220656,6,0,646,344076,0


Converting to forward existential form...Done !
original formula: EG(A(AG(!(AF(((p59==0)||(p74==1))))) U (E(AX(((p37==0)||(p25==1))) U AF((p13==1))) + !(((AX((p117==0)) * AG((p92==1))) * ((p44==0)||(p93=...164
=> equivalent forward existential formula: [FwdG(Init,!((E(!((E(!(EX(!(((p37==0)||(p25==1))))) U !(EG(!((p13==1))))) + !(((!(EX(!((p117==0)))) * !(E(TRUE U...554
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...458
Detected timeout of ITS tools.
[2025-06-02 08:16:19] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:16:19] [INFO ] Applying decomposition
[2025-06-02 08:16:19] [INFO ] Flatten gal took : 6 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/graph13840591616829752708.txt' '-o' '/tmp/graph13840591616829752708.bin' '-w' '/tmp/graph13840591616829752708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13840591616829752708.bin' '-l' '-1' '-v' '-w' '/tmp/graph13840591616829752708.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:16:19] [INFO ] Decomposing Gal with order
[2025-06-02 08:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:16:19] [INFO ] Removed a total of 423 redundant transitions.
[2025-06-02 08:16:19] [INFO ] Flatten gal took : 21 ms
[2025-06-02 08:16:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 8 ms.
[2025-06-02 08:16:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11698656882766665821.gal : 3 ms
[2025-06-02 08:16:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4720309044774646725.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/CTLCardinality11698656882766665821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4720309044774646725.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.16024e+07,0.211729,9104,486,101,9507,742,426,19834,87,3167,0


Converting to forward existential form...Done !
original formula: EG(A(AG(!(AF(((i1.i1.u12.p59==0)||(i6.u19.p74==1))))) U (E(AX(((i3.u11.p37==0)||(i3.u7.p25==1))) U AF((i1.i0.u3.p13==1))) + !(((AX((i6.u1...234
=> equivalent forward existential formula: [FwdG(Init,!((E(!((E(!(EX(!(((i3.u11.p37==0)||(i3.u7.p25==1))))) U !(EG(!((i1.i0.u3.p13==1))))) + !(((!(EX(!((i6...730
Reverse transition relation is NOT exact ! Due to transitions t7, t24, i0.u2.t99, i0.u5.t95, i1.i0.t100, i1.i0.u3.t98, i1.i0.u4.t96, i1.i1.t62, i1.i1.t71, ...787
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,10.6838,268960,1,0,392389,3453,2950,1.49348e+06,425,26403,333942
FORMULA MedleyA-PT-09-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 107 transition count 209
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 107 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 105 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 105 transition count 205
Applied a total of 54 rules in 5 ms. Remains 105 /133 variables (removed 28) and now considering 205/237 (removed 32) transitions.
// Phase 1: matrix 205 rows 105 cols
[2025-06-02 08:16:30] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:30] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 08:16:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:30] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 08:16:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:33] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:33] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:34] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:34] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:34] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:34] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:38] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:38] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:38] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:39] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:43] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:44] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 127 constraints, problems are : Problem set: 0 solved, 204 unsolved in 22645 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:58] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:58] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:58] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:16:58] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 335 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 52772ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 52772ms
Starting structural reductions in LTL mode, iteration 1 : 105/133 places, 205/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53139 ms. Remains : 105/133 places, 205/237 transitions.
[2025-06-02 08:17:23] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:17:23] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:17:23] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 08:17:23] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:17:23] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:17:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality960394362343840146.gal : 2 ms
[2025-06-02 08:17:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality14976771864220862548.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/CTLCardinality960394362343840146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14976771864220862548.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,5.54642e+07,3.46627,80192,2,4545,5,222437,6,0,625,327704,0


Converting to forward existential form...Done !
original formula: (AG((p65==0)) * AX(((p46==0)||(p145==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p65==0)))] = FALSE * [(EY(Init) * !(((p46==0)||(p145==1))))] = FALSE)
(forward)formula 0,0,3.48692,80192,1,0,12,222437,11,4,871,327704,3
FORMULA MedleyA-PT-09-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 108 transition count 210
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 108 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 106 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 106 transition count 206
Applied a total of 52 rules in 5 ms. Remains 106 /133 variables (removed 27) and now considering 206/237 (removed 31) transitions.
// Phase 1: matrix 206 rows 106 cols
[2025-06-02 08:17:26] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:17:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 08:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:17:27] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2025-06-02 08:17:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:30] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:30] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:30] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:30] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:30] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:30] [INFO ] Deduced a trap composed of 14 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-02 08:17:30] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/123 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:34] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:34] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:34] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:34] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:38] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:40] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/312 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 129 constraints, problems are : Problem set: 0 solved, 205 unsolved in 20370 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/312 variables, 106/128 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 205/333 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:51] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:51] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:51] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:00] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:15] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 339 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50486ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 50487ms
Starting structural reductions in LTL mode, iteration 1 : 106/133 places, 206/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50723 ms. Remains : 106/133 places, 206/237 transitions.
[2025-06-02 08:18:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:18:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:18:17] [INFO ] Input system was already deterministic with 206 transitions.
[2025-06-02 08:18:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:18:17] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:18:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8867898273739214931.gal : 2 ms
[2025-06-02 08:18:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality18020104596595427743.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/CTLCardinality8867898273739214931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18020104596595427743.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.39746e+07,3.70947,82124,2,6548,5,226211,6,0,630,348055,0


Converting to forward existential form...Done !
original formula: E(AF(EX(AX(((p93==1)&&(p19==1))))) U !(AF(!(((AX((p66==1)) + A((p135==0) U (p10==1))) + ((p95==0)||(p98==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(EX(!(EX(!(((p93==1)&&(p19==1)))))))))),!(!(((!(EX(!((p66==1)))) + !((E(!((p10==1)) U (!((...238
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...437
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 08:18:47] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:18:47] [INFO ] Applying decomposition
[2025-06-02 08:18:47] [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/graph14984940589382579347.txt' '-o' '/tmp/graph14984940589382579347.bin' '-w' '/tmp/graph14984940589382579347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14984940589382579347.bin' '-l' '-1' '-v' '-w' '/tmp/graph14984940589382579347.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:18:47] [INFO ] Decomposing Gal with order
[2025-06-02 08:18:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:18:47] [INFO ] Removed a total of 337 redundant transitions.
[2025-06-02 08:18:47] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:18:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2025-06-02 08:18:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality5399641578659321277.gal : 3 ms
[2025-06-02 08:18:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality161329477778447772.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/CTLCardinality5399641578659321277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality161329477778447772.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,5.39746e+07,0.333085,13308,909,243,17407,2122,400,39801,104,9078,0


Converting to forward existential form...Done !
original formula: E(AF(EX(AX(((i6.u21.p93==1)&&(i4.u2.p19==1))))) U !(AF(!(((AX((i5.u13.p66==1)) + A((i1.u30.p135==0) U (i2.u1.p10==1))) + ((i6.u22.p95==0)...178
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(EX(!(EX(!(((i6.u21.p93==1)&&(i4.u2.p19==1)))))))))),!(!(((!(EX(!((i5.u13.p66==1)))) + !((...297
Reverse transition relation is NOT exact ! Due to transitions t7, t24, t57, t63, i0.i1.t15, i0.i1.u29.t14, i1.u27.t16, i1.u27.t143, i2.u1.t94, i2.u1.t95, i...693
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 7
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 108 transition count 211
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 108 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 107 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 107 transition count 209
Applied a total of 50 rules in 6 ms. Remains 107 /133 variables (removed 26) and now considering 209/237 (removed 28) transitions.
// Phase 1: matrix 209 rows 107 cols
[2025-06-02 08:19:18] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:18] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:18] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2025-06-02 08:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:20] [INFO ] Deduced a trap composed of 21 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-02 08:19:20] [INFO ] Deduced a trap composed of 31 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-02 08:19:21] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:21] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:21] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:21] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/316 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:24] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:24] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:25] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:25] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:29] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:31] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:32] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 130 constraints, problems are : Problem set: 0 solved, 208 unsolved in 25317 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 209/316 variables, 107/128 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 208/336 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:49] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:19:57] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:05] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:13] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 340 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 55473ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 55475ms
Starting structural reductions in LTL mode, iteration 1 : 107/133 places, 209/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55853 ms. Remains : 107/133 places, 209/237 transitions.
[2025-06-02 08:20:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:20:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:20:13] [INFO ] Input system was already deterministic with 209 transitions.
[2025-06-02 08:20:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:20:13] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:20:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1459158741261968540.gal : 3 ms
[2025-06-02 08:20:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13318839602107208476.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/CTLCardinality1459158741261968540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13318839602107208476.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.16538e+07,2.74579,57692,2,4075,5,167448,6,0,637,251024,0


Converting to forward existential form...Done !
original formula: A((((p121==0)||(p132==1))||((p55==0)||(p39==1))) U (A(!(EG(E(((p0==0)||(p48==1)) U (p100==1)))) U !(E((p29==1) U ((p24==0)||(p94==1))))) ...175
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(E((p29==1) U ((p24==0)||(p94==1))))) U (!(!(EG(E(((p0==0)||(p48==1)) U (p100==1))))) ...789
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t25, t27, t28, t30, t31, t32, t35, t36, t37, t39, t41, t42, t45,...452
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 08:20:43] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:20:43] [INFO ] Applying decomposition
[2025-06-02 08:20:44] [INFO ] Flatten gal took : 10 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/graph9706354753177681847.txt' '-o' '/tmp/graph9706354753177681847.bin' '-w' '/tmp/graph9706354753177681847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9706354753177681847.bin' '-l' '-1' '-v' '-w' '/tmp/graph9706354753177681847.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:20:44] [INFO ] Decomposing Gal with order
[2025-06-02 08:20:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:20:44] [INFO ] Removed a total of 368 redundant transitions.
[2025-06-02 08:20:44] [INFO ] Flatten gal took : 31 ms
[2025-06-02 08:20:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 7 ms.
[2025-06-02 08:20:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality6650347158474649622.gal : 3 ms
[2025-06-02 08:20:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15072871274673430815.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/CTLCardinality6650347158474649622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15072871274673430815.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.16538e+07,0.474953,17836,718,90,26544,713,366,52280,87,2925,0


Converting to forward existential form...Done !
original formula: A((((i9.u28.p121==0)||(i7.u29.p132==1))||((i3.u12.p55==0)||(i2.u8.p39==1))) U (A(!(EG(E(((i7.u0.p0==0)||(i3.u10.p48==1)) U (i6.u25.p100==...248
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(E((i2.u6.p29==1) U ((i1.u5.p24==0)||(i5.u22.p94==1))))) U (!(!(EG(E(((i7.u0.p0==0)||(...1068
Reverse transition relation is NOT exact ! Due to transitions t7, t56, t65, t74, i1.u2.t98, i1.u5.t95, i2.t86, i2.t83, i2.t82, i2.u6.t90, i2.u6.t91, i2.u6....700
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 114 transition count 218
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 114 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 113 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 113 transition count 216
Applied a total of 38 rules in 4 ms. Remains 113 /133 variables (removed 20) and now considering 216/237 (removed 21) transitions.
// Phase 1: matrix 216 rows 113 cols
[2025-06-02 08:21:14] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:14] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-02 08:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:14] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-02 08:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:17] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:17] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:17] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:17] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:17] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:18] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/329 variables, 113/135 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:22] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:22] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:22] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:23] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:28] [INFO ] Deduced a trap along path composed of 2 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:28] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 141 constraints, problems are : Problem set: 0 solved, 215 unsolved in 26244 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/329 variables, 113/139 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 215/354 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:45] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:46] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:47] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:47] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:47] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:55] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:56] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:57] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:57] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:10] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 364 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 56348ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 56349ms
Starting structural reductions in LTL mode, iteration 1 : 113/133 places, 216/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56607 ms. Remains : 113/133 places, 216/237 transitions.
[2025-06-02 08:22:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:10] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-02 08:22:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:22:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:22:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14230295040089438119.gal : 2 ms
[2025-06-02 08:22:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality6792764750886989012.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/CTLCardinality14230295040089438119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6792764750886989012.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,8.16357e+07,5.51848,127384,2,12141,5,361382,6,0,668,579987,0


Converting to forward existential form...Done !
original formula: !(A(((!(((AF((p36==1)) + (p9==0)) + (p28==1))) * !(((((p98==0)||(p76==1))&&(p12==1))||(p128==1)))) * (EX(((((p114==0)||(p77==1))||(p108==...367
=> equivalent forward existential formula: ([FwdG((EY((FwdU(Init,!(!(EX(!(!((E(TRUE U ((p66==0)||(p134==1))) * EG((p101==0))))))))) * !(((!(((!(EG(!((p36==...792
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t23, t24, t26, t27, t28, t30, t31, t33, t34, t35, t36, t37, t38, t40, t41,...508
Detected timeout of ITS tools.
[2025-06-02 08:22:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:22:40] [INFO ] Applying decomposition
[2025-06-02 08:22:40] [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/graph17295242922760703870.txt' '-o' '/tmp/graph17295242922760703870.bin' '-w' '/tmp/graph17295242922760703870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17295242922760703870.bin' '-l' '-1' '-v' '-w' '/tmp/graph17295242922760703870.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:22:41] [INFO ] Decomposing Gal with order
[2025-06-02 08:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:22:41] [INFO ] Removed a total of 355 redundant transitions.
[2025-06-02 08:22:41] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:22:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 9 ms.
[2025-06-02 08:22:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality14714199218318276244.gal : 3 ms
[2025-06-02 08:22:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality16074332346079329245.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/CTLCardinality14714199218318276244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16074332346079329245.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,8.16357e+07,4.31307,98332,1661,591,127175,14402,472,647785,123,130672,0


Converting to forward existential form...Done !
original formula: !(A(((!(((AF((i2.u9.p36==1)) + (i1.u2.p9==0)) + (i2.u10.p28==1))) * !(((((i5.u22.p98==0)||(i6.u17.p76==1))&&(i3.i1.u1.p12==1))||(i0.i1.u3...551
=> equivalent forward existential formula: ([FwdG((EY((FwdU(Init,!(!(EX(!(!((E(TRUE U ((i4.u16.p66==0)||(u30.p134==1))) * EG((i6.u25.p101==0))))))))) * !((...1074
Reverse transition relation is NOT exact ! Due to transitions t66, t72, i0.i1.t16, i0.i1.u29.t14, i0.i1.u32.t8, i1.u2.t103, i1.u2.t104, i1.u4.t100, i2.t93,...870
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 113 transition count 218
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 113 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 112 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 112 transition count 216
Applied a total of 40 rules in 3 ms. Remains 112 /133 variables (removed 21) and now considering 216/237 (removed 21) transitions.
// Phase 1: matrix 216 rows 112 cols
[2025-06-02 08:23:11] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:23:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 08:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:23:11] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-02 08:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:14] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:14] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/328 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:19] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:19] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:19] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:19] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:24] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:28] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:37] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/328 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/328 variables, and 133 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/328 variables, 112/131 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 215/346 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:46] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:47] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:47] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:47] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:54] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:01] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:10] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 353 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 112/133 places, 216/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60430 ms. Remains : 112/133 places, 216/237 transitions.
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:24:11] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:24:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:24:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality10990894240961790404.gal : 2 ms
[2025-06-02 08:24:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality5822301309270428366.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/CTLCardinality10990894240961790404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5822301309270428366.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(((EX(EX(AF(((p139==0)||(p57==1))))) * (p111==1)) * (((p43==0)||(p100==1)) * (EX((p90!=1)) + EG(EF(((p40==0)||(p141==1))))))) U !(((((p1...282
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((p139==0)||(p57==1))))))) * (p111==1)) * (((p43==0)||(p100==1)) * (EX((p90!=1)) + ...682
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t16, t17, t23, t24, t26, t27, t28, t30, t31, t33, t35, t36, t37, t39, t40, t41, t43,...487
Detected timeout of ITS tools.
[2025-06-02 08:24:41] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:24:41] [INFO ] Applying decomposition
[2025-06-02 08:24:41] [INFO ] Flatten gal took : 5 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/graph9540911104331123910.txt' '-o' '/tmp/graph9540911104331123910.bin' '-w' '/tmp/graph9540911104331123910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9540911104331123910.bin' '-l' '-1' '-v' '-w' '/tmp/graph9540911104331123910.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:24:41] [INFO ] Decomposing Gal with order
[2025-06-02 08:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:24:41] [INFO ] Removed a total of 398 redundant transitions.
[2025-06-02 08:24:41] [INFO ] Flatten gal took : 36 ms
[2025-06-02 08:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 5 ms.
[2025-06-02 08:24:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality6175650803281331079.gal : 3 ms
[2025-06-02 08:24:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality29043963636734518.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/CTLCardinality6175650803281331079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality29043963636734518.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.77024e+07,0.805964,20956,949,173,28166,1309,401,84736,115,8267,0


Converting to forward existential form...Done !
original formula: E(((EX(EX(AF(((i2.u2.p139==0)||(i2.u2.p57==1))))) * (i5.u24.p111==1)) * (((i2.u10.p43==0)||(i5.u24.p100==1)) * (EX((i4.u19.p90!=1)) + EG(...411
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((i2.u2.p139==0)||(i2.u2.p57==1))))))) * (i5.u24.p111==1)) * (((i2.u10.p43==0)||(i5...923
Reverse transition relation is NOT exact ! Due to transitions t69, i0.u1.t105, i0.u4.t102, i1.t95, i1.t94, i1.t93, i1.t90, i1.t89, i1.u5.t67, i1.u5.t100, i...793
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 106 transition count 208
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 106 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 104 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 104 transition count 204
Applied a total of 56 rules in 7 ms. Remains 104 /133 variables (removed 29) and now considering 204/237 (removed 33) transitions.
// Phase 1: matrix 204 rows 104 cols
[2025-06-02 08:25:11] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:25:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:25:12] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-06-02 08:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:14] [INFO ] Deduced a trap composed of 21 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-02 08:25:15] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:15] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:15] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:15] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:15] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:19] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:19] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:19] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:20] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:23] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:25] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 126 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23324 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/327 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:40] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:40] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:41] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53436ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 53437ms
Starting structural reductions in LTL mode, iteration 1 : 104/133 places, 204/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53780 ms. Remains : 104/133 places, 204/237 transitions.
[2025-06-02 08:26:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:26:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 08:26:05] [INFO ] Input system was already deterministic with 204 transitions.
[2025-06-02 08:26:05] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:26:05] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:26:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11100745537728714258.gal : 2 ms
[2025-06-02 08:26:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality14372357846336478254.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/CTLCardinality11100745537728714258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14372357846336478254.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,4.81538e+07,1.94516,46812,2,3216,5,135037,6,0,620,189146,0


Converting to forward existential form...Done !
original formula: EG((AX(((p37==0)||(p120==1))) * EX(AF(((p112==0)&&((p93==0)||(p117==1)))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(((p37==0)||(p120==1))))) * EX(!(EG(!(((p112==0)&&((p93==0)||(p117==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t43, t44, t45,...417
(forward)formula 0,1,26.4051,604728,1,0,1125,3.27614e+06,437,527,5903,3.23496e+06,1201
FORMULA MedleyA-PT-09-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 237/237 transitions.
Graph (complete) has 431 edges and 133 vertex of which 128 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 127 transition count 210
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 104 transition count 206
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 102 transition count 203
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 101 transition count 203
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 57 place count 101 transition count 197
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 69 place count 95 transition count 197
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 88 place count 76 transition count 171
Iterating global reduction 4 with 19 rules applied. Total rules applied 107 place count 76 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 107 place count 76 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 75 transition count 170
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 141 place count 58 transition count 155
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 57 transition count 153
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 57 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 149 place count 57 transition count 147
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 151 place count 57 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 153 place count 55 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 153 place count 55 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 157 place count 53 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 161 place count 51 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 49 transition count 139
Applied a total of 163 rules in 41 ms. Remains 49 /133 variables (removed 84) and now considering 139/237 (removed 98) transitions.
// Phase 1: matrix 139 rows 49 cols
[2025-06-02 08:26:32] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:26:32] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 08:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:26:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 08:26:32] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:26:32] [INFO ] Redundant transitions in 7 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-02 08:26:32] [INFO ] Invariant cache hit.
[2025-06-02 08:26:32] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/188 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 73 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 2/49 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 139/188 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 133/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 206 constraints, problems are : Problem set: 0 solved, 133 unsolved in 14747 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19866ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 19867ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/133 places, 139/237 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20118 ms. Remains : 49/133 places, 139/237 transitions.
[2025-06-02 08:26:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:26:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 08:26:52] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-02 08:26:52] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:26:52] [INFO ] Flatten gal took : 5 ms
[2025-06-02 08:26:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality17556605383751564248.gal : 1 ms
[2025-06-02 08:26:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality18050980491716074933.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/CTLCardinality17556605383751564248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18050980491716074933.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,357570,0.146056,7632,2,409,5,15237,6,0,331,14588,0


Converting to forward existential form...Done !
original formula: AG(AF((p144==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p144==0)))] = FALSE
Hit Full ! (commute/partial/dont) 128/0/11
(forward)formula 0,0,0.316237,10832,1,0,11,35006,20,3,2266,29171,8
FORMULA MedleyA-PT-09-CTLCardinality-2024-14 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 : 133/133 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 237
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 107 transition count 209
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 107 transition count 209
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 105 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 105 transition count 205
Applied a total of 54 rules in 4 ms. Remains 105 /133 variables (removed 28) and now considering 205/237 (removed 32) transitions.
// Phase 1: matrix 205 rows 105 cols
[2025-06-02 08:26:52] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:26:52] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 08:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:26:53] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 08:26:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:55] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:55] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:56] [INFO ] Deduced a trap composed of 14 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-02 08:26:56] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:56] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:56] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:59] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:59] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:27:00] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:27:03] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:27:04] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 127 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19996 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:27:18] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:27:18] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:27:19] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 334 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50125ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 50126ms
Starting structural reductions in LTL mode, iteration 1 : 105/133 places, 205/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50384 ms. Remains : 105/133 places, 205/237 transitions.
[2025-06-02 08:27:43] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:27:43] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:27:43] [INFO ] Input system was already deterministic with 205 transitions.
[2025-06-02 08:27:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:27:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:27:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality18290006106391437916.gal : 6 ms
[2025-06-02 08:27:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14005372246149015318.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/CTLCardinality18290006106391437916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14005372246149015318.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,4.82685e+07,2.61915,57352,2,4509,5,164104,6,0,625,230852,0


Converting to forward existential form...Done !
original formula: AX(((p10==0) * EF(AG((p95==1)))))
=> equivalent forward existential formula: ([(EY(Init) * !((p10==0)))] = FALSE * [(EY(Init) * !(E(TRUE U !(E(TRUE U !((p95==1)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t14, t15, t16, t22, t23, t24, t25, t27, t28, t30, t31, t32, t35, t37, t39, t40, t43, t44,...427
(forward)formula 0,1,24.9939,550600,1,0,442,2.97731e+06,434,176,5779,1.9745e+06,521
FORMULA MedleyA-PT-09-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-02 08:28:08] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:28:08] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:28:08] [INFO ] Applying decomposition
[2025-06-02 08:28:08] [INFO ] Flatten gal took : 11 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/graph2537696312440068203.txt' '-o' '/tmp/graph2537696312440068203.bin' '-w' '/tmp/graph2537696312440068203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2537696312440068203.bin' '-l' '-1' '-v' '-w' '/tmp/graph2537696312440068203.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:28:08] [INFO ] Decomposing Gal with order
[2025-06-02 08:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:28:08] [INFO ] Removed a total of 491 redundant transitions.
[2025-06-02 08:28:08] [INFO ] Flatten gal took : 30 ms
[2025-06-02 08:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 6 ms.
[2025-06-02 08:28:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3500427401269563033.gal : 3 ms
[2025-06-02 08:28:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2008851869574181150.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/CTLCardinality3500427401269563033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2008851869574181150.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 6 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.65125e+08,1.03459,27760,856,214,37116,2678,492,123728,147,16880,0


Converting to forward existential form...Done !
original formula: (EF(((((i7.u21.p96==0)||(i1.u1.p13==1)) * A(AF((i7.u18.p97==1)) U (i0.u5.p23==1))) * (AX((i6.u15.p61==0)) + (i2.i0.u4.p2==0)))) + (AX(AX(...445
=> equivalent forward existential formula: (([((EY(EY((Init * !(E(TRUE U ((((i7.u21.p96==0)||(i1.u1.p13==1)) * !((E(!((i0.u5.p23==1)) U (!(!(EG(!((i7.u18.p...1900
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t123, i0.u2.t124, i0.u5.t118, i0.u5.t119, i1.u1.t122, i1.u1.t125, i1.u1.t126, i1.u1.t12...1051
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,111.642,1926648,1,0,2.45692e+06,59702,3175,7.08036e+06,726,530762,2133652
FORMULA MedleyA-PT-09-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(AX(EF((EG(((i8.u24.p102==0)||(i3.u6.p27==1))) * AX((i8.u26.p108==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U (EG(((i8.u24.p102==0)||(i3.u6.p27==1))) * !(EX(!((i8.u26.p108==0))))))))))] ...163
(forward)formula 1,1,149.68,2204536,1,0,2.79419e+06,62586,1299,7.96215e+06,382,567422,309795
FORMULA MedleyA-PT-09-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(AF(EX(AX(((i7.u20.p93==1)&&(i1.u3.p19==1))))) U !(AF(!(((AX((i6.u13.p66==1)) + A((i5.i1.u32.p135==0) U (i0.u2.p10==1))) + ((i7.u21.p95=...181
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(EX(!(EX(!(((i7.u20.p93==1)&&(i1.u3.p19==1)))))))))),!(!(((!(EX(!((i6.u13.p66==1)))) + !((...300
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,1,205.063,2204536,1,0,2.79419e+06,62586,1700,7.96215e+06,422,567422,1662072
FORMULA MedleyA-PT-09-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((i5.i1.u29.p121==0)||(i2.i1.u31.p132==1))||((i4.u10.p55==0)||(i3.u9.p39==1))) U (A(!(EG(E(((i2.i0.u0.p0==0)||(i4.u10.p48==1)) U (i8.u...257
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!(!(E((i3.u7.p29==1) U ((i0.u5.p24==0)||(i7.u20.p94==1))))) U (!(!(EG(E(((i2.i0.u0.p0==0)...1083
Using saturation style SCC detection
(forward)formula 3,0,286.673,2425720,1,0,3.04847e+06,62586,1024,8.89689e+06,356,567422,449624
FORMULA MedleyA-PT-09-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(A(((!(((AF((i3.u9.p36==1)) + (i0.u2.p9==0)) + (i3.u6.p28==1))) * !(((((i7.u21.p98==0)||(i6.u14.p76==1))&&(i1.u1.p12==1))||(i2.i1.u34.p1...541
=> equivalent forward existential formula: ([FwdG((EY((FwdU(Init,!(!(EX(!(!((E(TRUE U ((i6.u13.p66==0)||(i5.i1.u32.p134==1))) * EG((i8.u24.p101==0)))))))))...1076
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
(forward)formula 4,1,389.736,2507000,1,0,3.26303e+06,62586,2076,9.06247e+06,486,567422,2911921
FORMULA MedleyA-PT-09-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2025-06-02 08:35:20] [INFO ] Applying decomposition
[2025-06-02 08:35:20] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:35:20] [INFO ] Decomposing Gal with order
[2025-06-02 08:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:35:20] [INFO ] Removed a total of 328 redundant transitions.
[2025-06-02 08:35:20] [INFO ] Flatten gal took : 16 ms
[2025-06-02 08:35:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 4 ms.
[2025-06-02 08:35:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16830301953694180088.gal : 1 ms
[2025-06-02 08:35:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality17822164214101675893.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/CTLCardinality16830301953694180088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17822164214101675893.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.65125e+08,0.801952,28320,603,699,40136,4592,271,139924,202,40798,0


Converting to forward existential form...Done !
original formula: E(((EX(EX(AF(((i1.i1.u15.p139==0)||(i0.i0.i1.u6.p57==1))))) * (i0.i1.i1.u11.p111==1)) * (((i0.i0.i1.u6.p43==0)||(i0.i1.i1.u11.p100==1)) *...496
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((i1.i1.u15.p139==0)||(i0.i0.i1.u6.p57==1))))))) * (i0.i1.i1.u11.p111==1)) * (((i0....1086
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t120, i0.i0.u3.t122, i0.i0.u3.t123, i0.i0.u3.t124, i0.i0.u3.t125, i0.i0.u3.t126, i0....1542
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-02 08:37:43] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:37:43] [INFO ] Input system was already deterministic with 237 transitions.
[2025-06-02 08:37:43] [INFO ] Transformed 133 places.
[2025-06-02 08:37:43] [INFO ] Transformed 237 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 08:37:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality6359902969366120054.gal : 1 ms
[2025-06-02 08:37:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3205926571329794692.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/CTLCardinality6359902969366120054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3205926571329794692.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
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.65125e+08,28.9509,669760,2,82862,5,2.17487e+06,6,0,765,2.38274e+06,0


Converting to forward existential form...Done !
original formula: E(((EX(EX(AF(((p139==0)||(p57==1))))) * (p111==1)) * (((p43==0)||(p100==1)) * (EX((p90!=1)) + EG(EF(((p40==0)||(p141==1))))))) U !(((((p1...282
=> equivalent forward existential formula: (([(FwdU(Init,((EX(EX(!(EG(!(((p139==0)||(p57==1))))))) * (p111==1)) * (((p43==0)||(p100==1)) * (EX((p90!=1)) + ...682
Reverse transition relation is NOT exact ! Due to transitions t8, t16, t17, t18, t19, t24, t25, t28, t29, t30, t32, t33, t36, t38, t39, t40, t41, t42, t44,...594
Detected timeout of ITS tools.
Total runtime 3412354 ms.

BK_STOP 1748855077507

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="MedleyA-PT-09"
export BK_EXAMINATION="CTLCardinality"
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 MedleyA-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524000161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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