Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898600113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
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 r550-tall-171734898600113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 255K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-15-CTLCardinality-2024-11
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

=== Now, execution of the tool begins

BK_START 1717352349192

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 202405141337
[2024-06-02 18:19:10] [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]
[2024-06-02 18:19:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:19:10] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 18:19:10] [INFO ] Transformed 833 places.
[2024-06-02 18:19:10] [INFO ] Transformed 1106 transitions.
[2024-06-02 18:19:10] [INFO ] Found NUPN structural information;
[2024-06-02 18:19:10] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 124 places in 11 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 57 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 691 transition count 906
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 164 place count 548 transition count 761
Iterating global reduction 1 with 143 rules applied. Total rules applied 307 place count 548 transition count 761
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 313 place count 548 transition count 755
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 380 place count 481 transition count 683
Iterating global reduction 2 with 67 rules applied. Total rules applied 447 place count 481 transition count 683
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 449 place count 481 transition count 681
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 463 place count 467 transition count 662
Iterating global reduction 3 with 14 rules applied. Total rules applied 477 place count 467 transition count 662
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 467 transition count 660
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 484 place count 462 transition count 655
Iterating global reduction 4 with 5 rules applied. Total rules applied 489 place count 462 transition count 655
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 492 place count 459 transition count 652
Iterating global reduction 4 with 3 rules applied. Total rules applied 495 place count 459 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 498 place count 459 transition count 649
Applied a total of 498 rules in 147 ms. Remains 459 /709 variables (removed 250) and now considering 649/909 (removed 260) transitions.
// Phase 1: matrix 649 rows 459 cols
[2024-06-02 18:19:10] [INFO ] Computed 7 invariants in 25 ms
[2024-06-02 18:19:11] [INFO ] Implicit Places using invariants in 331 ms returned [5, 390]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 359 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/709 places, 649/909 transitions.
Applied a total of 0 rules in 14 ms. Remains 457 /457 variables (removed 0) and now considering 649/649 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 535 ms. Remains : 457/709 places, 649/909 transitions.
Support contains 57 out of 457 places after structural reductions.
[2024-06-02 18:19:11] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-02 18:19:11] [INFO ] Flatten gal took : 69 ms
[2024-06-02 18:19:11] [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
FORMULA CO4-PT-15-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:19:11] [INFO ] Flatten gal took : 34 ms
[2024-06-02 18:19:11] [INFO ] Input system was already deterministic with 649 transitions.
Support contains 38 out of 457 places (down from 57) after GAL structural reductions.
RANDOM walk for 40000 steps (756 resets) in 1447 ms. (27 steps per ms) remains 12/22 properties
BEST_FIRST walk for 40003 steps (156 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (156 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (154 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (162 resets) in 105 ms. (377 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (160 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (126 resets) in 112 ms. (354 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (207 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (160 resets) in 108 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (158 resets) in 90 ms. (439 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (125 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
// Phase 1: matrix 649 rows 457 cols
[2024-06-02 18:19:12] [INFO ] Computed 5 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 232/286 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 15/301 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 15/316 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 439/755 variables, 199/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 284/1039 variables, 163/416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1039 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 60/1099 variables, 41/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1099 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 7/1106 variables, 5/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1106 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1106 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1106/1106 variables, and 462 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 457/457 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 232/286 variables, 32/49 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 15/301 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 15/316 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 439/755 variables, 199/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/755 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 284/1039 variables, 163/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1039 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 60/1099 variables, 41/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1099 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 7/1106 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1106/1106 variables, and 471 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 457/457 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2581ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 105 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Parikh walk visited 9 properties in 996 ms.
[2024-06-02 18:19:16] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:19:16] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:19:16] [INFO ] Input system was already deterministic with 649 transitions.
Support contains 36 out of 457 places (down from 38) after GAL structural reductions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 949 edges and 457 vertex of which 450 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Graph (trivial) has 491 edges and 457 vertex of which 2 / 457 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 948 edges and 456 vertex of which 449 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 174 rules applied. Total rules applied 176 place count 448 transition count 468
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 178 rules applied. Total rules applied 354 place count 277 transition count 461
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 357 place count 275 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 358 place count 274 transition count 460
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 358 place count 274 transition count 423
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 432 place count 237 transition count 423
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 444 place count 225 transition count 410
Iterating global reduction 4 with 12 rules applied. Total rules applied 456 place count 225 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 458 place count 225 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 459 place count 224 transition count 408
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 459 place count 224 transition count 402
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 471 place count 218 transition count 402
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 479 place count 210 transition count 388
Iterating global reduction 6 with 8 rules applied. Total rules applied 487 place count 210 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 488 place count 210 transition count 387
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 542 place count 183 transition count 356
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 10 rules applied. Total rules applied 552 place count 183 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 8 rules applied. Total rules applied 560 place count 180 transition count 341
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 9 with 5 rules applied. Total rules applied 565 place count 178 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 568 place count 177 transition count 336
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 570 place count 176 transition count 335
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 573 place count 173 transition count 329
Iterating global reduction 12 with 3 rules applied. Total rules applied 576 place count 173 transition count 329
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 584 place count 169 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 12 with 3 rules applied. Total rules applied 587 place count 169 transition count 322
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 3 rules applied. Total rules applied 590 place count 168 transition count 320
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 592 place count 167 transition count 319
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 593 place count 166 transition count 317
Iterating global reduction 15 with 1 rules applied. Total rules applied 594 place count 166 transition count 317
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 595 place count 165 transition count 315
Iterating global reduction 15 with 1 rules applied. Total rules applied 596 place count 165 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 597 place count 165 transition count 314
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 16 with 2 rules applied. Total rules applied 599 place count 164 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 612 place count 164 transition count 300
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 16 with 7 rules applied. Total rules applied 619 place count 164 transition count 293
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 626 place count 157 transition count 293
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 18 with 2 rules applied. Total rules applied 628 place count 156 transition count 292
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 630 place count 154 transition count 290
Applied a total of 630 rules in 161 ms. Remains 154 /457 variables (removed 303) and now considering 290/649 (removed 359) transitions.
[2024-06-02 18:19:16] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 154 cols
[2024-06-02 18:19:16] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:19:16] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:19:16] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 18:19:16] [INFO ] Invariant cache hit.
[2024-06-02 18:19:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:19:16] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-02 18:19:16] [INFO ] Redundant transitions in 13 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 18:19:16] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 18:19:16] [INFO ] Invariant cache hit.
[2024-06-02 18:19:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 263/417 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 1/418 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/418 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 160 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 263/417 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 270/429 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 1/418 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 430 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10091 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 18340ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 18345ms
Starting structural reductions in SI_CTL mode, iteration 1 : 154/457 places, 290/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18708 ms. Remains : 154/457 places, 290/649 transitions.
[2024-06-02 18:19:34] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:19:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:19:34] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 18:19:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:19:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:19:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3060021715467894567.gal : 6 ms
[2024-06-02 18:19:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality5817515045109626260.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3060021715467894567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5817515045109626260.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,4.72349e+07,0.169425,9908,2,1771,5,27855,6,0,896,22853,0


Converting to forward existential form...Done !
original formula: AG(EF((p92==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p92==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t40, t50, t71, t74, t83, t89, Intersection with reachable at each step enabled. (des...199
(forward)formula 0,1,2.56143,92592,1,0,392,504432,600,202,5546,314340,589
FORMULA CO4-PT-15-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Graph (trivial) has 492 edges and 457 vertex of which 2 / 457 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 948 edges and 456 vertex of which 449 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 174 rules applied. Total rules applied 176 place count 448 transition count 468
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 178 rules applied. Total rules applied 354 place count 277 transition count 461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 356 place count 275 transition count 461
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 356 place count 275 transition count 423
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 432 place count 237 transition count 423
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 444 place count 225 transition count 410
Iterating global reduction 3 with 12 rules applied. Total rules applied 456 place count 225 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 458 place count 225 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 459 place count 224 transition count 408
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 459 place count 224 transition count 402
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 471 place count 218 transition count 402
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 479 place count 210 transition count 388
Iterating global reduction 5 with 8 rules applied. Total rules applied 487 place count 210 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 488 place count 210 transition count 387
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 542 place count 183 transition count 356
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 10 rules applied. Total rules applied 552 place count 183 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 8 rules applied. Total rules applied 560 place count 180 transition count 341
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 5 rules applied. Total rules applied 565 place count 178 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 568 place count 177 transition count 336
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 570 place count 176 transition count 335
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 573 place count 173 transition count 329
Iterating global reduction 11 with 3 rules applied. Total rules applied 576 place count 173 transition count 329
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 584 place count 169 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 11 with 3 rules applied. Total rules applied 587 place count 169 transition count 322
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 3 rules applied. Total rules applied 590 place count 168 transition count 320
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 592 place count 167 transition count 319
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 593 place count 166 transition count 317
Iterating global reduction 14 with 1 rules applied. Total rules applied 594 place count 166 transition count 317
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 595 place count 165 transition count 315
Iterating global reduction 14 with 1 rules applied. Total rules applied 596 place count 165 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 597 place count 165 transition count 314
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 15 with 2 rules applied. Total rules applied 599 place count 164 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 612 place count 164 transition count 300
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 15 with 7 rules applied. Total rules applied 619 place count 164 transition count 293
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 626 place count 157 transition count 293
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 17 with 2 rules applied. Total rules applied 628 place count 156 transition count 292
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 630 place count 154 transition count 290
Applied a total of 630 rules in 107 ms. Remains 154 /457 variables (removed 303) and now considering 290/649 (removed 359) transitions.
[2024-06-02 18:19:37] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 154 cols
[2024-06-02 18:19:37] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:19:37] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:19:37] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 18:19:37] [INFO ] Invariant cache hit.
[2024-06-02 18:19:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:19:37] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 18:19:37] [INFO ] Redundant transitions in 3 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 18:19:37] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 18:19:37] [INFO ] Invariant cache hit.
[2024-06-02 18:19:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 263/417 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 1/418 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/418 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 160 constraints, problems are : Problem set: 0 solved, 270 unsolved in 8230 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 263/417 variables, 154/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 270/429 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 1/418 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/418 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 430 constraints, problems are : Problem set: 0 solved, 270 unsolved in 9991 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 18318ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 18322ms
Starting structural reductions in SI_CTL mode, iteration 1 : 154/457 places, 290/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18642 ms. Remains : 154/457 places, 290/649 transitions.
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:19:56] [INFO ] Input system was already deterministic with 290 transitions.
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:19:56] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:19:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality18344071105705673685.gal : 3 ms
[2024-06-02 18:19:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12526767194473115210.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18344071105705673685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12526767194473115210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.72349e+07,0.168621,9980,2,1764,5,27603,6,0,896,22558,0


Converting to forward existential form...Done !
original formula: EG((p240==0))
=> equivalent forward existential formula: [FwdG(Init,(p240==0))] != FALSE
Hit Full ! (commute/partial/dont) 288/0/2
(forward)formula 0,1,0.916354,37956,1,0,10,203856,19,4,4395,81008,8
FORMULA CO4-PT-15-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 649
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 430 transition count 623
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 430 transition count 623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 430 transition count 622
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 69 place count 414 transition count 599
Iterating global reduction 2 with 16 rules applied. Total rules applied 85 place count 414 transition count 599
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 414 transition count 597
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 411 transition count 593
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 411 transition count 593
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 408 transition count 590
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 408 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 101 place count 408 transition count 588
Applied a total of 101 rules in 37 ms. Remains 408 /457 variables (removed 49) and now considering 588/649 (removed 61) transitions.
// Phase 1: matrix 588 rows 408 cols
[2024-06-02 18:19:57] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:19:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 18:19:57] [INFO ] Invariant cache hit.
[2024-06-02 18:19:57] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2024-06-02 18:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-02 18:20:07] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 588/996 variables, 408/414 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 4 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-06-02 18:20:15] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:20:16] [INFO ] Deduced a trap composed of 154 places in 89 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/996 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 587 unsolved
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 996/996 variables, and 418 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/408 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 588/996 variables, 408/418 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/996 variables, 587/1005 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/996 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 996/996 variables, and 1005 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 5/5 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 408/457 places, 588/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 408/457 places, 588/649 transitions.
[2024-06-02 18:20:57] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:20:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:20:57] [INFO ] Input system was already deterministic with 588 transitions.
[2024-06-02 18:20:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:20:57] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:20:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality8458294285869656132.gal : 3 ms
[2024-06-02 18:20:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5023686004507896514.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8458294285869656132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5023686004507896514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.38605e+11,5.40707,145320,2,15659,5,435202,6,0,2212,701629,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:21:28] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:21:28] [INFO ] Applying decomposition
[2024-06-02 18:21:28] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15983243899071989574.txt' '-o' '/tmp/graph15983243899071989574.bin' '-w' '/tmp/graph15983243899071989574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15983243899071989574.bin' '-l' '-1' '-v' '-w' '/tmp/graph15983243899071989574.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:21:28] [INFO ] Decomposing Gal with order
[2024-06-02 18:21:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:21:28] [INFO ] Removed a total of 369 redundant transitions.
[2024-06-02 18:21:28] [INFO ] Flatten gal took : 115 ms
[2024-06-02 18:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 14 ms.
[2024-06-02 18:21:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15685846497440150217.gal : 7 ms
[2024-06-02 18:21:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10784080325405342304.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15685846497440150217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10784080325405342304.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38605e+11,0.253879,14476,872,70,20018,847,980,45755,106,3061,0


Converting to forward existential form...Done !
original formula: AF((AX(AX(AG(((i1.u12.p114!=0)&&(i6.u53.p304!=1))))) * (((i8.u90.p499==0)||(i17.u136.p747==0)) + AF(((i7.u66.p402==0)&&(i2.u29.p198==1)))...158
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EX(!(!(E(TRUE U !(((i1.u12.p114!=0)&&(i6.u53.p304!=1))))))))))) * (((i8.u90.p499==0)||(i1...233
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t75, t88, t133, t143, t186, t213, t227, t280, t313, t442, t476, t530, t560, i0....921
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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 : 457/457 places, 649/649 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 649
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 427 transition count 620
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 427 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 427 transition count 619
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 77 place count 409 transition count 593
Iterating global reduction 2 with 18 rules applied. Total rules applied 95 place count 409 transition count 593
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 409 transition count 591
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 405 transition count 586
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 405 transition count 586
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 401 transition count 582
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 401 transition count 582
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 401 transition count 579
Applied a total of 116 rules in 25 ms. Remains 401 /457 variables (removed 56) and now considering 579/649 (removed 70) transitions.
// Phase 1: matrix 579 rows 401 cols
[2024-06-02 18:21:58] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 18:21:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:21:58] [INFO ] Invariant cache hit.
[2024-06-02 18:21:58] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2024-06-02 18:21:58] [INFO ] Invariant cache hit.
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
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:22:15] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:22:16] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/980 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-06-02 18:22:23] [INFO ] Deduced a trap composed of 153 places in 71 ms of which 2 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 410 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
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, 4/9 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-06-02 18:22:35] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 579/980 variables, 401/411 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 578/989 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/989 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 989 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 5/5 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Starting structural reductions in LTL mode, iteration 1 : 401/457 places, 579/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60576 ms. Remains : 401/457 places, 579/649 transitions.
[2024-06-02 18:22:58] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:22:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:22:59] [INFO ] Input system was already deterministic with 579 transitions.
[2024-06-02 18:22:59] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:22:59] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:22:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality6184333068195247096.gal : 3 ms
[2024-06-02 18:22:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2837946677861763954.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6184333068195247096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2837946677861763954.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.17416e+11,4.00126,120608,2,15356,5,385283,6,0,2176,542946,0


Converting to forward existential form...Done !
original formula: EF(EX((p390==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p390==1))] != FALSE
(forward)formula 0,1,4.66078,120608,1,0,8,385283,8,1,3645,542946,2
FORMULA CO4-PT-15-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Graph (trivial) has 485 edges and 457 vertex of which 2 / 457 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 948 edges and 456 vertex of which 450 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 449 transition count 473
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 173 rules applied. Total rules applied 344 place count 283 transition count 466
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 347 place count 281 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 348 place count 280 transition count 465
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 348 place count 280 transition count 427
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 424 place count 242 transition count 427
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 436 place count 230 transition count 414
Iterating global reduction 4 with 12 rules applied. Total rules applied 448 place count 230 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 450 place count 230 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 451 place count 229 transition count 412
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 451 place count 229 transition count 406
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 463 place count 223 transition count 406
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 471 place count 215 transition count 392
Iterating global reduction 6 with 8 rules applied. Total rules applied 479 place count 215 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 480 place count 215 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 7 with 52 rules applied. Total rules applied 532 place count 189 transition count 361
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 8 rules applied. Total rules applied 540 place count 189 transition count 353
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 5 rules applied. Total rules applied 545 place count 187 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 548 place count 186 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 551 place count 185 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 553 place count 184 transition count 345
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 556 place count 181 transition count 339
Iterating global reduction 12 with 3 rules applied. Total rules applied 559 place count 181 transition count 339
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 565 place count 178 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 12 with 3 rules applied. Total rules applied 568 place count 178 transition count 333
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 3 rules applied. Total rules applied 571 place count 177 transition count 331
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 573 place count 176 transition count 330
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 574 place count 175 transition count 328
Iterating global reduction 15 with 1 rules applied. Total rules applied 575 place count 175 transition count 328
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 576 place count 174 transition count 326
Iterating global reduction 15 with 1 rules applied. Total rules applied 577 place count 174 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 578 place count 174 transition count 325
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 16 with 2 rules applied. Total rules applied 580 place count 173 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 593 place count 173 transition count 311
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 16 with 7 rules applied. Total rules applied 600 place count 173 transition count 304
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 607 place count 166 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 607 place count 166 transition count 303
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 609 place count 165 transition count 303
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 18 with 2 rules applied. Total rules applied 611 place count 164 transition count 302
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 612 place count 164 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 613 place count 164 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 615 place count 162 transition count 299
Applied a total of 615 rules in 89 ms. Remains 162 /457 variables (removed 295) and now considering 299/649 (removed 350) transitions.
// Phase 1: matrix 299 rows 162 cols
[2024-06-02 18:23:03] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:23:03] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 18:23:04] [INFO ] Invariant cache hit.
[2024-06-02 18:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:23:04] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-06-02 18:23:04] [INFO ] Redundant transitions in 3 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 18:23:04] [INFO ] Invariant cache hit.
[2024-06-02 18:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 298/459 variables, 161/166 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 1/460 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 1/461 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 168 constraints, problems are : Problem set: 0 solved, 278 unsolved in 9509 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 162/162 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 298/459 variables, 161/166 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 276/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 1/460 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/461 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (OVERLAPS) 0/461 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 446 constraints, problems are : Problem set: 0 solved, 278 unsolved in 15762 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 162/162 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
After SMT, in 25337ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 25341ms
Starting structural reductions in SI_CTL mode, iteration 1 : 162/457 places, 299/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25678 ms. Remains : 162/457 places, 299/649 transitions.
[2024-06-02 18:23:29] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:23:29] [INFO ] Input system was already deterministic with 299 transitions.
[2024-06-02 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:23:29] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:23:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality12607153627833034855.gal : 2 ms
[2024-06-02 18:23:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13017966062531808314.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12607153627833034855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13017966062531808314.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,7.36208e+07,0.173442,10072,2,1912,5,27575,6,0,934,22296,0


Converting to forward existential form...Done !
original formula: AG(A(AF((((p525==1)||(p778==0))||(p199==1))) U ((!((p238==0)||(p791==1)))||(!((p244==1)&&(p778==0))))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(((!((p238==0)||(p791==1)))||(!((p244==1)&&(p778==0)))))) * !(((!((p238==0)||(p791...333
Hit Full ! (commute/partial/dont) 291/10/8
(forward)formula 0,0,0.998892,40532,1,0,8,217160,20,2,4730,70471,8
FORMULA CO4-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Graph (trivial) has 486 edges and 457 vertex of which 2 / 457 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 948 edges and 456 vertex of which 450 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 449 transition count 472
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 174 rules applied. Total rules applied 346 place count 282 transition count 465
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 349 place count 280 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 279 transition count 464
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 350 place count 279 transition count 426
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 426 place count 241 transition count 426
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 435 place count 232 transition count 417
Iterating global reduction 4 with 9 rules applied. Total rules applied 444 place count 232 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 446 place count 232 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 447 place count 231 transition count 415
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 447 place count 231 transition count 410
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 457 place count 226 transition count 410
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 463 place count 220 transition count 399
Iterating global reduction 6 with 6 rules applied. Total rules applied 469 place count 220 transition count 399
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 470 place count 220 transition count 398
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 526 place count 192 transition count 367
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 10 rules applied. Total rules applied 536 place count 192 transition count 357
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 8 rules applied. Total rules applied 544 place count 189 transition count 352
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 9 with 5 rules applied. Total rules applied 549 place count 187 transition count 349
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 552 place count 186 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 554 place count 185 transition count 346
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 557 place count 182 transition count 340
Iterating global reduction 12 with 3 rules applied. Total rules applied 560 place count 182 transition count 340
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 566 place count 179 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 12 with 3 rules applied. Total rules applied 569 place count 179 transition count 334
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 3 rules applied. Total rules applied 572 place count 178 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 574 place count 177 transition count 331
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 575 place count 176 transition count 329
Iterating global reduction 15 with 1 rules applied. Total rules applied 576 place count 176 transition count 329
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 577 place count 175 transition count 327
Iterating global reduction 15 with 1 rules applied. Total rules applied 578 place count 175 transition count 327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 579 place count 175 transition count 326
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 16 with 2 rules applied. Total rules applied 581 place count 174 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 16 with 13 rules applied. Total rules applied 594 place count 174 transition count 312
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 16 with 7 rules applied. Total rules applied 601 place count 174 transition count 305
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 608 place count 167 transition count 305
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 18 with 2 rules applied. Total rules applied 610 place count 166 transition count 304
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 611 place count 166 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 613 place count 164 transition count 302
Applied a total of 613 rules in 74 ms. Remains 164 /457 variables (removed 293) and now considering 302/649 (removed 347) transitions.
[2024-06-02 18:23:30] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 164 cols
[2024-06-02 18:23:30] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 18:23:30] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-02 18:23:30] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 18:23:30] [INFO ] Invariant cache hit.
[2024-06-02 18:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:23:30] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-02 18:23:30] [INFO ] Redundant transitions in 4 ms returned []
Running 282 sub problems to find dead transitions.
[2024-06-02 18:23:30] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 18:23:30] [INFO ] Invariant cache hit.
[2024-06-02 18:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 275/438 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 1/439 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/440 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 170 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 164/164 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 275/438 variables, 163/168 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 281/449 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 1/439 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 1/440 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 452 constraints, problems are : Problem set: 0 solved, 282 unsolved in 15862 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 164/164 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
After SMT, in 24992ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 24996ms
Starting structural reductions in SI_CTL mode, iteration 1 : 164/457 places, 302/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25349 ms. Remains : 164/457 places, 302/649 transitions.
[2024-06-02 18:23:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:23:55] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:23:55] [INFO ] Input system was already deterministic with 302 transitions.
[2024-06-02 18:23:55] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:23:55] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:23:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2113194584720871160.gal : 1 ms
[2024-06-02 18:23:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality869181338644618461.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2113194584720871160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality869181338644618461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.23236e+07,0.211247,11692,2,1704,5,32945,6,0,946,30174,0


Converting to forward existential form...Done !
original formula: A(EF((((p144==0)&&(!((p86==0)||(p308==1))))&&((p274==0)||(p351==1)))) U AG((p100==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((p100==1)))))))) * !(E(!(!(E(TRUE U !((p100==1))))) U (!(E(TRUE U (((p144==0)&&(!(...249
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t40, t51, t75, t78, t87, Intersection with reachable at each step enabled. (destroye...194
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:24:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:24:25] [INFO ] Applying decomposition
[2024-06-02 18:24:25] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15207677975348295617.txt' '-o' '/tmp/graph15207677975348295617.bin' '-w' '/tmp/graph15207677975348295617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15207677975348295617.bin' '-l' '-1' '-v' '-w' '/tmp/graph15207677975348295617.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:24:26] [INFO ] Decomposing Gal with order
[2024-06-02 18:24:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:24:26] [INFO ] Removed a total of 257 redundant transitions.
[2024-06-02 18:24:26] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:24:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2024-06-02 18:24:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality8029456551398071435.gal : 3 ms
[2024-06-02 18:24:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality17805000618218464908.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8029456551398071435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17805000618218464908.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,8.23236e+07,0.045637,5424,142,76,2137,585,614,3027,106,1732,0


Converting to forward existential form...Done !
original formula: A(EF((((i1.i0.u8.p144==0)&&(!((i0.i0.u0.p86==0)||(i4.i1.u27.p308==1))))&&((i3.u22.p274==0)||(i4.i1.u27.p351==1)))) U AG((i0.i0.u3.p100==1...158
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((i0.i0.u3.p100==1)))))))) * !(E(!(!(E(TRUE U !((i0.i0.u3.p100==1))))) U (!(E(TRUE ...321
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u6.t87, i1.i1.u11.t75, i1.i1.u12.t78, i4.i1.u27.t51, i6.i0.u34.t40, i7.i1.u60.t7, i7.i1...263
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,0,7.47989,271600,1,0,276980,8216,3587,2.51937e+06,531,61414,179544
FORMULA CO4-PT-15-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 649
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 431 transition count 624
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 431 transition count 624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 431 transition count 623
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 67 place count 415 transition count 600
Iterating global reduction 2 with 16 rules applied. Total rules applied 83 place count 415 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 415 transition count 599
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 411 transition count 594
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 411 transition count 594
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 407 transition count 590
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 407 transition count 590
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 103 place count 407 transition count 587
Applied a total of 103 rules in 23 ms. Remains 407 /457 variables (removed 50) and now considering 587/649 (removed 62) transitions.
// Phase 1: matrix 587 rows 407 cols
[2024-06-02 18:24:33] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 18:24:33] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:24:33] [INFO ] Invariant cache hit.
[2024-06-02 18:24:33] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2024-06-02 18:24:33] [INFO ] Invariant cache hit.
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
[2024-06-02 18:24:50] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-02 18:24:51] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/994 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 994/994 variables, and 414 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: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
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, 2/7 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (OVERLAPS) 587/994 variables, 407/414 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/994 variables, 586/1000 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-06-02 18:25:26] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 1/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 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 407/407 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 3/3 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 407/457 places, 587/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 407/457 places, 587/649 transitions.
[2024-06-02 18:25:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:25:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:25:34] [INFO ] Input system was already deterministic with 587 transitions.
[2024-06-02 18:25:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:25:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:25:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11875399263307725749.gal : 3 ms
[2024-06-02 18:25:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality3807565703200275747.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11875399263307725749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3807565703200275747.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.32369e+11,4.76958,130264,2,16307,5,424844,6,0,2207,583268,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 18:26:04] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:26:04] [INFO ] Applying decomposition
[2024-06-02 18:26:04] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15488457655616966494.txt' '-o' '/tmp/graph15488457655616966494.bin' '-w' '/tmp/graph15488457655616966494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15488457655616966494.bin' '-l' '-1' '-v' '-w' '/tmp/graph15488457655616966494.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:26:04] [INFO ] Decomposing Gal with order
[2024-06-02 18:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:26:04] [INFO ] Removed a total of 384 redundant transitions.
[2024-06-02 18:26:04] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 8 ms.
[2024-06-02 18:26:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality492368514928190786.gal : 4 ms
[2024-06-02 18:26:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality658607900831874571.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality492368514928190786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality658607900831874571.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32369e+11,8.61866,276720,2391,86,483710,1281,1087,2.24507e+06,95,6134,0


Converting to forward existential form...Done !
original formula: EG(A(!((AG(AX((i2.u25.p193==1))) * ((i10.u109.p584!=1)||(i4.u53.p302==1)))) U ((EX(((((i4.u56.p346==0)||(i14.u134.p721==1))&&(i3.i1.i4.u5...263
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((EX(((((i4.u56.p346==0)||(i14.u134.p721==1))&&(i3.i1.i4.u50.p259==0)) * EX((i16.u51.p299==0))...701
Reverse transition relation is NOT exact ! Due to transitions t75, t107, t133, t143, t212, t217, t230, t247, t263, t279, t307, t418, t438, t473, t565, t569...947
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 649
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 427 transition count 620
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 427 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 427 transition count 619
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 76 place count 410 transition count 595
Iterating global reduction 2 with 17 rules applied. Total rules applied 93 place count 410 transition count 595
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 410 transition count 593
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 406 transition count 588
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 406 transition count 588
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 402 transition count 584
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 402 transition count 584
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 402 transition count 581
Applied a total of 114 rules in 28 ms. Remains 402 /457 variables (removed 55) and now considering 581/649 (removed 68) transitions.
// Phase 1: matrix 581 rows 402 cols
[2024-06-02 18:26:34] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 18:26:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:26:34] [INFO ] Invariant cache hit.
[2024-06-02 18:26:34] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-06-02 18:26:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:26:44] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/983 variables, 402/408 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/983 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 983/983 variables, and 410 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/402 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (OVERLAPS) 581/983 variables, 402/410 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/983 variables, 580/990 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/983 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 983/983 variables, and 990 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 3/3 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Starting structural reductions in LTL mode, iteration 1 : 402/457 places, 581/649 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60574 ms. Remains : 402/457 places, 581/649 transitions.
[2024-06-02 18:27:35] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:27:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:27:35] [INFO ] Input system was already deterministic with 581 transitions.
[2024-06-02 18:27:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:27:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:27:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11941828918041026076.gal : 2 ms
[2024-06-02 18:27:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality5444298441504036765.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11941828918041026076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5444298441504036765.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.1865e+11,4.46488,120912,2,15308,5,382989,6,0,2182,544154,0


Converting to forward existential form...Done !
original formula: EX(EX(EG((p220==1))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),(p220==1))] != FALSE
(forward)formula 0,0,24.4347,578944,1,0,48,3.20838e+06,18,2,10001,1.3555e+06,45
FORMULA CO4-PT-15-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Graph (trivial) has 489 edges and 457 vertex of which 2 / 457 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 948 edges and 456 vertex of which 449 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 448 transition count 471
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 175 rules applied. Total rules applied 348 place count 280 transition count 464
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 350 place count 278 transition count 464
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 350 place count 278 transition count 426
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 426 place count 240 transition count 426
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 437 place count 229 transition count 414
Iterating global reduction 3 with 11 rules applied. Total rules applied 448 place count 229 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 450 place count 229 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 451 place count 228 transition count 412
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 451 place count 228 transition count 407
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 461 place count 223 transition count 407
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 468 place count 216 transition count 395
Iterating global reduction 5 with 7 rules applied. Total rules applied 475 place count 216 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 476 place count 216 transition count 394
Performed 28 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 532 place count 188 transition count 362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 10 rules applied. Total rules applied 542 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 8 rules applied. Total rules applied 550 place count 185 transition count 347
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 5 rules applied. Total rules applied 555 place count 183 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 556 place count 182 transition count 344
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 559 place count 179 transition count 338
Iterating global reduction 10 with 3 rules applied. Total rules applied 562 place count 179 transition count 338
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 568 place count 176 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 10 with 3 rules applied. Total rules applied 571 place count 176 transition count 332
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 574 place count 175 transition count 330
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 576 place count 174 transition count 329
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 577 place count 173 transition count 327
Iterating global reduction 13 with 1 rules applied. Total rules applied 578 place count 173 transition count 327
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 579 place count 172 transition count 325
Iterating global reduction 13 with 1 rules applied. Total rules applied 580 place count 172 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 581 place count 172 transition count 324
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 583 place count 171 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 14 with 14 rules applied. Total rules applied 597 place count 171 transition count 309
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 14 with 7 rules applied. Total rules applied 604 place count 171 transition count 302
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 611 place count 164 transition count 302
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 611 place count 164 transition count 301
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 613 place count 163 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 615 place count 162 transition count 300
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 617 place count 160 transition count 298
Applied a total of 617 rules in 59 ms. Remains 160 /457 variables (removed 297) and now considering 298/649 (removed 351) transitions.
[2024-06-02 18:27:59] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
// Phase 1: matrix 272 rows 160 cols
[2024-06-02 18:27:59] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 18:27:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:27:59] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2024-06-02 18:27:59] [INFO ] Invariant cache hit.
[2024-06-02 18:28:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:28:00] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-02 18:28:00] [INFO ] Redundant transitions in 1 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 18:28:00] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2024-06-02 18:28:00] [INFO ] Invariant cache hit.
[2024-06-02 18:28:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 271/431 variables, 160/165 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 1/432 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/432 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 166 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8600 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 271/431 variables, 160/165 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/431 variables, 278/443 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/431 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 1/432 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/432 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 444 constraints, problems are : Problem set: 0 solved, 278 unsolved in 11694 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
After SMT, in 20351ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 20354ms
Starting structural reductions in SI_CTL mode, iteration 1 : 160/457 places, 298/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20722 ms. Remains : 160/457 places, 298/649 transitions.
[2024-06-02 18:28:20] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:28:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:28:20] [INFO ] Input system was already deterministic with 298 transitions.
[2024-06-02 18:28:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:28:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:28:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7048540194087659883.gal : 2 ms
[2024-06-02 18:28:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality3726450773956926541.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7048540194087659883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3726450773956926541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.1159e+07,0.224292,12980,2,1927,5,36026,6,0,928,34310,0


Converting to forward existential form...Done !
original formula: EG((((p132==0)||(p326==1))||(p231==1)))
=> equivalent forward existential formula: [FwdG(Init,(((p132==0)||(p326==1))||(p231==1)))] != FALSE
Hit Full ! (commute/partial/dont) 291/0/7
(forward)formula 0,1,1.28937,46616,1,0,8,244974,19,4,4619,104683,8
FORMULA CO4-PT-15-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 457/457 places, 649/649 transitions.
Graph (trivial) has 492 edges and 457 vertex of which 2 / 457 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 948 edges and 456 vertex of which 449 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 174 rules applied. Total rules applied 176 place count 448 transition count 468
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 178 rules applied. Total rules applied 354 place count 277 transition count 461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 356 place count 275 transition count 461
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 356 place count 275 transition count 423
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 432 place count 237 transition count 423
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 444 place count 225 transition count 410
Iterating global reduction 3 with 12 rules applied. Total rules applied 456 place count 225 transition count 410
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 456 place count 225 transition count 404
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 468 place count 219 transition count 404
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 476 place count 211 transition count 390
Iterating global reduction 3 with 8 rules applied. Total rules applied 484 place count 211 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 485 place count 211 transition count 389
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 4 with 54 rules applied. Total rules applied 539 place count 184 transition count 358
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 10 rules applied. Total rules applied 549 place count 184 transition count 348
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 8 rules applied. Total rules applied 557 place count 181 transition count 343
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 with 5 rules applied. Total rules applied 562 place count 179 transition count 340
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 565 place count 178 transition count 338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 567 place count 177 transition count 337
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 570 place count 174 transition count 331
Iterating global reduction 9 with 3 rules applied. Total rules applied 573 place count 174 transition count 331
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 581 place count 170 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 9 with 3 rules applied. Total rules applied 584 place count 170 transition count 324
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 587 place count 169 transition count 322
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 589 place count 168 transition count 321
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 590 place count 167 transition count 319
Iterating global reduction 12 with 1 rules applied. Total rules applied 591 place count 167 transition count 319
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 592 place count 166 transition count 317
Iterating global reduction 12 with 1 rules applied. Total rules applied 593 place count 166 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 594 place count 166 transition count 316
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 596 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 13 with 13 rules applied. Total rules applied 609 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 13 with 7 rules applied. Total rules applied 616 place count 165 transition count 295
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 623 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 15 with 2 rules applied. Total rules applied 625 place count 157 transition count 294
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 626 place count 157 transition count 294
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 628 place count 155 transition count 292
Applied a total of 628 rules in 76 ms. Remains 155 /457 variables (removed 302) and now considering 292/649 (removed 357) transitions.
[2024-06-02 18:28:21] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 155 cols
[2024-06-02 18:28:21] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 18:28:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:28:22] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 18:28:22] [INFO ] Invariant cache hit.
[2024-06-02 18:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:28:22] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-06-02 18:28:22] [INFO ] Redundant transitions in 0 ms returned []
Running 272 sub problems to find dead transitions.
[2024-06-02 18:28:22] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 18:28:22] [INFO ] Invariant cache hit.
[2024-06-02 18:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
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 8273 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]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
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 10845 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]
After SMT, in 19167ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 19171ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/457 places, 292/649 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19584 ms. Remains : 155/457 places, 292/649 transitions.
[2024-06-02 18:28:41] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:28:41] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:28:41] [INFO ] Input system was already deterministic with 292 transitions.
[2024-06-02 18:28:41] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:28:41] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:28:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality6024681409352095193.gal : 1 ms
[2024-06-02 18:28:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3792769743493331322.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6024681409352095193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3792769743493331322.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,4.76824e+07,0.192106,10812,2,1850,5,29583,6,0,902,27375,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.996518,38872,1,0,8,197718,19,4,4423,74290,8
FORMULA CO4-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:28:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:28:42] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:28:42] [INFO ] Applying decomposition
[2024-06-02 18:28:42] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph9973368680054531428.txt' '-o' '/tmp/graph9973368680054531428.bin' '-w' '/tmp/graph9973368680054531428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9973368680054531428.bin' '-l' '-1' '-v' '-w' '/tmp/graph9973368680054531428.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:28:42] [INFO ] Decomposing Gal with order
[2024-06-02 18:28:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:28:42] [INFO ] Removed a total of 414 redundant transitions.
[2024-06-02 18:28:42] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:28:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 8 ms.
[2024-06-02 18:28:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14705135152787426418.gal : 4 ms
[2024-06-02 18:28:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2174808686481483827.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14705135152787426418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2174808686481483827.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,4.00111e+11,1.20703,47448,1543,86,80619,1545,1185,251442,103,8282,0


Converting to forward existential form...Done !
original formula: AF((AX(AX(AG(((i6.u10.p114!=0)&&(i7.u61.p304!=1))))) * (((i12.u103.p499==0)||(i17.u148.p747==0)) + AF(((i9.u79.p402==0)&&(i4.u28.p198==1)...160
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EX(!(!(E(TRUE U !(((i6.u10.p114!=0)&&(i7.u61.p304!=1))))))))))) * (((i12.u103.p499==0)||(...235
Reverse transition relation is NOT exact ! Due to transitions t16, t88, t147, t157, t179, t204, t231, t249, t266, t298, t339, t432, t448, t466, t479, t520,...1340
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,0,448.228,2766588,1,0,3.36692e+06,1717,2561,2.00851e+07,196,9288,3179695
FORMULA CO4-PT-15-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(A(!((AG(AX((i3.u27.p193==1))) * ((i15.u124.p584!=1)||(i7.u61.p302==1)))) U ((EX(((((i7.u69.p346==0)||(i17.u148.p721==1))&&(i6.u59.p259...256
=> equivalent forward existential formula: [FwdG(Init,!((E(!(((EX(((((i7.u69.p346==0)||(i17.u148.p721==1))&&(i6.u59.p259==0)) * EX((i0.u60.p299==0)))) * !(...680
(forward)formula 1,0,600.683,3093420,1,0,3.7804e+06,1717,2599,2.17282e+07,196,9725,1768294
FORMULA CO4-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1173463 ms.

BK_STOP 1717353523869

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-5568"
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 r550-tall-171734898600113"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;