Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K 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.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 241K 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 FlexibleBarrier-PT-08b-CTLCardinality-2023-12
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-13
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-14
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-15
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-00
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-01
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-02
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-03
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-04
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-05
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-06
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-07
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-08
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-09
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-10
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748924120515

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-03 04:15:22] [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-03 04:15:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 04:15:22] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2025-06-03 04:15:22] [INFO ] Transformed 920 places.
[2025-06-03 04:15:22] [INFO ] Transformed 1057 transitions.
[2025-06-03 04:15:22] [INFO ] Found NUPN structural information;
[2025-06-03 04:15:22] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Support contains 96 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 300 places :
Symmetric choice reduction at 0 with 300 rule applications. Total rules 300 place count 620 transition count 757
Iterating global reduction 0 with 300 rules applied. Total rules applied 600 place count 620 transition count 757
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 717 place count 503 transition count 640
Iterating global reduction 0 with 117 rules applied. Total rules applied 834 place count 503 transition count 640
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 891 place count 446 transition count 583
Iterating global reduction 0 with 57 rules applied. Total rules applied 948 place count 446 transition count 583
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 964 place count 446 transition count 567
Applied a total of 964 rules in 367 ms. Remains 446 /920 variables (removed 474) and now considering 567/1057 (removed 490) transitions.
// Phase 1: matrix 567 rows 446 cols
[2025-06-03 04:15:23] [INFO ] Computed 10 invariants in 60 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:15:24] [INFO ] Implicit Places using invariants in 986 ms returned []
[2025-06-03 04:15:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:15:25] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2025-06-03 04:15:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (OVERLAPS) 1/446 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:44] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:45] [INFO ] Deduced a trap composed of 47 places in 359 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:45] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:47] [INFO ] Deduced a trap composed of 107 places in 273 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:51] [INFO ] Deduced a trap composed of 108 places in 276 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:56] [INFO ] Deduced a trap composed of 101 places in 503 ms of which 52 ms to minimize.
SMT process timed out in 31063ms, After SMT, problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 31100ms
Starting structural reductions in LTL mode, iteration 1 : 446/920 places, 567/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33631 ms. Remains : 446/920 places, 567/1057 transitions.
Support contains 96 out of 446 places after structural reductions.
[2025-06-03 04:15:57] [INFO ] Flatten gal took : 141 ms
[2025-06-03 04:15:57] [INFO ] Flatten gal took : 69 ms
[2025-06-03 04:15:57] [INFO ] Input system was already deterministic with 567 transitions.
Support contains 93 out of 446 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (630 resets) in 2127 ms. (18 steps per ms) remains 33/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
[2025-06-03 04:15:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 379/440 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 6/446 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 567/1013 variables, 446/456 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1013 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/1013 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1013/1013 variables, and 456 constraints, problems are : Problem set: 1 solved, 32 unsolved in 2381 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 32 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 382/440 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:01] [INFO ] Deduced a trap composed of 100 places in 338 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:01] [INFO ] Deduced a trap composed of 108 places in 222 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:02] [INFO ] Deduced a trap composed of 205 places in 187 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:02] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:02] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:02] [INFO ] Deduced a trap composed of 110 places in 272 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:03] [INFO ] Deduced a trap composed of 111 places in 357 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:03] [INFO ] Deduced a trap composed of 111 places in 315 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:04] [INFO ] Deduced a trap composed of 114 places in 532 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:04] [INFO ] Deduced a trap composed of 109 places in 539 ms of which 115 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 10/19 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 6/446 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 31 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1013 variables, and 20 constraints, problems are : Problem set: 2 solved, 31 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/33 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7418ms problems are : Problem set: 2 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 348 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 6 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 405 transition count 476
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 364 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 363 transition count 475
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 85 place count 363 transition count 460
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 115 place count 348 transition count 460
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 148 place count 315 transition count 427
Iterating global reduction 3 with 33 rules applied. Total rules applied 181 place count 315 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 185 place count 315 transition count 423
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 189 place count 311 transition count 419
Iterating global reduction 4 with 4 rules applied. Total rules applied 193 place count 311 transition count 419
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 295 place count 260 transition count 368
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 300 place count 260 transition count 363
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 309 place count 251 transition count 354
Iterating global reduction 5 with 9 rules applied. Total rules applied 318 place count 251 transition count 354
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 324 place count 251 transition count 348
Free-agglomeration rule applied 134 times.
Iterating global reduction 6 with 134 rules applied. Total rules applied 458 place count 251 transition count 214
Reduce places removed 134 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 6 with 173 rules applied. Total rules applied 631 place count 117 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 633 place count 117 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 634 place count 117 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 635 place count 117 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 116 transition count 171
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t6.t397.t446.t394.t395.t380 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 114 vertex of which 8 / 114 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 8 with 7 rules applied. Total rules applied 643 place count 110 transition count 165
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 655 place count 106 transition count 157
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 655 place count 106 transition count 150
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 669 place count 99 transition count 150
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 674 place count 99 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 684 place count 94 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 688 place count 94 transition count 136
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 699 place count 94 transition count 125
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 713 place count 83 transition count 122
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 714 place count 83 transition count 122
Applied a total of 714 rules in 433 ms. Remains 83 /446 variables (removed 363) and now considering 122/567 (removed 445) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 83/446 places, 122/567 transitions.
RANDOM walk for 40000 steps (8 resets) in 952 ms. (41 steps per ms) remains 11/31 properties
BEST_FIRST walk for 40002 steps (8 resets) in 287 ms. (138 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 269 ms. (148 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 4/6 properties
[2025-06-03 04:16:07] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 83 cols
[2025-06-03 04:16:07] [INFO ] Computed 9 invariants in 2 ms
[2025-06-03 04:16:07] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 57/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 94/161 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 11/172 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/180 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/185 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/186 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 11/197 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 4/201 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/201 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/201 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 99 constraints, problems are : Problem set: 0 solved, 4 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 57/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:07] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:07] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:07] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 94/161 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 11/172 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/180 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/185 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/186 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 11/197 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/197 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 4/201 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/201 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/201 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/201 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 107 constraints, problems are : Problem set: 0 solved, 4 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 83/83 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 762 steps, including 42 resets, run visited all 4 properties in 7 ms. (steps per millisecond=108 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 15 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-03 04:16:08] [INFO ] Flatten gal took : 55 ms
[2025-06-03 04:16:08] [INFO ] Flatten gal took : 57 ms
[2025-06-03 04:16:08] [INFO ] Input system was already deterministic with 567 transitions.
Support contains 88 out of 446 places (down from 89) after GAL structural reductions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 381 transition count 502
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 381 transition count 502
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 135 place count 381 transition count 497
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 173 place count 343 transition count 459
Iterating global reduction 1 with 38 rules applied. Total rules applied 211 place count 343 transition count 459
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 231 place count 343 transition count 439
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 242 place count 332 transition count 428
Iterating global reduction 2 with 11 rules applied. Total rules applied 253 place count 332 transition count 428
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 260 place count 332 transition count 421
Applied a total of 260 rules in 58 ms. Remains 332 /446 variables (removed 114) and now considering 421/567 (removed 146) transitions.
// Phase 1: matrix 421 rows 332 cols
[2025-06-03 04:16:08] [INFO ] Computed 10 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:16:09] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-03 04:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:16:09] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2025-06-03 04:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:21] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/753 variables, 332/343 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 753/753 variables, and 343 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/332 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 421/753 variables, 332/343 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 420/763 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:55] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 29 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:17:08] [INFO ] Deduced a trap composed of 30 places in 365 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/753 variables, and 765 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 332/446 places, 421/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60981 ms. Remains : 332/446 places, 421/567 transitions.
[2025-06-03 04:17:09] [INFO ] Flatten gal took : 37 ms
[2025-06-03 04:17:09] [INFO ] Flatten gal took : 35 ms
[2025-06-03 04:17:09] [INFO ] Input system was already deterministic with 421 transitions.
[2025-06-03 04:17:09] [INFO ] Flatten gal took : 33 ms
[2025-06-03 04:17:10] [INFO ] Flatten gal took : 30 ms
[2025-06-03 04:17:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality8426495489333381481.gal : 24 ms
[2025-06-03 04:17:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality6849967958015011742.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/CTLCardinality8426495489333381481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6849967958015011742.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 04:17:40] [INFO ] Flatten gal took : 29 ms
[2025-06-03 04:17:40] [INFO ] Applying decomposition
[2025-06-03 04:17:40] [INFO ] Flatten gal took : 27 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/graph15825852010988254550.txt' '-o' '/tmp/graph15825852010988254550.bin' '-w' '/tmp/graph15825852010988254550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15825852010988254550.bin' '-l' '-1' '-v' '-w' '/tmp/graph15825852010988254550.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:17:40] [INFO ] Decomposing Gal with order
[2025-06-03 04:17:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:17:40] [INFO ] Removed a total of 194 redundant transitions.
[2025-06-03 04:17:40] [INFO ] Flatten gal took : 168 ms
[2025-06-03 04:17:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2025-06-03 04:17:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality7576144303381935508.gal : 19 ms
[2025-06-03 04:17:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality9131336714241055725.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/CTLCardinality7576144303381935508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9131336714241055725.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83422e+14,12.7986,249260,6192,1753,397669,41287,860,1.12794e+06,383,345157,0


Converting to forward existential form...Done !
original formula: (EG((u83.p712==0)) * AX(EF((i9.u85.p919==1))))
=> equivalent forward existential formula: ([(Init * !(EG((u83.p712==0))))] = FALSE * [(EY(Init) * !(E(TRUE U (i9.u85.p919==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t90, t91, t121, t135, t152, t153, t183, t184, t214, t228, t245, t246, t277, t339, t341, t...826
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 390 transition count 511
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 390 transition count 511
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 116 place count 390 transition count 507
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 147 place count 359 transition count 476
Iterating global reduction 1 with 31 rules applied. Total rules applied 178 place count 359 transition count 476
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 194 place count 359 transition count 460
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 201 place count 352 transition count 453
Iterating global reduction 2 with 7 rules applied. Total rules applied 208 place count 352 transition count 453
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 212 place count 352 transition count 449
Applied a total of 212 rules in 39 ms. Remains 352 /446 variables (removed 94) and now considering 449/567 (removed 118) transitions.
// Phase 1: matrix 449 rows 352 cols
[2025-06-03 04:18:10] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:18:11] [INFO ] Implicit Places using invariants in 300 ms returned []
[2025-06-03 04:18:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:18:11] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2025-06-03 04:18: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/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/352 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:26] [INFO ] Deduced a trap composed of 258 places in 431 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:26] [INFO ] Deduced a trap composed of 307 places in 312 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:27] [INFO ] Deduced a trap composed of 263 places in 301 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:30] [INFO ] Deduced a trap composed of 257 places in 349 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:31] [INFO ] Deduced a trap composed of 257 places in 356 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:31] [INFO ] Deduced a trap composed of 257 places in 364 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:32] [INFO ] Deduced a trap composed of 261 places in 340 ms of which 74 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:38] [INFO ] Deduced a trap composed of 84 places in 357 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:38] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:39] [INFO ] Deduced a trap composed of 257 places in 339 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:39] [INFO ] Deduced a trap composed of 281 places in 365 ms of which 78 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/801 variables, and 21 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/352 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/352 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:49] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:49] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:51] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:52] [INFO ] Deduced a trap composed of 257 places in 203 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:52] [INFO ] Deduced a trap composed of 86 places in 224 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:52] [INFO ] Deduced a trap composed of 266 places in 355 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:53] [INFO ] Deduced a trap composed of 258 places in 353 ms of which 78 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (OVERLAPS) 449/801 variables, 352/380 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 448/828 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:05] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:06] [INFO ] Deduced a trap composed of 30 places in 324 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:06] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:06] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:07] [INFO ] Deduced a trap composed of 75 places in 226 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:08] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:09] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:10] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:19:11] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 837 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 352/446 places, 449/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61012 ms. Remains : 352/446 places, 449/567 transitions.
[2025-06-03 04:19:11] [INFO ] Flatten gal took : 30 ms
[2025-06-03 04:19:11] [INFO ] Flatten gal took : 27 ms
[2025-06-03 04:19:12] [INFO ] Input system was already deterministic with 449 transitions.
[2025-06-03 04:19:12] [INFO ] Flatten gal took : 24 ms
[2025-06-03 04:19:12] [INFO ] Flatten gal took : 21 ms
[2025-06-03 04:19:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality1311548373376533172.gal : 4 ms
[2025-06-03 04:19:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14497546854972379043.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1311548373376533172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14497546854972379043.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 04:19:42] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:19:42] [INFO ] Applying decomposition
[2025-06-03 04:19:42] [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/graph10002589397359406083.txt' '-o' '/tmp/graph10002589397359406083.bin' '-w' '/tmp/graph10002589397359406083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10002589397359406083.bin' '-l' '-1' '-v' '-w' '/tmp/graph10002589397359406083.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:19:42] [INFO ] Decomposing Gal with order
[2025-06-03 04:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:19:42] [INFO ] Removed a total of 211 redundant transitions.
[2025-06-03 04:19:42] [INFO ] Flatten gal took : 39 ms
[2025-06-03 04:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 22 ms.
[2025-06-03 04:19:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality18359840185399396559.gal : 9 ms
[2025-06-03 04:19:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality10802762642286796229.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/CTLCardinality18359840185399396559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10802762642286796229.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.7341e+14,23.4188,421684,6807,1590,707307,41793,1176,1.62155e+06,402,284316,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 379 transition count 500
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 379 transition count 500
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 139 place count 379 transition count 495
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 178 place count 340 transition count 456
Iterating global reduction 1 with 39 rules applied. Total rules applied 217 place count 340 transition count 456
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 238 place count 340 transition count 435
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 249 place count 329 transition count 424
Iterating global reduction 2 with 11 rules applied. Total rules applied 260 place count 329 transition count 424
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 267 place count 329 transition count 417
Applied a total of 267 rules in 28 ms. Remains 329 /446 variables (removed 117) and now considering 417/567 (removed 150) transitions.
// Phase 1: matrix 417 rows 329 cols
[2025-06-03 04:20:12] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:20:12] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-03 04:20:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:20:13] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-06-03 04:20:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 339 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 416/755 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:02] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:03] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:04] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:05] [INFO ] Deduced a trap composed of 76 places in 309 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:06] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:07] [INFO ] Deduced a trap composed of 79 places in 238 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:08] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:08] [INFO ] Deduced a trap composed of 78 places in 284 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:09] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:10] [INFO ] Deduced a trap composed of 81 places in 237 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:11] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:11] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:12] [INFO ] Deduced a trap composed of 81 places in 234 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 768 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 329/446 places, 417/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61043 ms. Remains : 329/446 places, 417/567 transitions.
[2025-06-03 04:21:13] [INFO ] Flatten gal took : 19 ms
[2025-06-03 04:21:13] [INFO ] Flatten gal took : 21 ms
[2025-06-03 04:21:13] [INFO ] Input system was already deterministic with 417 transitions.
[2025-06-03 04:21:13] [INFO ] Flatten gal took : 31 ms
[2025-06-03 04:21:13] [INFO ] Flatten gal took : 19 ms
[2025-06-03 04:21:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10615252414870099077.gal : 4 ms
[2025-06-03 04:21:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17853311408690850162.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/CTLCardinality10615252414870099077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17853311408690850162.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.
Detected timeout of ITS tools.
[2025-06-03 04:21:43] [INFO ] Flatten gal took : 10 ms
[2025-06-03 04:21:43] [INFO ] Applying decomposition
[2025-06-03 04:21:43] [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/graph11983734466523336788.txt' '-o' '/tmp/graph11983734466523336788.bin' '-w' '/tmp/graph11983734466523336788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11983734466523336788.bin' '-l' '-1' '-v' '-w' '/tmp/graph11983734466523336788.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:21:43] [INFO ] Decomposing Gal with order
[2025-06-03 04:21:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:21:43] [INFO ] Removed a total of 198 redundant transitions.
[2025-06-03 04:21:43] [INFO ] Flatten gal took : 32 ms
[2025-06-03 04:21:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 04:21:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5160544362848947811.gal : 5 ms
[2025-06-03 04:21:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14040173525351995784.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/CTLCardinality5160544362848947811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14040173525351995784.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.71781e+14,25.3825,327632,3409,1424,346566,31252,967,2.26714e+06,372,518609,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,25.4591,327632,1,0,346566,31252,1281,2.26714e+06,392,518609,990
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 381 transition count 502
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 381 transition count 502
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 135 place count 381 transition count 497
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 173 place count 343 transition count 459
Iterating global reduction 1 with 38 rules applied. Total rules applied 211 place count 343 transition count 459
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 232 place count 343 transition count 438
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 242 place count 333 transition count 428
Iterating global reduction 2 with 10 rules applied. Total rules applied 252 place count 333 transition count 428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 258 place count 333 transition count 422
Applied a total of 258 rules in 26 ms. Remains 333 /446 variables (removed 113) and now considering 422/567 (removed 145) transitions.
// Phase 1: matrix 422 rows 333 cols
[2025-06-03 04:22:09] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:09] [INFO ] Implicit Places using invariants in 259 ms returned []
[2025-06-03 04:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:10] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2025-06-03 04:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/755 variables, and 343 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 421/764 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:22:53] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:22:53] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:22:53] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:22:54] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:22:54] [INFO ] Deduced a trap composed of 77 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-03 04:22:55] [INFO ] Deduced a trap composed of 78 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-03 04:22:56] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:22:57] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 8/772 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/755 variables, and 772 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 333/446 places, 422/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60800 ms. Remains : 333/446 places, 422/567 transitions.
[2025-06-03 04:23:10] [INFO ] Flatten gal took : 16 ms
[2025-06-03 04:23:10] [INFO ] Flatten gal took : 18 ms
[2025-06-03 04:23:10] [INFO ] Input system was already deterministic with 422 transitions.
[2025-06-03 04:23:10] [INFO ] Flatten gal took : 15 ms
[2025-06-03 04:23:10] [INFO ] Flatten gal took : 15 ms
[2025-06-03 04:23:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality17853994402977928455.gal : 6 ms
[2025-06-03 04:23:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality3097728094252460348.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/CTLCardinality17853994402977928455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3097728094252460348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 04:23:40] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:23:40] [INFO ] Applying decomposition
[2025-06-03 04:23:40] [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/graph8117289961491281409.txt' '-o' '/tmp/graph8117289961491281409.bin' '-w' '/tmp/graph8117289961491281409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8117289961491281409.bin' '-l' '-1' '-v' '-w' '/tmp/graph8117289961491281409.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:23:40] [INFO ] Decomposing Gal with order
[2025-06-03 04:23:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:23:40] [INFO ] Removed a total of 201 redundant transitions.
[2025-06-03 04:23:40] [INFO ] Flatten gal took : 25 ms
[2025-06-03 04:23:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2025-06-03 04:23:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3071618968511434824.gal : 6 ms
[2025-06-03 04:23:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality7772080643200535799.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/CTLCardinality3071618968511434824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7772080643200535799.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.06203e+14,20.4338,421548,10067,1384,864478,15066,987,1.25357e+06,382,70939,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 385 transition count 506
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 385 transition count 506
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 127 place count 385 transition count 501
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 160 place count 352 transition count 468
Iterating global reduction 1 with 33 rules applied. Total rules applied 193 place count 352 transition count 468
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 210 place count 352 transition count 451
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 219 place count 343 transition count 442
Iterating global reduction 2 with 9 rules applied. Total rules applied 228 place count 343 transition count 442
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 234 place count 343 transition count 436
Applied a total of 234 rules in 25 ms. Remains 343 /446 variables (removed 103) and now considering 436/567 (removed 131) transitions.
// Phase 1: matrix 436 rows 343 cols
[2025-06-03 04:24:10] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:10] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-06-03 04:24:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:24:11] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2025-06-03 04:24: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/342 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (OVERLAPS) 1/343 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 435 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:24:26] [INFO ] Deduced a trap composed of 81 places in 320 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:24:29] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 435 unsolved
SMT process timed out in 30124ms, After SMT, problems are : Problem set: 0 solved, 435 unsolved
Search for dead transitions found 0 dead transitions in 30127ms
Starting structural reductions in LTL mode, iteration 1 : 343/446 places, 436/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30993 ms. Remains : 343/446 places, 436/567 transitions.
[2025-06-03 04:24:41] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:24:41] [INFO ] Flatten gal took : 15 ms
[2025-06-03 04:24:41] [INFO ] Input system was already deterministic with 436 transitions.
[2025-06-03 04:24:41] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:24:41] [INFO ] Flatten gal took : 27 ms
[2025-06-03 04:24:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17105624426081176813.gal : 4 ms
[2025-06-03 04:24:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8014582730644747357.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/CTLCardinality17105624426081176813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8014582730644747357.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 04:25:11] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:25:11] [INFO ] Applying decomposition
[2025-06-03 04:25:11] [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/graph15964544607292935287.txt' '-o' '/tmp/graph15964544607292935287.bin' '-w' '/tmp/graph15964544607292935287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15964544607292935287.bin' '-l' '-1' '-v' '-w' '/tmp/graph15964544607292935287.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:25:11] [INFO ] Decomposing Gal with order
[2025-06-03 04:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:25:11] [INFO ] Removed a total of 201 redundant transitions.
[2025-06-03 04:25:11] [INFO ] Flatten gal took : 27 ms
[2025-06-03 04:25:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2025-06-03 04:25:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality1160502372976754361.gal : 5 ms
[2025-06-03 04:25:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality7911266748434103855.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/CTLCardinality1160502372976754361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7911266748434103855.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82983e+14,18.7952,382956,9572,2249,703724,52901,1110,1.34112e+06,394,262470,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 413 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 404 transition count 467
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 347 transition count 467
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 115 place count 347 transition count 438
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 173 place count 318 transition count 438
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 243 place count 248 transition count 368
Iterating global reduction 2 with 70 rules applied. Total rules applied 313 place count 248 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 318 place count 248 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 318 place count 248 transition count 362
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 320 place count 247 transition count 362
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 336 place count 231 transition count 346
Iterating global reduction 3 with 16 rules applied. Total rules applied 352 place count 231 transition count 346
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 367 place count 231 transition count 331
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 409 place count 210 transition count 310
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 419 place count 200 transition count 300
Iterating global reduction 4 with 10 rules applied. Total rules applied 429 place count 200 transition count 300
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 439 place count 200 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 447 place count 200 transition count 282
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 449 place count 198 transition count 280
Applied a total of 449 rules in 123 ms. Remains 198 /446 variables (removed 248) and now considering 280/567 (removed 287) transitions.
[2025-06-03 04:25:41] [INFO ] Flow matrix only has 273 transitions (discarded 7 similar events)
// Phase 1: matrix 273 rows 198 cols
[2025-06-03 04:25:41] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:25:42] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-03 04:25:42] [INFO ] Flow matrix only has 273 transitions (discarded 7 similar events)
[2025-06-03 04:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:25:42] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:25:42] [INFO ] Redundant transitions in 21 ms returned []
Running 163 sub problems to find dead transitions.
[2025-06-03 04:25:42] [INFO ] Flow matrix only has 273 transitions (discarded 7 similar events)
[2025-06-03 04:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:46] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 272/470 variables, 198/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/471 variables, and 209 constraints, problems are : Problem set: 0 solved, 163 unsolved in 18980 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 8/198 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 272/470 variables, 198/209 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 163/372 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/471 variables, and 372 constraints, problems are : Problem set: 0 solved, 163 unsolved in 15410 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34450ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 34451ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/446 places, 280/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35377 ms. Remains : 198/446 places, 280/567 transitions.
[2025-06-03 04:26:17] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:26:17] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:26:17] [INFO ] Input system was already deterministic with 280 transitions.
[2025-06-03 04:26:17] [INFO ] Flatten gal took : 12 ms
[2025-06-03 04:26:17] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:26:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13553972674021440440.gal : 3 ms
[2025-06-03 04:26:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality13466719649877366160.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/CTLCardinality13553972674021440440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13466719649877366160.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21689e+12,2.41164,56484,2,3540,5,290590,6,0,1066,162130,0


Converting to forward existential form...Done !
original formula: AF(E(!(E((p384==1) U ((p11==0)||(p654==1)))) U E((p588==0) U EF((p302==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E((p384==1) U ((p11==0)||(p654==1)))) U E((p588==0) U E(TRUE U (p302==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
Detected timeout of ITS tools.
[2025-06-03 04:26:47] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:26:47] [INFO ] Applying decomposition
[2025-06-03 04:26:47] [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/graph70780113681797875.txt' '-o' '/tmp/graph70780113681797875.bin' '-w' '/tmp/graph70780113681797875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph70780113681797875.bin' '-l' '-1' '-v' '-w' '/tmp/graph70780113681797875.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:26:47] [INFO ] Decomposing Gal with order
[2025-06-03 04:26:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:26:47] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-03 04:26:47] [INFO ] Flatten gal took : 16 ms
[2025-06-03 04:26:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2025-06-03 04:26:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality2547613801722643926.gal : 2 ms
[2025-06-03 04:26:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1774105132706810124.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/CTLCardinality2547613801722643926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1774105132706810124.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21689e+12,0.071353,5788,61,129,1657,1389,508,2334,363,1821,0


Converting to forward existential form...Done !
original formula: AF(E(!(E((i4.u14.p384==1) U ((i0.u2.p11==0)||(i8.u22.p654==1)))) U E((i7.u20.p588==0) U EF((i3.u11.p302==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E((i4.u14.p384==1) U ((i0.u2.p11==0)||(i8.u22.p654==1)))) U E((i7.u20.p588==0) U E(TRUE U (i3.u...180
Reverse transition relation is NOT exact ! Due to transitions i3.u11.t71, i4.u14.t56, Intersection with reachable at each step enabled. (destroyed/reverse...185
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 419 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 404 transition count 465
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 345 transition count 465
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 119 place count 345 transition count 436
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 177 place count 316 transition count 436
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 251 place count 242 transition count 362
Iterating global reduction 2 with 74 rules applied. Total rules applied 325 place count 242 transition count 362
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 330 place count 242 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 242 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 241 transition count 356
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 349 place count 224 transition count 339
Iterating global reduction 3 with 17 rules applied. Total rules applied 366 place count 224 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 383 place count 224 transition count 322
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 427 place count 202 transition count 300
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 437 place count 192 transition count 290
Iterating global reduction 4 with 10 rules applied. Total rules applied 447 place count 192 transition count 290
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 457 place count 192 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 465 place count 192 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 467 place count 190 transition count 270
Applied a total of 467 rules in 76 ms. Remains 190 /446 variables (removed 256) and now considering 270/567 (removed 297) transitions.
[2025-06-03 04:27:17] [INFO ] Flow matrix only has 263 transitions (discarded 7 similar events)
// Phase 1: matrix 263 rows 190 cols
[2025-06-03 04:27:17] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:17] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-03 04:27:17] [INFO ] Flow matrix only has 263 transitions (discarded 7 similar events)
[2025-06-03 04:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:18] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:27:18] [INFO ] Redundant transitions in 15 ms returned []
Running 147 sub problems to find dead transitions.
[2025-06-03 04:27:18] [INFO ] Flow matrix only has 263 transitions (discarded 7 similar events)
[2025-06-03 04:27: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/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:27:21] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 262/452 variables, 190/201 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/453 variables, and 201 constraints, problems are : Problem set: 0 solved, 147 unsolved in 16194 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 262/452 variables, 190/201 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 147/348 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/452 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/453 variables, and 348 constraints, problems are : Problem set: 0 solved, 147 unsolved in 16121 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32348ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 32349ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/446 places, 270/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32888 ms. Remains : 190/446 places, 270/567 transitions.
[2025-06-03 04:27:50] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:27:50] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:27:50] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-03 04:27:50] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:27:50] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:27:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16422776341720688719.gal : 1 ms
[2025-06-03 04:27:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality5862235009031065505.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/CTLCardinality16422776341720688719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5862235009031065505.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.48747e+11,1.81711,44728,2,5522,5,243885,6,0,1025,112963,0


Converting to forward existential form...Done !
original formula: EF(EG((p847==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p847==1))] != FALSE
Hit Full ! (commute/partial/dont) 268/0/2
(forward)formula 0,1,4.50223,83476,1,0,8,448079,19,2,5009,190158,8
FORMULA FlexibleBarrier-PT-08b-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 : 446/446 places, 567/567 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 382 transition count 503
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 382 transition count 503
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 132 place count 382 transition count 499
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 168 place count 346 transition count 463
Iterating global reduction 1 with 36 rules applied. Total rules applied 204 place count 346 transition count 463
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 224 place count 346 transition count 443
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 234 place count 336 transition count 433
Iterating global reduction 2 with 10 rules applied. Total rules applied 244 place count 336 transition count 433
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 250 place count 336 transition count 427
Applied a total of 250 rules in 49 ms. Remains 336 /446 variables (removed 110) and now considering 427/567 (removed 140) transitions.
// Phase 1: matrix 427 rows 336 cols
[2025-06-03 04:27:55] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:55] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-03 04:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:55] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-03 04:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 346 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 426/772 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:46] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:47] [INFO ] Deduced a trap composed of 30 places in 345 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:48] [INFO ] Deduced a trap composed of 32 places in 320 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:48] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:49] [INFO ] Deduced a trap composed of 74 places in 314 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:50] [INFO ] Deduced a trap composed of 77 places in 310 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:51] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:52] [INFO ] Deduced a trap composed of 79 places in 285 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:52] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:53] [INFO ] Deduced a trap composed of 80 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:55] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 783 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 336/446 places, 427/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60965 ms. Remains : 336/446 places, 427/567 transitions.
[2025-06-03 04:28:55] [INFO ] Flatten gal took : 13 ms
[2025-06-03 04:28:55] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:28:55] [INFO ] Input system was already deterministic with 427 transitions.
[2025-06-03 04:28:56] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:28:56] [INFO ] Flatten gal took : 13 ms
[2025-06-03 04:28:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality5586151016726272100.gal : 3 ms
[2025-06-03 04:28:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality4597226397507912722.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/CTLCardinality5586151016726272100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4597226397507912722.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 04:29:26] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:29:26] [INFO ] Applying decomposition
[2025-06-03 04:29:26] [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/graph865629972449230230.txt' '-o' '/tmp/graph865629972449230230.bin' '-w' '/tmp/graph865629972449230230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph865629972449230230.bin' '-l' '-1' '-v' '-w' '/tmp/graph865629972449230230.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:29:26] [INFO ] Decomposing Gal with order
[2025-06-03 04:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:29:26] [INFO ] Removed a total of 208 redundant transitions.
[2025-06-03 04:29:26] [INFO ] Flatten gal took : 42 ms
[2025-06-03 04:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 16 ms.
[2025-06-03 04:29:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4689453151631444594.gal : 5 ms
[2025-06-03 04:29:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2312248265142603552.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/CTLCardinality4689453151631444594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2312248265142603552.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.23464e+14,19.8498,295392,4112,1378,353457,22901,982,1.86525e+06,380,213280,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 418 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 404 transition count 465
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 345 transition count 465
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 119 place count 345 transition count 436
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 177 place count 316 transition count 436
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 250 place count 243 transition count 363
Iterating global reduction 2 with 73 rules applied. Total rules applied 323 place count 243 transition count 363
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 243 transition count 358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 243 transition count 357
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 242 transition count 357
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 345 place count 227 transition count 342
Iterating global reduction 3 with 15 rules applied. Total rules applied 360 place count 227 transition count 342
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 375 place count 227 transition count 327
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 419 place count 205 transition count 305
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 430 place count 194 transition count 294
Iterating global reduction 4 with 11 rules applied. Total rules applied 441 place count 194 transition count 294
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 452 place count 194 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 460 place count 194 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 462 place count 192 transition count 273
Applied a total of 462 rules in 94 ms. Remains 192 /446 variables (removed 254) and now considering 273/567 (removed 294) transitions.
[2025-06-03 04:29:56] [INFO ] Flow matrix only has 266 transitions (discarded 7 similar events)
// Phase 1: matrix 266 rows 192 cols
[2025-06-03 04:29:56] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:56] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-03 04:29:56] [INFO ] Flow matrix only has 266 transitions (discarded 7 similar events)
[2025-06-03 04:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:56] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:29:56] [INFO ] Redundant transitions in 6 ms returned []
Running 149 sub problems to find dead transitions.
[2025-06-03 04:29:56] [INFO ] Flow matrix only has 266 transitions (discarded 7 similar events)
[2025-06-03 04:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 8/192 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 265/457 variables, 192/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/458 variables, and 202 constraints, problems are : Problem set: 0 solved, 149 unsolved in 14068 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 8/192 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 265/457 variables, 192/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 149/351 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/458 variables, and 351 constraints, problems are : Problem set: 0 solved, 149 unsolved in 14309 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28409ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 28410ms
Starting structural reductions in SI_CTL mode, iteration 1 : 192/446 places, 273/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29041 ms. Remains : 192/446 places, 273/567 transitions.
[2025-06-03 04:30:25] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:30:25] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:30:25] [INFO ] Input system was already deterministic with 273 transitions.
[2025-06-03 04:30:25] [INFO ] Flatten gal took : 16 ms
[2025-06-03 04:30:25] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:30:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10068386650033864139.gal : 2 ms
[2025-06-03 04:30:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4397561161581471966.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/CTLCardinality10068386650033864139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4397561161581471966.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.74064e+11,1.59951,39640,2,4614,5,223236,6,0,1036,103202,0


Converting to forward existential form...Done !
original formula: AG(!(A(AG((p382==1)) U (p455==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((p455==1))))) * !(E(!((p455==1)) U (!(!(E(TRUE U !((p382==1))))) * !((p455==1))))))]...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 271/0/2
Hit Full ! (commute/partial/dont) 271/0/2
Detected timeout of ITS tools.
[2025-06-03 04:30:55] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:30:55] [INFO ] Applying decomposition
[2025-06-03 04:30:55] [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/graph6525365846257665349.txt' '-o' '/tmp/graph6525365846257665349.bin' '-w' '/tmp/graph6525365846257665349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6525365846257665349.bin' '-l' '-1' '-v' '-w' '/tmp/graph6525365846257665349.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:30:55] [INFO ] Decomposing Gal with order
[2025-06-03 04:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:30:55] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-03 04:30:55] [INFO ] Flatten gal took : 16 ms
[2025-06-03 04:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 3 ms.
[2025-06-03 04:30:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality7817068614474839063.gal : 2 ms
[2025-06-03 04:30:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality3311442568177305128.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/CTLCardinality7817068614474839063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3311442568177305128.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.74064e+11,0.130142,6208,34,100,3248,1075,451,5465,358,1314,0


Converting to forward existential form...Done !
original formula: AG(!(A(AG((i4.u14.p382==1)) U (i5.u15.p455==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((i5.u15.p455==1))))) * !(E(!((i5.u15.p455==1)) U (!(!(E(TRUE U !((i4.u14.p382==1))))...191
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,24.0107,521712,1,0,393982,704944,1789,774074,1362,2.42857e+06,1234040
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 416 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 404 transition count 466
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 346 transition count 466
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 117 place count 346 transition count 438
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 173 place count 318 transition count 438
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 246 place count 245 transition count 365
Iterating global reduction 2 with 73 rules applied. Total rules applied 319 place count 245 transition count 365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 323 place count 245 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 323 place count 245 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 244 transition count 360
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 342 place count 227 transition count 343
Iterating global reduction 3 with 17 rules applied. Total rules applied 359 place count 227 transition count 343
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 375 place count 227 transition count 327
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 417 place count 206 transition count 306
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 428 place count 195 transition count 295
Iterating global reduction 4 with 11 rules applied. Total rules applied 439 place count 195 transition count 295
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 450 place count 195 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 458 place count 195 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 460 place count 193 transition count 274
Applied a total of 460 rules in 65 ms. Remains 193 /446 variables (removed 253) and now considering 274/567 (removed 293) transitions.
[2025-06-03 04:31:19] [INFO ] Flow matrix only has 267 transitions (discarded 7 similar events)
// Phase 1: matrix 267 rows 193 cols
[2025-06-03 04:31:19] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:31:19] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-03 04:31:19] [INFO ] Flow matrix only has 267 transitions (discarded 7 similar events)
[2025-06-03 04:31:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:31:20] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:31:20] [INFO ] Redundant transitions in 2 ms returned []
Running 150 sub problems to find dead transitions.
[2025-06-03 04:31:20] [INFO ] Flow matrix only has 267 transitions (discarded 7 similar events)
[2025-06-03 04:31: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/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 8/193 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 266/459 variables, 193/203 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/459 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/460 variables, and 203 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12753 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (OVERLAPS) 8/193 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 266/459 variables, 193/203 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 150/353 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/460 variables, and 353 constraints, problems are : Problem set: 0 solved, 150 unsolved in 15036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27809ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27812ms
Starting structural reductions in SI_CTL mode, iteration 1 : 193/446 places, 274/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28368 ms. Remains : 193/446 places, 274/567 transitions.
[2025-06-03 04:31:48] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:31:48] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:31:48] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-03 04:31:48] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:31:48] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:31:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2455093787929936988.gal : 2 ms
[2025-06-03 04:31:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13176891475293792227.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/CTLCardinality2455093787929936988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13176891475293792227.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,9.25479e+11,2.48711,52384,2,4662,5,283615,6,0,1041,128884,0


Converting to forward existential form...Done !
original formula: EG((((p526==0)||(p39==1))||(p494==1)))
=> equivalent forward existential formula: [FwdG(Init,(((p526==0)||(p39==1))||(p494==1)))] != FALSE
Hit Full ! (commute/partial/dont) 268/0/6
(forward)formula 0,1,7.00011,116628,1,0,8,652469,19,4,5076,369339,8
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 386 transition count 507
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 386 transition count 507
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 124 place count 386 transition count 503
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 159 place count 351 transition count 468
Iterating global reduction 1 with 35 rules applied. Total rules applied 194 place count 351 transition count 468
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 213 place count 351 transition count 449
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 222 place count 342 transition count 440
Iterating global reduction 2 with 9 rules applied. Total rules applied 231 place count 342 transition count 440
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 236 place count 342 transition count 435
Applied a total of 236 rules in 29 ms. Remains 342 /446 variables (removed 104) and now considering 435/567 (removed 132) transitions.
// Phase 1: matrix 435 rows 342 cols
[2025-06-03 04:31:55] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:31:55] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-03 04:31:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:31:56] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-06-03 04:31:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (OVERLAPS) 435/777 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 352 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/342 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (OVERLAPS) 435/777 variables, 342/352 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/777 variables, 434/786 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:48] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:48] [INFO ] Deduced a trap composed of 80 places in 255 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:49] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:49] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:50] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:51] [INFO ] Deduced a trap composed of 78 places in 291 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:52] [INFO ] Deduced a trap composed of 78 places in 279 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:53] [INFO ] Deduced a trap composed of 83 places in 260 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:54] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:56] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 796 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 342/446 places, 435/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61183 ms. Remains : 342/446 places, 435/567 transitions.
[2025-06-03 04:32:56] [INFO ] Flatten gal took : 12 ms
[2025-06-03 04:32:56] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:32:56] [INFO ] Input system was already deterministic with 435 transitions.
[2025-06-03 04:32:56] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:32:56] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:32:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9565563866267881686.gal : 2 ms
[2025-06-03 04:32:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality15249641358131862861.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/CTLCardinality9565563866267881686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15249641358131862861.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 04:33:26] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:33:26] [INFO ] Applying decomposition
[2025-06-03 04:33:26] [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/graph14497228135799045286.txt' '-o' '/tmp/graph14497228135799045286.bin' '-w' '/tmp/graph14497228135799045286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14497228135799045286.bin' '-l' '-1' '-v' '-w' '/tmp/graph14497228135799045286.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:33:26] [INFO ] Decomposing Gal with order
[2025-06-03 04:33:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:33:26] [INFO ] Removed a total of 215 redundant transitions.
[2025-06-03 04:33:26] [INFO ] Flatten gal took : 35 ms
[2025-06-03 04:33:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2025-06-03 04:33:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3619159489268081293.gal : 6 ms
[2025-06-03 04:33:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15906636459879175777.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/CTLCardinality3619159489268081293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15906636459879175777.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82995e+14,18.3793,358560,9577,1378,641309,16258,1015,1.5892e+06,380,79041,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 416 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 404 transition count 466
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 346 transition count 466
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 117 place count 346 transition count 439
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 171 place count 319 transition count 439
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 244 place count 246 transition count 366
Iterating global reduction 2 with 73 rules applied. Total rules applied 317 place count 246 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 322 place count 246 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 246 transition count 360
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 324 place count 245 transition count 360
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 340 place count 229 transition count 344
Iterating global reduction 3 with 16 rules applied. Total rules applied 356 place count 229 transition count 344
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 371 place count 229 transition count 329
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 415 place count 207 transition count 307
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 426 place count 196 transition count 296
Iterating global reduction 4 with 11 rules applied. Total rules applied 437 place count 196 transition count 296
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 448 place count 196 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 456 place count 196 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 458 place count 194 transition count 275
Applied a total of 458 rules in 68 ms. Remains 194 /446 variables (removed 252) and now considering 275/567 (removed 292) transitions.
[2025-06-03 04:33:56] [INFO ] Flow matrix only has 268 transitions (discarded 7 similar events)
// Phase 1: matrix 268 rows 194 cols
[2025-06-03 04:33:56] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:33:56] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-03 04:33:56] [INFO ] Flow matrix only has 268 transitions (discarded 7 similar events)
[2025-06-03 04:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:33:57] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:33:57] [INFO ] Redundant transitions in 1 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-03 04:33:57] [INFO ] Flow matrix only has 268 transitions (discarded 7 similar events)
[2025-06-03 04:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 8/194 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 267/461 variables, 194/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/461 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/462 variables, and 204 constraints, problems are : Problem set: 0 solved, 151 unsolved in 15578 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 8/194 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 267/461 variables, 194/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 151/355 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/461 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/462 variables, and 355 constraints, problems are : Problem set: 0 solved, 151 unsolved in 15070 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30681ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 30683ms
Starting structural reductions in SI_CTL mode, iteration 1 : 194/446 places, 275/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31318 ms. Remains : 194/446 places, 275/567 transitions.
[2025-06-03 04:34:27] [INFO ] Flatten gal took : 13 ms
[2025-06-03 04:34:27] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:34:28] [INFO ] Input system was already deterministic with 275 transitions.
[2025-06-03 04:34:28] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:34:28] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:34:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2355645397655296375.gal : 2 ms
[2025-06-03 04:34:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality6497707334259088521.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/CTLCardinality2355645397655296375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6497707334259088521.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,9.74189e+11,1.59475,37204,2,4142,5,207968,6,0,1046,93793,0


Converting to forward existential form...Done !
original formula: AF((AF(EG((p506==0))) * ((p232==0)||(p537==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(EG((p506==0))))) * ((p232==0)||(p537==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 273/0/2
Detected timeout of ITS tools.
[2025-06-03 04:34:58] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:34:58] [INFO ] Applying decomposition
[2025-06-03 04:34:58] [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/graph4960557741329773972.txt' '-o' '/tmp/graph4960557741329773972.bin' '-w' '/tmp/graph4960557741329773972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4960557741329773972.bin' '-l' '-1' '-v' '-w' '/tmp/graph4960557741329773972.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:34:58] [INFO ] Decomposing Gal with order
[2025-06-03 04:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:34:58] [INFO ] Removed a total of 98 redundant transitions.
[2025-06-03 04:34:58] [INFO ] Flatten gal took : 22 ms
[2025-06-03 04:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2025-06-03 04:34:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5650743012362137803.gal : 3 ms
[2025-06-03 04:34:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality11915722201971549239.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/CTLCardinality5650743012362137803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11915722201971549239.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.74189e+11,0.069432,5864,55,100,1586,1020,494,2100,359,1038,0


Converting to forward existential form...Done !
original formula: AF((AF(EG((i6.u18.p506==0))) * ((i2.u6.p232==0)||(i7.u21.p537==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!(EG((i6.u18.p506==0))))) * ((i2.u6.p232==0)||(i7.u21.p537==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,12.7134,307148,1,0,344581,260514,2016,660544,1421,850073,836573
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 399 edges and 446 vertex of which 43 / 446 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 409 transition count 475
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 355 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 354 transition count 474
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 111 place count 354 transition count 447
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 165 place count 327 transition count 447
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 231 place count 261 transition count 381
Iterating global reduction 3 with 66 rules applied. Total rules applied 297 place count 261 transition count 381
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 302 place count 261 transition count 376
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 318 place count 245 transition count 360
Iterating global reduction 4 with 16 rules applied. Total rules applied 334 place count 245 transition count 360
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 349 place count 245 transition count 345
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 405 place count 217 transition count 317
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 413 place count 209 transition count 309
Iterating global reduction 5 with 8 rules applied. Total rules applied 421 place count 209 transition count 309
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 429 place count 209 transition count 301
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 430 place count 209 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 432 place count 207 transition count 299
Applied a total of 432 rules in 48 ms. Remains 207 /446 variables (removed 239) and now considering 299/567 (removed 268) transitions.
[2025-06-03 04:35:11] [INFO ] Flow matrix only has 286 transitions (discarded 13 similar events)
// Phase 1: matrix 286 rows 207 cols
[2025-06-03 04:35:11] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:35:11] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-03 04:35:11] [INFO ] Flow matrix only has 286 transitions (discarded 13 similar events)
[2025-06-03 04:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:35:11] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:35:11] [INFO ] Redundant transitions in 12 ms returned []
Running 174 sub problems to find dead transitions.
[2025-06-03 04:35:11] [INFO ] Flow matrix only has 286 transitions (discarded 13 similar events)
[2025-06-03 04:35: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/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 8/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:15] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:15] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:16] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 285/492 variables, 207/220 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/493 variables, and 220 constraints, problems are : Problem set: 0 solved, 174 unsolved in 20722 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 8/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 285/492 variables, 207/220 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 174/394 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/493 variables, and 394 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15771 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36542ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 36543ms
Starting structural reductions in SI_CTL mode, iteration 1 : 207/446 places, 299/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37140 ms. Remains : 207/446 places, 299/567 transitions.
[2025-06-03 04:35:48] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:35:48] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:35:48] [INFO ] Input system was already deterministic with 299 transitions.
[2025-06-03 04:35:48] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:35:48] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:35:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17070714878276745882.gal : 1 ms
[2025-06-03 04:35:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality640567629579207077.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/CTLCardinality17070714878276745882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality640567629579207077.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.59851e+12,4.69136,110164,2,14657,5,594775,6,0,1123,328153,0


Converting to forward existential form...Done !
original formula: (AF((p363==1)) + (AG((AF(((p873==0)&&(p902==1))) + (p509==1))) * E(!((!(A((p439==1) U ((p483==0)||(p566==1)))) * ((p895==0)||(p548==1))))...187
=> equivalent forward existential formula: ([FwdG((FwdU((Init * !(!(EG(!((p363==1)))))),TRUE) * !((p509==1))),!(((p873==0)&&(p902==1))))] = FALSE * [((Init...379
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t55, t71, t79, t87, t103, t118, t132, t148, t162, t193, t196, t199, t202, t203, t206,...292
Detected timeout of ITS tools.
[2025-06-03 04:36:18] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:36:18] [INFO ] Applying decomposition
[2025-06-03 04:36:18] [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/graph15380542220099759735.txt' '-o' '/tmp/graph15380542220099759735.bin' '-w' '/tmp/graph15380542220099759735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15380542220099759735.bin' '-l' '-1' '-v' '-w' '/tmp/graph15380542220099759735.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:36:18] [INFO ] Decomposing Gal with order
[2025-06-03 04:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:36:18] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-03 04:36:18] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 4 ms.
[2025-06-03 04:36:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8256646079222827353.gal : 3 ms
[2025-06-03 04:36:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9685429963443634051.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/CTLCardinality8256646079222827353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9685429963443634051.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59851e+12,0.101123,6116,132,142,2329,2124,671,3743,397,2420,0


Converting to forward existential form...Done !
original formula: (AF((i4.u15.p363==1)) + (AG((AF(((i9.u26.p873==0)&&(i9.u27.p902==1))) + (i5.u18.p509==1))) * E(!((!(A((i5.u18.p439==1) U ((i5.u16.p483==0...270
=> equivalent forward existential formula: ([FwdG((FwdU((Init * !(!(EG(!((i4.u15.p363==1)))))),TRUE) * !((i5.u18.p509==1))),!(((i9.u26.p873==0)&&(i9.u27.p9...503
Reverse transition relation is NOT exact ! Due to transitions t193, t196, t199, t202, t207, t212, t216, t219, i0.u1.t162, i1.u4.t148, i2.u7.t132, i3.u9.t11...391
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 418 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 404 transition count 466
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 346 transition count 466
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 117 place count 346 transition count 436
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 177 place count 316 transition count 436
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 251 place count 242 transition count 362
Iterating global reduction 2 with 74 rules applied. Total rules applied 325 place count 242 transition count 362
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 330 place count 242 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 330 place count 242 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 241 transition count 356
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 349 place count 224 transition count 339
Iterating global reduction 3 with 17 rules applied. Total rules applied 366 place count 224 transition count 339
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 383 place count 224 transition count 322
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 425 place count 203 transition count 301
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 436 place count 192 transition count 290
Iterating global reduction 4 with 11 rules applied. Total rules applied 447 place count 192 transition count 290
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 458 place count 192 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 466 place count 192 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 468 place count 190 transition count 269
Applied a total of 468 rules in 41 ms. Remains 190 /446 variables (removed 256) and now considering 269/567 (removed 298) transitions.
[2025-06-03 04:36:48] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
// Phase 1: matrix 262 rows 190 cols
[2025-06-03 04:36:48] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:36:48] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-03 04:36:48] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
[2025-06-03 04:36:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:36:48] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:36:48] [INFO ] Redundant transitions in 3 ms returned []
Running 147 sub problems to find dead transitions.
[2025-06-03 04:36:48] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
[2025-06-03 04:36:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 261/451 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/451 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/452 variables, and 200 constraints, problems are : Problem set: 0 solved, 147 unsolved in 15138 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 261/451 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 147/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/452 variables, and 347 constraints, problems are : Problem set: 0 solved, 147 unsolved in 13612 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28770ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 28771ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/446 places, 269/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29304 ms. Remains : 190/446 places, 269/567 transitions.
[2025-06-03 04:37:17] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:37:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:37:17] [INFO ] Input system was already deterministic with 269 transitions.
[2025-06-03 04:37:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:37:17] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:37:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1936227062476899987.gal : 1 ms
[2025-06-03 04:37:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15950824088237560591.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/CTLCardinality1936227062476899987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15950824088237560591.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.79643e+11,1.15555,35396,2,3944,5,199461,6,0,1024,90474,0


Converting to forward existential form...Done !
original formula: EF(AG((p236==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p236==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-03 04:37:47] [INFO ] Flatten gal took : 5 ms
[2025-06-03 04:37:47] [INFO ] Applying decomposition
[2025-06-03 04:37:47] [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/graph2941281991772656812.txt' '-o' '/tmp/graph2941281991772656812.bin' '-w' '/tmp/graph2941281991772656812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2941281991772656812.bin' '-l' '-1' '-v' '-w' '/tmp/graph2941281991772656812.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:37:47] [INFO ] Decomposing Gal with order
[2025-06-03 04:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:37:47] [INFO ] Removed a total of 94 redundant transitions.
[2025-06-03 04:37:47] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 2 ms.
[2025-06-03 04:37:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality7754127678810276396.gal : 2 ms
[2025-06-03 04:37:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality9829043738761269307.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/CTLCardinality7754127678810276396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9829043738761269307.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.79643e+11,0.057413,5808,46,100,1208,923,441,1428,338,814,0


Converting to forward existential form...Done !
original formula: EF(AG((i2.u7.p236==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i2.u7.p236==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,9.43849,218124,1,0,280365,136877,1621,771796,1269,408968,474278
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Graph (trivial) has 414 edges and 446 vertex of which 49 / 446 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 404 transition count 467
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 347 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 346 transition count 466
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 117 place count 346 transition count 437
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 175 place count 317 transition count 437
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 246 place count 246 transition count 366
Iterating global reduction 3 with 71 rules applied. Total rules applied 317 place count 246 transition count 366
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 322 place count 246 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 322 place count 246 transition count 360
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 324 place count 245 transition count 360
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 341 place count 228 transition count 343
Iterating global reduction 4 with 17 rules applied. Total rules applied 358 place count 228 transition count 343
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 375 place count 228 transition count 326
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 417 place count 207 transition count 305
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 426 place count 198 transition count 296
Iterating global reduction 5 with 9 rules applied. Total rules applied 435 place count 198 transition count 296
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 444 place count 198 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 451 place count 198 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 453 place count 196 transition count 278
Applied a total of 453 rules in 50 ms. Remains 196 /446 variables (removed 250) and now considering 278/567 (removed 289) transitions.
[2025-06-03 04:37:57] [INFO ] Flow matrix only has 271 transitions (discarded 7 similar events)
// Phase 1: matrix 271 rows 196 cols
[2025-06-03 04:37:57] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:37:57] [INFO ] Implicit Places using invariants in 267 ms returned []
[2025-06-03 04:37:57] [INFO ] Flow matrix only has 271 transitions (discarded 7 similar events)
[2025-06-03 04:37:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:37:58] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:37:58] [INFO ] Redundant transitions in 3 ms returned []
Running 162 sub problems to find dead transitions.
[2025-06-03 04:37:58] [INFO ] Flow matrix only has 271 transitions (discarded 7 similar events)
[2025-06-03 04:37:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 8/196 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 270/466 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/467 variables, and 206 constraints, problems are : Problem set: 0 solved, 162 unsolved in 15106 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 8/196 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 270/466 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 162/368 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/467 variables, and 368 constraints, problems are : Problem set: 0 solved, 162 unsolved in 15634 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30764ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 30764ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/446 places, 278/567 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31540 ms. Remains : 196/446 places, 278/567 transitions.
[2025-06-03 04:38:28] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:38:28] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:38:28] [INFO ] Input system was already deterministic with 278 transitions.
[2025-06-03 04:38:28] [INFO ] Flatten gal took : 10 ms
[2025-06-03 04:38:28] [INFO ] Flatten gal took : 9 ms
[2025-06-03 04:38:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16072302070479632696.gal : 2 ms
[2025-06-03 04:38:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9084106509067251765.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/CTLCardinality16072302070479632696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9084106509067251765.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07973e+12,3.0834,73932,2,6346,5,421779,6,0,1056,191715,0


Converting to forward existential form...Done !
original formula: AF(E(((p193!=0) * EF(((p166==0)||(p511==1)))) U AF(((p153==1)&&(p458==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((p193!=0) * E(TRUE U ((p166==0)||(p511==1)))) U !(EG(!(((p153==1)&&(p458==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 274/0/4
Detected timeout of ITS tools.
[2025-06-03 04:38:58] [INFO ] Flatten gal took : 6 ms
[2025-06-03 04:38:58] [INFO ] Applying decomposition
[2025-06-03 04:38:58] [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/graph15727974053447217417.txt' '-o' '/tmp/graph15727974053447217417.bin' '-w' '/tmp/graph15727974053447217417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15727974053447217417.bin' '-l' '-1' '-v' '-w' '/tmp/graph15727974053447217417.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:38:58] [INFO ] Decomposing Gal with order
[2025-06-03 04:38:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:38:58] [INFO ] Removed a total of 99 redundant transitions.
[2025-06-03 04:38:58] [INFO ] Flatten gal took : 14 ms
[2025-06-03 04:38:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 2 ms.
[2025-06-03 04:38:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality15099900689868820964.gal : 2 ms
[2025-06-03 04:38:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality6841298390080258158.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/CTLCardinality15099900689868820964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6841298390080258158.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07973e+12,0.066147,5864,53,100,1689,1159,510,2264,363,1406,0


Converting to forward existential form...Done !
original formula: AF(E(((i2.u8.p193!=0) * EF(((i1.u5.p166==0)||(i6.u18.p511==1)))) U AF(((i1.u5.p153==1)&&(i6.u17.p458==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((i2.u8.p193!=0) * E(TRUE U ((i1.u5.p166==0)||(i6.u18.p511==1)))) U !(EG(!(((i1.u5.p153==1)&&(i6....183
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 567/567 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 388 transition count 509
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 388 transition count 509
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 121 place count 388 transition count 504
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 153 place count 356 transition count 472
Iterating global reduction 1 with 32 rules applied. Total rules applied 185 place count 356 transition count 472
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 201 place count 356 transition count 456
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 211 place count 346 transition count 446
Iterating global reduction 2 with 10 rules applied. Total rules applied 221 place count 346 transition count 446
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 227 place count 346 transition count 440
Applied a total of 227 rules in 24 ms. Remains 346 /446 variables (removed 100) and now considering 440/567 (removed 127) transitions.
// Phase 1: matrix 440 rows 346 cols
[2025-06-03 04:39:29] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:39:29] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-03 04:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:39:29] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2025-06-03 04:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 440/786 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 786/786 variables, and 356 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 440/786 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/786 variables, 439/795 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:21] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:21] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:22] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:23] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:24] [INFO ] Deduced a trap composed of 209 places in 315 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:25] [INFO ] Deduced a trap composed of 81 places in 291 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:26] [INFO ] Deduced a trap composed of 80 places in 281 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:27] [INFO ] Deduced a trap composed of 79 places in 211 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:28] [INFO ] Deduced a trap composed of 81 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:30] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 29 ms to minimize.
SMT process timed out in 60235ms, After SMT, problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 346/446 places, 440/567 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61092 ms. Remains : 346/446 places, 440/567 transitions.
[2025-06-03 04:40:30] [INFO ] Flatten gal took : 15 ms
[2025-06-03 04:40:30] [INFO ] Flatten gal took : 13 ms
[2025-06-03 04:40:30] [INFO ] Input system was already deterministic with 440 transitions.
[2025-06-03 04:40:30] [INFO ] Flatten gal took : 13 ms
[2025-06-03 04:40:30] [INFO ] Flatten gal took : 13 ms
[2025-06-03 04:40:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality14057979851224708513.gal : 3 ms
[2025-06-03 04:40:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15522166665210047456.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/CTLCardinality14057979851224708513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15522166665210047456.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.
Detected timeout of ITS tools.
[2025-06-03 04:41:00] [INFO ] Flatten gal took : 8 ms
[2025-06-03 04:41:00] [INFO ] Applying decomposition
[2025-06-03 04:41:00] [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/graph4942643600901365262.txt' '-o' '/tmp/graph4942643600901365262.bin' '-w' '/tmp/graph4942643600901365262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4942643600901365262.bin' '-l' '-1' '-v' '-w' '/tmp/graph4942643600901365262.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:41:00] [INFO ] Decomposing Gal with order
[2025-06-03 04:41:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:41:00] [INFO ] Removed a total of 215 redundant transitions.
[2025-06-03 04:41:00] [INFO ] Flatten gal took : 27 ms
[2025-06-03 04:41:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-06-03 04:41:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality10081937447750297516.gal : 4 ms
[2025-06-03 04:41:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality16972890558478991919.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/CTLCardinality10081937447750297516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16972890558478991919.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23748e+14,18.8673,312732,5665,1299,448619,21490,1054,1.51634e+06,385,190682,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-03 04:41:30] [INFO ] Flatten gal took : 10 ms
[2025-06-03 04:41:30] [INFO ] Flatten gal took : 10 ms
[2025-06-03 04:41:30] [INFO ] Applying decomposition
[2025-06-03 04:41:30] [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/graph1182844906440880419.txt' '-o' '/tmp/graph1182844906440880419.bin' '-w' '/tmp/graph1182844906440880419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1182844906440880419.bin' '-l' '-1' '-v' '-w' '/tmp/graph1182844906440880419.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:41:30] [INFO ] Decomposing Gal with order
[2025-06-03 04:41:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:41:30] [INFO ] Removed a total of 228 redundant transitions.
[2025-06-03 04:41:30] [INFO ] Flatten gal took : 25 ms
[2025-06-03 04:41:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 5 ms.
[2025-06-03 04:41:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12553213519445500386.gal : 5 ms
[2025-06-03 04:41:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality711761457540940920.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/CTLCardinality12553213519445500386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality711761457540940920.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.38491e+15,391.579,5484848,89394,1686,8.38573e+06,88231,1284,2.03817e+07,428,340556,0


Converting to forward existential form...Done !
original formula: (EG((i11.u103.p712==0)) * AX(EF((i4.i1.i0.u110.p919==1))))
=> equivalent forward existential formula: ([(Init * !(EG((i11.u103.p712==0))))] = FALSE * [(EY(Init) * !(E(TRUE U (i4.i1.i0.u110.p919==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t9, t66, t122, t123, t211, t212, t255, t269, t336, t354, t380, t450, t456, t557, t559, t563, ...1576
Detected timeout of ITS tools.
[2025-06-03 05:10:15] [INFO ] Applying decomposition
[2025-06-03 05:10:16] [INFO ] Flatten gal took : 383 ms
[2025-06-03 05:10:16] [INFO ] Decomposing Gal with order
[2025-06-03 05:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:10:17] [INFO ] Removed a total of 132 redundant transitions.
[2025-06-03 05:10:17] [INFO ] Flatten gal took : 918 ms
[2025-06-03 05:10:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 409 labels/synchronizations in 845 ms.
[2025-06-03 05:10:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10288846462001355958.gal : 91 ms
[2025-06-03 05:10:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality10872216618470299275.ctl : 25 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/CTLCardinality10288846462001355958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10872216618470299275.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 10 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="FlexibleBarrier-PT-08b"
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 FlexibleBarrier-PT-08b, 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 r086-smll-174860102500441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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