About the Execution of ITS-Tools for CO4-PT-15
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 | TFTFFFTFT?TFFTT? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028500489.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CO4-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028500489
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-15-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748607550092
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 12:19:11] [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 12:19:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:19:11] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-05-30 12:19:11] [INFO ] Transformed 833 places.
[2025-05-30 12:19:11] [INFO ] Transformed 1106 transitions.
[2025-05-30 12:19:11] [INFO ] Found NUPN structural information;
[2025-05-30 12:19:11] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-15-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 693 transition count 907
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 169 place count 542 transition count 754
Iterating global reduction 1 with 151 rules applied. Total rules applied 320 place count 542 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 323 place count 542 transition count 751
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 389 place count 476 transition count 676
Iterating global reduction 2 with 66 rules applied. Total rules applied 455 place count 476 transition count 676
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 457 place count 476 transition count 674
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 467 place count 466 transition count 660
Iterating global reduction 3 with 10 rules applied. Total rules applied 477 place count 466 transition count 660
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 479 place count 466 transition count 658
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 482 place count 463 transition count 655
Iterating global reduction 4 with 3 rules applied. Total rules applied 485 place count 463 transition count 655
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 488 place count 460 transition count 652
Iterating global reduction 4 with 3 rules applied. Total rules applied 491 place count 460 transition count 652
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 494 place count 460 transition count 649
Applied a total of 494 rules in 169 ms. Remains 460 /709 variables (removed 249) and now considering 649/909 (removed 260) transitions.
// Phase 1: matrix 649 rows 460 cols
[2025-05-30 12:19:11] [INFO ] Computed 8 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:12] [INFO ] Implicit Places using invariants in 354 ms returned [5, 381]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 385 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/709 places, 649/909 transitions.
Applied a total of 0 rules in 11 ms. Remains 458 /458 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 579 ms. Remains : 458/709 places, 649/909 transitions.
Support contains 58 out of 458 places after structural reductions.
[2025-05-30 12:19:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:19:12] [INFO ] Flatten gal took : 67 ms
[2025-05-30 12:19:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-15-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:19:12] [INFO ] Flatten gal took : 36 ms
[2025-05-30 12:19:12] [INFO ] Input system was already deterministic with 649 transitions.
Support contains 52 out of 458 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (900 resets) in 1850 ms. (21 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (14 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (12 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (14 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (14 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
// Phase 1: matrix 649 rows 458 cols
[2025-05-30 12:19:13] [INFO ] Computed 6 invariants in 5 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 205/243 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 4/247 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 385/632 variables, 247/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 263/895 variables, 85/338 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/895 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 174/1069 variables, 99/437 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1069 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 32/1101 variables, 23/460 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1101 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 5/1106 variables, 3/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1106 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 1/1107 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1107 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/1107 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 464 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 458/458 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 205/243 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 4/247 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 385/632 variables, 247/253 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 263/895 variables, 85/344 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/895 variables, 13/357 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/895 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 174/1069 variables, 99/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1069 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 32/1101 variables, 23/479 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1101 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 5/1106 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1106/1107 variables, and 482 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 457/458 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7799ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 437 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 941 edges and 457 vertex of which 453 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 453 transition count 479
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 160 rules applied. Total rules applied 323 place count 300 transition count 472
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 329 place count 294 transition count 472
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 329 place count 294 transition count 435
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 403 place count 257 transition count 435
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 406 place count 254 transition count 432
Iterating global reduction 3 with 3 rules applied. Total rules applied 409 place count 254 transition count 432
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 411 place count 252 transition count 430
Iterating global reduction 3 with 2 rules applied. Total rules applied 413 place count 252 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 252 transition count 429
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 415 place count 251 transition count 428
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 251 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 417 place count 251 transition count 427
Performed 63 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 543 place count 188 transition count 347
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 552 place count 188 transition count 338
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 554 place count 186 transition count 334
Iterating global reduction 6 with 2 rules applied. Total rules applied 556 place count 186 transition count 334
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 628 place count 150 transition count 378
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 639 place count 150 transition count 367
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 659 place count 130 transition count 287
Iterating global reduction 7 with 20 rules applied. Total rules applied 679 place count 130 transition count 287
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 686 place count 130 transition count 280
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 689 place count 127 transition count 266
Iterating global reduction 8 with 3 rules applied. Total rules applied 692 place count 127 transition count 266
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 694 place count 126 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 697 place count 126 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 719 place count 126 transition count 254
Free-agglomeration rule applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 749 place count 126 transition count 224
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 781 place count 96 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 786 place count 96 transition count 217
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 787 place count 96 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 788 place count 95 transition count 217
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 794 place count 95 transition count 217
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 795 place count 95 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 796 place count 94 transition count 216
Applied a total of 796 rules in 165 ms. Remains 94 /458 variables (removed 364) and now considering 216/649 (removed 433) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 94/458 places, 216/649 transitions.
RANDOM walk for 38303 steps (1599 resets) in 505 ms. (75 steps per ms) remains 0/19 properties
[2025-05-30 12:19:21] [INFO ] Flatten gal took : 27 ms
[2025-05-30 12:19:21] [INFO ] Flatten gal took : 25 ms
[2025-05-30 12:19:21] [INFO ] Input system was already deterministic with 649 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 943 edges and 458 vertex of which 450 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 454 transition count 648
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 31 place count 428 transition count 620
Iterating global reduction 1 with 26 rules applied. Total rules applied 57 place count 428 transition count 620
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 428 transition count 615
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 75 place count 415 transition count 601
Iterating global reduction 2 with 13 rules applied. Total rules applied 88 place count 415 transition count 601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 415 transition count 600
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 95 place count 409 transition count 590
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 409 transition count 590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 409 transition count 589
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 405 transition count 585
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 405 transition count 585
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 404 transition count 584
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 404 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 404 transition count 583
Applied a total of 113 rules in 57 ms. Remains 404 /458 variables (removed 54) and now considering 583/649 (removed 66) transitions.
// Phase 1: matrix 583 rows 404 cols
[2025-05-30 12:19:21] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:21] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 12:19:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:22] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2025-05-30 12:19:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/987 variables, 404/410 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:46] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:19:46] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 412 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (OVERLAPS) 583/987 variables, 404/412 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 582/994 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:21] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in LTL mode, iteration 1 : 404/458 places, 583/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 404/458 places, 583/649 transitions.
[2025-05-30 12:20:22] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:20:22] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:20:22] [INFO ] Input system was already deterministic with 583 transitions.
[2025-05-30 12:20:22] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:20:22] [INFO ] Flatten gal took : 18 ms
[2025-05-30 12:20:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12410933961162913313.gal : 12 ms
[2025-05-30 12:20:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4550245108899516933.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12410933961162913313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4550245108899516933.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.35617e+11,4.78555,146520,2,17892,5,443398,6,0,2192,665792,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:20:52] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:20:52] [INFO ] Applying decomposition
[2025-05-30 12:20:52] [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/graph13785631152372271500.txt' '-o' '/tmp/graph13785631152372271500.bin' '-w' '/tmp/graph13785631152372271500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13785631152372271500.bin' '-l' '-1' '-v' '-w' '/tmp/graph13785631152372271500.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:20:52] [INFO ] Decomposing Gal with order
[2025-05-30 12:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:20:52] [INFO ] Removed a total of 384 redundant transitions.
[2025-05-30 12:20:52] [INFO ] Flatten gal took : 67 ms
[2025-05-30 12:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 13 ms.
[2025-05-30 12:20:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5026682156872336788.gal : 9 ms
[2025-05-30 12:20:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality11465188161443552450.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/CTLCardinality5026682156872336788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11465188161443552450.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.35617e+11,0.335979,18640,1308,63,27779,700,989,62721,80,2566,0
Converting to forward existential form...Done !
original formula: (EF(AX(AG(((i19.u136.p769==0)&&(i19.u126.p714==1))))) * (EX(!(E((i6.u51.p351==1) U (i10.u100.p579==0)))) + AG(((i12.u99.p578==0)||(i0.u35...168
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(!(E(TRUE U !(((i19.u136.p769==0)&&(i19.u126.p714==1)))))))))))] = FALSE * [(FwdU((In...271
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t49, t77, t109, t135, t145, t161, t192, t197, t214, t281, t310, t369, t379, t47...922
(forward)formula 0,0,1.73333,83024,1,0,155690,1086,7287,347613,400,4457,499978
FORMULA CO4-PT-15-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 454 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 427 transition count 620
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 427 transition count 620
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 427 transition count 615
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 78 place count 413 transition count 600
Iterating global reduction 2 with 14 rules applied. Total rules applied 92 place count 413 transition count 600
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 413 transition count 598
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 408 transition count 589
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 408 transition count 589
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 404 transition count 585
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 404 transition count 585
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 403 transition count 584
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 403 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 403 transition count 583
Applied a total of 115 rules in 61 ms. Remains 403 /458 variables (removed 55) and now considering 583/649 (removed 66) transitions.
// Phase 1: matrix 583 rows 403 cols
[2025-05-30 12:20:54] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-30 12:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2025-05-30 12:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/986 variables, 403/408 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:18] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:18] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:19] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:19] [INFO ] Deduced a trap composed of 152 places in 105 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 412 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/403 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 5 (OVERLAPS) 583/986 variables, 403/413 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/986 variables, 582/995 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 995 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Starting structural reductions in LTL mode, iteration 1 : 403/458 places, 583/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60528 ms. Remains : 403/458 places, 583/649 transitions.
[2025-05-30 12:21:55] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:21:55] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:21:55] [INFO ] Input system was already deterministic with 583 transitions.
[2025-05-30 12:21:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:21:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:21:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17174072715296491374.gal : 2 ms
[2025-05-30 12:21:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17093853062056892224.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/CTLCardinality17174072715296491374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17093853062056892224.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.31122e+11,4.24213,125036,2,15673,5,395438,6,0,2188,558143,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:22:25] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:22:25] [INFO ] Applying decomposition
[2025-05-30 12:22:25] [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/graph8939011452089002397.txt' '-o' '/tmp/graph8939011452089002397.bin' '-w' '/tmp/graph8939011452089002397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8939011452089002397.bin' '-l' '-1' '-v' '-w' '/tmp/graph8939011452089002397.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:22:25] [INFO ] Decomposing Gal with order
[2025-05-30 12:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:22:25] [INFO ] Removed a total of 387 redundant transitions.
[2025-05-30 12:22:25] [INFO ] Flatten gal took : 47 ms
[2025-05-30 12:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 9 ms.
[2025-05-30 12:22:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality13164448558433883583.gal : 5 ms
[2025-05-30 12:22:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2996389557225265078.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/CTLCardinality13164448558433883583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2996389557225265078.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.31122e+11,1.89714,65260,1980,87,101906,1534,1093,451147,87,9227,0
Converting to forward existential form...Done !
original formula: A(!(AG(AX(EF(((i18.u144.p800==0)||(i16.u137.p749==1)))))) U (i16.u131.p685==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i16.u131.p685==1))))) * !(E(!((i16.u131.p685==1)) U (!(!(!(E(TRUE U !(!(EX(!(E(TRUE U ((i18.u1...234
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t79, t137, t147, t186, t216, t234, t244, t268, t283, t311, t393, t419, t473, t527, t...953
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 454 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 28 place count 431 transition count 624
Iterating global reduction 1 with 23 rules applied. Total rules applied 51 place count 431 transition count 624
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 431 transition count 619
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 69 place count 418 transition count 605
Iterating global reduction 2 with 13 rules applied. Total rules applied 82 place count 418 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 418 transition count 603
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 414 transition count 596
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 414 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 414 transition count 595
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 96 place count 411 transition count 592
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 411 transition count 592
Applied a total of 99 rules in 34 ms. Remains 411 /458 variables (removed 47) and now considering 592/649 (removed 57) transitions.
// Phase 1: matrix 592 rows 411 cols
[2025-05-30 12:22:55] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 12:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:55] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 591 sub problems to find dead transitions.
[2025-05-30 12:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/1003 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:20] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:20] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1003 variables, and 419 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 4 (OVERLAPS) 592/1003 variables, 411/419 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1003 variables, 591/1010 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1003 variables, and 1010 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/411 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 411/458 places, 592/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60531 ms. Remains : 411/458 places, 592/649 transitions.
[2025-05-30 12:23:56] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:23:56] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:23:56] [INFO ] Input system was already deterministic with 592 transitions.
[2025-05-30 12:23:56] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:23:56] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:23:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality5876475796719862376.gal : 2 ms
[2025-05-30 12:23:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1552913617218974258.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/CTLCardinality5876475796719862376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1552913617218974258.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.46491e+11,4.06818,119224,2,15289,5,379823,6,0,2229,529634,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:24:26] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:24:26] [INFO ] Applying decomposition
[2025-05-30 12:24:26] [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/graph3001855361734949860.txt' '-o' '/tmp/graph3001855361734949860.bin' '-w' '/tmp/graph3001855361734949860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3001855361734949860.bin' '-l' '-1' '-v' '-w' '/tmp/graph3001855361734949860.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:24:26] [INFO ] Decomposing Gal with order
[2025-05-30 12:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:24:26] [INFO ] Removed a total of 387 redundant transitions.
[2025-05-30 12:24:26] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2025-05-30 12:24:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2036297336010993260.gal : 3 ms
[2025-05-30 12:24:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2989421901998931061.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/CTLCardinality2036297336010993260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2989421901998931061.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.46491e+11,3.87843,152484,2903,70,301290,1234,1048,1.01926e+06,79,7935,0
Converting to forward existential form...Done !
original formula: EF((EG((i7.u77.p446==1)) * (AX((EX(TRUE) + AF((i1.u51.p141==1)))) + (AX(((i17.u134.p690==0)&&(i17.u132.p701==1))) * (AF((i8.u81.p463==0))...205
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EG((i7.u77.p446==1))) * !(EX(!((EX(TRUE) + !(EG(!((i1.u51.p141==1)))))))))] != FALSE + ([(...448
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t81, t139, t149, t188, t219, t237, t271, t286, t314, t396, t423, t477, t533, t564, t...908
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 454 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 427 transition count 619
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 427 transition count 619
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 427 transition count 614
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 79 place count 412 transition count 598
Iterating global reduction 2 with 15 rules applied. Total rules applied 94 place count 412 transition count 598
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 412 transition count 596
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 406 transition count 586
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 406 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 406 transition count 585
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 113 place count 402 transition count 581
Iterating global reduction 4 with 4 rules applied. Total rules applied 117 place count 402 transition count 581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 401 transition count 580
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 401 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 401 transition count 579
Applied a total of 120 rules in 36 ms. Remains 401 /458 variables (removed 57) and now considering 579/649 (removed 70) transitions.
// Phase 1: matrix 579 rows 401 cols
[2025-05-30 12:24:56] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:24:56] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-30 12:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:24:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-05-30 12:24:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/980 variables, 401/406 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:20] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:20] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:21] [INFO ] Deduced a trap composed of 153 places in 75 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 409 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 578/987 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:25:44] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 988 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 401/458 places, 579/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 401/458 places, 579/649 transitions.
[2025-05-30 12:25:56] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:25:57] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:25:57] [INFO ] Input system was already deterministic with 579 transitions.
[2025-05-30 12:25:57] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:25:57] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:25:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17191482079227973063.gal : 3 ms
[2025-05-30 12:25:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7974338707691811803.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/CTLCardinality17191482079227973063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7974338707691811803.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17415e+11,4.20887,127664,2,15652,5,402263,6,0,2176,583883,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:26:27] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:26:27] [INFO ] Applying decomposition
[2025-05-30 12:26:27] [INFO ] Flatten gal took : 19 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/graph1327380788675787783.txt' '-o' '/tmp/graph1327380788675787783.bin' '-w' '/tmp/graph1327380788675787783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1327380788675787783.bin' '-l' '-1' '-v' '-w' '/tmp/graph1327380788675787783.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:26:27] [INFO ] Decomposing Gal with order
[2025-05-30 12:26:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:26:27] [INFO ] Removed a total of 371 redundant transitions.
[2025-05-30 12:26:27] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:26:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2025-05-30 12:26:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality506990584045604541.gal : 4 ms
[2025-05-30 12:26:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality6946963504212678979.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/CTLCardinality506990584045604541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6946963504212678979.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.17415e+11,0.231051,13272,939,61,17332,572,960,34160,84,1808,0
Converting to forward existential form...Done !
original formula: EX(AF((i12.u72.p444==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((i12.u72.p444==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t46, t74, t181, t211, t239, t251, t278, t306, t434, t468, t522, t552, i0.t431, ...870
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 499 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 942 edges and 457 vertex of which 449 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 448 transition count 460
Reduce places removed 178 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 183 rules applied. Total rules applied 367 place count 270 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 368 place count 269 transition count 455
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 368 place count 269 transition count 414
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 450 place count 228 transition count 414
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 459 place count 219 transition count 403
Iterating global reduction 3 with 9 rules applied. Total rules applied 468 place count 219 transition count 403
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 472 place count 219 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 473 place count 218 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 473 place count 218 transition count 397
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 477 place count 216 transition count 397
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 480 place count 213 transition count 392
Iterating global reduction 5 with 3 rules applied. Total rules applied 483 place count 213 transition count 392
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 535 place count 187 transition count 362
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 546 place count 187 transition count 351
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 9 rules applied. Total rules applied 555 place count 184 transition count 345
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 564 place count 181 transition count 339
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 9 rules applied. Total rules applied 573 place count 178 transition count 333
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 579 place count 175 transition count 330
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 583 place count 171 transition count 322
Iterating global reduction 10 with 4 rules applied. Total rules applied 587 place count 171 transition count 322
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 588 place count 170 transition count 320
Iterating global reduction 10 with 1 rules applied. Total rules applied 589 place count 170 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 590 place count 170 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 596 place count 167 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 608 place count 167 transition count 304
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 6 rules applied. Total rules applied 614 place count 167 transition count 298
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 620 place count 161 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 622 place count 160 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 624 place count 158 transition count 295
Applied a total of 624 rules in 98 ms. Remains 158 /458 variables (removed 300) and now considering 295/649 (removed 354) transitions.
[2025-05-30 12:26:57] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 158 cols
[2025-05-30 12:26:57] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:26:57] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-05-30 12:26:57] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2025-05-30 12:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:26:57] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:26:57] [INFO ] Redundant transitions in 14 ms returned []
Running 275 sub problems to find dead transitions.
[2025-05-30 12:26:57] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2025-05-30 12:26:57] [INFO ] Invariant cache hit.
[2025-05-30 12:26:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 268/426 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/427 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/427 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 164 constraints, problems are : Problem set: 0 solved, 275 unsolved in 16668 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 268/426 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 275/438 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/427 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 439 constraints, problems are : Problem set: 0 solved, 275 unsolved in 28837 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45542ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 45543ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/458 places, 295/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46056 ms. Remains : 158/458 places, 295/649 transitions.
[2025-05-30 12:27:43] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:27:43] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:27:43] [INFO ] Input system was already deterministic with 295 transitions.
[2025-05-30 12:27:43] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:27:43] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:27:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality18292622429517912999.gal : 1 ms
[2025-05-30 12:27:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality10607629628975951275.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/CTLCardinality18292622429517912999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10607629628975951275.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.9642e+07,0.120127,8528,2,1545,5,19851,6,0,917,15373,0
Converting to forward existential form...Done !
original formula: AG(EF(((p581==0)||(p378==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p581==0)||(p378==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t45, t57, t78, t85, t90, t126, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,1,2.31602,85336,1,0,396,454029,610,206,5614,286762,599
FORMULA CO4-PT-15-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 457 transition count 649
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 435 transition count 625
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 435 transition count 625
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 435 transition count 623
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 60 place count 422 transition count 609
Iterating global reduction 2 with 13 rules applied. Total rules applied 73 place count 422 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 422 transition count 607
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 417 transition count 599
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 417 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 417 transition count 598
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 414 transition count 595
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 414 transition count 595
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 413 transition count 594
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 413 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 413 transition count 593
Applied a total of 95 rules in 28 ms. Remains 413 /458 variables (removed 45) and now considering 593/649 (removed 56) transitions.
// Phase 1: matrix 593 rows 413 cols
[2025-05-30 12:27:45] [INFO ] Computed 6 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-30 12:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:27:46] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2025-05-30 12:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 2/411 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:27:56] [INFO ] Deduced a trap composed of 162 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:27:57] [INFO ] Deduced a trap composed of 154 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:00] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 593/1004 variables, 411/421 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:14] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:14] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1004/1006 variables, and 423 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 411/413 constraints, PredecessorRefiner: 592/592 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 2/411 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (OVERLAPS) 593/1004 variables, 411/423 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1004 variables, 555/978 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:28:39] [INFO ] Deduced a trap composed of 183 places in 96 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1004/1006 variables, and 979 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 411/413 constraints, PredecessorRefiner: 555/592 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 413/458 places, 593/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 413/458 places, 593/649 transitions.
[2025-05-30 12:28:46] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:28:46] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:28:46] [INFO ] Input system was already deterministic with 593 transitions.
[2025-05-30 12:28:46] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:28:46] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:28:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality14475590030948419617.gal : 2 ms
[2025-05-30 12:28:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5493017936647514153.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/CTLCardinality14475590030948419617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5493017936647514153.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61782e+11,4.05233,122304,2,16281,5,400999,6,0,2230,518468,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:29:16] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:29:16] [INFO ] Applying decomposition
[2025-05-30 12:29:16] [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/graph7781390982138516122.txt' '-o' '/tmp/graph7781390982138516122.bin' '-w' '/tmp/graph7781390982138516122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7781390982138516122.bin' '-l' '-1' '-v' '-w' '/tmp/graph7781390982138516122.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:29:16] [INFO ] Decomposing Gal with order
[2025-05-30 12:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:29:16] [INFO ] Removed a total of 391 redundant transitions.
[2025-05-30 12:29:16] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 7 ms.
[2025-05-30 12:29:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality18188207603277821202.gal : 4 ms
[2025-05-30 12:29:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2110817646844702530.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/CTLCardinality18188207603277821202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2110817646844702530.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.61782e+11,0.310657,16608,1095,92,21575,1063,1037,58622,99,3820,0
Converting to forward existential form...Done !
original formula: (EX(AG((((i3.u25.p176==0)||(i13.u139.p743==1)) + AX(((i14.u131.p722==0)||(i14.u142.p780==1)))))) * AF((((i3.u24.p174==0) * EG(((i14.u131....230
=> equivalent forward existential formula: ([(Init * !(EX(!(E(TRUE U !((((i3.u25.p176==0)||(i13.u139.p743==1)) + !(EX(!(((i14.u131.p722==0)||(i14.u142.p780...321
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t52, t81, t139, t149, t188, t196, t223, t244, t285, t315, t446, t480, t534, t57...945
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 496 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 942 edges and 457 vertex of which 450 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.22 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 449 transition count 458
Reduce places removed 180 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 185 rules applied. Total rules applied 371 place count 269 transition count 453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 372 place count 268 transition count 453
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 372 place count 268 transition count 412
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 454 place count 227 transition count 412
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 463 place count 218 transition count 401
Iterating global reduction 3 with 9 rules applied. Total rules applied 472 place count 218 transition count 401
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 476 place count 218 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 477 place count 217 transition count 397
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 477 place count 217 transition count 395
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 481 place count 215 transition count 395
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 484 place count 212 transition count 390
Iterating global reduction 5 with 3 rules applied. Total rules applied 487 place count 212 transition count 390
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 539 place count 186 transition count 360
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 550 place count 186 transition count 349
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 9 rules applied. Total rules applied 559 place count 183 transition count 343
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 568 place count 180 transition count 337
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 9 rules applied. Total rules applied 577 place count 177 transition count 331
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 583 place count 174 transition count 328
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 586 place count 171 transition count 322
Iterating global reduction 10 with 3 rules applied. Total rules applied 589 place count 171 transition count 322
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 590 place count 170 transition count 320
Iterating global reduction 10 with 1 rules applied. Total rules applied 591 place count 170 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 592 place count 170 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 598 place count 167 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 611 place count 167 transition count 303
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 7 rules applied. Total rules applied 618 place count 167 transition count 296
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 625 place count 160 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 627 place count 159 transition count 295
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 632 place count 159 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 633 place count 159 transition count 294
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 634 place count 159 transition count 294
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 636 place count 157 transition count 292
Applied a total of 636 rules in 88 ms. Remains 157 /458 variables (removed 301) and now considering 292/649 (removed 357) transitions.
[2025-05-30 12:29:46] [INFO ] Flow matrix only has 265 transitions (discarded 27 similar events)
// Phase 1: matrix 265 rows 157 cols
[2025-05-30 12:29:46] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:46] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 12:29:46] [INFO ] Flow matrix only has 265 transitions (discarded 27 similar events)
[2025-05-30 12:29:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:29:46] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:29:46] [INFO ] Redundant transitions in 4 ms returned []
Running 272 sub problems to find dead transitions.
[2025-05-30 12:29:46] [INFO ] Flow matrix only has 265 transitions (discarded 27 similar events)
[2025-05-30 12:29:46] [INFO ] Invariant cache hit.
[2025-05-30 12:29:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 264/420 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/421 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 1/422 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 163 constraints, problems are : Problem set: 0 solved, 272 unsolved in 19961 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 264/420 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 271/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 1/421 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 1/422 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 435 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49995ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 49996ms
Starting structural reductions in SI_CTL mode, iteration 1 : 157/458 places, 292/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50260 ms. Remains : 157/458 places, 292/649 transitions.
[2025-05-30 12:30:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:30:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:30:36] [INFO ] Input system was already deterministic with 292 transitions.
[2025-05-30 12:30:36] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:30:36] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:30:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality18306368269467471302.gal : 1 ms
[2025-05-30 12:30:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3747038933198358701.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/CTLCardinality18306368269467471302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3747038933198358701.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.9642e+07,0.132427,8516,2,1556,5,20094,6,0,908,15631,0
Converting to forward existential form...Done !
original formula: EG(EF((AG(((p86==0)||(p139==1))) * AF(((p579==0)&&(p278==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (!(E(TRUE U !(((p86==0)||(p139==1))))) * !(EG(!(((p579==0)&&(p278==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t42, t52, t73, t80, t118, Intersection with reachable at each step enabled. (destro...196
(forward)formula 0,1,27.3437,846032,1,0,695,5.18247e+06,617,389,5862,4.63974e+06,947
FORMULA CO4-PT-15-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 454 transition count 648
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 32 place count 427 transition count 619
Iterating global reduction 1 with 27 rules applied. Total rules applied 59 place count 427 transition count 619
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 427 transition count 614
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 79 place count 412 transition count 598
Iterating global reduction 2 with 15 rules applied. Total rules applied 94 place count 412 transition count 598
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 412 transition count 596
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 406 transition count 586
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 406 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 406 transition count 585
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 113 place count 402 transition count 581
Iterating global reduction 4 with 4 rules applied. Total rules applied 117 place count 402 transition count 581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 401 transition count 580
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 401 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 401 transition count 579
Applied a total of 120 rules in 35 ms. Remains 401 /458 variables (removed 57) and now considering 579/649 (removed 70) transitions.
// Phase 1: matrix 579 rows 401 cols
[2025-05-30 12:31:04] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:04] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-30 12:31:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:04] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2025-05-30 12:31:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/980 variables, 401/406 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:28] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:28] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:31:29] [INFO ] Deduced a trap composed of 153 places in 69 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 409 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/401 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (OVERLAPS) 579/980 variables, 401/409 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/980 variables, 578/987 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 987 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 401/458 places, 579/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 401/458 places, 579/649 transitions.
[2025-05-30 12:32:05] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:32:05] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:32:05] [INFO ] Input system was already deterministic with 579 transitions.
[2025-05-30 12:32:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:32:05] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:32:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality7279368157331013899.gal : 2 ms
[2025-05-30 12:32:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10142509654285860171.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/CTLCardinality7279368157331013899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10142509654285860171.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17416e+11,4.1369,121844,2,15415,5,389863,6,0,2176,546927,0
Converting to forward existential form...Done !
original formula: AX(AF(((p396==1)&&(p231==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((p396==1)&&(p231==0))))] = FALSE
Hit Full ! (commute/partial/dont) 575/0/4
Detected timeout of ITS tools.
[2025-05-30 12:32:35] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:32:35] [INFO ] Applying decomposition
[2025-05-30 12:32:35] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10466077736860685762.txt' '-o' '/tmp/graph10466077736860685762.bin' '-w' '/tmp/graph10466077736860685762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10466077736860685762.bin' '-l' '-1' '-v' '-w' '/tmp/graph10466077736860685762.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:32:35] [INFO ] Decomposing Gal with order
[2025-05-30 12:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:32:35] [INFO ] Removed a total of 378 redundant transitions.
[2025-05-30 12:32:35] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 7 ms.
[2025-05-30 12:32:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9991331384520699463.gal : 3 ms
[2025-05-30 12:32:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality3027052823700773953.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/CTLCardinality9991331384520699463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3027052823700773953.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.17416e+11,1.32634,58872,2045,65,90541,806,1023,400455,74,4124,0
Converting to forward existential form...Done !
original formula: AX(AF(((i6.u66.p396==1)&&(i0.u7.p231==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i6.u66.p396==1)&&(i0.u7.p231==0))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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,0,5.06602,195320,1,0,256480,1072,4395,1.64924e+06,292,6158,347953
FORMULA CO4-PT-15-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 493 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 942 edges and 457 vertex of which 449 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 180 rules applied. Total rules applied 182 place count 448 transition count 462
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 181 rules applied. Total rules applied 363 place count 272 transition count 457
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 366 place count 271 transition count 455
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 368 place count 269 transition count 455
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 368 place count 269 transition count 415
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 448 place count 229 transition count 415
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 457 place count 220 transition count 404
Iterating global reduction 4 with 9 rules applied. Total rules applied 466 place count 220 transition count 404
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 470 place count 220 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 471 place count 219 transition count 400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 471 place count 219 transition count 398
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 475 place count 217 transition count 398
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 478 place count 214 transition count 393
Iterating global reduction 6 with 3 rules applied. Total rules applied 481 place count 214 transition count 393
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 533 place count 188 transition count 363
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 11 rules applied. Total rules applied 544 place count 188 transition count 352
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 553 place count 185 transition count 346
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 9 rules applied. Total rules applied 562 place count 182 transition count 340
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 9 rules applied. Total rules applied 571 place count 179 transition count 334
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 577 place count 176 transition count 331
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 581 place count 172 transition count 323
Iterating global reduction 11 with 4 rules applied. Total rules applied 585 place count 172 transition count 323
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 586 place count 171 transition count 321
Iterating global reduction 11 with 1 rules applied. Total rules applied 587 place count 171 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 588 place count 171 transition count 320
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 594 place count 168 transition count 317
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 12 with 12 rules applied. Total rules applied 606 place count 168 transition count 305
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 12 with 6 rules applied. Total rules applied 612 place count 168 transition count 299
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 618 place count 162 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 620 place count 161 transition count 298
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 621 place count 161 transition count 298
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 623 place count 159 transition count 296
Applied a total of 623 rules in 51 ms. Remains 159 /458 variables (removed 299) and now considering 296/649 (removed 353) transitions.
[2025-05-30 12:32:40] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
// Phase 1: matrix 270 rows 159 cols
[2025-05-30 12:32:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:32:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 12:32:40] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
[2025-05-30 12:32:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:32:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:32:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:32:40] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2025-05-30 12:32:40] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
[2025-05-30 12:32:40] [INFO ] Invariant cache hit.
[2025-05-30 12:32:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 269/428 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 1/429 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 165 constraints, problems are : Problem set: 0 solved, 276 unsolved in 17210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 269/428 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 276/440 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 1/429 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 441 constraints, problems are : Problem set: 0 solved, 276 unsolved in 27457 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 159/159 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44690ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 44691ms
Starting structural reductions in SI_CTL mode, iteration 1 : 159/458 places, 296/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44913 ms. Remains : 159/458 places, 296/649 transitions.
[2025-05-30 12:33:25] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:33:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:33:25] [INFO ] Input system was already deterministic with 296 transitions.
[2025-05-30 12:33:25] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:33:25] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:33:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality1003840524251701041.gal : 1 ms
[2025-05-30 12:33:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2520354994574517309.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/CTLCardinality1003840524251701041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2520354994574517309.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.71725e+07,0.127831,8800,2,1574,5,20831,6,0,922,17499,0
Converting to forward existential form...Done !
original formula: EF(((((p515!=0)&&(p819!=1)) * (AG(((p601!=0)&&(p390!=1))) * (p280!=0))) * (p390!=1)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p390!=1)) * ((p515!=0)&&(p819!=1))) * (p280!=0)) * !(E(TRUE U !(((p601!=0)&&(p390!=1))))...167
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t47, t58, t80, t87, t92, t128, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,0,2.30039,88200,1,0,397,468488,613,207,5670,294126,601
FORMULA CO4-PT-15-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 497 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 942 edges and 457 vertex of which 449 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 0 with 182 rules applied. Total rules applied 184 place count 448 transition count 460
Reduce places removed 178 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 183 rules applied. Total rules applied 367 place count 270 transition count 455
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 370 place count 269 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 372 place count 267 transition count 453
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 372 place count 267 transition count 412
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 454 place count 226 transition count 412
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 462 place count 218 transition count 402
Iterating global reduction 4 with 8 rules applied. Total rules applied 470 place count 218 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 473 place count 218 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 473 place count 218 transition count 398
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 475 place count 217 transition count 398
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 477 place count 215 transition count 395
Iterating global reduction 5 with 2 rules applied. Total rules applied 479 place count 215 transition count 395
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 533 place count 188 transition count 364
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 544 place count 188 transition count 353
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 9 rules applied. Total rules applied 553 place count 185 transition count 347
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 562 place count 182 transition count 341
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 9 rules applied. Total rules applied 571 place count 179 transition count 335
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 577 place count 176 transition count 332
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 581 place count 172 transition count 324
Iterating global reduction 10 with 4 rules applied. Total rules applied 585 place count 172 transition count 324
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 586 place count 171 transition count 322
Iterating global reduction 10 with 1 rules applied. Total rules applied 587 place count 171 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 588 place count 171 transition count 321
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 594 place count 168 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 607 place count 168 transition count 305
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 7 rules applied. Total rules applied 614 place count 168 transition count 298
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 621 place count 161 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 623 place count 160 transition count 297
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 624 place count 160 transition count 297
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 626 place count 158 transition count 295
Applied a total of 626 rules in 60 ms. Remains 158 /458 variables (removed 300) and now considering 295/649 (removed 354) transitions.
[2025-05-30 12:33:27] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
// Phase 1: matrix 268 rows 158 cols
[2025-05-30 12:33:27] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:27] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-30 12:33:27] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
[2025-05-30 12:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:33:27] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:33:27] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2025-05-30 12:33:27] [INFO ] Flow matrix only has 268 transitions (discarded 27 similar events)
[2025-05-30 12:33:27] [INFO ] Invariant cache hit.
[2025-05-30 12:33:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 267/425 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 1/426 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/426 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 164 constraints, problems are : Problem set: 0 solved, 275 unsolved in 16682 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (OVERLAPS) 267/425 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 275/438 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (OVERLAPS) 1/426 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 439 constraints, problems are : Problem set: 0 solved, 275 unsolved in 28876 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45592ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 45593ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/458 places, 295/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45924 ms. Remains : 158/458 places, 295/649 transitions.
[2025-05-30 12:34:13] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:34:13] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:34:13] [INFO ] Input system was already deterministic with 295 transitions.
[2025-05-30 12:34:13] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:34:13] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:34:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10579099398228121507.gal : 1 ms
[2025-05-30 12:34:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13788449282342020449.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10579099398228121507.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13788449282342020449.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (3102 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (311 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality13788449282342020449.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 40
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :40 after 178
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :178 after 117936
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :117936 after 1.111e+07
Reachability property CO4-PT-15-CTLCardinality-2025-09 is true.
FORMULA CO4-PT-15-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.61909e+07,0.208808,8756,2,2204,14,21247,6,0,917,12845,0
Total reachable state count : 26190865
Verifying 1 reachability properties.
Reachability property CO4-PT-15-CTLCardinality-2025-09 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-15-CTLCardinality-2025-09,212,0.21019,8884,2,222,14,21247,7,0,925,12845,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 115485 steps, run visited all 1 properties in 234 ms. (steps per millisecond=493 )
Probabilistic random walk after 115485 steps, saw 25128 distinct states, run finished after 238 ms. (steps per millisecond=485 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 500 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 942 edges and 457 vertex of which 449 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 180 transitions
Trivial Post-agglo rules discarded 180 transitions
Performed 180 trivial Post agglomeration. Transition count delta: 180
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 448 transition count 458
Reduce places removed 180 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 185 rules applied. Total rules applied 371 place count 268 transition count 453
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 373 place count 267 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 374 place count 266 transition count 452
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 374 place count 266 transition count 411
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 456 place count 225 transition count 411
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 464 place count 217 transition count 401
Iterating global reduction 4 with 8 rules applied. Total rules applied 472 place count 217 transition count 401
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 476 place count 217 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 477 place count 216 transition count 397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 477 place count 216 transition count 396
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 479 place count 215 transition count 396
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 481 place count 213 transition count 393
Iterating global reduction 6 with 2 rules applied. Total rules applied 483 place count 213 transition count 393
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 537 place count 186 transition count 362
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 11 rules applied. Total rules applied 548 place count 186 transition count 351
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 557 place count 183 transition count 345
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 9 rules applied. Total rules applied 566 place count 180 transition count 339
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 9 rules applied. Total rules applied 575 place count 177 transition count 333
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 581 place count 174 transition count 330
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 585 place count 170 transition count 322
Iterating global reduction 11 with 4 rules applied. Total rules applied 589 place count 170 transition count 322
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 590 place count 169 transition count 320
Iterating global reduction 11 with 1 rules applied. Total rules applied 591 place count 169 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 592 place count 169 transition count 319
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 598 place count 166 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 611 place count 166 transition count 303
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 12 with 7 rules applied. Total rules applied 618 place count 166 transition count 296
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 625 place count 159 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 627 place count 158 transition count 295
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 628 place count 158 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 629 place count 158 transition count 294
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 631 place count 156 transition count 292
Applied a total of 631 rules in 62 ms. Remains 156 /458 variables (removed 302) and now considering 292/649 (removed 357) transitions.
[2025-05-30 12:34:13] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 156 cols
[2025-05-30 12:34:13] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:14] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 12:34:14] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2025-05-30 12:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:34:14] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:34:14] [INFO ] Redundant transitions in 1 ms returned []
Running 272 sub problems to find dead transitions.
[2025-05-30 12:34:14] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2025-05-30 12:34:14] [INFO ] Invariant cache hit.
[2025-05-30 12:34:14] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 265/421 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/422 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/422 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 162 constraints, problems are : Problem set: 0 solved, 272 unsolved in 16497 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 265/421 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/421 variables, 272/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/421 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 1/422 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/422 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 434 constraints, problems are : Problem set: 0 solved, 272 unsolved in 27455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43980ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 43980ms
Starting structural reductions in SI_CTL mode, iteration 1 : 156/458 places, 292/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44356 ms. Remains : 156/458 places, 292/649 transitions.
[2025-05-30 12:34:58] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:34:58] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:34:58] [INFO ] Input system was already deterministic with 292 transitions.
[2025-05-30 12:34:58] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:34:58] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:34:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1699797699744954108.gal : 1 ms
[2025-05-30 12:34:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality17242326164650546510.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/CTLCardinality1699797699744954108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17242326164650546510.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87711e+07,0.181098,10692,2,1740,5,28268,6,0,906,25530,0
Converting to forward existential form...Done !
original formula: EG(((p210==0)||(p635==1)))
=> equivalent forward existential formula: [FwdG(Init,((p210==0)||(p635==1)))] != FALSE
Hit Full ! (commute/partial/dont) 287/0/5
(forward)formula 0,1,1.28612,47124,1,0,8,231497,19,4,4419,122622,8
FORMULA CO4-PT-15-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 454 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 30 place count 429 transition count 621
Iterating global reduction 1 with 25 rules applied. Total rules applied 55 place count 429 transition count 621
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 429 transition count 616
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 74 place count 415 transition count 601
Iterating global reduction 2 with 14 rules applied. Total rules applied 88 place count 415 transition count 601
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 415 transition count 599
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 95 place count 410 transition count 591
Iterating global reduction 3 with 5 rules applied. Total rules applied 100 place count 410 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 410 transition count 590
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 104 place count 407 transition count 587
Iterating global reduction 4 with 3 rules applied. Total rules applied 107 place count 407 transition count 587
Applied a total of 107 rules in 25 ms. Remains 407 /458 variables (removed 51) and now considering 587/649 (removed 62) transitions.
// Phase 1: matrix 587 rows 407 cols
[2025-05-30 12:34:59] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-30 12:34:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:34:59] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2025-05-30 12:34:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 587/994 variables, 407/412 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:35:23] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:35:23] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:35:24] [INFO ] Deduced a trap composed of 154 places in 67 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 994/994 variables, and 415 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/407 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 587/994 variables, 407/415 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/994 variables, 586/1001 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 994/994 variables, and 1001 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 407/458 places, 587/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 407/458 places, 587/649 transitions.
[2025-05-30 12:36:00] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:36:00] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:36:00] [INFO ] Input system was already deterministic with 587 transitions.
[2025-05-30 12:36:00] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:36:00] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:36:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7032064711464136639.gal : 1 ms
[2025-05-30 12:36:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13643530049176557131.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/CTLCardinality7032064711464136639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13643530049176557131.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42254e+11,4.15642,126532,2,15136,5,394893,6,0,2208,574426,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 12:36:30] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:36:30] [INFO ] Applying decomposition
[2025-05-30 12:36:30] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14743209422072773743.txt' '-o' '/tmp/graph14743209422072773743.bin' '-w' '/tmp/graph14743209422072773743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14743209422072773743.bin' '-l' '-1' '-v' '-w' '/tmp/graph14743209422072773743.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:36:30] [INFO ] Decomposing Gal with order
[2025-05-30 12:36:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:36:30] [INFO ] Removed a total of 390 redundant transitions.
[2025-05-30 12:36:30] [INFO ] Flatten gal took : 29 ms
[2025-05-30 12:36:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2025-05-30 12:36:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4892699041253272510.gal : 10 ms
[2025-05-30 12:36:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9366361868582852195.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/CTLCardinality4892699041253272510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9366361868582852195.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.42254e+11,0.224977,12212,889,79,14916,801,1034,28031,77,2846,0
Converting to forward existential form...Done !
original formula: EX((AF(AX(!(E(((i4.u30.p211==0)||(i17.u135.p688==1)) U ((i14.u125.p650==0)||(i0.u152.p824==1)))))) * AG((((i2.u16.p202==0)||(i0.u48.p300=...204
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(EX(!(!(E(((i4.u30.p211==0)||(i17.u135.p688==1)) U ((i14.u125.p650==0)||(i0.u152.p824==1))...273
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t46, t80, t103, t138, t148, t187, t217, t252, t257, t284, t312, t420, t474, t52...920
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 458/458 places, 649/649 transitions.
Graph (trivial) has 501 edges and 458 vertex of which 2 / 458 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 942 edges and 457 vertex of which 449 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 185 rules applied. Total rules applied 187 place count 448 transition count 457
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 186 rules applied. Total rules applied 373 place count 267 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 374 place count 266 transition count 452
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 374 place count 266 transition count 411
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 456 place count 225 transition count 411
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 465 place count 216 transition count 400
Iterating global reduction 3 with 9 rules applied. Total rules applied 474 place count 216 transition count 400
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 476 place count 216 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 476 place count 216 transition count 396
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 480 place count 214 transition count 396
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 483 place count 211 transition count 391
Iterating global reduction 4 with 3 rules applied. Total rules applied 486 place count 211 transition count 391
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 538 place count 185 transition count 361
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 549 place count 185 transition count 350
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 9 rules applied. Total rules applied 558 place count 182 transition count 344
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 9 rules applied. Total rules applied 567 place count 179 transition count 338
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 9 rules applied. Total rules applied 576 place count 176 transition count 332
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 582 place count 173 transition count 329
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 586 place count 169 transition count 321
Iterating global reduction 9 with 4 rules applied. Total rules applied 590 place count 169 transition count 321
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 591 place count 168 transition count 319
Iterating global reduction 9 with 1 rules applied. Total rules applied 592 place count 168 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 593 place count 168 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 599 place count 165 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 612 place count 165 transition count 302
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 7 rules applied. Total rules applied 619 place count 165 transition count 295
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 626 place count 158 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 628 place count 157 transition count 294
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 629 place count 157 transition count 294
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 631 place count 155 transition count 292
Applied a total of 631 rules in 48 ms. Remains 155 /458 variables (removed 303) and now considering 292/649 (removed 357) transitions.
[2025-05-30 12:37:00] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 155 cols
[2025-05-30 12:37:00] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:37:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 12:37:00] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2025-05-30 12:37:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:37:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:37:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:37:00] [INFO ] Redundant transitions in 2 ms returned []
Running 272 sub problems to find dead transitions.
[2025-05-30 12:37:00] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2025-05-30 12:37:00] [INFO ] Invariant cache hit.
[2025-05-30 12:37:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 265/420 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 1/421 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/421 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 161 constraints, problems are : Problem set: 0 solved, 272 unsolved in 16482 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 265/420 variables, 155/160 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 272/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (OVERLAPS) 1/421 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/421 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 433 constraints, problems are : Problem set: 0 solved, 272 unsolved in 27194 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 155/155 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43704ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 43704ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/458 places, 292/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43938 ms. Remains : 155/458 places, 292/649 transitions.
[2025-05-30 12:37:44] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:37:44] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:37:44] [INFO ] Input system was already deterministic with 292 transitions.
[2025-05-30 12:37:44] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:37:44] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:37:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12766767520984146383.gal : 1 ms
[2025-05-30 12:37:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12336261491417097184.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/CTLCardinality12766767520984146383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12336261491417097184.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.76824e+07,0.108327,8372,2,1498,5,19151,6,0,902,14858,0
Converting to forward existential form...Done !
original formula: EG((p554==0))
=> equivalent forward existential formula: [FwdG(Init,(p554==0))] != FALSE
Hit Full ! (commute/partial/dont) 290/0/2
(forward)formula 0,1,0.631533,30004,1,0,8,152917,19,4,4398,51260,8
FORMULA CO4-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 12:37:45] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:37:45] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:45] [INFO ] Applying decomposition
[2025-05-30 12:37:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph313505894178089311.txt' '-o' '/tmp/graph313505894178089311.bin' '-w' '/tmp/graph313505894178089311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph313505894178089311.bin' '-l' '-1' '-v' '-w' '/tmp/graph313505894178089311.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:37:45] [INFO ] Decomposing Gal with order
[2025-05-30 12:37:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:37:45] [INFO ] Removed a total of 406 redundant transitions.
[2025-05-30 12:37:45] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:37:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2025-05-30 12:37:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality15429654261246696492.gal : 3 ms
[2025-05-30 12:37:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality3190023867376348026.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/CTLCardinality15429654261246696492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3190023867376348026.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71912e+11,0.538751,27136,1283,115,36945,1693,1041,131244,119,7184,0
Converting to forward existential form...Done !
original formula: A(!(AG(AX(EF(((i17.u155.p800==0)||(i15.u146.p749==1)))))) U (i15.u136.p685==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i15.u136.p685==1))))) * !(E(!((i15.u136.p685==1)) U (!(!(!(E(TRUE U !(!(EX(!(E(TRUE U ((i17.u1...234
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t55, t103, t107, t245, t271, t308, t313, t350, t483, t519, t577, t611, t617, t6...1051
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,575.327,3176964,1,0,2.00132e+06,2798,2337,3.43358e+07,226,19010,399642
FORMULA CO4-PT-15-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((EG((i8.u77.p446==1)) * (AX((EX(TRUE) + AF((i3.u12.p141==1)))) + (AX(((i15.u138.p690==0)&&(i15.u141.p701==1))) * (AF((i9.u80.p463==0))...210
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EG((i8.u77.p446==1))) * !(EX(!((EX(TRUE) + !(EG(!((i3.u12.p141==1)))))))))] != FALSE + ([(...453
(forward)formula 1,1,1081.58,4265732,1,0,3.0023e+06,2798,3452,4.50261e+07,291,19010,1085849
FORMULA CO4-PT-15-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(AF((i8.u76.p444==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((i8.u76.p444==1)))))] != FALSE
(forward)formula 2,0,1529.72,4818692,1,0,3.8366e+06,2798,2870,4.66486e+07,242,19010,863753
FORMULA CO4-PT-15-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2025-05-30 13:03:56] [INFO ] Applying decomposition
[2025-05-30 13:03:56] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:03:56] [INFO ] Decomposing Gal with order
[2025-05-30 13:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:03:56] [INFO ] Removed a total of 244 redundant transitions.
[2025-05-30 13:03:56] [INFO ] Flatten gal took : 18 ms
[2025-05-30 13:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 221 labels/synchronizations in 4 ms.
[2025-05-30 13:03:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10785995868472060093.gal : 2 ms
[2025-05-30 13:03:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality8013796237538159370.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/CTLCardinality10785995868472060093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8013796237538159370.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 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71912e+11,0.919584,40432,464,2295,20821,66430,293,82458,1339,242979,0
Converting to forward existential form...Done !
original formula: (EX(AG((((i0.i0.i0.u5.p176==0)||(i0.i1.i1.i1.i1.u16.p743==1)) + AX(((i0.i1.i1.i1.i1.u16.p722==0)||(i0.i1.i1.i1.i1.u17.p780==1)))))) * AF(...296
=> equivalent forward existential formula: ([(Init * !(EX(!(E(TRUE U !((((i0.i0.i0.u5.p176==0)||(i0.i1.i1.i1.i1.u16.p743==1)) + !(EX(!(((i0.i1.i1.i1.i1.u16...387
Reverse transition relation is NOT exact ! Due to transitions t621, t623, i0.t493, i0.t16, i0.i0.i0.t350, i0.i0.i0.u5.t432, i0.i0.i0.u5.t436, i0.i0.i0.u5.t...1760
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CO4-PT-15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r044-tall-174854028500489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-15.tgz
mv CO4-PT-15 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 '
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 ;