Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028600521.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 CO4-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028600521
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 332K 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 CO4-PT-19-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-19-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748610128038

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 13:02:09] [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-05-30 13:02:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:02:09] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-05-30 13:02:09] [INFO ] Transformed 1174 places.
[2025-05-30 13:02:09] [INFO ] Transformed 1447 transitions.
[2025-05-30 13:02:09] [INFO ] Found NUPN structural information;
[2025-05-30 13:02:09] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-CTLCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 191 place count 790 transition count 1005
Iterating global reduction 1 with 158 rules applied. Total rules applied 349 place count 790 transition count 1005
Discarding 123 places :
Symmetric choice reduction at 1 with 123 rule applications. Total rules 472 place count 667 transition count 880
Iterating global reduction 1 with 123 rules applied. Total rules applied 595 place count 667 transition count 880
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 601 place count 667 transition count 874
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 653 place count 615 transition count 817
Iterating global reduction 2 with 52 rules applied. Total rules applied 705 place count 615 transition count 817
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 706 place count 615 transition count 816
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 738 place count 583 transition count 784
Iterating global reduction 3 with 32 rules applied. Total rules applied 770 place count 583 transition count 784
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 773 place count 583 transition count 781
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 784 place count 572 transition count 770
Iterating global reduction 4 with 11 rules applied. Total rules applied 795 place count 572 transition count 770
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 800 place count 567 transition count 765
Iterating global reduction 4 with 5 rules applied. Total rules applied 805 place count 567 transition count 765
Applied a total of 805 rules in 251 ms. Remains 567 /973 variables (removed 406) and now considering 765/1173 (removed 408) transitions.
// Phase 1: matrix 765 rows 567 cols
[2025-05-30 13:02:09] [INFO ] Computed 7 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:02:10] [INFO ] Implicit Places using invariants in 345 ms returned [6, 492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 377 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 565/973 places, 765/1173 transitions.
Applied a total of 0 rules in 14 ms. Remains 565 /565 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 654 ms. Remains : 565/973 places, 765/1173 transitions.
Support contains 60 out of 565 places after structural reductions.
[2025-05-30 13:02:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-30 13:02:10] [INFO ] Flatten gal took : 68 ms
FORMULA CO4-PT-19-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 13:02:10] [INFO ] Flatten gal took : 47 ms
[2025-05-30 13:02:10] [INFO ] Input system was already deterministic with 765 transitions.
Support contains 57 out of 565 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (787 resets) in 1550 ms. (25 steps per ms) remains 24/38 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
// Phase 1: matrix 765 rows 565 cols
[2025-05-30 13:02:11] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 24/79 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 201/280 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 411/691 variables, 145/229 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/691 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 381/1072 variables, 189/418 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1072 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 183/1255 variables, 105/523 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1255 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 52/1307 variables, 31/554 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1307 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 22/1329 variables, 15/569 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1329 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 1/1330 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1330 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/1330 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1330/1330 variables, and 570 constraints, problems are : Problem set: 0 solved, 24 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 565/565 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 15/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 24/79 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 201/280 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 411/691 variables, 145/230 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 23/253 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 381/1072 variables, 189/442 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1072 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 183/1255 variables, 105/547 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1255 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 52/1307 variables, 31/578 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1307 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 22/1329 variables, 15/593 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1330 variables, and 593 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 564/565 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8354ms problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 565 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 565/565 places, 765/765 transitions.
Graph (trivial) has 533 edges and 565 vertex of which 3 / 565 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1071 edges and 563 vertex of which 546 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 245 rules applied. Total rules applied 247 place count 546 transition count 503
Reduce places removed 225 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 235 rules applied. Total rules applied 482 place count 321 transition count 493
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 491 place count 312 transition count 493
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 491 place count 312 transition count 451
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 575 place count 270 transition count 451
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 580 place count 265 transition count 444
Iterating global reduction 3 with 5 rules applied. Total rules applied 585 place count 265 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 587 place count 265 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 587 place count 265 transition count 441
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 589 place count 264 transition count 441
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 591 place count 262 transition count 438
Iterating global reduction 4 with 2 rules applied. Total rules applied 593 place count 262 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 594 place count 262 transition count 437
Performed 75 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 744 place count 187 transition count 347
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 757 place count 187 transition count 334
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 761 place count 183 transition count 327
Iterating global reduction 6 with 4 rules applied. Total rules applied 765 place count 183 transition count 327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 767 place count 182 transition count 326
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 768 place count 181 transition count 324
Iterating global reduction 6 with 1 rules applied. Total rules applied 769 place count 181 transition count 324
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 835 place count 148 transition count 359
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 848 place count 148 transition count 346
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 867 place count 129 transition count 270
Iterating global reduction 7 with 19 rules applied. Total rules applied 886 place count 129 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 896 place count 129 transition count 260
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 897 place count 128 transition count 254
Iterating global reduction 8 with 1 rules applied. Total rules applied 898 place count 128 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 907 place count 128 transition count 245
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 927 place count 128 transition count 225
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 948 place count 108 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 949 place count 108 transition count 223
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 951 place count 108 transition count 221
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 953 place count 106 transition count 221
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 960 place count 106 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 961 place count 105 transition count 220
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 t411.t415.t618.t658 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 26 edges and 101 vertex of which 2 / 101 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 10 with 6 rules applied. Total rules applied 967 place count 100 transition count 215
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 975 place count 97 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 975 place count 97 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 977 place count 96 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 981 place count 94 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 982 place count 94 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 984 place count 93 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 994 place count 93 transition count 195
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 996 place count 91 transition count 191
Iterating global reduction 13 with 2 rules applied. Total rules applied 998 place count 91 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1000 place count 91 transition count 189
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 1003 place count 91 transition count 186
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1006 place count 88 transition count 186
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1007 place count 88 transition count 186
Applied a total of 1007 rules in 202 ms. Remains 88 /565 variables (removed 477) and now considering 186/765 (removed 579) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 88/565 places, 186/765 transitions.
RANDOM walk for 40000 steps (8 resets) in 377 ms. (105 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/2 properties
[2025-05-30 13:02:19] [INFO ] Flow matrix only has 170 transitions (discarded 16 similar events)
// Phase 1: matrix 170 rows 88 cols
[2025-05-30 13:02:19] [INFO ] Computed 5 invariants in 1 ms
[2025-05-30 13:02:19] [INFO ] State equation strengthened by 4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/34 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/125 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/163 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 79/242 variables, 46/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/252 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/253 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/253 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/258 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/258 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/258 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 88/88 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/34 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/125 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/163 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 79/242 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/252 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/252 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/253 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/253 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 258/258 variables, and 98 constraints, problems are : Problem set: 1 solved, 0 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 88/88 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA CO4-PT-19-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 13:02:20] [INFO ] Flatten gal took : 37 ms
[2025-05-30 13:02:20] [INFO ] Flatten gal took : 26 ms
[2025-05-30 13:02:20] [INFO ] Input system was already deterministic with 765 transitions.
Computed a total of 20 stabilizing places and 23 stable transitions
Graph (complete) has 1074 edges and 565 vertex of which 560 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 531 transition count 728
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 531 transition count 728
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 531 transition count 721
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 96 place count 510 transition count 700
Iterating global reduction 1 with 21 rules applied. Total rules applied 117 place count 510 transition count 700
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 510 transition count 698
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 131 place count 498 transition count 686
Iterating global reduction 2 with 12 rules applied. Total rules applied 143 place count 498 transition count 686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 498 transition count 682
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 153 place count 492 transition count 676
Iterating global reduction 3 with 6 rules applied. Total rules applied 159 place count 492 transition count 676
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 163 place count 488 transition count 672
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 488 transition count 672
Applied a total of 167 rules in 47 ms. Remains 488 /565 variables (removed 77) and now considering 672/765 (removed 93) transitions.
// Phase 1: matrix 672 rows 488 cols
[2025-05-30 13:02:20] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:02:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-30 13:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:02:20] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2025-05-30 13:02: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/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:38] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:02:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 671 unsolved
SMT process timed out in 30186ms, After SMT, problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 488/565 places, 672/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30666 ms. Remains : 488/565 places, 672/765 transitions.
[2025-05-30 13:02:51] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:02:51] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:02:51] [INFO ] Input system was already deterministic with 672 transitions.
[2025-05-30 13:02:51] [INFO ] Flatten gal took : 20 ms
[2025-05-30 13:02:51] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:02:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10324599037803726861.gal : 15 ms
[2025-05-30 13:02:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11245058135286712001.ctl : 3 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/CTLCardinality10324599037803726861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11245058135286712001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.49129e+11,11.013,304576,2,24491,5,866928,6,0,2618,1.57821e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:03:21] [INFO ] Flatten gal took : 21 ms
[2025-05-30 13:03:21] [INFO ] Applying decomposition
[2025-05-30 13:03:21] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2444496680263845792.txt' '-o' '/tmp/graph2444496680263845792.bin' '-w' '/tmp/graph2444496680263845792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2444496680263845792.bin' '-l' '-1' '-v' '-w' '/tmp/graph2444496680263845792.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:03:21] [INFO ] Decomposing Gal with order
[2025-05-30 13:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:03:21] [INFO ] Removed a total of 400 redundant transitions.
[2025-05-30 13:03:21] [INFO ] Flatten gal took : 75 ms
[2025-05-30 13:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 11 ms.
[2025-05-30 13:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6776146351327003564.gal : 10 ms
[2025-05-30 13:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9139313602982275337.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/CTLCardinality6776146351327003564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9139313602982275337.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.49129e+11,0.982804,43992,1860,109,64813,1310,1062,258935,87,6773,0


Converting to forward existential form...Done !
original formula: ((EX(((AG(((i4.i0.i1.u35.p302==0)||(i8.u86.p598==1))) * (i10.u89.p614==0)) * (i4.i0.i1.u36.p304==0))) + AG(EX(TRUE))) + EF((i17.u145.p878...161
=> equivalent forward existential formula: [(FwdU(((Init * !(E(TRUE U (i17.u145.p878==1)))) * !(EX(((!(E(TRUE U !(((i4.i0.i1.u35.p302==0)||(i8.u86.p598==1)...239
Reverse transition relation is NOT exact ! Due to transitions t24, t47, t77, t86, t87, t131, t165, t177, t215, t259, t300, t312, t347, t457, t519, t547, t5...1006
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Graph (trivial) has 589 edges and 565 vertex of which 3 / 565 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1072 edges and 563 vertex of which 558 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 250 transitions
Trivial Post-agglo rules discarded 250 transitions
Performed 250 trivial Post agglomeration. Transition count delta: 250
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 557 transition count 506
Reduce places removed 250 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 254 rules applied. Total rules applied 506 place count 307 transition count 502
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 511 place count 306 transition count 498
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 514 place count 303 transition count 498
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 514 place count 303 transition count 455
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 600 place count 260 transition count 455
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 609 place count 251 transition count 443
Iterating global reduction 4 with 9 rules applied. Total rules applied 618 place count 251 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 620 place count 251 transition count 441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 620 place count 251 transition count 440
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 622 place count 250 transition count 440
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 624 place count 248 transition count 437
Iterating global reduction 5 with 2 rules applied. Total rules applied 626 place count 248 transition count 437
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 627 place count 248 transition count 436
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 701 place count 211 transition count 399
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 6 with 17 rules applied. Total rules applied 718 place count 211 transition count 382
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 727 place count 205 transition count 379
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 734 place count 198 transition count 368
Iterating global reduction 8 with 7 rules applied. Total rules applied 741 place count 198 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 743 place count 198 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 744 place count 197 transition count 366
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 746 place count 196 transition count 365
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 747 place count 195 transition count 363
Iterating global reduction 10 with 1 rules applied. Total rules applied 748 place count 195 transition count 363
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 749 place count 194 transition count 361
Iterating global reduction 10 with 1 rules applied. Total rules applied 750 place count 194 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 751 place count 194 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 11 with 25 rules applied. Total rules applied 776 place count 194 transition count 335
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 11 with 15 rules applied. Total rules applied 791 place count 194 transition count 320
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 12 with 15 rules applied. Total rules applied 806 place count 179 transition count 320
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 3 Pre rules applied. Total rules applied 806 place count 179 transition count 317
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 812 place count 176 transition count 317
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 814 place count 175 transition count 316
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 816 place count 175 transition count 316
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 818 place count 173 transition count 314
Applied a total of 818 rules in 111 ms. Remains 173 /565 variables (removed 392) and now considering 314/765 (removed 451) transitions.
// Phase 1: matrix 314 rows 173 cols
[2025-05-30 13:03:51] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:03:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-30 13:03:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:03:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:03:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:03:51] [INFO ] Redundant transitions in 24 ms returned []
Running 294 sub problems to find dead transitions.
[2025-05-30 13:03:51] [INFO ] Invariant cache hit.
[2025-05-30 13:03:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 313/486 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 1/487 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 179 constraints, problems are : Problem set: 0 solved, 294 unsolved in 19711 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 313/486 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 294/472 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 1/487 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 473 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 173/173 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49782ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 49783ms
Starting structural reductions in SI_CTL mode, iteration 1 : 173/565 places, 314/765 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50130 ms. Remains : 173/565 places, 314/765 transitions.
[2025-05-30 13:04:41] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:04:41] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:04:41] [INFO ] Input system was already deterministic with 314 transitions.
[2025-05-30 13:04:41] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:04:41] [INFO ] Flatten gal took : 7 ms
[2025-05-30 13:04:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality13266443624452543228.gal : 2 ms
[2025-05-30 13:04:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10717818972418480642.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/CTLCardinality13266443624452543228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10717818972418480642.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.33298e+08,0.21967,12160,2,2417,5,34156,6,0,992,32318,0


Converting to forward existential form...Done !
original formula: EF(EG(((EF(((p409==0)||(p285==1))) + (AF((p352==1)) * (((p1042==0)&&(p567==1))||((p777==0)&&(p1141==1))))) * ((p950==1)||(p318==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((E(TRUE U ((p409==0)||(p285==1))) + (!(EG(!((p352==1)))) * (((p1042==0)&&(p567==1))||((p7...214
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t11, t24, t38, t54, t67, t84, t89, t125, t298, t299, t300, t302, t305, Intersect...245
Detected timeout of ITS tools.
[2025-05-30 13:05:11] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:05:11] [INFO ] Applying decomposition
[2025-05-30 13:05: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/graph13662040308982930068.txt' '-o' '/tmp/graph13662040308982930068.bin' '-w' '/tmp/graph13662040308982930068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13662040308982930068.bin' '-l' '-1' '-v' '-w' '/tmp/graph13662040308982930068.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:05:11] [INFO ] Decomposing Gal with order
[2025-05-30 13:05:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:05:11] [INFO ] Removed a total of 229 redundant transitions.
[2025-05-30 13:05:11] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:05:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 7 ms.
[2025-05-30 13:05:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality14596867069044221206.gal : 3 ms
[2025-05-30 13:05:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17734791118077063080.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/CTLCardinality14596867069044221206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17734791118077063080.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33298e+08,0.060077,6020,148,94,2993,925,636,4772,111,2792,0


Converting to forward existential form...Done !
original formula: EF(EG(((EF(((i2.i1.u24.p409==0)||(i1.i2.u10.p285==1))) + (AF((i2.i0.u19.p352==1)) * (((i7.i1.u62.p1042==0)&&(i3.u29.p567==1))||((i5.i0.u4...240
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((E(TRUE U ((i2.i1.u24.p409==0)||(i1.i2.u10.p285==1))) + (!(EG(!((i2.i0.u19.p352==1)))) * ...302
Reverse transition relation is NOT exact ! Due to transitions t299, i0.i1.u4.t89, i1.i1.u9.t125, i1.i3.u16.t84, i2.i0.u22.t67, i7.i1.t3, i7.i1.t298, i7.i1....387
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,6.42521,211084,1,0,219315,30328,3827,1.8055e+06,641,161243,109632
FORMULA CO4-PT-19-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 531 transition count 728
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 531 transition count 728
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 75 place count 531 transition count 721
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 97 place count 509 transition count 699
Iterating global reduction 1 with 22 rules applied. Total rules applied 119 place count 509 transition count 699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 509 transition count 697
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 133 place count 497 transition count 685
Iterating global reduction 2 with 12 rules applied. Total rules applied 145 place count 497 transition count 685
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 149 place count 497 transition count 681
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 155 place count 491 transition count 675
Iterating global reduction 3 with 6 rules applied. Total rules applied 161 place count 491 transition count 675
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 165 place count 487 transition count 671
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 487 transition count 671
Applied a total of 169 rules in 68 ms. Remains 487 /565 variables (removed 78) and now considering 671/765 (removed 94) transitions.
// Phase 1: matrix 671 rows 487 cols
[2025-05-30 13:05:18] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:05:18] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-30 13:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:05:18] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2025-05-30 13:05: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/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (OVERLAPS) 671/1158 variables, 487/492 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 492 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:06:02] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:06:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 671/1158 variables, 487/494 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1158 variables, 670/1164 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1164 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 487/565 places, 671/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60638 ms. Remains : 487/565 places, 671/765 transitions.
[2025-05-30 13:06:19] [INFO ] Flatten gal took : 17 ms
[2025-05-30 13:06:19] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:06:19] [INFO ] Input system was already deterministic with 671 transitions.
[2025-05-30 13:06:19] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:06:19] [INFO ] Flatten gal took : 26 ms
[2025-05-30 13:06:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality1749806679073821800.gal : 4 ms
[2025-05-30 13:06:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15826353443273443369.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/CTLCardinality1749806679073821800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15826353443273443369.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.54824e+11,12.2264,309452,2,25042,5,880323,6,0,2613,1.602e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:06:49] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:06:49] [INFO ] Applying decomposition
[2025-05-30 13:06:49] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8300235687344775989.txt' '-o' '/tmp/graph8300235687344775989.bin' '-w' '/tmp/graph8300235687344775989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8300235687344775989.bin' '-l' '-1' '-v' '-w' '/tmp/graph8300235687344775989.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:06:49] [INFO ] Decomposing Gal with order
[2025-05-30 13:06:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:06:49] [INFO ] Removed a total of 395 redundant transitions.
[2025-05-30 13:06:49] [INFO ] Flatten gal took : 30 ms
[2025-05-30 13:06:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2025-05-30 13:06:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5368919559890808920.gal : 5 ms
[2025-05-30 13:06:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality10836370988857722346.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/CTLCardinality5368919559890808920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10836370988857722346.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.54824e+11,2.76432,103380,1871,108,142343,2169,1164,812406,86,15196,0


Converting to forward existential form...Done !
original formula: EG((AF(EG((i1.u174.p1050==1))) + AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG((i1.u174.p1050==1))))) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t47, t78, t87, t88, t132, t166, t178, t216, t260, t301, t313, t348, t357, t546, t547, t5...1066
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 538 transition count 736
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 538 transition count 736
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 538 transition count 730
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 77 place count 521 transition count 713
Iterating global reduction 1 with 17 rules applied. Total rules applied 94 place count 521 transition count 713
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 105 place count 510 transition count 702
Iterating global reduction 1 with 11 rules applied. Total rules applied 116 place count 510 transition count 702
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 510 transition count 699
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 125 place count 504 transition count 693
Iterating global reduction 2 with 6 rules applied. Total rules applied 131 place count 504 transition count 693
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 500 transition count 689
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 500 transition count 689
Applied a total of 139 rules in 61 ms. Remains 500 /565 variables (removed 65) and now considering 689/765 (removed 76) transitions.
// Phase 1: matrix 689 rows 500 cols
[2025-05-30 13:07:19] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:07:19] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 13:07:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:07:20] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2025-05-30 13:07: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/499 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 689/1189 variables, 500/505 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1189/1189 variables, and 505 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:08:04] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:08:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1189 variables, 500/507 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1189 variables, 688/1195 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1189/1189 variables, and 1195 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 500/565 places, 689/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 500/565 places, 689/765 transitions.
[2025-05-30 13:08:20] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:08:20] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:08:20] [INFO ] Input system was already deterministic with 689 transitions.
[2025-05-30 13:08:20] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:08:20] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:08:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5981987782109947581.gal : 5 ms
[2025-05-30 13:08:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6939612615970937903.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/CTLCardinality5981987782109947581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6939612615970937903.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,6.88566e+11,15.073,377592,2,28108,5,1.0133e+06,6,0,2683,1.98488e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:08:50] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:08:50] [INFO ] Applying decomposition
[2025-05-30 13:08:50] [INFO ] Flatten gal took : 14 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/graph3320797063289570147.txt' '-o' '/tmp/graph3320797063289570147.bin' '-w' '/tmp/graph3320797063289570147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3320797063289570147.bin' '-l' '-1' '-v' '-w' '/tmp/graph3320797063289570147.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:08:50] [INFO ] Decomposing Gal with order
[2025-05-30 13:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:08:50] [INFO ] Removed a total of 410 redundant transitions.
[2025-05-30 13:08:50] [INFO ] Flatten gal took : 29 ms
[2025-05-30 13:08:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 6 ms.
[2025-05-30 13:08:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality5681909101804876204.gal : 5 ms
[2025-05-30 13:08:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality4728692052370084069.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/CTLCardinality5681909101804876204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4728692052370084069.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,6.88566e+11,0.520202,27184,1398,113,40858,1076,1171,119897,100,4229,0


Converting to forward existential form...Done !
original formula: !(E(EX(!((E((i19.u179.p1077==1) U ((i9.u67.p447==0)||(i16.u115.p733==1))) * (i16.u132.p810==1)))) U ((AX(!((((i5.u47.p350==0)||(i11.i0.i0...346
=> equivalent forward existential formula: [(EY(FwdU(((FwdU(Init,EX(!((E((i19.u179.p1077==1) U ((i9.u67.p447==0)||(i16.u115.p733==1))) * (i16.u132.p810==1)...413
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t82, t91, t92, t136, t184, t224, t247, t268, t356, t449, t504, t532, t561, t562, t5...1097
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 532 transition count 729
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 532 transition count 729
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 72 place count 532 transition count 723
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 93 place count 511 transition count 702
Iterating global reduction 1 with 21 rules applied. Total rules applied 114 place count 511 transition count 702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 511 transition count 700
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 127 place count 500 transition count 689
Iterating global reduction 2 with 11 rules applied. Total rules applied 138 place count 500 transition count 689
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 141 place count 500 transition count 686
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 147 place count 494 transition count 680
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 494 transition count 680
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 157 place count 490 transition count 676
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 490 transition count 676
Applied a total of 161 rules in 54 ms. Remains 490 /565 variables (removed 75) and now considering 676/765 (removed 89) transitions.
// Phase 1: matrix 676 rows 490 cols
[2025-05-30 13:09:20] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:09:20] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-30 13:09:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:09:21] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 675 sub problems to find dead transitions.
[2025-05-30 13:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 676/1166 variables, 490/495 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 495 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 676/1166 variables, 490/495 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1166 variables, 675/1170 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 1170 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 490/565 places, 676/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60666 ms. Remains : 490/565 places, 676/765 transitions.
[2025-05-30 13:10:21] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:10:21] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:10:21] [INFO ] Input system was already deterministic with 676 transitions.
[2025-05-30 13:10:21] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:10:21] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:10:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality16705167233913085871.gal : 3 ms
[2025-05-30 13:10:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality551809268416105437.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/CTLCardinality16705167233913085871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality551809268416105437.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,6.07336e+11,13.586,351844,2,26667,5,956339,6,0,2630,1.8506e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:10:51] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:10:51] [INFO ] Applying decomposition
[2025-05-30 13:10:51] [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/graph1480963475932329740.txt' '-o' '/tmp/graph1480963475932329740.bin' '-w' '/tmp/graph1480963475932329740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1480963475932329740.bin' '-l' '-1' '-v' '-w' '/tmp/graph1480963475932329740.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:10:51] [INFO ] Decomposing Gal with order
[2025-05-30 13:10:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:10:51] [INFO ] Removed a total of 405 redundant transitions.
[2025-05-30 13:10:51] [INFO ] Flatten gal took : 44 ms
[2025-05-30 13:10:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2025-05-30 13:10:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6824459889791307648.gal : 5 ms
[2025-05-30 13:10:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7229626700431212485.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/CTLCardinality6824459889791307648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7229626700431212485.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,6.07336e+11,0.721535,33900,1688,96,51014,880,1161,165781,85,3079,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((i19.u179.p1088==0)||(i4.u38.p315==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((i19.u179.p1088==0)||(i4.u38.p315==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t47, t82, t91, t92, t136, t182, t264, t305, t317, t352, t361, t452, t483, t523, t551, t5...1019
(forward)formula 0,1,2.745,112620,1,0,187257,1556,7347,634445,371,6108,491003
FORMULA CO4-PT-19-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Graph (trivial) has 606 edges and 565 vertex of which 3 / 565 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1072 edges and 563 vertex of which 558 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 557 transition count 494
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 266 rules applied. Total rules applied 530 place count 295 transition count 490
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 532 place count 294 transition count 489
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 532 place count 294 transition count 445
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 620 place count 250 transition count 445
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 631 place count 239 transition count 431
Iterating global reduction 3 with 11 rules applied. Total rules applied 642 place count 239 transition count 431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 644 place count 239 transition count 429
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 644 place count 239 transition count 427
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 648 place count 237 transition count 427
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 651 place count 234 transition count 423
Iterating global reduction 4 with 3 rules applied. Total rules applied 654 place count 234 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 655 place count 234 transition count 422
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 725 place count 199 transition count 387
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 17 rules applied. Total rules applied 742 place count 199 transition count 370
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 751 place count 193 transition count 367
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 759 place count 185 transition count 355
Iterating global reduction 7 with 8 rules applied. Total rules applied 767 place count 185 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 769 place count 185 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 770 place count 184 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 772 place count 183 transition count 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 773 place count 182 transition count 350
Iterating global reduction 9 with 1 rules applied. Total rules applied 774 place count 182 transition count 350
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 775 place count 181 transition count 348
Iterating global reduction 9 with 1 rules applied. Total rules applied 776 place count 181 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 777 place count 181 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 803 place count 181 transition count 321
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 10 with 16 rules applied. Total rules applied 819 place count 181 transition count 305
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 835 place count 165 transition count 305
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 835 place count 165 transition count 302
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 841 place count 162 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 843 place count 161 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 845 place count 159 transition count 299
Applied a total of 845 rules in 67 ms. Remains 159 /565 variables (removed 406) and now considering 299/765 (removed 466) transitions.
// Phase 1: matrix 299 rows 159 cols
[2025-05-30 13:10:54] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:10:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 13:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:10:54] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:10:54] [INFO ] Redundant transitions in 4 ms returned []
Running 279 sub problems to find dead transitions.
[2025-05-30 13:10:54] [INFO ] Invariant cache hit.
[2025-05-30 13:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 298/457 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 1/458 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 165 constraints, problems are : Problem set: 0 solved, 279 unsolved in 17634 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 298/457 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 279/443 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 444 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47694ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 47695ms
Starting structural reductions in SI_CTL mode, iteration 1 : 159/565 places, 299/765 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47951 ms. Remains : 159/565 places, 299/765 transitions.
[2025-05-30 13:11:42] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:11:42] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:11:42] [INFO ] Input system was already deterministic with 299 transitions.
[2025-05-30 13:11:42] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:11:42] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:11:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12635594423911031607.gal : 1 ms
[2025-05-30 13:11:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15986168753279823730.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12635594423911031607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15986168753279823730.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15986168753279823730.prop.
RANDOM walk for 40000 steps (3103 resets) in 537 ms. (74 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 29
Invariant property CO4-PT-19-CTLCardinality-2025-10 does not hold.
FORMULA CO4-PT-19-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,50,0.058272,5756,2,263,10,1889,6,0,921,460,0
Total reachable state count : 50

Verifying 1 reachability properties.
Invariant property CO4-PT-19-CTLCardinality-2025-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-19-CTLCardinality-2025-10,1,0.05892,5884,2,160,10,1889,7,0,927,460,0
BEST_FIRST walk for 40004 steps (300 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1188433 steps, run visited all 1 properties in 1448 ms. (steps per millisecond=820 )
Probabilistic random walk after 1188433 steps, saw 189125 distinct states, run finished after 1453 ms. (steps per millisecond=817 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 536 transition count 733
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 536 transition count 733
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 536 transition count 728
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 80 place count 519 transition count 711
Iterating global reduction 1 with 17 rules applied. Total rules applied 97 place count 519 transition count 711
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 519 transition count 709
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 107 place count 511 transition count 701
Iterating global reduction 2 with 8 rules applied. Total rules applied 115 place count 511 transition count 701
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 511 transition count 700
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 506 transition count 695
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 506 transition count 695
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 503 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 503 transition count 692
Applied a total of 132 rules in 45 ms. Remains 503 /565 variables (removed 62) and now considering 692/765 (removed 73) transitions.
// Phase 1: matrix 692 rows 503 cols
[2025-05-30 13:11:44] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:11:44] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 13:11:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:11:44] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2025-05-30 13:11:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1195 variables, 503/508 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1195/1195 variables, and 508 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:12:28] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:12:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 692/1195 variables, 503/510 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1195 variables, 691/1201 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1195/1195 variables, and 1201 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 503/565 places, 692/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60632 ms. Remains : 503/565 places, 692/765 transitions.
[2025-05-30 13:12:44] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:12:44] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:12:44] [INFO ] Input system was already deterministic with 692 transitions.
[2025-05-30 13:12:44] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:12:44] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:12:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16115717429548777242.gal : 2 ms
[2025-05-30 13:12:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7420186008534705058.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/CTLCardinality16115717429548777242.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7420186008534705058.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.14471e+11,15.6381,348760,2,26230,5,960722,6,0,2698,1.82267e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:13:14] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:13:14] [INFO ] Applying decomposition
[2025-05-30 13:13:14] [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/graph18435799913594298881.txt' '-o' '/tmp/graph18435799913594298881.bin' '-w' '/tmp/graph18435799913594298881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18435799913594298881.bin' '-l' '-1' '-v' '-w' '/tmp/graph18435799913594298881.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:13:14] [INFO ] Decomposing Gal with order
[2025-05-30 13:13:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:13:14] [INFO ] Removed a total of 404 redundant transitions.
[2025-05-30 13:13:14] [INFO ] Flatten gal took : 25 ms
[2025-05-30 13:13:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2025-05-30 13:13:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8802854669161572615.gal : 4 ms
[2025-05-30 13:13:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8053842040743672259.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/CTLCardinality8802854669161572615.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8053842040743672259.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.14471e+11,0.911338,41044,1747,112,58403,1304,1188,246566,91,6911,0


Converting to forward existential form...Done !
original formula: E(!(AF((AX((i16.u158.p911==1)) * !(A((i6.u68.p470==1) U (i6.u66.p445==0)))))) U ((i8.u129.p790==0) * AX((!(((i15.u153.p930==0)||(i0.u62.p...211
=> equivalent forward existential formula: [((FwdU(Init,!(!(EG(!((!(EX(!((i16.u158.p911==1)))) * !(!((E(!((i6.u66.p445==0)) U (!((i6.u68.p470==1)) * !((i6....336
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t78, t87, t88, t135, t181, t230, t266, t354, t374, t465, t496, t564, t565, t602, t6...1124
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Graph (trivial) has 606 edges and 565 vertex of which 3 / 565 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1072 edges and 563 vertex of which 558 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 557 transition count 493
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 267 rules applied. Total rules applied 532 place count 294 transition count 489
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 534 place count 293 transition count 488
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 534 place count 293 transition count 444
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 622 place count 249 transition count 444
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 633 place count 238 transition count 430
Iterating global reduction 3 with 11 rules applied. Total rules applied 644 place count 238 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 646 place count 238 transition count 428
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 646 place count 238 transition count 426
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 650 place count 236 transition count 426
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 653 place count 233 transition count 422
Iterating global reduction 4 with 3 rules applied. Total rules applied 656 place count 233 transition count 422
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 657 place count 233 transition count 421
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 729 place count 197 transition count 385
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 17 rules applied. Total rules applied 746 place count 197 transition count 368
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 755 place count 191 transition count 365
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 763 place count 183 transition count 353
Iterating global reduction 7 with 8 rules applied. Total rules applied 771 place count 183 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 773 place count 183 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 774 place count 182 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 776 place count 181 transition count 350
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 777 place count 180 transition count 348
Iterating global reduction 9 with 1 rules applied. Total rules applied 778 place count 180 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 779 place count 179 transition count 346
Iterating global reduction 9 with 1 rules applied. Total rules applied 780 place count 179 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 781 place count 179 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 807 place count 179 transition count 319
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 10 with 15 rules applied. Total rules applied 822 place count 179 transition count 304
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 837 place count 164 transition count 304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 837 place count 164 transition count 301
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 843 place count 161 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 845 place count 160 transition count 300
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 847 place count 158 transition count 298
Applied a total of 847 rules in 61 ms. Remains 158 /565 variables (removed 407) and now considering 298/765 (removed 467) transitions.
// Phase 1: matrix 298 rows 158 cols
[2025-05-30 13:13:45] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-05-30 13:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:13:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:13:45] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:13:45] [INFO ] Redundant transitions in 4 ms returned []
Running 278 sub problems to find dead transitions.
[2025-05-30 13:13:45] [INFO ] Invariant cache hit.
[2025-05-30 13:13:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 297/455 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 1/456 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 164 constraints, problems are : Problem set: 0 solved, 278 unsolved in 17579 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 297/455 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 278/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 1/456 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 442 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47635ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 47638ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/565 places, 298/765 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47946 ms. Remains : 158/565 places, 298/765 transitions.
[2025-05-30 13:14:32] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:14:32] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:14:32] [INFO ] Input system was already deterministic with 298 transitions.
[2025-05-30 13:14:32] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:14:32] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:14:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality2147302336695823934.gal : 2 ms
[2025-05-30 13:14:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality10063464041393298898.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/CTLCardinality2147302336695823934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10063464041393298898.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.15236e+07,0.136044,9048,2,1834,5,22257,6,0,916,17506,0


Converting to forward existential form...Done !
original formula: EG((p551==0))
=> equivalent forward existential formula: [FwdG(Init,(p551==0))] != FALSE
Hit Full ! (commute/partial/dont) 296/0/2
(forward)formula 0,1,0.896528,37648,1,0,10,195691,19,4,4770,68244,8
FORMULA CO4-PT-19-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 533 transition count 730
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 533 transition count 730
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 71 place count 533 transition count 723
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 90 place count 514 transition count 704
Iterating global reduction 1 with 19 rules applied. Total rules applied 109 place count 514 transition count 704
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 514 transition count 702
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 121 place count 504 transition count 692
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 504 transition count 692
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 135 place count 504 transition count 688
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 500 transition count 684
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 500 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 497 transition count 681
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 497 transition count 681
Applied a total of 149 rules in 50 ms. Remains 497 /565 variables (removed 68) and now considering 681/765 (removed 84) transitions.
// Phase 1: matrix 681 rows 497 cols
[2025-05-30 13:14:33] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-30 13:14:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:14:34] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2025-05-30 13:14:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (OVERLAPS) 681/1178 variables, 497/502 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 502 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 680 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:15:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 4 (OVERLAPS) 681/1178 variables, 497/504 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 680/1184 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 1184 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 680 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 497/565 places, 681/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60622 ms. Remains : 497/565 places, 681/765 transitions.
[2025-05-30 13:15:34] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:15:34] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:15:34] [INFO ] Input system was already deterministic with 681 transitions.
[2025-05-30 13:15:34] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:15:34] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:15:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2352171112628741992.gal : 2 ms
[2025-05-30 13:15:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality18131375095486519810.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/CTLCardinality2352171112628741992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18131375095486519810.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.6887e+11,13.6378,316808,2,25318,5,901914,6,0,2663,1.64241e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:16:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:16:04] [INFO ] Applying decomposition
[2025-05-30 13:16:04] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5556056022444977381.txt' '-o' '/tmp/graph5556056022444977381.bin' '-w' '/tmp/graph5556056022444977381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5556056022444977381.bin' '-l' '-1' '-v' '-w' '/tmp/graph5556056022444977381.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:16:04] [INFO ] Decomposing Gal with order
[2025-05-30 13:16:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:16:04] [INFO ] Removed a total of 396 redundant transitions.
[2025-05-30 13:16:04] [INFO ] Flatten gal took : 24 ms
[2025-05-30 13:16:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 5 ms.
[2025-05-30 13:16:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality13667525119205976079.gal : 5 ms
[2025-05-30 13:16:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality16292107547165739046.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/CTLCardinality13667525119205976079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16292107547165739046.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.6887e+11,0.590257,26732,1383,101,42620,1239,1160,102689,85,6493,0


Converting to forward existential form...Done !
original formula: EX(EG(A(EF((i12.u123.p764!=1)) U ((i11.i1.i0.u78.p554==0)||(i19.u152.p894==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((E(!(((i11.i1.i0.u78.p554==0)||(i19.u152.p894==1))) U (!(E(TRUE U (i12.u123.p764!=1))) * !(((i1...267
Reverse transition relation is NOT exact ! Due to transitions t26, t49, t79, t88, t89, t135, t181, t202, t222, t251, t266, t306, t331, t355, t364, t408, t4...1039
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 565/565 places, 765/765 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 535 transition count 732
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 535 transition count 732
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 535 transition count 728
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 84 place count 515 transition count 708
Iterating global reduction 1 with 20 rules applied. Total rules applied 104 place count 515 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 515 transition count 706
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 117 place count 504 transition count 695
Iterating global reduction 2 with 11 rules applied. Total rules applied 128 place count 504 transition count 695
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 132 place count 504 transition count 691
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 137 place count 499 transition count 686
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 499 transition count 686
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 146 place count 495 transition count 682
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 495 transition count 682
Applied a total of 150 rules in 53 ms. Remains 495 /565 variables (removed 70) and now considering 682/765 (removed 83) transitions.
// Phase 1: matrix 682 rows 495 cols
[2025-05-30 13:16:34] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:16:34] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-05-30 13:16:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:16:35] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2025-05-30 13:16:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:16:53] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:16:53] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)timeout

(s169 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 681 unsolved
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 30144ms
Starting structural reductions in LTL mode, iteration 1 : 495/565 places, 682/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30621 ms. Remains : 495/565 places, 682/765 transitions.
[2025-05-30 13:17:05] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:17:05] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:17:05] [INFO ] Input system was already deterministic with 682 transitions.
[2025-05-30 13:17:05] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:17:05] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:17:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13005700867067369332.gal : 2 ms
[2025-05-30 13:17:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9860641344925997349.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/CTLCardinality13005700867067369332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9860641344925997349.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.1266e+11,13.7924,323032,2,25493,5,904219,6,0,2656,1.67024e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:17:35] [INFO ] Flatten gal took : 15 ms
[2025-05-30 13:17:35] [INFO ] Applying decomposition
[2025-05-30 13:17:35] [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/graph2032056187540569723.txt' '-o' '/tmp/graph2032056187540569723.bin' '-w' '/tmp/graph2032056187540569723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2032056187540569723.bin' '-l' '-1' '-v' '-w' '/tmp/graph2032056187540569723.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:17:35] [INFO ] Decomposing Gal with order
[2025-05-30 13:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:17:35] [INFO ] Removed a total of 413 redundant transitions.
[2025-05-30 13:17:35] [INFO ] Flatten gal took : 23 ms
[2025-05-30 13:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 5 ms.
[2025-05-30 13:17:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality3963996518952774139.gal : 4 ms
[2025-05-30 13:17:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality7078021504802680474.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/CTLCardinality3963996518952774139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7078021504802680474.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,6.1266e+11,0.584167,27244,1321,118,43081,1352,1140,106487,95,5734,0


Converting to forward existential form...Done !
original formula: AX(!(E(((A((i9.u164.p903==1) U (i1.i1.i3.u32.p279==0)) * (i8.u93.p591!=0)) + E(EF((i3.i1.i1.u43.p326==0)) U EF(((i14.u143.p821==0)||(i5.u...271
=> equivalent forward existential formula: [((((FwdU(EY(Init),((!((E(!((i1.i1.i3.u32.p279==0)) U (!((i9.u164.p903==1)) * !((i1.i1.i3.u32.p279==0)))) + EG(!...466
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t78, t91, t92, t138, t172, t184, t222, t266, t307, t319, t354, t363, t455, t526, t5...1079
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
[2025-05-30 13:18:05] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:18:05] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:18:05] [INFO ] Applying decomposition
[2025-05-30 13:18:05] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8258263271626840344.txt' '-o' '/tmp/graph8258263271626840344.bin' '-w' '/tmp/graph8258263271626840344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8258263271626840344.bin' '-l' '-1' '-v' '-w' '/tmp/graph8258263271626840344.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:18:05] [INFO ] Decomposing Gal with order
[2025-05-30 13:18:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:18:05] [INFO ] Removed a total of 433 redundant transitions.
[2025-05-30 13:18:05] [INFO ] Flatten gal took : 27 ms
[2025-05-30 13:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2025-05-30 13:18:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11298871619889285158.gal : 5 ms
[2025-05-30 13:18:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3774603495497462110.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/CTLCardinality11298871619889285158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3774603495497462110.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39824e+12,25.1153,806016,3903,152,1.0155e+06,4979,1347,7.36182e+06,130,45225,0


Converting to forward existential form...Done !
original formula: ((EX(((AG(((i2.u40.p302==0)||(i18.i0.i0.u106.p598==1))) * (i8.u109.p614==0)) * (i2.u41.p304==0))) + AG(EX(TRUE))) + EF((i17.i1.i0.u175.p8...163
=> equivalent forward existential formula: [(FwdU(((Init * !(E(TRUE U (i17.i1.i0.u175.p878==1)))) * !(EX(((!(E(TRUE U !(((i2.u40.p302==0)||(i18.i0.i0.u106....241
Reverse transition relation is NOT exact ! Due to transitions t111, t112, t163, t197, t211, t237, t257, t301, t342, t343, t354, t366, t390, t410, t460, t54...1264
(forward)formula 0,1,145.631,2453056,1,0,1.45252e+06,4979,4702,2.92668e+07,344,45225,1144090
FORMULA CO4-PT-19-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
ITS-tools command line returned an error code 139
[2025-05-30 13:20:54] [INFO ] Applying decomposition
[2025-05-30 13:20:54] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:20:54] [INFO ] Decomposing Gal with order
[2025-05-30 13:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:20:54] [INFO ] Removed a total of 259 redundant transitions.
[2025-05-30 13:20:54] [INFO ] Flatten gal took : 20 ms
[2025-05-30 13:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 4 ms.
[2025-05-30 13:20:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality17311770813443192462.gal : 2 ms
[2025-05-30 13:20:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality12510456164279614106.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/CTLCardinality17311770813443192462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12510456164279614106.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 5 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.39824e+12,3.7004,121536,760,3360,70123,177498,292,300130,1658,895413,0


Converting to forward existential form...Done !
original formula: EG((AF(EG((i0.i1.i1.i1.u16.p1050==1))) + AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG((i0.i1.i1.i1.u16.p1050==1))))) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t620, i0.t257, i0.i0.i0.t410, i0.i0.i0.u5.t460, i0.i0.i0.u5.t470, i0.i0.i0.u5.t497, i0.i0....1912
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2025-05-30 13:46:13] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:46:13] [INFO ] Input system was already deterministic with 765 transitions.
[2025-05-30 13:46:13] [INFO ] Transformed 565 places.
[2025-05-30 13:46:13] [INFO ] Transformed 765 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 13:46:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11906330057241100835.gal : 2 ms
[2025-05-30 13:46:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14964041046739548876.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/CTLCardinality11906330057241100835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14964041046739548876.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 5 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.39824e+12,50.979,1282068,2,57759,5,5.03023e+06,6,0,3019,5.69647e+06,0


Converting to forward existential form...Done !
original formula: EG((AF(EG((p1050==1))) + AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EG((p1050==1))))) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t25, t26, t27, t28, t32, t35, t38, t46, t55, t57, t58, t59, t60, t61, t65, t66, t68, t71...737

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="CO4-PT-19"
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 CO4-PT-19, 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 r044-tall-174854028600521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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