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-171734898600129.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-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898600129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 248K 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-17-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717353082232

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:31:23] [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:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:31:23] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-02 18:31:23] [INFO ] Transformed 967 places.
[2024-06-02 18:31:23] [INFO ] Transformed 1150 transitions.
[2024-06-02 18:31:23] [INFO ] Found NUPN structural information;
[2024-06-02 18:31:23] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Deduced a syphon composed of 198 places in 10 ms
Reduce places removed 198 places and 238 transitions.
Support contains 62 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 752 transition count 911
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 165 place count 605 transition count 764
Iterating global reduction 1 with 147 rules applied. Total rules applied 312 place count 605 transition count 764
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 317 place count 605 transition count 759
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 383 place count 539 transition count 693
Iterating global reduction 2 with 66 rules applied. Total rules applied 449 place count 539 transition count 693
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 456 place count 532 transition count 685
Iterating global reduction 2 with 7 rules applied. Total rules applied 463 place count 532 transition count 685
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 465 place count 532 transition count 683
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 466 place count 531 transition count 682
Iterating global reduction 3 with 1 rules applied. Total rules applied 467 place count 531 transition count 682
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 530 transition count 681
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 530 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 470 place count 530 transition count 680
Applied a total of 470 rules in 186 ms. Remains 530 /769 variables (removed 239) and now considering 680/912 (removed 232) transitions.
// Phase 1: matrix 680 rows 530 cols
[2024-06-02 18:31:23] [INFO ] Computed 5 invariants in 27 ms
[2024-06-02 18:31:24] [INFO ] Implicit Places using invariants in 321 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/769 places, 680/912 transitions.
Applied a total of 0 rules in 14 ms. Remains 529 /529 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 567 ms. Remains : 529/769 places, 680/912 transitions.
Support contains 62 out of 529 places after structural reductions.
[2024-06-02 18:31:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:31:24] [INFO ] Flatten gal took : 70 ms
[2024-06-02 18:31:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-17-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:31:24] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:31:24] [INFO ] Input system was already deterministic with 680 transitions.
Support contains 46 out of 529 places (down from 62) after GAL structural reductions.
FORMULA CO4-PT-17-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (56 resets) in 2463 ms. (16 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4004 steps (18 resets) in 29 ms. (133 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4002 steps (14 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (20 resets) in 10 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (19 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (18 resets) in 35 ms. (111 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4001 steps (19 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (18 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 12/13 properties
// Phase 1: matrix 680 rows 529 cols
[2024-06-02 18:31:25] [INFO ] Computed 4 invariants in 6 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, 12 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 70/112 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 286/398 variables, 60/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 510/908 variables, 239/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/908 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 268/1176 variables, 165/510 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1176 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 28/1204 variables, 20/530 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1204 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 4/1208 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1208 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 1/1209 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1209 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/1209 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 533 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1690 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 7/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 70/112 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 286/398 variables, 60/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 12/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 510/908 variables, 239/357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/908 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 268/1176 variables, 165/522 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1176 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 28/1204 variables, 20/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1204 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 4/1208 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1208 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 1/1209 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1209 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/1209 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 545 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2480 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 4210ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 4231 steps, including 45 resets, run visited all 1 properties in 6 ms. (steps per millisecond=705 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 1708 ms.
[2024-06-02 18:31:31] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:31:31] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:31:31] [INFO ] Input system was already deterministic with 680 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 874 edges and 529 vertex of which 518 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 528 transition count 680
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 497 transition count 649
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 497 transition count 649
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 497 transition count 646
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 82 place count 481 transition count 629
Iterating global reduction 2 with 16 rules applied. Total rules applied 98 place count 481 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 481 transition count 628
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 104 place count 476 transition count 622
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 476 transition count 622
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 474 transition count 620
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 474 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 474 transition count 619
Applied a total of 114 rules in 39 ms. Remains 474 /529 variables (removed 55) and now considering 619/680 (removed 61) transitions.
// Phase 1: matrix 619 rows 474 cols
[2024-06-02 18:31:31] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:31:31] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 18:31:31] [INFO ] Invariant cache hit.
[2024-06-02 18:31:31] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:31:51] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 27 ms to minimize.
[2024-06-02 18:31:52] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1093 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/474 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 616/1095 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 618 unsolved
SMT process timed out in 60236ms, After SMT, problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Starting structural reductions in LTL mode, iteration 1 : 474/529 places, 619/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60643 ms. Remains : 474/529 places, 619/680 transitions.
[2024-06-02 18:32:32] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:32:32] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:32:32] [INFO ] Input system was already deterministic with 619 transitions.
[2024-06-02 18:32:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:32:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:32:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17231531380214451685.gal : 14 ms
[2024-06-02 18:32:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality907372979661266965.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/CTLCardinality17231531380214451685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality907372979661266965.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.91462e+10,1.26152,44744,2,8763,5,151959,6,0,2509,198184,0


Converting to forward existential form...Done !
original formula: (EG(AG(((p88==0)&&((p132==0)||(p98==1))))) * A(!(AX(AF(((p885==0)||(p209==1))))) U AF(EX(((p701==0)||(p88==1))))))
=> equivalent forward existential formula: [(((Init * EG(!(E(TRUE U !(((p88==0)&&((p132==0)||(p98==1)))))))) * !(EG(!(!(EG(!(EX(((p701==0)||(p88==1))))))))...309
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...482
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 18:33:02] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:33:02] [INFO ] Applying decomposition
[2024-06-02 18:33:02] [INFO ] Flatten gal took : 15 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/graph18057285832624745041.txt' '-o' '/tmp/graph18057285832624745041.bin' '-w' '/tmp/graph18057285832624745041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18057285832624745041.bin' '-l' '-1' '-v' '-w' '/tmp/graph18057285832624745041.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:33:02] [INFO ] Decomposing Gal with order
[2024-06-02 18:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:33:02] [INFO ] Removed a total of 204 redundant transitions.
[2024-06-02 18:33:02] [INFO ] Flatten gal took : 143 ms
[2024-06-02 18:33:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 26 ms.
[2024-06-02 18:33:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7557690667860516690.gal : 42 ms
[2024-06-02 18:33:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1143999208355123574.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/CTLCardinality7557690667860516690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1143999208355123574.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.91462e+10,0.24525,13156,614,90,16712,3458,1072,30064,97,12714,0


Converting to forward existential form...Done !
original formula: (EG(AG(((i1.u5.p88==0)&&((i3.i1.i1.u17.p132==0)||(i1.u8.p98==1))))) * A(!(AX(AF(((i0.u160.p885==0)||(i2.u27.p209==1))))) U AF(EX(((i11.u1...187
=> equivalent forward existential formula: [(((Init * EG(!(E(TRUE U !(((i1.u5.p88==0)&&((i3.i1.i1.u17.p132==0)||(i1.u8.p98==1)))))))) * !(EG(!(!(EG(!(EX(((...394
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t54, t192, t247, t351, t370, t481, t502, t540, i0.t243, i0.t4, i0.u168.t8, i0.u168....770
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 498 transition count 651
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 498 transition count 651
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 498 transition count 648
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 78 place count 483 transition count 632
Iterating global reduction 2 with 15 rules applied. Total rules applied 93 place count 483 transition count 632
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 483 transition count 631
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 478 transition count 625
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 478 transition count 625
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 476 transition count 623
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 476 transition count 623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 476 transition count 622
Applied a total of 109 rules in 37 ms. Remains 476 /529 variables (removed 53) and now considering 622/680 (removed 58) transitions.
// Phase 1: matrix 622 rows 476 cols
[2024-06-02 18:33:33] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:33:33] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 18:33:33] [INFO ] Invariant cache hit.
[2024-06-02 18:33:33] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-06-02 18:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 18:33:54] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 4 ms to minimize.
[2024-06-02 18:33:54] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1098 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 476/529 places, 622/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60632 ms. Remains : 476/529 places, 622/680 transitions.
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 44 ms
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:34:33] [INFO ] Input system was already deterministic with 622 transitions.
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:34:33] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:34:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3722346219815083331.gal : 3 ms
[2024-06-02 18:34:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14460287471724153966.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/CTLCardinality3722346219815083331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14460287471724153966.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.94541e+10,1.60345,47628,2,8826,5,158690,6,0,2522,213525,0


Converting to forward existential form...Done !
original formula: EX((AG(EX(EF(((p487==0)||(p257==1))))) * ((p403==0)||(p711==1))))
=> equivalent forward existential formula: [((EY(Init) * ((p403==0)||(p711==1))) * !(E(TRUE U !(EX(E(TRUE U ((p487==0)||(p257==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t157, t183, t...500
Detected timeout of ITS tools.
[2024-06-02 18:35:04] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:35:04] [INFO ] Applying decomposition
[2024-06-02 18:35:04] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph602663833118869037.txt' '-o' '/tmp/graph602663833118869037.bin' '-w' '/tmp/graph602663833118869037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph602663833118869037.bin' '-l' '-1' '-v' '-w' '/tmp/graph602663833118869037.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:35:04] [INFO ] Decomposing Gal with order
[2024-06-02 18:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:35:04] [INFO ] Removed a total of 213 redundant transitions.
[2024-06-02 18:35:04] [INFO ] Flatten gal took : 58 ms
[2024-06-02 18:35:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 26 ms.
[2024-06-02 18:35:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality315789376514355231.gal : 6 ms
[2024-06-02 18:35:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality886096626689485027.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/CTLCardinality315789376514355231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality886096626689485027.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.94541e+10,0.550707,15400,730,84,22192,1309,1109,42981,100,5408,0


Converting to forward existential form...Done !
original formula: EX((AG(EX(EF(((i6.u74.p487==0)||(i2.i0.i1.u39.p257==1))))) * ((i8.i0.i1.u57.p403==0)||(i14.u124.p711==1))))
=> equivalent forward existential formula: [((EY(Init) * ((i8.i0.i1.u57.p403==0)||(i14.u124.p711==1))) * !(E(TRUE U !(EX(E(TRUE U ((i6.u74.p487==0)||(i2.i0...188
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t54, t130, t218, t226, t248, t372, t484, t542, i0.t504, i0.t501, i0.u7.t508, i0.u14...834
(forward)formula 0,0,1.31196,45496,1,0,77039,1693,7452,197276,512,5408,194277
FORMULA CO4-PT-17-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 35 place count 494 transition count 647
Iterating global reduction 1 with 33 rules applied. Total rules applied 68 place count 494 transition count 647
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 494 transition count 644
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 87 place count 478 transition count 627
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 478 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 478 transition count 626
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 473 transition count 620
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 473 transition count 620
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 471 transition count 618
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 471 transition count 617
Applied a total of 119 rules in 34 ms. Remains 471 /529 variables (removed 58) and now considering 617/680 (removed 63) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:35:05] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:35:05] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-02 18:35:05] [INFO ] Invariant cache hit.
[2024-06-02 18:35:06] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:35:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:35:25] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-02 18:35:26] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 471/529 places, 617/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 471/529 places, 617/680 transitions.
[2024-06-02 18:36:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:36:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:36:06] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:36:06] [INFO ] Flatten gal took : 34 ms
[2024-06-02 18:36:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:36:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8906347168654727410.gal : 9 ms
[2024-06-02 18:36:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality11406356398856020830.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/CTLCardinality8906347168654727410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11406356398856020830.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.87379e+10,1.35638,45148,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AX(EG(AF(AX((p735==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(!(EX(!((p735==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:36:36] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:36:36] [INFO ] Applying decomposition
[2024-06-02 18:36:36] [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/graph9418452609051342224.txt' '-o' '/tmp/graph9418452609051342224.bin' '-w' '/tmp/graph9418452609051342224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9418452609051342224.bin' '-l' '-1' '-v' '-w' '/tmp/graph9418452609051342224.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:36:36] [INFO ] Decomposing Gal with order
[2024-06-02 18:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:36:36] [INFO ] Removed a total of 205 redundant transitions.
[2024-06-02 18:36:36] [INFO ] Flatten gal took : 61 ms
[2024-06-02 18:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 3 ms.
[2024-06-02 18:36:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15434759181154542788.gal : 11 ms
[2024-06-02 18:36:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality6974756691321186901.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/CTLCardinality15434759181154542788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6974756691321186901.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,1.87379e+10,0.221113,11624,709,85,14964,1268,978,25171,101,4825,0


Converting to forward existential form...Done !
original formula: AX(EG(AF(AX((i14.i0.i0.u116.p735==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EG(!(!(EX(!((i14.i0.i0.u116.p735==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t64, t196, t247, t351, t370, t481, t501, t539, i0.t498, i0.u7.t505, i1.t613, i1.t45...762
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,1,24.7457,686332,1,0,1.03416e+06,3292,5932,4.16359e+06,546,17041,696325
FORMULA CO4-PT-17-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 35 place count 494 transition count 647
Iterating global reduction 1 with 33 rules applied. Total rules applied 68 place count 494 transition count 647
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 494 transition count 644
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 87 place count 478 transition count 627
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 478 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 478 transition count 626
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 473 transition count 620
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 473 transition count 620
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 471 transition count 618
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 471 transition count 617
Applied a total of 119 rules in 41 ms. Remains 471 /529 variables (removed 58) and now considering 617/680 (removed 63) transitions.
[2024-06-02 18:37:01] [INFO ] Invariant cache hit.
[2024-06-02 18:37:01] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 18:37:01] [INFO ] Invariant cache hit.
[2024-06-02 18:37:02] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:37:21] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-06-02 18:37:21] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 471/529 places, 617/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60577 ms. Remains : 471/529 places, 617/680 transitions.
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:02] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:38:02] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:38:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5956262981962838669.gal : 17 ms
[2024-06-02 18:38:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality4607104836149757374.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/CTLCardinality5956262981962838669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4607104836149757374.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.87379e+10,1.2346,45172,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: EF(AX((p212==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p212==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
(forward)formula 0,1,17.162,490288,1,0,785,1.76848e+06,1251,509,13496,1.7245e+06,1241
FORMULA CO4-PT-17-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Graph (trivial) has 571 edges and 529 vertex of which 2 / 529 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 873 edges and 528 vertex of which 517 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 516 transition count 465
Reduce places removed 201 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 1 with 204 rules applied. Total rules applied 408 place count 315 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 409 place count 314 transition count 462
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 409 place count 314 transition count 409
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 515 place count 261 transition count 409
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 524 place count 252 transition count 400
Iterating global reduction 3 with 9 rules applied. Total rules applied 533 place count 252 transition count 400
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 535 place count 252 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 536 place count 251 transition count 398
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 536 place count 251 transition count 395
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 542 place count 248 transition count 395
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 546 place count 244 transition count 391
Iterating global reduction 5 with 4 rules applied. Total rules applied 550 place count 244 transition count 391
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 596 place count 221 transition count 366
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 600 place count 221 transition count 362
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 6 with 3 rules applied. Total rules applied 603 place count 220 transition count 360
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 606 place count 219 transition count 358
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 8 with 3 rules applied. Total rules applied 609 place count 218 transition count 356
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 611 place count 217 transition count 355
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 616 place count 212 transition count 350
Iterating global reduction 10 with 5 rules applied. Total rules applied 621 place count 212 transition count 350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 625 place count 210 transition count 348
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 626 place count 209 transition count 347
Iterating global reduction 10 with 1 rules applied. Total rules applied 627 place count 209 transition count 347
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 628 place count 208 transition count 345
Iterating global reduction 10 with 1 rules applied. Total rules applied 629 place count 208 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 630 place count 208 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 643 place count 208 transition count 331
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 11 with 8 rules applied. Total rules applied 651 place count 208 transition count 323
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 659 place count 200 transition count 323
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 661 place count 199 transition count 322
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 663 place count 197 transition count 320
Applied a total of 663 rules in 240 ms. Remains 197 /529 variables (removed 332) and now considering 320/680 (removed 360) transitions.
// Phase 1: matrix 320 rows 197 cols
[2024-06-02 18:38:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:38:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 18:38:19] [INFO ] Invariant cache hit.
[2024-06-02 18:38:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:38:20] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-02 18:38:20] [INFO ] Redundant transitions in 15 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-02 18:38:20] [INFO ] Invariant cache hit.
[2024-06-02 18:38:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 319/516 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 1/517 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 0/517 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 202 constraints, problems are : Problem set: 0 solved, 307 unsolved in 11583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (OVERLAPS) 319/516 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 307/508 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 1/517 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 0/517 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 307 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 509 constraints, problems are : Problem set: 0 solved, 307 unsolved in 14749 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 0/0 constraints]
After SMT, in 26472ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 26478ms
Starting structural reductions in SI_CTL mode, iteration 1 : 197/529 places, 320/680 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27073 ms. Remains : 197/529 places, 320/680 transitions.
[2024-06-02 18:38:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:38:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:38:46] [INFO ] Input system was already deterministic with 320 transitions.
[2024-06-02 18:38:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:38:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:38:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11965880811531221868.gal : 13 ms
[2024-06-02 18:38:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2024943853156121674.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11965880811531221868.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2024943853156121674.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 3329 steps (281 resets) in 43 ms. (75 steps per ms) remains 0/1 properties
FORMULA CO4-PT-17-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 496 transition count 649
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 496 transition count 649
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 496 transition count 646
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 81 place count 482 transition count 631
Iterating global reduction 2 with 14 rules applied. Total rules applied 95 place count 482 transition count 631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 482 transition count 630
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 477 transition count 624
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 477 transition count 624
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 475 transition count 622
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 475 transition count 622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 475 transition count 621
Applied a total of 111 rules in 185 ms. Remains 475 /529 variables (removed 54) and now considering 621/680 (removed 59) transitions.
// Phase 1: matrix 621 rows 475 cols
[2024-06-02 18:38:47] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:38:47] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-06-02 18:38:47] [INFO ] Invariant cache hit.
[2024-06-02 18:38:47] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2024-06-02 18:38:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1096 variables, 475/479 constraints. Problems are: Problem set: 0 solved, 620 unsolved
[2024-06-02 18:39:08] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 3 ms to minimize.
[2024-06-02 18:39:08] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1096 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 481 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/475 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1096 variables, 475/481 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1096 variables, 620/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1096 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1101 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 2/2 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 475/529 places, 621/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61150 ms. Remains : 475/529 places, 621/680 transitions.
[2024-06-02 18:39:48] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:39:48] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:39:48] [INFO ] Input system was already deterministic with 621 transitions.
[2024-06-02 18:39:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:48] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:39:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality9262599056405614658.gal : 2 ms
[2024-06-02 18:39:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14074682146442518393.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/CTLCardinality9262599056405614658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14074682146442518393.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.9252e+10,1.24338,45760,2,8853,5,155083,6,0,2517,202700,0


Converting to forward existential form...Done !
original formula: EX(AG(((p805==1) + EF((p239==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p805==1) + E(TRUE U (p239==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t126, t157, t183, t...488
Detected timeout of ITS tools.
[2024-06-02 18:40:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:40:18] [INFO ] Applying decomposition
[2024-06-02 18:40:18] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4832701615000685603.txt' '-o' '/tmp/graph4832701615000685603.bin' '-w' '/tmp/graph4832701615000685603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4832701615000685603.bin' '-l' '-1' '-v' '-w' '/tmp/graph4832701615000685603.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:40:18] [INFO ] Decomposing Gal with order
[2024-06-02 18:40:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:40:18] [INFO ] Removed a total of 196 redundant transitions.
[2024-06-02 18:40:18] [INFO ] Flatten gal took : 36 ms
[2024-06-02 18:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 12 ms.
[2024-06-02 18:40:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality917571913672631913.gal : 10 ms
[2024-06-02 18:40:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11866349123019652548.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/CTLCardinality917571913672631913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11866349123019652548.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9252e+10,0.253259,13004,666,89,18004,1404,947,28368,100,5301,0


Converting to forward existential form...Done !
original formula: EX(AG(((i16.u135.p805==1) + EF((i4.u33.p239==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((i16.u135.p805==1) + E(TRUE U (i4.u33.p239==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t197, t207, t248, t321, t326, t352, t371, t542, i0.t244, i1.t503, i1.t500, i1.u8.t5...763
(forward)formula 0,0,1.00674,44684,1,0,79903,2095,6239,186012,498,6263,184905
FORMULA CO4-PT-17-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 502 transition count 655
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 502 transition count 655
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 502 transition count 652
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 493 transition count 643
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 493 transition count 643
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 493 transition count 642
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 490 transition count 638
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 490 transition count 638
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 81 place count 489 transition count 637
Iterating global reduction 3 with 1 rules applied. Total rules applied 82 place count 489 transition count 637
Applied a total of 82 rules in 41 ms. Remains 489 /529 variables (removed 40) and now considering 637/680 (removed 43) transitions.
// Phase 1: matrix 637 rows 489 cols
[2024-06-02 18:40:19] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:40:19] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 18:40:19] [INFO ] Invariant cache hit.
[2024-06-02 18:40:19] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 636 sub problems to find dead transitions.
[2024-06-02 18:40:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (OVERLAPS) 637/1126 variables, 489/493 constraints. Problems are: Problem set: 0 solved, 636 unsolved
[2024-06-02 18:40:41] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-06-02 18:40:41] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1126/1126 variables, and 495 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 1 (OVERLAPS) 1/489 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/489 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 4 (OVERLAPS) 637/1126 variables, 489/495 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1126 variables, 636/1131 constraints. Problems are: Problem set: 0 solved, 636 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1126 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1126/1126 variables, and 1131 constraints, problems are : Problem set: 0 solved, 636 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 489/489 constraints, PredecessorRefiner: 636/636 constraints, Known Traps: 2/2 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 636 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 489/529 places, 637/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60604 ms. Remains : 489/529 places, 637/680 transitions.
[2024-06-02 18:41:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:20] [INFO ] Input system was already deterministic with 637 transitions.
[2024-06-02 18:41:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality262148334073061234.gal : 2 ms
[2024-06-02 18:41:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality2832416862913251456.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/CTLCardinality262148334073061234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2832416862913251456.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,2.49027e+10,1.49358,53320,2,9280,5,180469,6,0,2589,246339,0


Converting to forward existential form...Done !
original formula: AF(E(AG((((p443==0)&&(((p703==0)||(p858==1))||(p645==1)))&&((p487==0)||(p797==1)))) U (((!(((p928==0)||(p699==1))||(p249==1)))||(p247==1)...228
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !((((p443==0)&&(((p703==0)||(p858==1))||(p645==1)))&&((p487==0)||(p797==1)))))) U (((!...285
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t16, t18, t24, t25, t30, t31, t33, t34, t38, t39, t43, t47, t133,...514
Detected timeout of ITS tools.
[2024-06-02 18:41:50] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:41:50] [INFO ] Applying decomposition
[2024-06-02 18:41:50] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10328195467445880750.txt' '-o' '/tmp/graph10328195467445880750.bin' '-w' '/tmp/graph10328195467445880750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10328195467445880750.bin' '-l' '-1' '-v' '-w' '/tmp/graph10328195467445880750.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:41:50] [INFO ] Decomposing Gal with order
[2024-06-02 18:41:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:41:50] [INFO ] Removed a total of 217 redundant transitions.
[2024-06-02 18:41:50] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 5 ms.
[2024-06-02 18:41:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality2460343821554053477.gal : 4 ms
[2024-06-02 18:41:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality4729520024949952244.ctl : 14 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/CTLCardinality2460343821554053477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4729520024949952244.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.49027e+10,0.255038,12012,733,82,14906,1094,1142,27035,92,3974,0


Converting to forward existential form...Done !
original formula: AF(E(AG((((i4.i0.i1.u63.p443==0)&&(((i10.u125.p703==0)||(i7.u163.p858==1))||(i8.u111.p645==1)))&&((i4.i1.i1.u72.p487==0)||(i14.u145.p797=...363
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !((((i4.i0.i1.u63.p443==0)&&(((i10.u125.p703==0)||(i7.u163.p858==1))||(i8.u111.p645==1...420
Reverse transition relation is NOT exact ! Due to transitions t18, t47, t216, t227, t235, t257, t361, t551, t625, i0.t453, i0.t443, i1.t335, i1.t330, i1.i0...873
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 495 transition count 648
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 495 transition count 648
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 69 place count 495 transition count 645
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 84 place count 480 transition count 629
Iterating global reduction 2 with 15 rules applied. Total rules applied 99 place count 480 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 480 transition count 628
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 475 transition count 622
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 475 transition count 622
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 473 transition count 620
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 473 transition count 619
Applied a total of 115 rules in 30 ms. Remains 473 /529 variables (removed 56) and now considering 619/680 (removed 61) transitions.
// Phase 1: matrix 619 rows 473 cols
[2024-06-02 18:42:20] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:42:20] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-02 18:42:20] [INFO ] Invariant cache hit.
[2024-06-02 18:42:21] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Running 618 sub problems to find dead transitions.
[2024-06-02 18:42:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (OVERLAPS) 619/1092 variables, 473/477 constraints. Problems are: Problem set: 0 solved, 618 unsolved
[2024-06-02 18:42:40] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-06-02 18:42:41] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 479 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 618 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 1 (OVERLAPS) 1/473 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 4 (OVERLAPS) 619/1092 variables, 473/479 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1092 variables, 618/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1092 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 618 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 1097 constraints, problems are : Problem set: 0 solved, 618 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 618/618 constraints, Known Traps: 2/2 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 618 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 473/529 places, 619/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60861 ms. Remains : 473/529 places, 619/680 transitions.
[2024-06-02 18:43:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:21] [INFO ] Input system was already deterministic with 619 transitions.
[2024-06-02 18:43:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:21] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:43:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11253644040181450590.gal : 2 ms
[2024-06-02 18:43:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13387254180729144799.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/CTLCardinality11253644040181450590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13387254180729144799.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,1.90405e+10,1.54671,45816,2,8742,5,154412,6,0,2507,205033,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * EG(((p619==0)||(p447==1))))
=> equivalent forward existential formula: [FwdG((Init * EX(TRUE)),((p619==0)||(p447==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Hit Full ! (commute/partial/dont) 615/0/4
(forward)formula 0,1,20.265,539860,1,0,812,1.95298e+06,1263,514,14838,2.2514e+06,1271
FORMULA CO4-PT-17-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 35 place count 494 transition count 647
Iterating global reduction 1 with 33 rules applied. Total rules applied 68 place count 494 transition count 647
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 494 transition count 644
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 87 place count 478 transition count 627
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 478 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 478 transition count 626
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 473 transition count 620
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 473 transition count 620
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 471 transition count 618
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 471 transition count 617
Applied a total of 119 rules in 54 ms. Remains 471 /529 variables (removed 58) and now considering 617/680 (removed 63) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:43:41] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:43:42] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-02 18:43:42] [INFO ] Invariant cache hit.
[2024-06-02 18:43:42] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:43:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:44:01] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-06-02 18:44:01] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 471/529 places, 617/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 471/529 places, 617/680 transitions.
[2024-06-02 18:44:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:44:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:44:42] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:44:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:44:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:44:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14798741048707193919.gal : 4 ms
[2024-06-02 18:44:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality16409192693663221127.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/CTLCardinality14798741048707193919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16409192693663221127.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,1.87379e+10,1.30718,45148,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((p202==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p202==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2024-06-02 18:45:12] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:45:12] [INFO ] Applying decomposition
[2024-06-02 18:45:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3083757540853768378.txt' '-o' '/tmp/graph3083757540853768378.bin' '-w' '/tmp/graph3083757540853768378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3083757540853768378.bin' '-l' '-1' '-v' '-w' '/tmp/graph3083757540853768378.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:45:12] [INFO ] Decomposing Gal with order
[2024-06-02 18:45:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:45:12] [INFO ] Removed a total of 209 redundant transitions.
[2024-06-02 18:45:12] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:45:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 4 ms.
[2024-06-02 18:45:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality12628359136135038592.gal : 4 ms
[2024-06-02 18:45:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7137709214178676722.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/CTLCardinality12628359136135038592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7137709214178676722.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,1.87379e+10,0.248638,14180,711,94,19897,1636,1061,36291,109,5866,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((i1.u25.p202==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((i1.u25.p202==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t192, t206, t247, t351, t481, t501, t539, i0.i1.i0.u8.t505, i0.i1.i1.u15.t477, i0.i...792
(forward)formula 0,0,0.826832,38732,1,0,66524,2071,7040,164168,580,5866,163077
FORMULA CO4-PT-17-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 497 transition count 650
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 497 transition count 650
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 497 transition count 647
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 80 place count 482 transition count 631
Iterating global reduction 2 with 15 rules applied. Total rules applied 95 place count 482 transition count 631
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 482 transition count 630
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 478 transition count 625
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 478 transition count 625
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 476 transition count 623
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 476 transition count 623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 476 transition count 622
Applied a total of 109 rules in 29 ms. Remains 476 /529 variables (removed 53) and now considering 622/680 (removed 58) transitions.
// Phase 1: matrix 622 rows 476 cols
[2024-06-02 18:45:13] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:45:13] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 18:45:13] [INFO ] Invariant cache hit.
[2024-06-02 18:45:13] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-06-02 18:45:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-06-02 18:45:33] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-06-02 18:45:33] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1098 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1098 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 476/529 places, 622/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 476/529 places, 622/680 transitions.
[2024-06-02 18:46:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:46:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:46:14] [INFO ] Input system was already deterministic with 622 transitions.
[2024-06-02 18:46:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:46:14] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:46:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8500624830865142908.gal : 2 ms
[2024-06-02 18:46:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8703042784568744926.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/CTLCardinality8500624830865142908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8703042784568744926.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.94991e+10,1.35808,46696,2,8652,5,155892,6,0,2522,211037,0


Converting to forward existential form...Done !
original formula: AF(((EF(EX(TRUE)) * (p959!=0)) * (EF(!(E((p485==1) U (p214==1)))) + AF(EX(((p386!=0)&&(p93!=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (p959!=0)) * (E(TRUE U !(E((p485==1) U (p214==1)))) + !(EG(!(EX(((p386!=0)&&...181
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2024-06-02 18:46:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:46:44] [INFO ] Applying decomposition
[2024-06-02 18:46:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17857835297910019298.txt' '-o' '/tmp/graph17857835297910019298.bin' '-w' '/tmp/graph17857835297910019298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17857835297910019298.bin' '-l' '-1' '-v' '-w' '/tmp/graph17857835297910019298.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:46:44] [INFO ] Decomposing Gal with order
[2024-06-02 18:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:46:44] [INFO ] Removed a total of 211 redundant transitions.
[2024-06-02 18:46:44] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 4 ms.
[2024-06-02 18:46:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality5458926803634144014.gal : 144 ms
[2024-06-02 18:46:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3055020051307719683.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/CTLCardinality5458926803634144014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3055020051307719683.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.94991e+10,0.280859,14544,673,73,20869,1336,1074,35800,96,5838,0


Converting to forward existential form...Done !
original formula: AF(((EF(EX(TRUE)) * (i0.u173.p959!=0)) * (EF(!(E((i5.u70.p485==1) U (i3.u32.p214==1)))) + AF(EX(((i7.i0.i0.u54.p386!=0)&&(i1.u4.p93!=1)))...159
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (i0.u173.p959!=0)) * (E(TRUE U !(E((i5.u70.p485==1) U (i3.u32.p214==1)))) + ...222
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t192, t196, t206, t217, t225, t247, t483, t541, i0.t4, i0.u173.t8, i0.u173.t9, i0.u...791
Using 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 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
Using 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 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,26.4323,821936,1,0,1.496e+06,3946,7865,3.66243e+06,525,22800,1213110
FORMULA CO4-PT-17-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 499 transition count 652
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 499 transition count 652
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 499 transition count 649
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 485 transition count 634
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 485 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 485 transition count 633
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 95 place count 480 transition count 627
Iterating global reduction 3 with 5 rules applied. Total rules applied 100 place count 480 transition count 627
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 478 transition count 625
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 478 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 478 transition count 624
Applied a total of 105 rules in 31 ms. Remains 478 /529 variables (removed 51) and now considering 624/680 (removed 56) transitions.
// Phase 1: matrix 624 rows 478 cols
[2024-06-02 18:47:11] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:47:11] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 18:47:11] [INFO ] Invariant cache hit.
[2024-06-02 18:47:11] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 623 sub problems to find dead transitions.
[2024-06-02 18:47:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (OVERLAPS) 624/1102 variables, 478/482 constraints. Problems are: Problem set: 0 solved, 623 unsolved
[2024-06-02 18:47:31] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-06-02 18:47:31] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1102 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 484 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/1102 variables, 478/484 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 623/1107 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1107 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 478/529 places, 624/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60595 ms. Remains : 478/529 places, 624/680 transitions.
[2024-06-02 18:48:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:48:11] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:48:11] [INFO ] Input system was already deterministic with 624 transitions.
[2024-06-02 18:48:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:48:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:48:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality16766092872512402544.gal : 2 ms
[2024-06-02 18:48:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4466888549102365797.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/CTLCardinality16766092872512402544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4466888549102365797.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.96704e+10,1.45009,48868,2,8746,5,162061,6,0,2532,226537,0


Converting to forward existential form...Done !
original formula: AF((AF((((p823!=0)&&(p953!=1))||((p543==1)&&((p550==0)||(p107==1))))) + AX(!(E(((p857==1)||(p573==0)) U (p960!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((p823!=0)&&(p953!=1))||((p543==1)&&((p550==0)||(p107==1))))))) + !(EX(!(!(E(((p857==1)||(...193
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t127, t158, t184, t...488
Detected timeout of ITS tools.
[2024-06-02 18:48:41] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:48:41] [INFO ] Applying decomposition
[2024-06-02 18:48:41] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13652945987865300073.txt' '-o' '/tmp/graph13652945987865300073.bin' '-w' '/tmp/graph13652945987865300073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13652945987865300073.bin' '-l' '-1' '-v' '-w' '/tmp/graph13652945987865300073.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:48:41] [INFO ] Decomposing Gal with order
[2024-06-02 18:48:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:48:41] [INFO ] Removed a total of 219 redundant transitions.
[2024-06-02 18:48:41] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:48:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 4 ms.
[2024-06-02 18:48:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9395933857640871777.gal : 3 ms
[2024-06-02 18:48:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9635585146063166470.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/CTLCardinality9395933857640871777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9635585146063166470.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96704e+10,0.256439,13200,685,89,17706,1714,1075,31053,94,7402,0


Converting to forward existential form...Done !
original formula: AF((AF((((i9.i1.i0.u151.p823!=0)&&(i17.u175.p953!=1))||((i8.u81.p543==1)&&((i8.u85.p550==0)||(i1.u8.p107==1))))) + AX(!(E(((i15.u160.p857...204
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((i9.i1.i0.u151.p823!=0)&&(i17.u175.p953!=1))||((i8.u81.p543==1)&&((i8.u85.p550==0)||(i1.u...261
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t74, t194, t249, t353, t372, t483, t543, i0.t245, i1.t504, i1.t501, i1.u7.t508, i1....793
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Graph (trivial) has 570 edges and 529 vertex of which 2 / 529 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 873 edges and 528 vertex of which 519 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Discarding 9 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 518 transition count 465
Reduce places removed 202 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 1 with 205 rules applied. Total rules applied 410 place count 316 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 411 place count 315 transition count 462
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 411 place count 315 transition count 409
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 517 place count 262 transition count 409
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 526 place count 253 transition count 400
Iterating global reduction 3 with 9 rules applied. Total rules applied 535 place count 253 transition count 400
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 537 place count 253 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 538 place count 252 transition count 398
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 538 place count 252 transition count 395
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 544 place count 249 transition count 395
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 548 place count 245 transition count 391
Iterating global reduction 5 with 4 rules applied. Total rules applied 552 place count 245 transition count 391
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 598 place count 222 transition count 366
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 602 place count 222 transition count 362
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 6 with 3 rules applied. Total rules applied 605 place count 221 transition count 360
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 608 place count 220 transition count 358
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 8 with 3 rules applied. Total rules applied 611 place count 219 transition count 356
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 613 place count 218 transition count 355
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 618 place count 213 transition count 350
Iterating global reduction 10 with 5 rules applied. Total rules applied 623 place count 213 transition count 350
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 627 place count 211 transition count 348
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 628 place count 210 transition count 347
Iterating global reduction 10 with 1 rules applied. Total rules applied 629 place count 210 transition count 347
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 630 place count 209 transition count 345
Iterating global reduction 10 with 1 rules applied. Total rules applied 631 place count 209 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 632 place count 209 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 644 place count 209 transition count 332
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 11 with 7 rules applied. Total rules applied 651 place count 209 transition count 325
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 658 place count 202 transition count 325
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 660 place count 201 transition count 324
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 661 place count 201 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 663 place count 199 transition count 322
Applied a total of 663 rules in 184 ms. Remains 199 /529 variables (removed 330) and now considering 322/680 (removed 358) transitions.
// Phase 1: matrix 322 rows 199 cols
[2024-06-02 18:49:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:49:12] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 18:49:12] [INFO ] Invariant cache hit.
[2024-06-02 18:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:49:12] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 18:49:12] [INFO ] Redundant transitions in 4 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-02 18:49:12] [INFO ] Invariant cache hit.
[2024-06-02 18:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/519 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/520 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 1/521 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/521 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 204 constraints, problems are : Problem set: 0 solved, 309 unsolved in 11706 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/519 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 308/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/520 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (OVERLAPS) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 309 unsolved in 20261 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 32085ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 32087ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/529 places, 322/680 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32618 ms. Remains : 199/529 places, 322/680 transitions.
[2024-06-02 18:49:44] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:49:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:49:44] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 18:49:44] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:49:44] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:49:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality18112206443446778180.gal : 1 ms
[2024-06-02 18:49:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality448238436108078169.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/CTLCardinality18112206443446778180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality448238436108078169.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.11259e+08,0.157641,9684,2,1264,5,26105,6,0,1104,17100,0


Converting to forward existential form...Done !
original formula: AF(AG(((p174==0)||(p622==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p174==0)||(p622==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t43, t72, t79, t85, t115, t120, t173, t196, Intersection with reachable at each step ena...209
(forward)formula 0,0,6.54546,219672,1,0,491,932275,671,312,6761,1.41656e+06,761
FORMULA CO4-PT-17-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 680/680 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 527 transition count 680
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 35 place count 494 transition count 647
Iterating global reduction 1 with 33 rules applied. Total rules applied 68 place count 494 transition count 647
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 494 transition count 644
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 87 place count 478 transition count 627
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 478 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 478 transition count 626
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 473 transition count 620
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 473 transition count 620
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 471 transition count 618
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 471 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 471 transition count 617
Applied a total of 119 rules in 58 ms. Remains 471 /529 variables (removed 58) and now considering 617/680 (removed 63) transitions.
// Phase 1: matrix 617 rows 471 cols
[2024-06-02 18:49:51] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:49:51] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-06-02 18:49:51] [INFO ] Invariant cache hit.
[2024-06-02 18:49:51] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2024-06-02 18:49:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
[2024-06-02 18:50:11] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-06-02 18:50:11] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1088 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 471/529 places, 617/680 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60612 ms. Remains : 471/529 places, 617/680 transitions.
[2024-06-02 18:50:51] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:50:51] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:50:51] [INFO ] Input system was already deterministic with 617 transitions.
[2024-06-02 18:50:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:50:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:50:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15191828507409694355.gal : 2 ms
[2024-06-02 18:50:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality2321997619906626789.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/CTLCardinality15191828507409694355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2321997619906626789.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.87379e+10,1.30595,45128,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.38549,45128,1,0,6,152681,7,1,3025,201422,1
FORMULA CO4-PT-17-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 18:50:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:50:53] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:50:53] [INFO ] Applying decomposition
[2024-06-02 18:50:53] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1702222724787872287.txt' '-o' '/tmp/graph1702222724787872287.bin' '-w' '/tmp/graph1702222724787872287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1702222724787872287.bin' '-l' '-1' '-v' '-w' '/tmp/graph1702222724787872287.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:50:53] [INFO ] Decomposing Gal with order
[2024-06-02 18:50:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:50:53] [INFO ] Removed a total of 222 redundant transitions.
[2024-06-02 18:50:53] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:50:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 5 ms.
[2024-06-02 18:50:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8932196257380564886.gal : 4 ms
[2024-06-02 18:50:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1863043037140717025.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/CTLCardinality8932196257380564886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1863043037140717025.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 -...262
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53977e+10,0.334606,15000,872,75,21060,1182,1246,41087,103,4755,0


Converting to forward existential form...Done !
original formula: (EG(AG(((i3.u4.p88==0)&&((i4.i0.i1.u12.p132==0)||(i3.u8.p98==1))))) * A(!(AX(AF(((i0.u177.p885==0)||(i1.u27.p209==1))))) U AF(EX(((i13.i0...193
=> equivalent forward existential formula: [(((Init * EG(!(E(TRUE U !(((i3.u4.p88==0)&&((i4.i0.i1.u12.p132==0)||(i3.u8.p98==1)))))))) * !(EG(!(!(EG(!(EX(((...412
Reverse transition relation is NOT exact ! Due to transitions t54, t87, t213, t265, t269, t379, t400, t512, t518, t581, t582, t592, t662, i0.t4, i0.u190.t8...980
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using 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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,28.0622,795284,1,0,1.35663e+06,2748,9028,3.6828e+06,572,16601,1049562
FORMULA CO4-PT-17-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(E(AG((((i11.u65.p443==0)&&(((i13.i0.i1.u127.p703==0)||(i19.i1.i0.u170.p858==1))||(i12.u113.p645==1)))&&((i9.u76.p487==0)||(i17.u151.p7...372
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !((((i11.u65.p443==0)&&(((i13.i0.i1.u127.p703==0)||(i19.i1.i0.u170.p858==1))||(i12.u11...429
(forward)formula 1,0,175.739,2206164,1,0,3.2117e+06,3267,2573,9.14633e+06,207,25274,528461
FORMULA CO4-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((AF((((i18.i1.i0.u160.p823!=0)&&(i20.u188.p953!=1))||((i7.i0.i1.u52.p543==1)&&((i7.i2.i1.u94.p550==0)||(i4.i0.i0.u10.p107==1))))) + AX...235
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((i18.i1.i0.u160.p823!=0)&&(i20.u188.p953!=1))||((i7.i0.i1.u52.p543==1)&&((i7.i2.i1.u94.p5...292
(forward)formula 2,0,203.596,2206164,1,0,3.2117e+06,3267,4512,9.14633e+06,277,25274,1652773
FORMULA CO4-PT-17-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1374063 ms.

BK_STOP 1717354457507

--------------------
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-17"
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-17, 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-171734898600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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