fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r030-smll-174853813400145
Last Updated
June 24, 2025

About the Execution of ITS-Tools for BusinessProcesses-PT-19

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 ?TF?T?TT?T?FFTT? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 189K 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 BusinessProcesses-PT-19-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-15
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748613370892

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 13:56:13] [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:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:56:13] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2025-05-30 13:56:13] [INFO ] Transformed 772 places.
[2025-05-30 13:56:13] [INFO ] Transformed 685 transitions.
[2025-05-30 13:56:13] [INFO ] Found NUPN structural information;
[2025-05-30 13:56:14] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Deduced a syphon composed of 15 places in 35 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 750 transition count 670
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 98 place count 659 transition count 579
Iterating global reduction 1 with 91 rules applied. Total rules applied 189 place count 659 transition count 579
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 233 place count 615 transition count 535
Iterating global reduction 1 with 44 rules applied. Total rules applied 277 place count 615 transition count 535
Applied a total of 277 rules in 338 ms. Remains 615 /757 variables (removed 142) and now considering 535/670 (removed 135) transitions.
// Phase 1: matrix 535 rows 615 cols
[2025-05-30 13:56:14] [INFO ] Computed 118 invariants in 76 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:56:15] [INFO ] Implicit Places using invariants in 1289 ms returned []
[2025-05-30 13:56:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:56:19] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 4859 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2025-05-30 13:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (OVERLAPS) 2/615 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 534 unsolved
SMT process timed out in 30397ms, After SMT, problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 30431ms
Starting structural reductions in LTL mode, iteration 1 : 615/757 places, 535/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35677 ms. Remains : 615/757 places, 535/670 transitions.
Support contains 97 out of 615 places after structural reductions.
[2025-05-30 13:56:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 13:56:50] [INFO ] Flatten gal took : 166 ms
[2025-05-30 13:56:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 13:56:50] [INFO ] Flatten gal took : 86 ms
[2025-05-30 13:56:50] [INFO ] Input system was already deterministic with 535 transitions.
Support contains 78 out of 615 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (214 resets) in 3163 ms. (12 steps per ms) remains 24/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
[2025-05-30 13:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 255/295 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 170/465 variables, 46/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 138/603 variables, 46/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/604 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 529/1133 variables, 604/722 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1133 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 15/1148 variables, 9/731 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1148/1150 variables, and 731 constraints, problems are : Problem set: 0 solved, 24 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 613/615 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
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 255/295 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:57] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 170/465 variables, 46/72 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:58] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:58] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:59] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:59] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:59] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:56:59] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:00] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:00] [INFO ] Deduced a trap composed of 25 places in 348 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:01] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:01] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:01] [INFO ] Deduced a trap composed of 34 places in 353 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:02] [INFO ] Deduced a trap composed of 85 places in 342 ms of which 36 ms to minimize.
SMT process timed out in 10061ms, After SMT, problems are : Problem set: 1 solved, 23 unsolved
Fused 23 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 39 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 535/535 transitions.
Graph (trivial) has 260 edges and 615 vertex of which 7 / 615 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1339 edges and 609 vertex of which 608 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 608 transition count 464
Reduce places removed 62 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 68 rules applied. Total rules applied 132 place count 546 transition count 458
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 540 transition count 458
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 138 place count 540 transition count 355
Deduced a syphon composed of 103 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 362 place count 419 transition count 355
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 372 place count 409 transition count 345
Iterating global reduction 3 with 10 rules applied. Total rules applied 382 place count 409 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 382 place count 409 transition count 344
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 384 place count 408 transition count 344
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 385 place count 407 transition count 343
Iterating global reduction 3 with 1 rules applied. Total rules applied 386 place count 407 transition count 343
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 686 place count 255 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 688 place count 254 transition count 197
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 690 place count 254 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 692 place count 252 transition count 195
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 694 place count 252 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 695 place count 251 transition count 194
Applied a total of 695 rules in 315 ms. Remains 251 /615 variables (removed 364) and now considering 194/535 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 251/615 places, 194/535 transitions.
RANDOM walk for 40000 steps (1030 resets) in 994 ms. (40 steps per ms) remains 5/23 properties
BEST_FIRST walk for 40002 steps (295 resets) in 313 ms. (127 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (298 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (229 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (278 resets) in 211 ms. (188 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (243 resets) in 176 ms. (225 steps per ms) remains 2/3 properties
// Phase 1: matrix 194 rows 251 cols
[2025-05-30 13:57:03] [INFO ] Computed 96 invariants in 20 ms
[2025-05-30 13:57:03] [INFO ] State equation strengthened by 3 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/145 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/154 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/188 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 184/372 variables, 188/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 63/435 variables, 56/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 25/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/437 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 7/444 variables, 6/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/444 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/444 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/445 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/445 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 350 constraints, problems are : Problem set: 0 solved, 2 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/64 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/145 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/154 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:03] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:03] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:04] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 34/188 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 184/372 variables, 188/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/372 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 63/435 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 25/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/435 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:04] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/435 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:04] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:04] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/435 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/437 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/437 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 7/444 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/444 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/444 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/445 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/445 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/445 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 360 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1682 ms.
Refiners :[Positive P Invariants (semi-flows): 74/74 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 251/251 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2127ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 59 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 11 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2025-05-30 13:57:05] [INFO ] Flatten gal took : 67 ms
[2025-05-30 13:57:05] [INFO ] Flatten gal took : 59 ms
[2025-05-30 13:57:05] [INFO ] Input system was already deterministic with 535 transitions.
Computed a total of 554 stabilizing places and 484 stable transitions
Graph (complete) has 1347 edges and 615 vertex of which 613 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 589 transition count 510
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 589 transition count 510
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 583 transition count 504
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 580 transition count 501
Applied a total of 69 rules in 187 ms. Remains 580 /615 variables (removed 35) and now considering 501/535 (removed 34) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 13:57:05] [INFO ] Computed 117 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:57:06] [INFO ] Implicit Places using invariants in 828 ms returned []
[2025-05-30 13:57:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:57:09] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3642 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 13:57:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:58] [INFO ] Deduced a trap composed of 74 places in 501 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:59] [INFO ] Deduced a trap composed of 74 places in 493 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:57:59] [INFO ] Deduced a trap composed of 74 places in 516 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:00] [INFO ] Deduced a trap composed of 74 places in 489 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:00] [INFO ] Deduced a trap composed of 74 places in 495 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:01] [INFO ] Deduced a trap composed of 74 places in 451 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:01] [INFO ] Deduced a trap composed of 74 places in 441 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:02] [INFO ] Deduced a trap composed of 74 places in 445 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:02] [INFO ] Deduced a trap composed of 74 places in 483 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:03] [INFO ] Deduced a trap composed of 74 places in 490 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:03] [INFO ] Deduced a trap composed of 74 places in 473 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:04] [INFO ] Deduced a trap composed of 74 places in 459 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:04] [INFO ] Deduced a trap composed of 74 places in 477 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:05] [INFO ] Deduced a trap composed of 74 places in 514 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:05] [INFO ] Deduced a trap composed of 74 places in 390 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:06] [INFO ] Deduced a trap composed of 74 places in 468 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:06] [INFO ] Deduced a trap composed of 74 places in 455 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:06] [INFO ] Deduced a trap composed of 74 places in 436 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:07] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:07] [INFO ] Deduced a trap composed of 74 places in 440 ms of which 92 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:09] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:09] [INFO ] Deduced a trap composed of 75 places in 439 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:58:09] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 88 ms to minimize.
SMT process timed out in 60580ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60584ms
Starting structural reductions in LTL mode, iteration 1 : 580/615 places, 501/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64415 ms. Remains : 580/615 places, 501/535 transitions.
[2025-05-30 13:58:10] [INFO ] Flatten gal took : 57 ms
[2025-05-30 13:58:10] [INFO ] Flatten gal took : 49 ms
[2025-05-30 13:58:10] [INFO ] Input system was already deterministic with 501 transitions.
[2025-05-30 13:58:10] [INFO ] Flatten gal took : 39 ms
[2025-05-30 13:58:10] [INFO ] Flatten gal took : 38 ms
[2025-05-30 13:58:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality1823440871836877610.gal : 33 ms
[2025-05-30 13:58:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality494060337362623934.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1823440871836877610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality494060337362623934.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 13:58:40] [INFO ] Flatten gal took : 39 ms
[2025-05-30 13:58:40] [INFO ] Applying decomposition
[2025-05-30 13:58:40] [INFO ] Flatten gal took : 84 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/graph8465070720483074122.txt' '-o' '/tmp/graph8465070720483074122.bin' '-w' '/tmp/graph8465070720483074122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8465070720483074122.bin' '-l' '-1' '-v' '-w' '/tmp/graph8465070720483074122.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:58:40] [INFO ] Decomposing Gal with order
[2025-05-30 13:58:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:58:41] [INFO ] Removed a total of 287 redundant transitions.
[2025-05-30 13:58:41] [INFO ] Flatten gal took : 159 ms
[2025-05-30 13:58:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 40 ms.
[2025-05-30 13:58:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality457677930710662635.gal : 32 ms
[2025-05-30 13:58:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality12971151253157631443.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/CTLCardinality457677930710662635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12971151253157631443.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24868e+33,2.72842,58736,5588,58,117477,940,1283,181306,69,2347,0


Converting to forward existential form...Done !
original formula: EF(AG(AX(((EG((i18.i1.u60.p179==1)) * ((i10.i1.u115.p347==0)||(i1.i1.u14.p32==1))) * (((i9.i0.u90.p271==0)||(i8.i0.u155.p540==1))&&(((i7....213
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((EG((i18.i1.u60.p179==1)) * ((i10.i1.u115.p347==0)||(i1.i1.u14.p32==1))...283
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t200, t302, t310, t388, t391, t464, t469, t471, t473, t474, t476, t478, t487...1604
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 590 transition count 511
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 584 transition count 505
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 581 transition count 502
Applied a total of 67 rules in 177 ms. Remains 581 /615 variables (removed 34) and now considering 502/535 (removed 33) transitions.
// Phase 1: matrix 502 rows 581 cols
[2025-05-30 13:59:11] [INFO ] Computed 117 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:59:12] [INFO ] Implicit Places using invariants in 877 ms returned []
[2025-05-30 13:59:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:59:15] [INFO ] Implicit Places using invariants and state equation in 3289 ms returned []
Implicit Place search using SMT with State Equation took 4168 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2025-05-30 13:59:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 501 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 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 117 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:05] [INFO ] Deduced a trap composed of 74 places in 405 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:06] [INFO ] Deduced a trap composed of 74 places in 470 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:06] [INFO ] Deduced a trap composed of 74 places in 402 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:06] [INFO ] Deduced a trap composed of 74 places in 356 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:07] [INFO ] Deduced a trap composed of 74 places in 301 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:07] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:07] [INFO ] Deduced a trap composed of 74 places in 415 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:08] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:08] [INFO ] Deduced a trap composed of 74 places in 435 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:09] [INFO ] Deduced a trap composed of 74 places in 434 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:09] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:10] [INFO ] Deduced a trap composed of 74 places in 449 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:10] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:11] [INFO ] Deduced a trap composed of 74 places in 368 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:11] [INFO ] Deduced a trap composed of 75 places in 421 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:11] [INFO ] Deduced a trap composed of 95 places in 395 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:12] [INFO ] Deduced a trap composed of 95 places in 439 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:12] [INFO ] Deduced a trap composed of 95 places in 393 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:13] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:13] [INFO ] Deduced a trap composed of 75 places in 424 ms of which 85 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:14] [INFO ] Deduced a trap composed of 93 places in 526 ms of which 288 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:15] [INFO ] Deduced a trap composed of 93 places in 503 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:00:15] [INFO ] Deduced a trap composed of 93 places in 471 ms of which 113 ms to minimize.
SMT process timed out in 60159ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 581/615 places, 502/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64509 ms. Remains : 581/615 places, 502/535 transitions.
[2025-05-30 14:00:16] [INFO ] Flatten gal took : 28 ms
[2025-05-30 14:00:16] [INFO ] Flatten gal took : 28 ms
[2025-05-30 14:00:16] [INFO ] Input system was already deterministic with 502 transitions.
[2025-05-30 14:00:16] [INFO ] Flatten gal took : 27 ms
[2025-05-30 14:00:16] [INFO ] Flatten gal took : 27 ms
[2025-05-30 14:00:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5957507713119029601.gal : 8 ms
[2025-05-30 14:00:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality11707868053918990892.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/CTLCardinality5957507713119029601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11707868053918990892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 14:00:46] [INFO ] Flatten gal took : 17 ms
[2025-05-30 14:00:46] [INFO ] Applying decomposition
[2025-05-30 14:00:46] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2769253175295372939.txt' '-o' '/tmp/graph2769253175295372939.bin' '-w' '/tmp/graph2769253175295372939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2769253175295372939.bin' '-l' '-1' '-v' '-w' '/tmp/graph2769253175295372939.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:00:46] [INFO ] Decomposing Gal with order
[2025-05-30 14:00:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:00:46] [INFO ] Removed a total of 287 redundant transitions.
[2025-05-30 14:00:46] [INFO ] Flatten gal took : 47 ms
[2025-05-30 14:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2025-05-30 14:00:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10140055992815420611.gal : 10 ms
[2025-05-30 14:00:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17612185508753693399.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/CTLCardinality10140055992815420611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17612185508753693399.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.29238e+33,12.1799,193168,12920,71,358994,698,1310,590698,74,1575,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 590 transition count 511
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 584 transition count 505
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 581 transition count 502
Applied a total of 67 rules in 121 ms. Remains 581 /615 variables (removed 34) and now considering 502/535 (removed 33) transitions.
// Phase 1: matrix 502 rows 581 cols
[2025-05-30 14:01:16] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:01:17] [INFO ] Implicit Places using invariants in 598 ms returned []
[2025-05-30 14:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:01:20] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 3775 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2025-05-30 14:01: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/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 117 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:09] [INFO ] Deduced a trap composed of 74 places in 343 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:09] [INFO ] Deduced a trap composed of 74 places in 446 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:10] [INFO ] Deduced a trap composed of 74 places in 418 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:10] [INFO ] Deduced a trap composed of 74 places in 459 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:11] [INFO ] Deduced a trap composed of 74 places in 453 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:11] [INFO ] Deduced a trap composed of 74 places in 452 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:12] [INFO ] Deduced a trap composed of 74 places in 451 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:12] [INFO ] Deduced a trap composed of 74 places in 448 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:12] [INFO ] Deduced a trap composed of 74 places in 278 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:13] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:13] [INFO ] Deduced a trap composed of 74 places in 411 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:13] [INFO ] Deduced a trap composed of 74 places in 374 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:14] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:14] [INFO ] Deduced a trap composed of 74 places in 376 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:15] [INFO ] Deduced a trap composed of 74 places in 428 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:15] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:15] [INFO ] Deduced a trap composed of 39 places in 366 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:16] [INFO ] Deduced a trap composed of 74 places in 369 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:16] [INFO ] Deduced a trap composed of 74 places in 353 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:17] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 77 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:17] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:18] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:18] [INFO ] Deduced a trap composed of 75 places in 268 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:18] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:19] [INFO ] Deduced a trap composed of 75 places in 256 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:19] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:19] [INFO ] Deduced a trap composed of 75 places in 371 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:20] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:02:20] [INFO ] Deduced a trap composed of 74 places in 444 ms of which 94 ms to minimize.
SMT process timed out in 60339ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60341ms
Starting structural reductions in LTL mode, iteration 1 : 581/615 places, 502/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64240 ms. Remains : 581/615 places, 502/535 transitions.
[2025-05-30 14:02:20] [INFO ] Flatten gal took : 29 ms
[2025-05-30 14:02:20] [INFO ] Flatten gal took : 25 ms
[2025-05-30 14:02:20] [INFO ] Input system was already deterministic with 502 transitions.
[2025-05-30 14:02:20] [INFO ] Flatten gal took : 24 ms
[2025-05-30 14:02:21] [INFO ] Flatten gal took : 25 ms
[2025-05-30 14:02:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality427106750334358977.gal : 10 ms
[2025-05-30 14:02:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6050726399871852383.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/CTLCardinality427106750334358977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6050726399871852383.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 14:02:51] [INFO ] Flatten gal took : 14 ms
[2025-05-30 14:02:51] [INFO ] Applying decomposition
[2025-05-30 14:02:51] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13565952948270168929.txt' '-o' '/tmp/graph13565952948270168929.bin' '-w' '/tmp/graph13565952948270168929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13565952948270168929.bin' '-l' '-1' '-v' '-w' '/tmp/graph13565952948270168929.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:02:51] [INFO ] Decomposing Gal with order
[2025-05-30 14:02:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:02:51] [INFO ] Removed a total of 287 redundant transitions.
[2025-05-30 14:02:51] [INFO ] Flatten gal took : 35 ms
[2025-05-30 14:02:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 13 ms.
[2025-05-30 14:02:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6355452582559918769.gal : 8 ms
[2025-05-30 14:02:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13650641188616521242.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/CTLCardinality6355452582559918769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13650641188616521242.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24544e+33,5.15804,102256,10139,59,210656,756,1290,289222,65,1999,0


Converting to forward existential form...Done !
original formula: EF(((i20.i2.u175.p666==1) * AX(EG(!(A(((i3.i0.u11.p26==0)||(i15.u155.p579==1)) U ((i20.i1.u141.p493==0)||(i20.i1.u59.p203==1))))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i20.i2.u175.p666==1)) * !(EX(!(EG(!(!((E(!(((i20.i1.u141.p493==0)||(i20.i1.u59.p203==1))) ...327
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t29, t203, t287, t303, t311, t389, t392, t466, t470, t472, t474, t475, t477,...1582
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 590 transition count 511
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 585 transition count 506
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 585 transition count 506
Applied a total of 59 rules in 57 ms. Remains 585 /615 variables (removed 30) and now considering 506/535 (removed 29) transitions.
// Phase 1: matrix 506 rows 585 cols
[2025-05-30 14:03:21] [INFO ] Computed 117 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:03:22] [INFO ] Implicit Places using invariants in 857 ms returned []
[2025-05-30 14:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:03:25] [INFO ] Implicit Places using invariants and state equation in 3157 ms returned []
Implicit Place search using SMT with State Equation took 4019 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2025-05-30 14:03:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:50] [INFO ] Deduced a trap composed of 76 places in 444 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:50] [INFO ] Deduced a trap composed of 76 places in 428 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:51] [INFO ] Deduced a trap composed of 76 places in 257 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:51] [INFO ] Deduced a trap composed of 76 places in 320 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:51] [INFO ] Deduced a trap composed of 76 places in 324 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:52] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:52] [INFO ] Deduced a trap composed of 76 places in 265 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:52] [INFO ] Deduced a trap composed of 76 places in 256 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:53] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:53] [INFO ] Deduced a trap composed of 76 places in 269 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:53] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:54] [INFO ] Deduced a trap composed of 76 places in 318 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:54] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:54] [INFO ] Deduced a trap composed of 76 places in 305 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:55] [INFO ] Deduced a trap composed of 76 places in 243 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:55] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:03:55] [INFO ] Deduced a trap composed of 76 places in 423 ms of which 100 ms to minimize.
SMT process timed out in 30393ms, After SMT, problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 30397ms
Starting structural reductions in LTL mode, iteration 1 : 585/615 places, 506/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34482 ms. Remains : 585/615 places, 506/535 transitions.
[2025-05-30 14:03:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:03:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:03:55] [INFO ] Input system was already deterministic with 506 transitions.
[2025-05-30 14:03:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:03:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:03:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4884861159242398393.gal : 3 ms
[2025-05-30 14:03:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17311421885161052297.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/CTLCardinality4884861159242398393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17311421885161052297.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19451e+33,2.04474,55272,4678,66,111217,772,1296,189152,72,2107,0


Converting to forward existential form...Done !
original formula: (AG(((i12.i0.u154.p558==0) * (EX(((i14.u125.p410==0)&&(i17.i0.u61.p196==1))) + AF((i2.u172.p649==0))))) + EF(((EF((i18.u163.p612==0)) * (...248
=> equivalent forward existential formula: ([(FwdU((Init * !(E(TRUE U ((E(TRUE U (i18.u163.p612==0)) * (i18.u170.p640==0)) * E((i1.i0.u174.p657==1) U !(((i...494
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t206, t314, t392, t395, t469, t473, t475, t477, t478, t480, t483, t492, t501...1620
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
(forward)formula 0,1,9.74257,237544,1,0,491746,772,9350,917232,357,2107,1189927
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 591 transition count 512
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 591 transition count 512
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 584 transition count 505
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 581 transition count 502
Applied a total of 67 rules in 146 ms. Remains 581 /615 variables (removed 34) and now considering 502/535 (removed 33) transitions.
// Phase 1: matrix 502 rows 581 cols
[2025-05-30 14:04:36] [INFO ] Computed 117 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:04:37] [INFO ] Implicit Places using invariants in 851 ms returned []
[2025-05-30 14:04:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:04:39] [INFO ] Implicit Places using invariants and state equation in 2918 ms returned []
Implicit Place search using SMT with State Equation took 3771 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2025-05-30 14:04:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 117 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:29] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:29] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:29] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:30] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:30] [INFO ] Deduced a trap composed of 74 places in 277 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:30] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:30] [INFO ] Deduced a trap composed of 74 places in 272 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:31] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:31] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:31] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:32] [INFO ] Deduced a trap composed of 74 places in 251 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:32] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:32] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:32] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:33] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:33] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:33] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:33] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:34] [INFO ] Deduced a trap composed of 75 places in 253 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:34] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 50 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:35] [INFO ] Deduced a trap composed of 93 places in 294 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:35] [INFO ] Deduced a trap composed of 88 places in 281 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:35] [INFO ] Deduced a trap composed of 88 places in 269 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:36] [INFO ] Deduced a trap composed of 88 places in 274 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:36] [INFO ] Deduced a trap composed of 88 places in 289 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:36] [INFO ] Deduced a trap composed of 88 places in 296 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:37] [INFO ] Deduced a trap composed of 88 places in 488 ms of which 278 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:37] [INFO ] Deduced a trap composed of 88 places in 421 ms of which 201 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:38] [INFO ] Deduced a trap composed of 88 places in 430 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:38] [INFO ] Deduced a trap composed of 88 places in 615 ms of which 276 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:39] [INFO ] Deduced a trap composed of 88 places in 485 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:39] [INFO ] Deduced a trap composed of 88 places in 414 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:05:40] [INFO ] Deduced a trap composed of 88 places in 413 ms of which 88 ms to minimize.
SMT process timed out in 60177ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 581/615 places, 502/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64100 ms. Remains : 581/615 places, 502/535 transitions.
[2025-05-30 14:05:40] [INFO ] Flatten gal took : 21 ms
[2025-05-30 14:05:40] [INFO ] Flatten gal took : 22 ms
[2025-05-30 14:05:40] [INFO ] Input system was already deterministic with 502 transitions.
[2025-05-30 14:05:40] [INFO ] Flatten gal took : 21 ms
[2025-05-30 14:05:40] [INFO ] Flatten gal took : 21 ms
[2025-05-30 14:05:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13445647480013370371.gal : 6 ms
[2025-05-30 14:05:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality15057007940637578545.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/CTLCardinality13445647480013370371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15057007940637578545.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 14:06:10] [INFO ] Flatten gal took : 14 ms
[2025-05-30 14:06:10] [INFO ] Applying decomposition
[2025-05-30 14:06:10] [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/graph12061275761504193252.txt' '-o' '/tmp/graph12061275761504193252.bin' '-w' '/tmp/graph12061275761504193252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12061275761504193252.bin' '-l' '-1' '-v' '-w' '/tmp/graph12061275761504193252.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:06:10] [INFO ] Decomposing Gal with order
[2025-05-30 14:06:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:06:10] [INFO ] Removed a total of 290 redundant transitions.
[2025-05-30 14:06:10] [INFO ] Flatten gal took : 48 ms
[2025-05-30 14:06:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-05-30 14:06:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3792768029696086969.gal : 6 ms
[2025-05-30 14:06:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality5090181767068693430.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/CTLCardinality3792768029696086969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5090181767068693430.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 590 transition count 511
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 590 transition count 511
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 583 transition count 504
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 580 transition count 501
Applied a total of 69 rules in 116 ms. Remains 580 /615 variables (removed 35) and now considering 501/535 (removed 34) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 14:06:40] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:06:41] [INFO ] Implicit Places using invariants in 564 ms returned []
[2025-05-30 14:06:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:06:44] [INFO ] Implicit Places using invariants and state equation in 3207 ms returned []
Implicit Place search using SMT with State Equation took 3773 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 14:06: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/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 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 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:33] [INFO ] Deduced a trap composed of 76 places in 379 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:34] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:34] [INFO ] Deduced a trap composed of 76 places in 358 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:34] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:35] [INFO ] Deduced a trap composed of 76 places in 252 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:35] [INFO ] Deduced a trap composed of 97 places in 448 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:36] [INFO ] Deduced a trap composed of 97 places in 520 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:36] [INFO ] Deduced a trap composed of 97 places in 411 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:36] [INFO ] Deduced a trap composed of 97 places in 379 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:37] [INFO ] Deduced a trap composed of 97 places in 366 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:37] [INFO ] Deduced a trap composed of 76 places in 472 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:38] [INFO ] Deduced a trap composed of 76 places in 429 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:38] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:39] [INFO ] Deduced a trap composed of 76 places in 395 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:39] [INFO ] Deduced a trap composed of 76 places in 387 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:40] [INFO ] Deduced a trap composed of 76 places in 369 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:40] [INFO ] Deduced a trap composed of 76 places in 363 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:40] [INFO ] Deduced a trap composed of 76 places in 398 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:41] [INFO ] Deduced a trap composed of 76 places in 460 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:41] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 57 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 10 solved, 490 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:42] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:42] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:43] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:43] [INFO ] Deduced a trap composed of 75 places in 423 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:43] [INFO ] Deduced a trap composed of 75 places in 290 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:44] [INFO ] Deduced a trap composed of 75 places in 301 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:44] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:07:44] [INFO ] Deduced a trap composed of 75 places in 311 ms of which 95 ms to minimize.
SMT process timed out in 60222ms, After SMT, problems are : Problem set: 10 solved, 490 unsolved
Search for dead transitions found 10 dead transitions in 60225ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/615 places, 491/535 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64145 ms. Remains : 580/615 places, 491/535 transitions.
[2025-05-30 14:07:44] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:07:44] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:07:44] [INFO ] Input system was already deterministic with 491 transitions.
[2025-05-30 14:07:44] [INFO ] Flatten gal took : 19 ms
[2025-05-30 14:07:44] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:07:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15094752421053812525.gal : 7 ms
[2025-05-30 14:07:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3316453490258473261.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/CTLCardinality15094752421053812525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3316453490258473261.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26217e+33,3.47823,83580,6308,55,149256,741,1273,378596,59,2060,0


Converting to forward existential form...Done !
original formula: (EX(((E(((i18.u159.p569==0)||(i16.i1.u127.p404==1)) U (i17.i1.u119.p362==0)) + AX((i17.i1.u118.p355==0))) + (i17.i1.u118.p358==1))) * AX(...162
=> equivalent forward existential formula: ([(Init * !(EX(((E(((i18.u159.p569==0)||(i16.i1.u127.p404==1)) U (i17.i1.u119.p362==0)) + !(EX(!((i17.i1.u118.p3...237
(forward)formula 0,0,3.49578,83580,1,0,149256,741,1828,378596,68,2060,1897
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Graph (trivial) has 303 edges and 615 vertex of which 7 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1340 edges and 609 vertex of which 608 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 607 transition count 444
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 525 transition count 444
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 166 place count 525 transition count 320
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 439 place count 376 transition count 320
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 460 place count 355 transition count 299
Iterating global reduction 2 with 21 rules applied. Total rules applied 481 place count 355 transition count 299
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 481 place count 355 transition count 297
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 486 place count 352 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 487 place count 351 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 488 place count 351 transition count 296
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 788 place count 199 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 789 place count 198 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 790 place count 197 transition count 147
Applied a total of 790 rules in 108 ms. Remains 197 /615 variables (removed 418) and now considering 147/535 (removed 388) transitions.
// Phase 1: matrix 147 rows 197 cols
[2025-05-30 14:08:18] [INFO ] Computed 87 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:08:19] [INFO ] Implicit Places using invariants in 343 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 346 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 170/615 places, 147/535 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 465 ms. Remains : 170/615 places, 147/535 transitions.
[2025-05-30 14:08:19] [INFO ] Flatten gal took : 6 ms
[2025-05-30 14:08:19] [INFO ] Flatten gal took : 7 ms
[2025-05-30 14:08:19] [INFO ] Input system was already deterministic with 147 transitions.
[2025-05-30 14:08:19] [INFO ] Flatten gal took : 7 ms
[2025-05-30 14:08:19] [INFO ] Flatten gal took : 7 ms
[2025-05-30 14:08:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality7519697417559537596.gal : 1 ms
[2025-05-30 14:08:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2818656313222050606.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/CTLCardinality7519697417559537596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2818656313222050606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4737e+06,0.199877,9936,2,2873,5,17703,6,0,822,14261,0


Converting to forward existential form...Done !
original formula: AG(AF(((p640==0)||(p357==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p640==0)||(p357==1))))] = FALSE
Hit Full ! (commute/partial/dont) 144/3/3
(forward)formula 0,1,0.92477,29508,1,0,8,100109,20,2,4725,28894,8
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Graph (trivial) has 301 edges and 615 vertex of which 7 / 615 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1340 edges and 609 vertex of which 607 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 606 transition count 447
Reduce places removed 79 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 82 rules applied. Total rules applied 163 place count 527 transition count 444
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 166 place count 524 transition count 444
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 166 place count 524 transition count 322
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 269 rules applied. Total rules applied 435 place count 377 transition count 322
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 457 place count 355 transition count 300
Iterating global reduction 3 with 22 rules applied. Total rules applied 479 place count 355 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 479 place count 355 transition count 298
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 484 place count 352 transition count 298
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 485 place count 351 transition count 297
Iterating global reduction 3 with 1 rules applied. Total rules applied 486 place count 351 transition count 297
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 784 place count 200 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 785 place count 199 transition count 149
Applied a total of 785 rules in 94 ms. Remains 199 /615 variables (removed 416) and now considering 149/535 (removed 386) transitions.
// Phase 1: matrix 149 rows 199 cols
[2025-05-30 14:08:20] [INFO ] Computed 87 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:08:20] [INFO ] Implicit Places using invariants in 339 ms returned [0, 1, 2, 3, 4, 13, 14, 15, 16, 17, 18, 22, 23, 24, 25, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 340 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 172/615 places, 149/535 transitions.
Applied a total of 0 rules in 8 ms. Remains 172 /172 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 442 ms. Remains : 172/615 places, 149/535 transitions.
[2025-05-30 14:08:20] [INFO ] Flatten gal took : 6 ms
[2025-05-30 14:08:20] [INFO ] Flatten gal took : 7 ms
[2025-05-30 14:08:20] [INFO ] Input system was already deterministic with 149 transitions.
[2025-05-30 14:08:20] [INFO ] Flatten gal took : 6 ms
[2025-05-30 14:08:20] [INFO ] Flatten gal took : 6 ms
[2025-05-30 14:08:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality520104274028321478.gal : 1 ms
[2025-05-30 14:08:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6835991792628334640.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/CTLCardinality520104274028321478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6835991792628334640.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.47667e+06,0.280932,13524,2,2548,5,28235,6,0,835,23288,0


Converting to forward existential form...Done !
original formula: EF(AG((((p88==0)||(p764==1))||((p177==0)||(p310==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p88==0)||(p764==1))||((p177==0)||(p310==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t37, t38, t39, t40, t74, t75, t76, t77, t78, t92, t93, t116, t117, t118, t119, t120, t121...275
(forward)formula 0,1,1.4441,41552,1,0,202,171052,283,109,6021,94919,279
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 588 transition count 509
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 588 transition count 509
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 581 transition count 502
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 579 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 579 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 578 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 578 transition count 499
Applied a total of 73 rules in 103 ms. Remains 578 /615 variables (removed 37) and now considering 499/535 (removed 36) transitions.
// Phase 1: matrix 499 rows 578 cols
[2025-05-30 14:08:22] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:08:22] [INFO ] Implicit Places using invariants in 545 ms returned []
[2025-05-30 14:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:08:25] [INFO ] Implicit Places using invariants and state equation in 3109 ms returned []
Implicit Place search using SMT with State Equation took 3656 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-05-30 14:08:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:49] [INFO ] Deduced a trap composed of 74 places in 266 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:50] [INFO ] Deduced a trap composed of 93 places in 609 ms of which 402 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:50] [INFO ] Deduced a trap composed of 93 places in 267 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:50] [INFO ] Deduced a trap composed of 93 places in 383 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:51] [INFO ] Deduced a trap composed of 93 places in 351 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:53] [INFO ] Deduced a trap composed of 93 places in 1979 ms of which 1770 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:53] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:53] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:54] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:54] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:54] [INFO ] Deduced a trap composed of 74 places in 338 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:55] [INFO ] Deduced a trap composed of 74 places in 441 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:55] [INFO ] Deduced a trap composed of 74 places in 430 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:08:56] [INFO ] Deduced a trap composed of 74 places in 436 ms of which 91 ms to minimize.
SMT process timed out in 30311ms, After SMT, problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 30313ms
Starting structural reductions in LTL mode, iteration 1 : 578/615 places, 499/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34074 ms. Remains : 578/615 places, 499/535 transitions.
[2025-05-30 14:08:56] [INFO ] Flatten gal took : 21 ms
[2025-05-30 14:08:56] [INFO ] Flatten gal took : 22 ms
[2025-05-30 14:08:56] [INFO ] Input system was already deterministic with 499 transitions.
[2025-05-30 14:08:56] [INFO ] Flatten gal took : 29 ms
[2025-05-30 14:08:56] [INFO ] Flatten gal took : 22 ms
[2025-05-30 14:08:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7999954682828100171.gal : 4 ms
[2025-05-30 14:08:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9197052196036061462.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/CTLCardinality7999954682828100171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9197052196036061462.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,1.97814,46328,5034,65,86384,761,1292,161422,72,1895,0


Converting to forward existential form...Done !
original formula: (EF(AG(AX(((i5.i1.u119.p368==0)&&(i3.i1.u172.p648==1))))) * EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * E(TRUE U !(E(TRUE U !(!(EX(!(((i5.i1.u119.p368==0)&&(i3.i1.u172.p648==1))))))))))) * TRUE)] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t200, t284, t300, t304, t308, t341, t386, t389, t462, t467, t469, t471, t474...1587
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 593 transition count 514
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 593 transition count 514
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 586 transition count 507
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 585 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 584 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 583 transition count 504
Applied a total of 63 rules in 164 ms. Remains 583 /615 variables (removed 32) and now considering 504/535 (removed 31) transitions.
// Phase 1: matrix 504 rows 583 cols
[2025-05-30 14:09:56] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:09:57] [INFO ] Implicit Places using invariants in 599 ms returned []
[2025-05-30 14:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:10:00] [INFO ] Implicit Places using invariants and state equation in 2942 ms returned []
Implicit Place search using SMT with State Equation took 3547 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2025-05-30 14:10:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1087 variables, and 117 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:47] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:47] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:48] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:48] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:49] [INFO ] Deduced a trap composed of 76 places in 424 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:49] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:50] [INFO ] Deduced a trap composed of 76 places in 359 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:50] [INFO ] Deduced a trap composed of 76 places in 334 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:50] [INFO ] Deduced a trap composed of 96 places in 407 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:51] [INFO ] Deduced a trap composed of 96 places in 450 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:51] [INFO ] Deduced a trap composed of 96 places in 429 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:52] [INFO ] Deduced a trap composed of 96 places in 437 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:52] [INFO ] Deduced a trap composed of 75 places in 440 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:53] [INFO ] Deduced a trap composed of 75 places in 429 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:53] [INFO ] Deduced a trap composed of 75 places in 434 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:54] [INFO ] Deduced a trap composed of 75 places in 429 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:54] [INFO ] Deduced a trap composed of 75 places in 436 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:55] [INFO ] Deduced a trap composed of 75 places in 433 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:55] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:56] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 90 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:56] [INFO ] Deduced a trap composed of 77 places in 255 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:57] [INFO ] Deduced a trap composed of 77 places in 344 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:57] [INFO ] Deduced a trap composed of 77 places in 429 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:58] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:58] [INFO ] Deduced a trap composed of 77 places in 406 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:59] [INFO ] Deduced a trap composed of 77 places in 408 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:10:59] [INFO ] Deduced a trap composed of 77 places in 422 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:11:00] [INFO ] Deduced a trap composed of 76 places in 426 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:11:00] [INFO ] Deduced a trap composed of 76 places in 434 ms of which 95 ms to minimize.
SMT process timed out in 60107ms, After SMT, problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 583/615 places, 504/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63822 ms. Remains : 583/615 places, 504/535 transitions.
[2025-05-30 14:11:00] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:11:00] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:11:00] [INFO ] Input system was already deterministic with 504 transitions.
[2025-05-30 14:11:00] [INFO ] Flatten gal took : 20 ms
[2025-05-30 14:11:00] [INFO ] Flatten gal took : 21 ms
[2025-05-30 14:11:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality15075975188325755227.gal : 4 ms
[2025-05-30 14:11:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1632764360970637128.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/CTLCardinality15075975188325755227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1632764360970637128.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 14:11:30] [INFO ] Flatten gal took : 12 ms
[2025-05-30 14:11:30] [INFO ] Applying decomposition
[2025-05-30 14:11:30] [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/graph184985652004648723.txt' '-o' '/tmp/graph184985652004648723.bin' '-w' '/tmp/graph184985652004648723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph184985652004648723.bin' '-l' '-1' '-v' '-w' '/tmp/graph184985652004648723.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:11:30] [INFO ] Decomposing Gal with order
[2025-05-30 14:11:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:11:30] [INFO ] Removed a total of 294 redundant transitions.
[2025-05-30 14:11:30] [INFO ] Flatten gal took : 41 ms
[2025-05-30 14:11:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-05-30 14:11:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10834650348775132880.gal : 9 ms
[2025-05-30 14:11:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15406345208319253663.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/CTLCardinality10834650348775132880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15406345208319253663.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.4246e+33,2.66492,56292,4919,49,111485,699,1284,163464,62,1701,0


Converting to forward existential form...Done !
original formula: (E(E((!(E((i20.u160.p561==1) U (i9.i0.u198.p750==1))) * EF(((i17.i2.u130.p414==0)||(i2.u49.p150==1)))) U EF(EX((i10.i1.u102.p321==0)))) U...391
=> equivalent forward existential formula: ([(FwdU(Init,E((!(E((i20.u160.p561==1) U (i9.i0.u198.p750==1))) * E(TRUE U ((i17.i2.u130.p414==0)||(i2.u49.p150=...566
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t203, t309, t317, t346, t391, t394, t467, t468, t472, t474, t476, t477, t481...1613
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Graph (trivial) has 303 edges and 615 vertex of which 7 / 615 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1340 edges and 609 vertex of which 607 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 606 transition count 444
Reduce places removed 82 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 524 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 523 transition count 443
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 168 place count 523 transition count 320
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 438 place count 376 transition count 320
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 460 place count 354 transition count 298
Iterating global reduction 3 with 22 rules applied. Total rules applied 482 place count 354 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 482 place count 354 transition count 296
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 487 place count 351 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 488 place count 350 transition count 295
Iterating global reduction 3 with 1 rules applied. Total rules applied 489 place count 350 transition count 295
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 783 place count 201 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 784 place count 200 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 785 place count 199 transition count 149
Applied a total of 785 rules in 135 ms. Remains 199 /615 variables (removed 416) and now considering 149/535 (removed 386) transitions.
// Phase 1: matrix 149 rows 199 cols
[2025-05-30 14:12:01] [INFO ] Computed 87 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:12:01] [INFO ] Implicit Places using invariants in 354 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 17, 18, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 358 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 172/615 places, 149/535 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 500 ms. Remains : 172/615 places, 149/535 transitions.
[2025-05-30 14:12:01] [INFO ] Flatten gal took : 5 ms
[2025-05-30 14:12:01] [INFO ] Flatten gal took : 5 ms
[2025-05-30 14:12:01] [INFO ] Input system was already deterministic with 149 transitions.
[2025-05-30 14:12:01] [INFO ] Flatten gal took : 7 ms
[2025-05-30 14:12:01] [INFO ] Flatten gal took : 6 ms
[2025-05-30 14:12:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2309735359363420512.gal : 1 ms
[2025-05-30 14:12:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4828265445531999796.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/CTLCardinality2309735359363420512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4828265445531999796.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,2.80771e+06,0.32646,9684,2,2783,5,16606,6,0,835,13684,0


Converting to forward existential form...Done !
original formula: EF(((p114==1) + EG(((p648==0)&&(p350==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p114==1))] != FALSE + [FwdG(FwdU(Init,TRUE),((p648==0)&&(p350==1)))] != FALSE)
(forward)formula 0,1,0.328277,10068,1,0,7,16606,8,1,838,13684,1
FORMULA BusinessProcesses-PT-19-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 593 transition count 514
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 593 transition count 514
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 588 transition count 509
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 588 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 587 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 587 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 586 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 585 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 585 transition count 506
Applied a total of 59 rules in 124 ms. Remains 585 /615 variables (removed 30) and now considering 506/535 (removed 29) transitions.
// Phase 1: matrix 506 rows 585 cols
[2025-05-30 14:12:01] [INFO ] Computed 117 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:12:02] [INFO ] Implicit Places using invariants in 617 ms returned []
[2025-05-30 14:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:12:05] [INFO ] Implicit Places using invariants and state equation in 2668 ms returned []
Implicit Place search using SMT with State Equation took 3288 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2025-05-30 14:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:31] [INFO ] Deduced a trap composed of 76 places in 254 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:31] [INFO ] Deduced a trap composed of 97 places in 243 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:32] [INFO ] Deduced a trap composed of 97 places in 250 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:32] [INFO ] Deduced a trap composed of 97 places in 243 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:32] [INFO ] Deduced a trap composed of 97 places in 252 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:32] [INFO ] Deduced a trap composed of 97 places in 272 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:33] [INFO ] Deduced a trap composed of 97 places in 241 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:33] [INFO ] Deduced a trap composed of 97 places in 256 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:33] [INFO ] Deduced a trap composed of 97 places in 256 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:33] [INFO ] Deduced a trap composed of 97 places in 246 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:34] [INFO ] Deduced a trap composed of 97 places in 266 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:34] [INFO ] Deduced a trap composed of 97 places in 239 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:34] [INFO ] Deduced a trap composed of 97 places in 248 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:35] [INFO ] Deduced a trap composed of 76 places in 241 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:35] [INFO ] Deduced a trap composed of 97 places in 243 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:12:35] [INFO ] Deduced a trap composed of 97 places in 247 ms of which 59 ms to minimize.
SMT process timed out in 30345ms, After SMT, problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 30348ms
Starting structural reductions in LTL mode, iteration 1 : 585/615 places, 506/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33762 ms. Remains : 585/615 places, 506/535 transitions.
[2025-05-30 14:12:35] [INFO ] Flatten gal took : 11 ms
[2025-05-30 14:12:35] [INFO ] Flatten gal took : 12 ms
[2025-05-30 14:12:35] [INFO ] Input system was already deterministic with 506 transitions.
[2025-05-30 14:12:35] [INFO ] Flatten gal took : 12 ms
[2025-05-30 14:12:35] [INFO ] Flatten gal took : 18 ms
[2025-05-30 14:12:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality17054708390689395256.gal : 2 ms
[2025-05-30 14:12:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality12911491195446327459.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/CTLCardinality17054708390689395256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12911491195446327459.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 14:13:05] [INFO ] Flatten gal took : 12 ms
[2025-05-30 14:13:05] [INFO ] Applying decomposition
[2025-05-30 14:13: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/graph3886167141738107765.txt' '-o' '/tmp/graph3886167141738107765.bin' '-w' '/tmp/graph3886167141738107765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3886167141738107765.bin' '-l' '-1' '-v' '-w' '/tmp/graph3886167141738107765.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:13:05] [INFO ] Decomposing Gal with order
[2025-05-30 14:13:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:13:05] [INFO ] Removed a total of 288 redundant transitions.
[2025-05-30 14:13:05] [INFO ] Flatten gal took : 26 ms
[2025-05-30 14:13:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2025-05-30 14:13:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality14880077260764738150.gal : 9 ms
[2025-05-30 14:13:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17123895071454096875.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/CTLCardinality14880077260764738150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17123895071454096875.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.24521e+33,3.92703,96332,6395,71,192466,872,1104,377381,72,1984,0


Converting to forward existential form...Done !
original formula: (AG(EX(((EF((i19.i0.i0.u85.p249==0)) * (i19.i1.i1.u190.p702==0)) * EX(((i19.i1.i1.u189.p696==0)&&(i6.u22.p58==1)))))) + AG(EX(((EX((i13.u...279
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(EX(((E(TRUE U (i19.i0.i0.u85.p249==0)) * (i19.i1.i1.u190.p702==0)) * EX(((i19.i1.i...354
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t204, t289, t307, t311, t315, t396, t469, t470, t474, t476, t479, t481, t483...1499
(forward)formula 0,0,17.3293,393036,1,0,794029,1162,9573,1.68704e+06,399,3151,1754280
FORMULA BusinessProcesses-PT-19-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 535/535 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 614 transition count 535
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 589 transition count 510
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 589 transition count 510
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 582 transition count 503
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 579 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 579 transition count 500
Applied a total of 71 rules in 106 ms. Remains 579 /615 variables (removed 36) and now considering 500/535 (removed 35) transitions.
// Phase 1: matrix 500 rows 579 cols
[2025-05-30 14:13:23] [INFO ] Computed 117 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:13:23] [INFO ] Implicit Places using invariants in 597 ms returned []
[2025-05-30 14:13:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:13:26] [INFO ] Implicit Places using invariants and state equation in 2717 ms returned []
Implicit Place search using SMT with State Equation took 3316 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 14:13:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:13:55] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:13:55] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:13:56] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:13:56] [INFO ] Deduced a trap composed of 74 places in 263 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:13:56] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 14:13:57] [INFO ] Deduced a trap composed of 74 places in 260 ms of which 58 ms to minimize.
SMT process timed out in 30314ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 30315ms
Starting structural reductions in LTL mode, iteration 1 : 579/615 places, 500/535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33739 ms. Remains : 579/615 places, 500/535 transitions.
[2025-05-30 14:13:57] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:13:57] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:13:57] [INFO ] Input system was already deterministic with 500 transitions.
[2025-05-30 14:13:57] [INFO ] Flatten gal took : 12 ms
[2025-05-30 14:13:57] [INFO ] Flatten gal took : 17 ms
[2025-05-30 14:13:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16614032924054962665.gal : 2 ms
[2025-05-30 14:13:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality17907790585291347144.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/CTLCardinality16614032924054962665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17907790585291347144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24529e+33,2.67362,65340,5387,78,110343,896,1280,293861,80,2211,0


Converting to forward existential form...Done !
original formula: AF(AG(EX(EF((i20.i1.u154.p664==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX(E(TRUE U (i20.i1.u154.p664==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t201, t285, t301, t313, t342, t387, t390, t463, t464, t468, t470, t472, t473, t47...1599
Detected timeout of ITS tools.
[2025-05-30 14:14:57] [INFO ] Flatten gal took : 23 ms
[2025-05-30 14:14:57] [INFO ] Flatten gal took : 22 ms
[2025-05-30 14:14:57] [INFO ] Applying decomposition
[2025-05-30 14:14:57] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4932092876371690433.txt' '-o' '/tmp/graph4932092876371690433.bin' '-w' '/tmp/graph4932092876371690433.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4932092876371690433.bin' '-l' '-1' '-v' '-w' '/tmp/graph4932092876371690433.weights' '-q' '0' '-e' '0.001'
[2025-05-30 14:14:57] [INFO ] Decomposing Gal with order
[2025-05-30 14:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:14:57] [INFO ] Removed a total of 292 redundant transitions.
[2025-05-30 14:14:57] [INFO ] Flatten gal took : 43 ms
[2025-05-30 14:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2025-05-30 14:14:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3672785046145757911.gal : 10 ms
[2025-05-30 14:14:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6476382297372306165.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/CTLCardinality3672785046145757911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6476382297372306165.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7446e+33,17.1772,292248,20976,89,448232,1336,1369,930063,83,5627,0


Converting to forward existential form...Done !
original formula: EF(AG(AX(((EG((i4.i0.u61.p179==1)) * ((i11.i1.u116.p347==0)||(i1.i0.u15.p32==1))) * (((i8.i0.u91.p271==0)||(i8.i2.u164.p540==1))&&(((i17....218
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((EG((i4.i0.u61.p179==1)) * ((i11.i1.u116.p347==0)||(i1.i0.u15.p32==1)))...288
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t32, t227, t315, t331, t339, t347, t424, t502, t504, t507, t512, t521, i0.u93.t238, i...1890
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,216.463,2209988,1,0,3.73241e+06,1336,4037,5.49984e+06,198,5627,3467777
FORMULA BusinessProcesses-PT-19-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(((i4.i1.u68.p204==1) * ((i13.i2.u124.p371==1) + ((EX((i14.i1.u45.p128==1)) * (i19.u201.p697==1)) * ((i9.i0.u34.p90==0)||(i14.i1.u44.p...257
=> equivalent forward existential formula: ([(EY((Init * !(EG(!(EX(!((E(TRUE U (i8.i3.u163.p536==1)) * (!(EX(!((i1.i0.u37.p100==1)))) + (i16.i0.u189.p652==...800
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-05-30 14:27:47] [INFO ] Applying decomposition
[2025-05-30 14:27:47] [INFO ] Flatten gal took : 13 ms
[2025-05-30 14:27:47] [INFO ] Decomposing Gal with order
[2025-05-30 14:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:27:47] [INFO ] Removed a total of 136 redundant transitions.
[2025-05-30 14:27:47] [INFO ] Flatten gal took : 30 ms
[2025-05-30 14:27:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 193 ms.
[2025-05-30 14:27:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10778695809640131230.gal : 9 ms
[2025-05-30 14:27:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17617568171616142788.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/CTLCardinality10778695809640131230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17617568171616142788.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 6 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 14:54:07] [INFO ] Flatten gal took : 793 ms
[2025-05-30 14:54:10] [INFO ] Input system was already deterministic with 535 transitions.
[2025-05-30 14:54:10] [INFO ] Transformed 615 places.
[2025-05-30 14:54:11] [INFO ] Transformed 535 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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 14:54:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4557646764662449955.gal : 11 ms
[2025-05-30 14:54:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality11811139276719984036.ctl : 17 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/CTLCardinality4557646764662449955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11811139276719984036.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-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 BusinessProcesses-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 r030-smll-174853813400145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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