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.r400-tall-171690531600097.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 StigmergyCommit-PT-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531600097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 231K May 18 16:43 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 StigmergyCommit-PT-02b-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-02b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716983421191

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 11:50:22] [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-05-29 11:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:50:22] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-29 11:50:22] [INFO ] Transformed 928 places.
[2024-05-29 11:50:22] [INFO ] Transformed 1040 transitions.
[2024-05-29 11:50:22] [INFO ] Found NUPN structural information;
[2024-05-29 11:50:22] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 109 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 865 transition count 977
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 865 transition count 977
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 159 place count 832 transition count 944
Iterating global reduction 0 with 33 rules applied. Total rules applied 192 place count 832 transition count 944
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 211 place count 813 transition count 925
Iterating global reduction 0 with 19 rules applied. Total rules applied 230 place count 813 transition count 925
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 245 place count 798 transition count 910
Iterating global reduction 0 with 15 rules applied. Total rules applied 260 place count 798 transition count 910
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 272 place count 786 transition count 898
Iterating global reduction 0 with 12 rules applied. Total rules applied 284 place count 786 transition count 898
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 295 place count 775 transition count 887
Iterating global reduction 0 with 11 rules applied. Total rules applied 306 place count 775 transition count 887
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 316 place count 765 transition count 877
Iterating global reduction 0 with 10 rules applied. Total rules applied 326 place count 765 transition count 877
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 336 place count 755 transition count 867
Iterating global reduction 0 with 10 rules applied. Total rules applied 346 place count 755 transition count 867
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 353 place count 748 transition count 860
Iterating global reduction 0 with 7 rules applied. Total rules applied 360 place count 748 transition count 860
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 365 place count 743 transition count 855
Iterating global reduction 0 with 5 rules applied. Total rules applied 370 place count 743 transition count 855
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 372 place count 743 transition count 853
Applied a total of 372 rules in 527 ms. Remains 743 /928 variables (removed 185) and now considering 853/1040 (removed 187) transitions.
// Phase 1: matrix 853 rows 743 cols
[2024-05-29 11:50:23] [INFO ] Computed 4 invariants in 27 ms
[2024-05-29 11:50:23] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-29 11:50:23] [INFO ] Invariant cache hit.
[2024-05-29 11:50:23] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 852 sub problems to find dead transitions.
[2024-05-29 11:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-29 11:50:41] [INFO ] Deduced a trap composed of 338 places in 266 ms of which 39 ms to minimize.
[2024-05-29 11:50:41] [INFO ] Deduced a trap composed of 326 places in 231 ms of which 9 ms to minimize.
[2024-05-29 11:50:42] [INFO ] Deduced a trap composed of 346 places in 204 ms of which 4 ms to minimize.
[2024-05-29 11:50:42] [INFO ] Deduced a trap composed of 447 places in 166 ms of which 4 ms to minimize.
[2024-05-29 11:50:42] [INFO ] Deduced a trap composed of 354 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:50:43] [INFO ] Deduced a trap composed of 332 places in 194 ms of which 4 ms to minimize.
[2024-05-29 11:50:45] [INFO ] Deduced a trap composed of 336 places in 185 ms of which 4 ms to minimize.
[2024-05-29 11:50:46] [INFO ] Deduced a trap composed of 337 places in 195 ms of which 3 ms to minimize.
[2024-05-29 11:50:47] [INFO ] Deduced a trap composed of 335 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:50:47] [INFO ] Deduced a trap composed of 328 places in 179 ms of which 4 ms to minimize.
[2024-05-29 11:50:50] [INFO ] Deduced a trap composed of 324 places in 179 ms of which 4 ms to minimize.
[2024-05-29 11:50:51] [INFO ] Deduced a trap composed of 336 places in 146 ms of which 4 ms to minimize.
[2024-05-29 11:50:52] [INFO ] Deduced a trap composed of 445 places in 162 ms of which 4 ms to minimize.
[2024-05-29 11:50:53] [INFO ] Deduced a trap composed of 354 places in 147 ms of which 4 ms to minimize.
[2024-05-29 11:50:53] [INFO ] Deduced a trap composed of 350 places in 163 ms of which 4 ms to minimize.
[2024-05-29 11:50:53] [INFO ] Deduced a trap composed of 354 places in 134 ms of which 3 ms to minimize.
[2024-05-29 11:50:53] [INFO ] Deduced a trap composed of 353 places in 123 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/1596 variables, and 21 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 852/852 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 852 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 852 unsolved
[2024-05-29 11:51:07] [INFO ] Deduced a trap composed of 343 places in 165 ms of which 4 ms to minimize.
[2024-05-29 11:51:14] [INFO ] Deduced a trap composed of 351 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/743 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/1596 variables, and 23 constraints, problems are : Problem set: 0 solved, 852 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 0/852 constraints, Known Traps: 19/19 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 743/928 places, 853/1040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61691 ms. Remains : 743/928 places, 853/1040 transitions.
Support contains 109 out of 743 places after structural reductions.
[2024-05-29 11:51:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 11:51:24] [INFO ] Flatten gal took : 75 ms
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 11:51:24] [INFO ] Flatten gal took : 35 ms
[2024-05-29 11:51:24] [INFO ] Input system was already deterministic with 853 transitions.
Support contains 103 out of 743 places (down from 109) after GAL structural reductions.
RANDOM walk for 40000 steps (648 resets) in 2423 ms. (16 steps per ms) remains 38/61 properties
BEST_FIRST walk for 4004 steps (15 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (15 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (16 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (14 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (13 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (16 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 10 ms. (364 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
[2024-05-29 11:51:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 679/743 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 37 unsolved
[2024-05-29 11:51:26] [INFO ] Deduced a trap composed of 344 places in 210 ms of which 4 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-05-29 11:51:26] [INFO ] Deduced a trap composed of 337 places in 255 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/743 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 853/1596 variables, 743/749 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1596 variables, 0/749 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/1596 variables, 0/749 constraints. Problems are: Problem set: 2 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1596/1596 variables, and 749 constraints, problems are : Problem set: 2 solved, 36 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 683/743 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-05-29 11:51:29] [INFO ] Deduced a trap composed of 353 places in 204 ms of which 5 ms to minimize.
[2024-05-29 11:51:29] [INFO ] Deduced a trap composed of 332 places in 195 ms of which 5 ms to minimize.
[2024-05-29 11:51:30] [INFO ] Deduced a trap composed of 354 places in 162 ms of which 3 ms to minimize.
[2024-05-29 11:51:30] [INFO ] Deduced a trap composed of 338 places in 166 ms of which 4 ms to minimize.
[2024-05-29 11:51:30] [INFO ] Deduced a trap composed of 336 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/743 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-05-29 11:51:31] [INFO ] Deduced a trap composed of 332 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:51:31] [INFO ] Deduced a trap composed of 337 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-05-29 11:51:32] [INFO ] Deduced a trap composed of 326 places in 151 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 36 unsolved
[2024-05-29 11:51:33] [INFO ] Deduced a trap composed of 354 places in 159 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/1596 variables, and 15 constraints, problems are : Problem set: 2 solved, 36 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 0/38 constraints, Known Traps: 11/11 constraints]
After SMT, in 8432ms problems are : Problem set: 2 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 853/853 transitions.
Graph (trivial) has 621 edges and 743 vertex of which 27 / 743 are part of one of the 5 SCC in 8 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 1025 edges and 721 vertex of which 719 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 425 rules applied. Total rules applied 427 place count 719 transition count 398
Reduce places removed 423 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 430 rules applied. Total rules applied 857 place count 296 transition count 391
Reduce places removed 3 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 2 with 35 rules applied. Total rules applied 892 place count 293 transition count 359
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 924 place count 261 transition count 359
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 924 place count 261 transition count 320
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1002 place count 222 transition count 320
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1008 place count 216 transition count 314
Iterating global reduction 4 with 6 rules applied. Total rules applied 1014 place count 216 transition count 314
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1015 place count 215 transition count 305
Iterating global reduction 4 with 1 rules applied. Total rules applied 1016 place count 215 transition count 305
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1064 place count 191 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1068 place count 191 transition count 277
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 1080 place count 179 transition count 239
Iterating global reduction 5 with 12 rules applied. Total rules applied 1092 place count 179 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1094 place count 179 transition count 237
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1095 place count 178 transition count 236
Iterating global reduction 6 with 1 rules applied. Total rules applied 1096 place count 178 transition count 236
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1097 place count 177 transition count 235
Iterating global reduction 6 with 1 rules applied. Total rules applied 1098 place count 177 transition count 235
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1110 place count 171 transition count 229
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1118 place count 167 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1119 place count 167 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1120 place count 167 transition count 243
Free-agglomeration rule applied 23 times.
Iterating global reduction 7 with 23 rules applied. Total rules applied 1143 place count 167 transition count 220
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1172 place count 144 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1190 place count 144 transition count 196
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1192 place count 144 transition count 196
Applied a total of 1192 rules in 132 ms. Remains 144 /743 variables (removed 599) and now considering 196/853 (removed 657) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 144/743 places, 196/853 transitions.
RANDOM walk for 40000 steps (1693 resets) in 519 ms. (76 steps per ms) remains 23/36 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4003 steps (73 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (62 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (65 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (67 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (68 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (70 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (70 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (65 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (53 resets) in 21 ms. (181 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (59 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (66 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (66 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (67 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (68 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (74 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (66 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (68 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
// Phase 1: matrix 196 rows 144 cols
[2024-05-29 11:51:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 11:51:34] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 111/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 11:51:34] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 196/340 variables, 144/149 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 157 constraints, problems are : Problem set: 0 solved, 20 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 111/144 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 11:51:35] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 2 ms to minimize.
[2024-05-29 11:51:35] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:51:35] [INFO ] Deduced a trap composed of 61 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:51:35] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 196/340 variables, 144/153 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 11:51:35] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 182 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 144/144 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 1537ms problems are : Problem set: 0 solved, 20 unsolved
Finished Parikh walk after 1289 steps, including 66 resets, run visited all 1 properties in 3 ms. (steps per millisecond=429 )
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 )
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 )
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 )
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 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 20 properties in 238 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-29 11:51:36] [INFO ] Flatten gal took : 30 ms
[2024-05-29 11:51:36] [INFO ] Flatten gal took : 29 ms
[2024-05-29 11:51:36] [INFO ] Input system was already deterministic with 853 transitions.
Computed a total of 137 stabilizing places and 143 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 724 transition count 834
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 724 transition count 834
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 708 transition count 818
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 708 transition count 818
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 80 place count 698 transition count 808
Iterating global reduction 0 with 10 rules applied. Total rules applied 90 place count 698 transition count 808
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 688 transition count 798
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 688 transition count 798
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 680 transition count 790
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 680 transition count 790
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 673 transition count 783
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 673 transition count 783
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 147 place count 666 transition count 776
Iterating global reduction 0 with 7 rules applied. Total rules applied 154 place count 666 transition count 776
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 159 place count 661 transition count 771
Iterating global reduction 0 with 5 rules applied. Total rules applied 164 place count 661 transition count 771
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 169 place count 656 transition count 766
Iterating global reduction 0 with 5 rules applied. Total rules applied 174 place count 656 transition count 766
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 179 place count 651 transition count 761
Iterating global reduction 0 with 5 rules applied. Total rules applied 184 place count 651 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 185 place count 651 transition count 760
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 187 place count 649 transition count 758
Iterating global reduction 1 with 2 rules applied. Total rules applied 189 place count 649 transition count 758
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 191 place count 647 transition count 756
Iterating global reduction 1 with 2 rules applied. Total rules applied 193 place count 647 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 194 place count 646 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 195 place count 646 transition count 755
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 196 place count 645 transition count 754
Iterating global reduction 1 with 1 rules applied. Total rules applied 197 place count 645 transition count 754
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 198 place count 644 transition count 753
Iterating global reduction 1 with 1 rules applied. Total rules applied 199 place count 644 transition count 753
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 200 place count 643 transition count 752
Iterating global reduction 1 with 1 rules applied. Total rules applied 201 place count 643 transition count 752
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 202 place count 642 transition count 751
Iterating global reduction 1 with 1 rules applied. Total rules applied 203 place count 642 transition count 751
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 204 place count 641 transition count 750
Iterating global reduction 1 with 1 rules applied. Total rules applied 205 place count 641 transition count 750
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 206 place count 640 transition count 749
Iterating global reduction 1 with 1 rules applied. Total rules applied 207 place count 640 transition count 749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 208 place count 639 transition count 748
Iterating global reduction 1 with 1 rules applied. Total rules applied 209 place count 639 transition count 748
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 210 place count 638 transition count 747
Iterating global reduction 1 with 1 rules applied. Total rules applied 211 place count 638 transition count 747
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 212 place count 637 transition count 746
Iterating global reduction 1 with 1 rules applied. Total rules applied 213 place count 637 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 214 place count 637 transition count 745
Applied a total of 214 rules in 399 ms. Remains 637 /743 variables (removed 106) and now considering 745/853 (removed 108) transitions.
// Phase 1: matrix 745 rows 637 cols
[2024-05-29 11:51:36] [INFO ] Computed 4 invariants in 11 ms
[2024-05-29 11:51:36] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-29 11:51:36] [INFO ] Invariant cache hit.
[2024-05-29 11:51:37] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 744 sub problems to find dead transitions.
[2024-05-29 11:51:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/637 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 11:51:52] [INFO ] Deduced a trap composed of 309 places in 183 ms of which 3 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 318 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:51:53] [INFO ] Deduced a trap composed of 298 places in 136 ms of which 3 ms to minimize.
[2024-05-29 11:51:55] [INFO ] Deduced a trap composed of 291 places in 141 ms of which 3 ms to minimize.
[2024-05-29 11:51:55] [INFO ] Deduced a trap composed of 309 places in 140 ms of which 4 ms to minimize.
[2024-05-29 11:51:56] [INFO ] Deduced a trap composed of 291 places in 135 ms of which 3 ms to minimize.
[2024-05-29 11:51:57] [INFO ] Deduced a trap composed of 326 places in 154 ms of which 3 ms to minimize.
[2024-05-29 11:51:57] [INFO ] Deduced a trap composed of 304 places in 138 ms of which 4 ms to minimize.
[2024-05-29 11:51:58] [INFO ] Deduced a trap composed of 303 places in 131 ms of which 3 ms to minimize.
[2024-05-29 11:51:58] [INFO ] Deduced a trap composed of 304 places in 125 ms of which 2 ms to minimize.
[2024-05-29 11:51:59] [INFO ] Deduced a trap composed of 300 places in 183 ms of which 4 ms to minimize.
[2024-05-29 11:51:59] [INFO ] Deduced a trap composed of 293 places in 168 ms of which 4 ms to minimize.
[2024-05-29 11:52:00] [INFO ] Deduced a trap composed of 326 places in 148 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/637 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 11:52:05] [INFO ] Deduced a trap composed of 318 places in 123 ms of which 2 ms to minimize.
[2024-05-29 11:52:07] [INFO ] Deduced a trap composed of 294 places in 135 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/1382 variables, and 19 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (OVERLAPS) 1/637 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/637 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-29 11:52:22] [INFO ] Deduced a trap composed of 320 places in 149 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/637 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 5 (OVERLAPS) 745/1382 variables, 637/657 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1382 variables, 744/1401 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1382/1382 variables, and 1401 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 637/637 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 16/16 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 637/743 places, 745/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61061 ms. Remains : 637/743 places, 745/853 transitions.
[2024-05-29 11:52:37] [INFO ] Flatten gal took : 23 ms
[2024-05-29 11:52:37] [INFO ] Flatten gal took : 21 ms
[2024-05-29 11:52:37] [INFO ] Input system was already deterministic with 745 transitions.
[2024-05-29 11:52:37] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:52:37] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:52:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality9817408183411652057.gal : 17 ms
[2024-05-29 11:52:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality13427933957789056395.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/CTLCardinality9817408183411652057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13427933957789056395.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,7.5916e+07,3.96676,114948,2,13584,5,361449,6,0,3295,498303,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 11:53:07] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:53:07] [INFO ] Applying decomposition
[2024-05-29 11:53:07] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9066524709207144375.txt' '-o' '/tmp/graph9066524709207144375.bin' '-w' '/tmp/graph9066524709207144375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9066524709207144375.bin' '-l' '-1' '-v' '-w' '/tmp/graph9066524709207144375.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:53:07] [INFO ] Decomposing Gal with order
[2024-05-29 11:53:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:53:08] [INFO ] Removed a total of 383 redundant transitions.
[2024-05-29 11:53:08] [INFO ] Flatten gal took : 75 ms
[2024-05-29 11:53:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2024-05-29 11:53:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality2743210588038585648.gal : 10 ms
[2024-05-29 11:53:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality17190605585489153880.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/CTLCardinality2743210588038585648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17190605585489153880.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,7.5916e+07,2.19466,82928,1208,28,166925,609,973,316561,78,1301,0


Converting to forward existential form...Done !
original formula: (AX(E(!(E(E((i2.u21.p65==1) U (i0.u24.p81==1)) U (((i29.u235.p911==0)||(i14.u120.p437==1))&&(i5.u41.p128==0)))) U AX(!((((i6.u62.p144==0)...387
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EX(!(E(!(E(E((i2.u21.p65==1) U (i0.u24.p81==1)) U (((i29.u235.p911==0)||(i14.u120.p437==1))&...708
Reverse transition relation is NOT exact ! Due to transitions t171, t172, t228, t262, t344, t345, t398, t401, t434, t468, t527, t599, t600, t607, t610, t61...508
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Graph (trivial) has 726 edges and 743 vertex of which 56 / 743 are part of one of the 9 SCC in 5 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 513 rules applied. Total rules applied 514 place count 695 transition count 286
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 522 rules applied. Total rules applied 1036 place count 182 transition count 277
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 1043 place count 178 transition count 274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1046 place count 175 transition count 274
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1046 place count 175 transition count 237
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1120 place count 138 transition count 237
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1134 place count 124 transition count 223
Iterating global reduction 4 with 14 rules applied. Total rules applied 1148 place count 124 transition count 223
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1157 place count 115 transition count 198
Iterating global reduction 4 with 9 rules applied. Total rules applied 1166 place count 115 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1168 place count 115 transition count 196
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1170 place count 113 transition count 194
Iterating global reduction 5 with 2 rules applied. Total rules applied 1172 place count 113 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1174 place count 111 transition count 192
Iterating global reduction 5 with 2 rules applied. Total rules applied 1176 place count 111 transition count 192
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1208 place count 95 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1210 place count 95 transition count 174
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1226 place count 79 transition count 139
Iterating global reduction 6 with 16 rules applied. Total rules applied 1242 place count 79 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1248 place count 79 transition count 133
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1257 place count 70 transition count 121
Iterating global reduction 7 with 9 rules applied. Total rules applied 1266 place count 70 transition count 121
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1275 place count 61 transition count 109
Iterating global reduction 7 with 9 rules applied. Total rules applied 1284 place count 61 transition count 109
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1289 place count 61 transition count 104
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 8 with 2 rules applied. Total rules applied 1291 place count 60 transition count 103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1292 place count 59 transition count 100
Iterating global reduction 8 with 1 rules applied. Total rules applied 1293 place count 59 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1294 place count 59 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1297 place count 59 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1303 place count 56 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1304 place count 55 transition count 92
Applied a total of 1304 rules in 61 ms. Remains 55 /743 variables (removed 688) and now considering 92/853 (removed 761) transitions.
[2024-05-29 11:53:38] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 55 cols
[2024-05-29 11:53:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 11:53:38] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 11:53:38] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-29 11:53:38] [INFO ] Invariant cache hit.
[2024-05-29 11:53:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:53:38] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-29 11:53:38] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-29 11:53:38] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-29 11:53:38] [INFO ] Invariant cache hit.
[2024-05-29 11:53:38] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:53:38] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:53:39] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:53:39] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 87/142 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-29 11:53:40] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/143 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 74 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2741 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 3/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 87/142 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 85/158 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-29 11:53:41] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/143 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-29 11:53:42] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 161 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 55/55 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 12/12 constraints]
After SMT, in 5272ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 5275ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/743 places, 92/853 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5525 ms. Remains : 55/743 places, 92/853 transitions.
[2024-05-29 11:53:43] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:53:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:53:43] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-29 11:53:43] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:53:43] [INFO ] Flatten gal took : 2 ms
[2024-05-29 11:53:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10792299492690086910.gal : 2 ms
[2024-05-29 11:53:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16092847786107356078.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/CTLCardinality10792299492690086910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16092847786107356078.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,8484,0.039174,5060,2,801,5,6161,6,0,306,6509,0


Converting to forward existential form...Done !
original formula: A((p538==1) U !(EF(EG((((p498==0)||(p154==1))&&((p395==0)||(p648==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U EG((((p498==0)||(p154==1))&&((p395==0)||(p648==1)))))))))) * !(E(!(!(E(TRUE U EG((((...305
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t10, t11, t19, t20, t23, t28, t38, t39, t41, t42, t49, t56, t58, t59, t72, t73, t...287
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.35239,56020,1,0,474,311461,214,267,2258,281918,565
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 722 transition count 832
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 722 transition count 832
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 704 transition count 814
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 704 transition count 814
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 692 transition count 802
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 692 transition count 802
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 114 place count 680 transition count 790
Iterating global reduction 0 with 12 rules applied. Total rules applied 126 place count 680 transition count 790
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 670 transition count 780
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 670 transition count 780
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 155 place count 661 transition count 771
Iterating global reduction 0 with 9 rules applied. Total rules applied 164 place count 661 transition count 771
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 173 place count 652 transition count 762
Iterating global reduction 0 with 9 rules applied. Total rules applied 182 place count 652 transition count 762
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 189 place count 645 transition count 755
Iterating global reduction 0 with 7 rules applied. Total rules applied 196 place count 645 transition count 755
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 201 place count 640 transition count 750
Iterating global reduction 0 with 5 rules applied. Total rules applied 206 place count 640 transition count 750
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 211 place count 635 transition count 745
Iterating global reduction 0 with 5 rules applied. Total rules applied 216 place count 635 transition count 745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 217 place count 635 transition count 744
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 219 place count 633 transition count 742
Iterating global reduction 1 with 2 rules applied. Total rules applied 221 place count 633 transition count 742
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 223 place count 631 transition count 740
Iterating global reduction 1 with 2 rules applied. Total rules applied 225 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 227 place count 629 transition count 738
Iterating global reduction 1 with 2 rules applied. Total rules applied 229 place count 629 transition count 738
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 231 place count 627 transition count 736
Iterating global reduction 1 with 2 rules applied. Total rules applied 233 place count 627 transition count 736
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 235 place count 625 transition count 734
Iterating global reduction 1 with 2 rules applied. Total rules applied 237 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 239 place count 623 transition count 732
Iterating global reduction 1 with 2 rules applied. Total rules applied 241 place count 623 transition count 732
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 243 place count 621 transition count 730
Iterating global reduction 1 with 2 rules applied. Total rules applied 245 place count 621 transition count 730
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 247 place count 619 transition count 728
Iterating global reduction 1 with 2 rules applied. Total rules applied 249 place count 619 transition count 728
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 251 place count 617 transition count 726
Iterating global reduction 1 with 2 rules applied. Total rules applied 253 place count 617 transition count 726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 255 place count 615 transition count 724
Iterating global reduction 1 with 2 rules applied. Total rules applied 257 place count 615 transition count 724
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 259 place count 613 transition count 722
Iterating global reduction 1 with 2 rules applied. Total rules applied 261 place count 613 transition count 722
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 263 place count 611 transition count 720
Iterating global reduction 1 with 2 rules applied. Total rules applied 265 place count 611 transition count 720
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 267 place count 611 transition count 718
Applied a total of 267 rules in 325 ms. Remains 611 /743 variables (removed 132) and now considering 718/853 (removed 135) transitions.
// Phase 1: matrix 718 rows 611 cols
[2024-05-29 11:53:45] [INFO ] Computed 4 invariants in 10 ms
[2024-05-29 11:53:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-29 11:53:45] [INFO ] Invariant cache hit.
[2024-05-29 11:53:45] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 717 sub problems to find dead transitions.
[2024-05-29 11:53:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-05-29 11:54:00] [INFO ] Deduced a trap composed of 297 places in 173 ms of which 4 ms to minimize.
[2024-05-29 11:54:01] [INFO ] Deduced a trap composed of 306 places in 170 ms of which 3 ms to minimize.
[2024-05-29 11:54:01] [INFO ] Deduced a trap composed of 304 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:54:03] [INFO ] Deduced a trap composed of 298 places in 137 ms of which 3 ms to minimize.
[2024-05-29 11:54:04] [INFO ] Deduced a trap composed of 298 places in 136 ms of which 3 ms to minimize.
[2024-05-29 11:54:05] [INFO ] Deduced a trap composed of 292 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:54:06] [INFO ] Deduced a trap composed of 293 places in 141 ms of which 3 ms to minimize.
[2024-05-29 11:54:06] [INFO ] Deduced a trap composed of 294 places in 140 ms of which 4 ms to minimize.
[2024-05-29 11:54:06] [INFO ] Deduced a trap composed of 297 places in 157 ms of which 4 ms to minimize.
[2024-05-29 11:54:07] [INFO ] Deduced a trap composed of 338 places in 168 ms of which 4 ms to minimize.
[2024-05-29 11:54:07] [INFO ] Deduced a trap composed of 311 places in 129 ms of which 3 ms to minimize.
[2024-05-29 11:54:08] [INFO ] Deduced a trap composed of 407 places in 144 ms of which 3 ms to minimize.
[2024-05-29 11:54:08] [INFO ] Deduced a trap composed of 311 places in 133 ms of which 3 ms to minimize.
[2024-05-29 11:54:08] [INFO ] Deduced a trap composed of 311 places in 132 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-05-29 11:54:11] [INFO ] Deduced a trap composed of 292 places in 130 ms of which 2 ms to minimize.
[2024-05-29 11:54:15] [INFO ] Deduced a trap composed of 291 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 611/1329 variables, and 20 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/611 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 717 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/611 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/611 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/611 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 4 (OVERLAPS) 718/1329 variables, 611/631 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1329 variables, 717/1348 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 1348 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 611/611 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 16/16 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 611/743 places, 718/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60970 ms. Remains : 611/743 places, 718/853 transitions.
[2024-05-29 11:54:46] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:54:46] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:54:46] [INFO ] Input system was already deterministic with 718 transitions.
[2024-05-29 11:54:46] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:54:46] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:54:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11372849344729820726.gal : 3 ms
[2024-05-29 11:54:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality3334658165102477994.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/CTLCardinality11372849344729820726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3334658165102477994.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,6.93002e+07,4.02284,102756,2,12678,5,326791,6,0,3164,436258,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 11:55:16] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:55:16] [INFO ] Applying decomposition
[2024-05-29 11:55:16] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14513483458502478623.txt' '-o' '/tmp/graph14513483458502478623.bin' '-w' '/tmp/graph14513483458502478623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14513483458502478623.bin' '-l' '-1' '-v' '-w' '/tmp/graph14513483458502478623.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:55:16] [INFO ] Decomposing Gal with order
[2024-05-29 11:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:55:16] [INFO ] Removed a total of 389 redundant transitions.
[2024-05-29 11:55:16] [INFO ] Flatten gal took : 29 ms
[2024-05-29 11:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-29 11:55:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality3688322142681654792.gal : 14 ms
[2024-05-29 11:55:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8342477569104250546.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/CTLCardinality3688322142681654792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8342477569104250546.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,6.93002e+07,0.499212,22424,1231,20,37329,496,963,64828,73,1146,0


Converting to forward existential form...Done !
original formula: AG((AF(EG(((i26.u212.p798==0)&&(i2.u29.p80==1)))) + EG(AF(EX(((i2.u28.p83==0)||(i11.u112.p407==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!(EG(!(EX(((i2.u28.p83==0)||(i11.u112.p407==1))))))))),!(EG(((i26.u212.p798==0)&&(...182
Reverse transition relation is NOT exact ! Due to transitions t159, t332, t388, t505, t577, t578, t581, t584, t587, t592, t595, t598, t599, t602, t605, t60...507
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 723 transition count 833
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 723 transition count 833
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 57 place count 706 transition count 816
Iterating global reduction 0 with 17 rules applied. Total rules applied 74 place count 706 transition count 816
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 696 transition count 806
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 696 transition count 806
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 104 place count 686 transition count 796
Iterating global reduction 0 with 10 rules applied. Total rules applied 114 place count 686 transition count 796
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 677 transition count 787
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 677 transition count 787
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 669 transition count 779
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 669 transition count 779
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 156 place count 661 transition count 771
Iterating global reduction 0 with 8 rules applied. Total rules applied 164 place count 661 transition count 771
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 170 place count 655 transition count 765
Iterating global reduction 0 with 6 rules applied. Total rules applied 176 place count 655 transition count 765
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 181 place count 650 transition count 760
Iterating global reduction 0 with 5 rules applied. Total rules applied 186 place count 650 transition count 760
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 191 place count 645 transition count 755
Iterating global reduction 0 with 5 rules applied. Total rules applied 196 place count 645 transition count 755
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 197 place count 645 transition count 754
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 199 place count 643 transition count 752
Iterating global reduction 1 with 2 rules applied. Total rules applied 201 place count 643 transition count 752
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 203 place count 641 transition count 750
Iterating global reduction 1 with 2 rules applied. Total rules applied 205 place count 641 transition count 750
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 207 place count 639 transition count 748
Iterating global reduction 1 with 2 rules applied. Total rules applied 209 place count 639 transition count 748
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 211 place count 637 transition count 746
Iterating global reduction 1 with 2 rules applied. Total rules applied 213 place count 637 transition count 746
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 215 place count 635 transition count 744
Iterating global reduction 1 with 2 rules applied. Total rules applied 217 place count 635 transition count 744
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 219 place count 633 transition count 742
Iterating global reduction 1 with 2 rules applied. Total rules applied 221 place count 633 transition count 742
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 223 place count 631 transition count 740
Iterating global reduction 1 with 2 rules applied. Total rules applied 225 place count 631 transition count 740
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 227 place count 629 transition count 738
Iterating global reduction 1 with 2 rules applied. Total rules applied 229 place count 629 transition count 738
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 231 place count 627 transition count 736
Iterating global reduction 1 with 2 rules applied. Total rules applied 233 place count 627 transition count 736
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 235 place count 625 transition count 734
Iterating global reduction 1 with 2 rules applied. Total rules applied 237 place count 625 transition count 734
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 239 place count 623 transition count 732
Iterating global reduction 1 with 2 rules applied. Total rules applied 241 place count 623 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 242 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 622 transition count 730
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 622 transition count 730
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 622 transition count 729
Applied a total of 245 rules in 320 ms. Remains 622 /743 variables (removed 121) and now considering 729/853 (removed 124) transitions.
// Phase 1: matrix 729 rows 622 cols
[2024-05-29 11:55:46] [INFO ] Computed 4 invariants in 10 ms
[2024-05-29 11:55:46] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 11:55:46] [INFO ] Invariant cache hit.
[2024-05-29 11:55:47] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 728 sub problems to find dead transitions.
[2024-05-29 11:55:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/622 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 298 places in 174 ms of which 4 ms to minimize.
[2024-05-29 11:55:59] [INFO ] Deduced a trap composed of 291 places in 135 ms of which 3 ms to minimize.
[2024-05-29 11:56:00] [INFO ] Deduced a trap composed of 298 places in 127 ms of which 3 ms to minimize.
[2024-05-29 11:56:00] [INFO ] Deduced a trap composed of 319 places in 182 ms of which 4 ms to minimize.
[2024-05-29 11:56:01] [INFO ] Deduced a trap composed of 297 places in 152 ms of which 4 ms to minimize.
[2024-05-29 11:56:02] [INFO ] Deduced a trap composed of 295 places in 139 ms of which 3 ms to minimize.
[2024-05-29 11:56:02] [INFO ] Deduced a trap composed of 293 places in 137 ms of which 3 ms to minimize.
[2024-05-29 11:56:02] [INFO ] Deduced a trap composed of 292 places in 136 ms of which 3 ms to minimize.
[2024-05-29 11:56:04] [INFO ] Deduced a trap composed of 324 places in 161 ms of which 3 ms to minimize.
[2024-05-29 11:56:05] [INFO ] Deduced a trap composed of 292 places in 133 ms of which 3 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 411 places in 143 ms of which 4 ms to minimize.
[2024-05-29 11:56:07] [INFO ] Deduced a trap composed of 314 places in 121 ms of which 3 ms to minimize.
[2024-05-29 11:56:08] [INFO ] Deduced a trap composed of 313 places in 116 ms of which 3 ms to minimize.
[2024-05-29 11:56:09] [INFO ] Deduced a trap composed of 320 places in 163 ms of which 3 ms to minimize.
[2024-05-29 11:56:11] [INFO ] Deduced a trap composed of 298 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 11:56:14] [INFO ] Deduced a trap composed of 294 places in 140 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1351 variables, and 20 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/622 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 1 (OVERLAPS) 1/622 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 728 unsolved
[2024-05-29 11:56:30] [INFO ] Deduced a trap composed of 317 places in 126 ms of which 3 ms to minimize.
[2024-05-29 11:56:30] [INFO ] Deduced a trap composed of 316 places in 115 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/622 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 5 (OVERLAPS) 729/1351 variables, 622/644 constraints. Problems are: Problem set: 0 solved, 728 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1351 variables, 728/1372 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1351/1351 variables, and 1372 constraints, problems are : Problem set: 0 solved, 728 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 622/622 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 18/18 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 728 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 622/743 places, 729/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60974 ms. Remains : 622/743 places, 729/853 transitions.
[2024-05-29 11:56:47] [INFO ] Flatten gal took : 18 ms
[2024-05-29 11:56:47] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:56:47] [INFO ] Input system was already deterministic with 729 transitions.
[2024-05-29 11:56:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:56:47] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:56:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality7812384172431580336.gal : 6 ms
[2024-05-29 11:56:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5144588596784880842.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/CTLCardinality7812384172431580336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5144588596784880842.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 11:57:17] [INFO ] Flatten gal took : 25 ms
[2024-05-29 11:57:17] [INFO ] Applying decomposition
[2024-05-29 11:57:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6554092339743510983.txt' '-o' '/tmp/graph6554092339743510983.bin' '-w' '/tmp/graph6554092339743510983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6554092339743510983.bin' '-l' '-1' '-v' '-w' '/tmp/graph6554092339743510983.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:57:17] [INFO ] Decomposing Gal with order
[2024-05-29 11:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:57:17] [INFO ] Removed a total of 383 redundant transitions.
[2024-05-29 11:57:17] [INFO ] Flatten gal took : 28 ms
[2024-05-29 11:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2024-05-29 11:57:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality7754186507867757640.gal : 5 ms
[2024-05-29 11:57:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality18045000396623500273.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/CTLCardinality7754186507867757640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18045000396623500273.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,7.16876e+07,0.203173,11824,1119,26,14579,568,862,18480,81,1039,0


Converting to forward existential form...Done !
original formula: A(E((EX((i29.u234.p911==1)) + (i16.u131.p432==1)) U AF(E((((i13.i1.i1.u104.p365==1)||(i7.u59.p185==0))||(i3.u17.p51==1)) U ((i14.u108.p37...202
=> equivalent forward existential formula: [((Init * !(EG(!((i6.u50.p143!=0))))) * !(E(!((i6.u50.p143!=0)) U (!(E((EX((i29.u234.p911==1)) + (i16.u131.p432=...317
Reverse transition relation is NOT exact ! Due to transitions t152, t208, t242, t383, t385, t443, t516, t572, t588, t589, t592, t595, t600, t603, t609, t61...513
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,8.90056,314632,1,0,603018,834,7855,1.08759e+06,415,2902,1225228
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 725 transition count 835
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 725 transition count 835
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 51 place count 710 transition count 820
Iterating global reduction 0 with 15 rules applied. Total rules applied 66 place count 710 transition count 820
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 700 transition count 810
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 700 transition count 810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 692 transition count 802
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 692 transition count 802
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 686 transition count 796
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 686 transition count 796
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 120 place count 680 transition count 790
Iterating global reduction 0 with 6 rules applied. Total rules applied 126 place count 680 transition count 790
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 132 place count 674 transition count 784
Iterating global reduction 0 with 6 rules applied. Total rules applied 138 place count 674 transition count 784
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 143 place count 669 transition count 779
Iterating global reduction 0 with 5 rules applied. Total rules applied 148 place count 669 transition count 779
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 152 place count 665 transition count 775
Iterating global reduction 0 with 4 rules applied. Total rules applied 156 place count 665 transition count 775
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 159 place count 662 transition count 772
Iterating global reduction 0 with 3 rules applied. Total rules applied 162 place count 662 transition count 772
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 164 place count 660 transition count 770
Iterating global reduction 0 with 2 rules applied. Total rules applied 166 place count 660 transition count 770
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 659 transition count 769
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 659 transition count 769
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 169 place count 658 transition count 768
Iterating global reduction 0 with 1 rules applied. Total rules applied 170 place count 658 transition count 768
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 171 place count 657 transition count 767
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 657 transition count 767
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 173 place count 656 transition count 766
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 656 transition count 766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 175 place count 655 transition count 765
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 655 transition count 765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 654 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 654 transition count 764
Applied a total of 178 rules in 252 ms. Remains 654 /743 variables (removed 89) and now considering 764/853 (removed 89) transitions.
// Phase 1: matrix 764 rows 654 cols
[2024-05-29 11:57:27] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 11:57:27] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 11:57:27] [INFO ] Invariant cache hit.
[2024-05-29 11:57:27] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 763 sub problems to find dead transitions.
[2024-05-29 11:57:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (OVERLAPS) 1/654 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 763 unsolved
[2024-05-29 11:57:44] [INFO ] Deduced a trap composed of 302 places in 188 ms of which 4 ms to minimize.
[2024-05-29 11:57:44] [INFO ] Deduced a trap composed of 306 places in 149 ms of which 3 ms to minimize.
[2024-05-29 11:57:44] [INFO ] Deduced a trap composed of 308 places in 151 ms of which 3 ms to minimize.
[2024-05-29 11:57:46] [INFO ] Deduced a trap composed of 301 places in 153 ms of which 5 ms to minimize.
[2024-05-29 11:57:47] [INFO ] Deduced a trap composed of 333 places in 139 ms of which 3 ms to minimize.
[2024-05-29 11:57:48] [INFO ] Deduced a trap composed of 307 places in 144 ms of which 3 ms to minimize.
[2024-05-29 11:57:50] [INFO ] Deduced a trap composed of 303 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:57:50] [INFO ] Deduced a trap composed of 335 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:57:51] [INFO ] Deduced a trap composed of 302 places in 191 ms of which 4 ms to minimize.
[2024-05-29 11:57:52] [INFO ] Deduced a trap composed of 310 places in 130 ms of which 3 ms to minimize.
[2024-05-29 11:57:53] [INFO ] Deduced a trap composed of 303 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/1418 variables, and 15 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 763 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 1 (OVERLAPS) 1/654 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/654 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 763 unsolved
[2024-05-29 11:58:11] [INFO ] Deduced a trap composed of 334 places in 147 ms of which 3 ms to minimize.
[2024-05-29 11:58:11] [INFO ] Deduced a trap composed of 328 places in 120 ms of which 2 ms to minimize.
[2024-05-29 11:58:11] [INFO ] Deduced a trap composed of 327 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/654 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 5 (OVERLAPS) 764/1418 variables, 654/672 constraints. Problems are: Problem set: 0 solved, 763 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1418 variables, 763/1435 constraints. Problems are: Problem set: 0 solved, 763 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1418/1418 variables, and 1435 constraints, problems are : Problem set: 0 solved, 763 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 654/654 constraints, PredecessorRefiner: 763/763 constraints, Known Traps: 14/14 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 763 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 654/743 places, 764/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60935 ms. Remains : 654/743 places, 764/853 transitions.
[2024-05-29 11:58:27] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:58:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:58:27] [INFO ] Input system was already deterministic with 764 transitions.
[2024-05-29 11:58:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:58:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:58:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality9024995233770431790.gal : 3 ms
[2024-05-29 11:58:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality10063007152431123098.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/CTLCardinality9024995233770431790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10063007152431123098.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,8.0677e+07,5.00147,131924,2,13411,5,407983,6,0,3382,612368,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 11:58:57] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:58:57] [INFO ] Applying decomposition
[2024-05-29 11:58:57] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6706652366549466863.txt' '-o' '/tmp/graph6706652366549466863.bin' '-w' '/tmp/graph6706652366549466863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6706652366549466863.bin' '-l' '-1' '-v' '-w' '/tmp/graph6706652366549466863.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:58:57] [INFO ] Decomposing Gal with order
[2024-05-29 11:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:58:57] [INFO ] Removed a total of 394 redundant transitions.
[2024-05-29 11:58:57] [INFO ] Flatten gal took : 27 ms
[2024-05-29 11:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2024-05-29 11:58:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality18274399628966688436.gal : 5 ms
[2024-05-29 11:58:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality8770395410214988362.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/CTLCardinality18274399628966688436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8770395410214988362.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.0677e+07,0.662567,31580,1450,22,48869,542,1100,131878,66,1214,0


Converting to forward existential form...Done !
original formula: EF(((A(((EX(((i22.u197.p681==0)||(i16.i1.i1.u154.p536==1))) * (i6.u26.p175==1)) * EX((i5.u68.p219==1))) U (EG((i2.u60.p188==1)) * EX(((i1...357
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!((E(!((EG((i2.u60.p188==1)) * EX(((i14.i0.i0.u129.p422==0)||(i29.u232.p833==1))))) U (!...1120
Reverse transition relation is NOT exact ! Due to transitions t159, t160, t214, t216, t342, t398, t431, t543, t544, t600, t616, t617, t622, t625, t630, t63...580
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 722 transition count 832
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 722 transition count 832
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 704 transition count 814
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 704 transition count 814
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 693 transition count 803
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 693 transition count 803
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 111 place count 682 transition count 792
Iterating global reduction 0 with 11 rules applied. Total rules applied 122 place count 682 transition count 792
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 673 transition count 783
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 673 transition count 783
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 148 place count 665 transition count 775
Iterating global reduction 0 with 8 rules applied. Total rules applied 156 place count 665 transition count 775
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 164 place count 657 transition count 767
Iterating global reduction 0 with 8 rules applied. Total rules applied 172 place count 657 transition count 767
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 178 place count 651 transition count 761
Iterating global reduction 0 with 6 rules applied. Total rules applied 184 place count 651 transition count 761
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 189 place count 646 transition count 756
Iterating global reduction 0 with 5 rules applied. Total rules applied 194 place count 646 transition count 756
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 199 place count 641 transition count 751
Iterating global reduction 0 with 5 rules applied. Total rules applied 204 place count 641 transition count 751
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 207 place count 638 transition count 748
Iterating global reduction 0 with 3 rules applied. Total rules applied 210 place count 638 transition count 748
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 213 place count 635 transition count 745
Iterating global reduction 0 with 3 rules applied. Total rules applied 216 place count 635 transition count 745
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 219 place count 632 transition count 742
Iterating global reduction 0 with 3 rules applied. Total rules applied 222 place count 632 transition count 742
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 225 place count 629 transition count 739
Iterating global reduction 0 with 3 rules applied. Total rules applied 228 place count 629 transition count 739
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 231 place count 626 transition count 736
Iterating global reduction 0 with 3 rules applied. Total rules applied 234 place count 626 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 237 place count 623 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 240 place count 623 transition count 733
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 243 place count 620 transition count 730
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 620 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 249 place count 617 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 252 place count 617 transition count 727
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 255 place count 614 transition count 724
Iterating global reduction 0 with 3 rules applied. Total rules applied 258 place count 614 transition count 724
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 260 place count 612 transition count 722
Iterating global reduction 0 with 2 rules applied. Total rules applied 262 place count 612 transition count 722
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 264 place count 610 transition count 720
Iterating global reduction 0 with 2 rules applied. Total rules applied 266 place count 610 transition count 720
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 268 place count 608 transition count 718
Iterating global reduction 0 with 2 rules applied. Total rules applied 270 place count 608 transition count 718
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 272 place count 608 transition count 716
Applied a total of 272 rules in 299 ms. Remains 608 /743 variables (removed 135) and now considering 716/853 (removed 137) transitions.
// Phase 1: matrix 716 rows 608 cols
[2024-05-29 11:59:28] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 11:59:28] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-29 11:59:28] [INFO ] Invariant cache hit.
[2024-05-29 11:59:28] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 715 sub problems to find dead transitions.
[2024-05-29 11:59:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/608 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 11:59:40] [INFO ] Deduced a trap composed of 291 places in 151 ms of which 3 ms to minimize.
[2024-05-29 11:59:41] [INFO ] Deduced a trap composed of 293 places in 146 ms of which 4 ms to minimize.
[2024-05-29 11:59:41] [INFO ] Deduced a trap composed of 300 places in 154 ms of which 4 ms to minimize.
[2024-05-29 11:59:41] [INFO ] Deduced a trap composed of 292 places in 119 ms of which 3 ms to minimize.
[2024-05-29 11:59:42] [INFO ] Deduced a trap composed of 307 places in 132 ms of which 2 ms to minimize.
[2024-05-29 11:59:44] [INFO ] Deduced a trap composed of 300 places in 148 ms of which 3 ms to minimize.
[2024-05-29 11:59:44] [INFO ] Deduced a trap composed of 292 places in 113 ms of which 3 ms to minimize.
[2024-05-29 11:59:44] [INFO ] Deduced a trap composed of 308 places in 128 ms of which 3 ms to minimize.
[2024-05-29 11:59:44] [INFO ] Deduced a trap composed of 293 places in 130 ms of which 3 ms to minimize.
[2024-05-29 11:59:50] [INFO ] Deduced a trap composed of 293 places in 127 ms of which 3 ms to minimize.
[2024-05-29 11:59:50] [INFO ] Deduced a trap composed of 292 places in 156 ms of which 4 ms to minimize.
[2024-05-29 11:59:50] [INFO ] Deduced a trap composed of 301 places in 128 ms of which 3 ms to minimize.
[2024-05-29 11:59:51] [INFO ] Deduced a trap composed of 298 places in 146 ms of which 3 ms to minimize.
[2024-05-29 11:59:51] [INFO ] Deduced a trap composed of 297 places in 137 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1324 variables, and 18 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/608 constraints, PredecessorRefiner: 715/715 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 715 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 1 (OVERLAPS) 1/608 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 715 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 12:00:10] [INFO ] Deduced a trap composed of 291 places in 107 ms of which 3 ms to minimize.
[2024-05-29 12:00:12] [INFO ] Deduced a trap composed of 302 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/608 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 715 unsolved
[2024-05-29 12:00:23] [INFO ] Deduced a trap composed of 298 places in 134 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 715 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/1324 variables, and 21 constraints, problems are : Problem set: 0 solved, 715 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/608 constraints, PredecessorRefiner: 0/715 constraints, Known Traps: 17/17 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 715 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 608/743 places, 716/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60881 ms. Remains : 608/743 places, 716/853 transitions.
[2024-05-29 12:00:28] [INFO ] Flatten gal took : 14 ms
[2024-05-29 12:00:28] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:00:28] [INFO ] Input system was already deterministic with 716 transitions.
[2024-05-29 12:00:28] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:00:29] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:00:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15096398664604606075.gal : 2 ms
[2024-05-29 12:00:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15617754124365805029.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/CTLCardinality15096398664604606075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15617754124365805029.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,6.87854e+07,3.95914,118788,2,10792,5,346357,6,0,3150,555032,0


Converting to forward existential form...Done !
original formula: AX(EG(EF((A(((p27==0)||(p809==1)) U (p636==1)) * ((p207==0)||(p926==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (!((E(!((p636==1)) U (!(((p27==0)||(p809==1))) * !((p636==1)))) + EG(!((p636==1))))) ...193
Reverse transition relation is NOT exact ! Due to transitions t69, t75, t90, t99, t153, t154, t155, t208, t211, t245, t248, t263, t272, t326, t327, t328, t...398
Detected timeout of ITS tools.
[2024-05-29 12:00:59] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:00:59] [INFO ] Applying decomposition
[2024-05-29 12:00:59] [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/graph7770789938822194926.txt' '-o' '/tmp/graph7770789938822194926.bin' '-w' '/tmp/graph7770789938822194926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7770789938822194926.bin' '-l' '-1' '-v' '-w' '/tmp/graph7770789938822194926.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:00:59] [INFO ] Decomposing Gal with order
[2024-05-29 12:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:00:59] [INFO ] Removed a total of 389 redundant transitions.
[2024-05-29 12:00:59] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-29 12:00:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1798816586409107565.gal : 4 ms
[2024-05-29 12:00:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13653968326948654642.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/CTLCardinality1798816586409107565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13653968326948654642.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,6.87854e+07,0.21602,11196,1013,22,12954,433,923,16698,63,838,0


Converting to forward existential form...Done !
original formula: AX(EG(EF((A(((i1.i0.i0.u7.p27==0)||(i23.u219.p809==1)) U (i19.i0.i1.u165.p636==1)) * ((i6.i1.i0.u62.p207==0)||(i27.u236.p926==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (!((E(!((i19.i0.i1.u165.p636==1)) U (!(((i1.i0.i0.u7.p27==0)||(i23.u219.p809==1))) * ...281
Reverse transition relation is NOT exact ! Due to transitions t211, t328, t384, t428, t452, t561, t564, t580, t581, t584, t587, t592, t595, t598, t599, t60...522
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,1,15.4905,495372,1,0,945570,510,8479,1.61414e+06,328,1509,1680414
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Graph (trivial) has 732 edges and 743 vertex of which 56 / 743 are part of one of the 9 SCC in 4 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 520 transitions
Trivial Post-agglo rules discarded 520 transitions
Performed 520 trivial Post agglomeration. Transition count delta: 520
Iterating post reduction 0 with 520 rules applied. Total rules applied 521 place count 695 transition count 279
Reduce places removed 520 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 529 rules applied. Total rules applied 1050 place count 175 transition count 270
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1055 place count 171 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1056 place count 170 transition count 269
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 39 Pre rules applied. Total rules applied 1056 place count 170 transition count 230
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1134 place count 131 transition count 230
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1147 place count 118 transition count 217
Iterating global reduction 4 with 13 rules applied. Total rules applied 1160 place count 118 transition count 217
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1169 place count 109 transition count 192
Iterating global reduction 4 with 9 rules applied. Total rules applied 1178 place count 109 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1181 place count 109 transition count 189
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1184 place count 106 transition count 186
Iterating global reduction 5 with 3 rules applied. Total rules applied 1187 place count 106 transition count 186
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1190 place count 103 transition count 183
Iterating global reduction 5 with 3 rules applied. Total rules applied 1193 place count 103 transition count 183
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1225 place count 87 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1227 place count 87 transition count 165
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1242 place count 72 transition count 131
Iterating global reduction 6 with 15 rules applied. Total rules applied 1257 place count 72 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1263 place count 72 transition count 125
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1271 place count 64 transition count 114
Iterating global reduction 7 with 8 rules applied. Total rules applied 1279 place count 64 transition count 114
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1287 place count 56 transition count 103
Iterating global reduction 7 with 8 rules applied. Total rules applied 1295 place count 56 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1300 place count 56 transition count 98
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 8 with 2 rules applied. Total rules applied 1302 place count 55 transition count 97
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1303 place count 54 transition count 94
Iterating global reduction 8 with 1 rules applied. Total rules applied 1304 place count 54 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1305 place count 54 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1308 place count 54 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1314 place count 51 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1315 place count 50 transition count 86
Applied a total of 1315 rules in 46 ms. Remains 50 /743 variables (removed 693) and now considering 86/853 (removed 767) transitions.
[2024-05-29 12:01:14] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 50 cols
[2024-05-29 12:01:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:01:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 12:01:14] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-29 12:01:14] [INFO ] Invariant cache hit.
[2024-05-29 12:01:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:01:14] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-29 12:01:14] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-29 12:01:14] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-29 12:01:14] [INFO ] Invariant cache hit.
[2024-05-29 12:01:14] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 12:01:15] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/131 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 67 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/50 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/131 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 79/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 12:01:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints]
After SMT, in 3471ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3472ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/743 places, 86/853 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3621 ms. Remains : 50/743 places, 86/853 transitions.
[2024-05-29 12:01:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:01:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 12:01:18] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-29 12:01:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:01:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:01:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5321990914755153145.gal : 2 ms
[2024-05-29 12:01:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14850374121192962068.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/ReachabilityCardinality5321990914755153145.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14850374121192962068.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14850374121192962068.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 116
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :116 after 180
RANDOM walk for 40000 steps (5138 resets) in 290 ms. (137 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :180 after 1322
Reachability property StigmergyCommit-PT-02b-CTLCardinality-2024-07 is true.
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2576,0.062642,4580,2,550,12,4205,6,0,280,3284,0
Total reachable state count : 2576

Verifying 1 reachability properties.
Reachability property StigmergyCommit-PT-02b-CTLCardinality-2024-07 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-02b-CTLCardinality-2024-07,1,0.063021,4840,2,51,12,4205,7,0,283,3284,0
BEST_FIRST walk for 40001 steps (841 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 15085 steps, run visited all 1 properties in 37 ms. (steps per millisecond=407 )
Probabilistic random walk after 15085 steps, saw 3850 distinct states, run finished after 55 ms. (steps per millisecond=274 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 723 transition count 833
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 723 transition count 833
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 705 transition count 815
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 705 transition count 815
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 694 transition count 804
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 694 transition count 804
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 683 transition count 793
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 683 transition count 793
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 129 place count 674 transition count 784
Iterating global reduction 0 with 9 rules applied. Total rules applied 138 place count 674 transition count 784
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 146 place count 666 transition count 776
Iterating global reduction 0 with 8 rules applied. Total rules applied 154 place count 666 transition count 776
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 162 place count 658 transition count 768
Iterating global reduction 0 with 8 rules applied. Total rules applied 170 place count 658 transition count 768
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 652 transition count 762
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 652 transition count 762
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 187 place count 647 transition count 757
Iterating global reduction 0 with 5 rules applied. Total rules applied 192 place count 647 transition count 757
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 197 place count 642 transition count 752
Iterating global reduction 0 with 5 rules applied. Total rules applied 202 place count 642 transition count 752
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 203 place count 642 transition count 751
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 205 place count 640 transition count 749
Iterating global reduction 1 with 2 rules applied. Total rules applied 207 place count 640 transition count 749
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 209 place count 638 transition count 747
Iterating global reduction 1 with 2 rules applied. Total rules applied 211 place count 638 transition count 747
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 213 place count 636 transition count 745
Iterating global reduction 1 with 2 rules applied. Total rules applied 215 place count 636 transition count 745
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 217 place count 634 transition count 743
Iterating global reduction 1 with 2 rules applied. Total rules applied 219 place count 634 transition count 743
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 221 place count 632 transition count 741
Iterating global reduction 1 with 2 rules applied. Total rules applied 223 place count 632 transition count 741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 225 place count 630 transition count 739
Iterating global reduction 1 with 2 rules applied. Total rules applied 227 place count 630 transition count 739
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 229 place count 628 transition count 737
Iterating global reduction 1 with 2 rules applied. Total rules applied 231 place count 628 transition count 737
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 232 place count 627 transition count 736
Iterating global reduction 1 with 1 rules applied. Total rules applied 233 place count 627 transition count 736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 234 place count 626 transition count 735
Iterating global reduction 1 with 1 rules applied. Total rules applied 235 place count 626 transition count 735
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 236 place count 625 transition count 734
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 625 transition count 734
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 238 place count 624 transition count 733
Iterating global reduction 1 with 1 rules applied. Total rules applied 239 place count 624 transition count 733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 240 place count 623 transition count 732
Iterating global reduction 1 with 1 rules applied. Total rules applied 241 place count 623 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 242 place count 623 transition count 731
Applied a total of 242 rules in 335 ms. Remains 623 /743 variables (removed 120) and now considering 731/853 (removed 122) transitions.
// Phase 1: matrix 731 rows 623 cols
[2024-05-29 12:01:18] [INFO ] Computed 4 invariants in 6 ms
[2024-05-29 12:01:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 12:01:19] [INFO ] Invariant cache hit.
[2024-05-29 12:01:19] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 730 sub problems to find dead transitions.
[2024-05-29 12:01:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-29 12:01:34] [INFO ] Deduced a trap composed of 312 places in 169 ms of which 4 ms to minimize.
[2024-05-29 12:01:34] [INFO ] Deduced a trap composed of 312 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:01:37] [INFO ] Deduced a trap composed of 297 places in 138 ms of which 4 ms to minimize.
[2024-05-29 12:01:39] [INFO ] Deduced a trap composed of 319 places in 130 ms of which 4 ms to minimize.
[2024-05-29 12:01:39] [INFO ] Deduced a trap composed of 298 places in 180 ms of which 3 ms to minimize.
[2024-05-29 12:01:40] [INFO ] Deduced a trap composed of 297 places in 135 ms of which 3 ms to minimize.
[2024-05-29 12:01:40] [INFO ] Deduced a trap composed of 296 places in 173 ms of which 3 ms to minimize.
[2024-05-29 12:01:40] [INFO ] Deduced a trap composed of 303 places in 184 ms of which 4 ms to minimize.
[2024-05-29 12:01:40] [INFO ] Deduced a trap composed of 292 places in 173 ms of which 4 ms to minimize.
[2024-05-29 12:01:41] [INFO ] Deduced a trap composed of 293 places in 181 ms of which 3 ms to minimize.
[2024-05-29 12:01:41] [INFO ] Deduced a trap composed of 320 places in 161 ms of which 3 ms to minimize.
[2024-05-29 12:01:41] [INFO ] Deduced a trap composed of 303 places in 163 ms of which 4 ms to minimize.
[2024-05-29 12:01:41] [INFO ] Deduced a trap composed of 312 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 730 unsolved
[2024-05-29 12:01:48] [INFO ] Deduced a trap composed of 298 places in 140 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1354 variables, and 18 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/623 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 730 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 1 (OVERLAPS) 1/623 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/623 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 4 (OVERLAPS) 731/1354 variables, 623/641 constraints. Problems are: Problem set: 0 solved, 730 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1354 variables, 730/1371 constraints. Problems are: Problem set: 0 solved, 730 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1354/1354 variables, and 1371 constraints, problems are : Problem set: 0 solved, 730 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 623/623 constraints, PredecessorRefiner: 730/730 constraints, Known Traps: 14/14 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 730 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 623/743 places, 731/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60914 ms. Remains : 623/743 places, 731/853 transitions.
[2024-05-29 12:02:19] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:02:19] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:02:19] [INFO ] Input system was already deterministic with 731 transitions.
[2024-05-29 12:02:19] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:02:19] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:02:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5269270512345860648.gal : 3 ms
[2024-05-29 12:02:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4292947289784268329.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/CTLCardinality5269270512345860648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4292947289784268329.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(E((((A((p684==0) U ((p790==0)||(p347==1))) * EX(((p664==0)||(p919==1)))) * ((p363!=0)&&((p892==0)||(p504==1)))) * ((p98==0)||(p560==1)...190
=> equivalent forward existential formula: [FwdG(Init,E((((!((E(!(((p790==0)||(p347==1))) U (!((p684==0)) * !(((p790==0)||(p347==1))))) + EG(!(((p790==0)||...359
Reverse transition relation is NOT exact ! Due to transitions t24, t69, t79, t101, t110, t164, t165, t166, t219, t222, t256, t265, t280, t289, t343, t344, ...399
Detected timeout of ITS tools.
[2024-05-29 12:02:49] [INFO ] Flatten gal took : 15 ms
[2024-05-29 12:02:49] [INFO ] Applying decomposition
[2024-05-29 12:02:49] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph200036896259131274.txt' '-o' '/tmp/graph200036896259131274.bin' '-w' '/tmp/graph200036896259131274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph200036896259131274.bin' '-l' '-1' '-v' '-w' '/tmp/graph200036896259131274.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:02:49] [INFO ] Decomposing Gal with order
[2024-05-29 12:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:02:49] [INFO ] Removed a total of 399 redundant transitions.
[2024-05-29 12:02:49] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-29 12:02:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality17613426586449671302.gal : 5 ms
[2024-05-29 12:02:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15123674946252862144.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/CTLCardinality17613426586449671302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15123674946252862144.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.24098e+07,0.441472,22064,911,16,37140,411,1037,64375,56,744,0


Converting to forward existential form...Done !
original formula: EG(E((((A((i23.i1.i0.u181.p684==0) U ((i25.u216.p790==0)||(i9.i1.i1.u93.p347==1))) * EX(((i19.u176.p664==0)||(i29.u251.p919==1)))) * ((i1...317
=> equivalent forward existential formula: [FwdG(Init,E((((!((E(!(((i25.u216.p790==0)||(i9.i1.i1.u93.p347==1))) U (!((i23.i1.i0.u181.p684==0)) * !(((i25.u2...548
Reverse transition relation is NOT exact ! Due to transitions t24, t69, t166, t256, t289, t344, t345, t401, t434, t516, t517, t570, t573, t589, t590, t596,...486
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,12.6324,446840,1,0,838042,438,8581,2.39347e+06,265,1192,1469700
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Graph (trivial) has 733 edges and 743 vertex of which 56 / 743 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 522 transitions
Trivial Post-agglo rules discarded 522 transitions
Performed 522 trivial Post agglomeration. Transition count delta: 522
Iterating post reduction 0 with 522 rules applied. Total rules applied 523 place count 695 transition count 277
Reduce places removed 522 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 531 rules applied. Total rules applied 1054 place count 173 transition count 268
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1058 place count 169 transition count 268
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 1058 place count 169 transition count 230
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1134 place count 131 transition count 230
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1148 place count 117 transition count 216
Iterating global reduction 3 with 14 rules applied. Total rules applied 1162 place count 117 transition count 216
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1171 place count 108 transition count 191
Iterating global reduction 3 with 9 rules applied. Total rules applied 1180 place count 108 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1183 place count 108 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1186 place count 105 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 1189 place count 105 transition count 185
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1192 place count 102 transition count 182
Iterating global reduction 4 with 3 rules applied. Total rules applied 1195 place count 102 transition count 182
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1227 place count 86 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1229 place count 86 transition count 164
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1244 place count 71 transition count 133
Iterating global reduction 5 with 15 rules applied. Total rules applied 1259 place count 71 transition count 133
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1264 place count 71 transition count 128
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1273 place count 62 transition count 116
Iterating global reduction 6 with 9 rules applied. Total rules applied 1282 place count 62 transition count 116
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1291 place count 53 transition count 104
Iterating global reduction 6 with 9 rules applied. Total rules applied 1300 place count 53 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1306 place count 53 transition count 98
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 7 with 2 rules applied. Total rules applied 1308 place count 52 transition count 97
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1309 place count 51 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 1310 place count 51 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1311 place count 51 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1314 place count 51 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1320 place count 48 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1321 place count 47 transition count 86
Applied a total of 1321 rules in 33 ms. Remains 47 /743 variables (removed 696) and now considering 86/853 (removed 767) transitions.
[2024-05-29 12:03:02] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 47 cols
[2024-05-29 12:03:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:03:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 12:03:02] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-29 12:03:02] [INFO ] Invariant cache hit.
[2024-05-29 12:03:02] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:03:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 12:03:02] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-29 12:03:02] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-29 12:03:02] [INFO ] Invariant cache hit.
[2024-05-29 12:03:02] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 12:03:02] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 12:03:03] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 81/128 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 65 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 3/47 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-29 12:03:04] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 81/128 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 79/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 10/10 constraints]
After SMT, in 3199ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3200ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/743 places, 86/853 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3309 ms. Remains : 47/743 places, 86/853 transitions.
[2024-05-29 12:03:05] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:03:05] [INFO ] Flatten gal took : 4 ms
[2024-05-29 12:03:05] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-29 12:03:05] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:03:05] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:03:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13648154433850780400.gal : 1 ms
[2024-05-29 12:03:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality2217376993501332921.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/CTLCardinality13648154433850780400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2217376993501332921.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,5354,0.037687,4792,2,833,5,5233,6,0,268,5511,0


Converting to forward existential form...Done !
original formula: AG(EF((p652==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p652==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t7, t8, t9, t16, t17, t18, t32, t33, t41, t48, t50, t51, t64, t65, t66, t68, t72,...274
(forward)formula 0,0,0.265569,14824,1,0,173,59744,188,78,1981,39964,185
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 722 transition count 832
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 722 transition count 832
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 704 transition count 814
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 704 transition count 814
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 89 place count 693 transition count 803
Iterating global reduction 0 with 11 rules applied. Total rules applied 100 place count 693 transition count 803
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 111 place count 682 transition count 792
Iterating global reduction 0 with 11 rules applied. Total rules applied 122 place count 682 transition count 792
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 673 transition count 783
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 673 transition count 783
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 147 place count 666 transition count 776
Iterating global reduction 0 with 7 rules applied. Total rules applied 154 place count 666 transition count 776
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 161 place count 659 transition count 769
Iterating global reduction 0 with 7 rules applied. Total rules applied 168 place count 659 transition count 769
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 175 place count 652 transition count 762
Iterating global reduction 0 with 7 rules applied. Total rules applied 182 place count 652 transition count 762
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 187 place count 647 transition count 757
Iterating global reduction 0 with 5 rules applied. Total rules applied 192 place count 647 transition count 757
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 197 place count 642 transition count 752
Iterating global reduction 0 with 5 rules applied. Total rules applied 202 place count 642 transition count 752
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 205 place count 639 transition count 749
Iterating global reduction 0 with 3 rules applied. Total rules applied 208 place count 639 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 211 place count 636 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 214 place count 636 transition count 746
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 216 place count 634 transition count 744
Iterating global reduction 0 with 2 rules applied. Total rules applied 218 place count 634 transition count 744
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 220 place count 632 transition count 742
Iterating global reduction 0 with 2 rules applied. Total rules applied 222 place count 632 transition count 742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 223 place count 631 transition count 741
Iterating global reduction 0 with 1 rules applied. Total rules applied 224 place count 631 transition count 741
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 225 place count 630 transition count 740
Iterating global reduction 0 with 1 rules applied. Total rules applied 226 place count 630 transition count 740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 227 place count 629 transition count 739
Iterating global reduction 0 with 1 rules applied. Total rules applied 228 place count 629 transition count 739
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 628 transition count 738
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 628 transition count 738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 627 transition count 737
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 627 transition count 737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 233 place count 626 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 234 place count 626 transition count 736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 235 place count 625 transition count 735
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 625 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 237 place count 625 transition count 734
Applied a total of 237 rules in 296 ms. Remains 625 /743 variables (removed 118) and now considering 734/853 (removed 119) transitions.
// Phase 1: matrix 734 rows 625 cols
[2024-05-29 12:03:06] [INFO ] Computed 4 invariants in 11 ms
[2024-05-29 12:03:06] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-29 12:03:06] [INFO ] Invariant cache hit.
[2024-05-29 12:03:06] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 733 sub problems to find dead transitions.
[2024-05-29 12:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 733 unsolved
[2024-05-29 12:03:22] [INFO ] Deduced a trap composed of 291 places in 181 ms of which 4 ms to minimize.
[2024-05-29 12:03:22] [INFO ] Deduced a trap composed of 291 places in 149 ms of which 3 ms to minimize.
[2024-05-29 12:03:23] [INFO ] Deduced a trap composed of 298 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:03:24] [INFO ] Deduced a trap composed of 298 places in 139 ms of which 3 ms to minimize.
[2024-05-29 12:03:25] [INFO ] Deduced a trap composed of 298 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 307 places in 182 ms of which 3 ms to minimize.
[2024-05-29 12:03:26] [INFO ] Deduced a trap composed of 308 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:03:27] [INFO ] Deduced a trap composed of 302 places in 165 ms of which 4 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 302 places in 126 ms of which 3 ms to minimize.
[2024-05-29 12:03:28] [INFO ] Deduced a trap composed of 302 places in 145 ms of which 3 ms to minimize.
[2024-05-29 12:03:29] [INFO ] Deduced a trap composed of 291 places in 140 ms of which 3 ms to minimize.
[2024-05-29 12:03:29] [INFO ] Deduced a trap composed of 308 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:03:29] [INFO ] Deduced a trap composed of 311 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:03:30] [INFO ] Deduced a trap composed of 298 places in 126 ms of which 3 ms to minimize.
[2024-05-29 12:03:30] [INFO ] Deduced a trap composed of 317 places in 156 ms of which 4 ms to minimize.
[2024-05-29 12:03:31] [INFO ] Deduced a trap composed of 316 places in 147 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/1359 variables, and 20 constraints, problems are : Problem set: 0 solved, 733 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/625 constraints, PredecessorRefiner: 733/733 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 1 (OVERLAPS) 1/625 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 733 unsolved
[2024-05-29 12:03:48] [INFO ] Deduced a trap composed of 308 places in 142 ms of which 3 ms to minimize.
[2024-05-29 12:03:49] [INFO ] Deduced a trap composed of 311 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/625 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/625 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 5 (OVERLAPS) 734/1359 variables, 625/647 constraints. Problems are: Problem set: 0 solved, 733 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1359 variables, 733/1380 constraints. Problems are: Problem set: 0 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 1380 constraints, problems are : Problem set: 0 solved, 733 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 625/625 constraints, PredecessorRefiner: 733/733 constraints, Known Traps: 18/18 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 733 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 625/743 places, 734/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60952 ms. Remains : 625/743 places, 734/853 transitions.
[2024-05-29 12:04:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:04:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:04:07] [INFO ] Input system was already deterministic with 734 transitions.
[2024-05-29 12:04:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:04:07] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:04:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5882718668440550670.gal : 2 ms
[2024-05-29 12:04:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14542852468708839529.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/CTLCardinality5882718668440550670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14542852468708839529.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,7.3117e+07,4.05788,119348,2,11375,5,350758,6,0,3236,549421,0


Converting to forward existential form...Done !
original formula: (AX(EG(EF((p215!=1)))) * !(E(AG(!(((EF((p485==1)) * ((p231==0)||(p492==1))) * (p357==1)))) U ((EG((p468==0)) * (p733==0)) * (p367==0)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(E(TRUE U (p215!=1)))))] = FALSE * [FwdG(((FwdU(Init,!(E(TRUE U !(!(((E(TRUE U (p485==1)) * ((...241
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t149, t150, t151, t204, t207, t241, t251, t264, t282, t336, t337, t338, t...404
Detected timeout of ITS tools.
[2024-05-29 12:04:37] [INFO ] Flatten gal took : 16 ms
[2024-05-29 12:04:37] [INFO ] Applying decomposition
[2024-05-29 12:04:37] [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/graph14436705108262988437.txt' '-o' '/tmp/graph14436705108262988437.bin' '-w' '/tmp/graph14436705108262988437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14436705108262988437.bin' '-l' '-1' '-v' '-w' '/tmp/graph14436705108262988437.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:04:37] [INFO ] Decomposing Gal with order
[2024-05-29 12:04:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:04:37] [INFO ] Removed a total of 397 redundant transitions.
[2024-05-29 12:04:37] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:04:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-29 12:04:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality739809491390779248.gal : 5 ms
[2024-05-29 12:04:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11389789061065224694.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/CTLCardinality739809491390779248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11389789061065224694.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,7.3117e+07,0.250857,13344,1016,26,17611,548,1013,26850,81,1088,0


Converting to forward existential form...Done !
original formula: (AX(EG(EF((i5.u61.p215!=1)))) * !(E(AG(!(((EF((i15.i0.i1.u135.p485==1)) * ((i28.u57.p231==0)||(i15.i1.i0.u136.p492==1))) * (i12.i0.i1.u96...253
=> equivalent forward existential formula: ([(EY(Init) * !(EG(E(TRUE U (i5.u61.p215!=1)))))] = FALSE * [FwdG(((FwdU(Init,!(E(TRUE U !(!(((E(TRUE U (i15.i0....339
Reverse transition relation is NOT exact ! Due to transitions t95, t207, t241, t282, t394, t427, t520, t576, t592, t593, t596, t599, t604, t607, t611, t612...521
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,3.73103,145080,1,0,305548,838,9430,456151,457,2296,865288
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 727 transition count 837
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 727 transition count 837
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 46 place count 713 transition count 823
Iterating global reduction 0 with 14 rules applied. Total rules applied 60 place count 713 transition count 823
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 703 transition count 813
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 703 transition count 813
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 693 transition count 803
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 693 transition count 803
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 108 place count 685 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 116 place count 685 transition count 795
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 123 place count 678 transition count 788
Iterating global reduction 0 with 7 rules applied. Total rules applied 130 place count 678 transition count 788
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 137 place count 671 transition count 781
Iterating global reduction 0 with 7 rules applied. Total rules applied 144 place count 671 transition count 781
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 149 place count 666 transition count 776
Iterating global reduction 0 with 5 rules applied. Total rules applied 154 place count 666 transition count 776
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 158 place count 662 transition count 772
Iterating global reduction 0 with 4 rules applied. Total rules applied 162 place count 662 transition count 772
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 166 place count 658 transition count 768
Iterating global reduction 0 with 4 rules applied. Total rules applied 170 place count 658 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 171 place count 658 transition count 767
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 173 place count 656 transition count 765
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 656 transition count 765
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 176 place count 655 transition count 764
Iterating global reduction 1 with 1 rules applied. Total rules applied 177 place count 655 transition count 764
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 178 place count 654 transition count 763
Iterating global reduction 1 with 1 rules applied. Total rules applied 179 place count 654 transition count 763
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 653 transition count 762
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 653 transition count 762
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 182 place count 652 transition count 761
Iterating global reduction 1 with 1 rules applied. Total rules applied 183 place count 652 transition count 761
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 184 place count 651 transition count 760
Iterating global reduction 1 with 1 rules applied. Total rules applied 185 place count 651 transition count 760
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 186 place count 650 transition count 759
Iterating global reduction 1 with 1 rules applied. Total rules applied 187 place count 650 transition count 759
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 188 place count 649 transition count 758
Iterating global reduction 1 with 1 rules applied. Total rules applied 189 place count 649 transition count 758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 190 place count 648 transition count 757
Iterating global reduction 1 with 1 rules applied. Total rules applied 191 place count 648 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 192 place count 647 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 193 place count 647 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 194 place count 646 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 195 place count 646 transition count 755
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 196 place count 645 transition count 754
Iterating global reduction 1 with 1 rules applied. Total rules applied 197 place count 645 transition count 754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 198 place count 645 transition count 753
Applied a total of 198 rules in 293 ms. Remains 645 /743 variables (removed 98) and now considering 753/853 (removed 100) transitions.
// Phase 1: matrix 753 rows 645 cols
[2024-05-29 12:04:41] [INFO ] Computed 4 invariants in 12 ms
[2024-05-29 12:04:41] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 12:04:41] [INFO ] Invariant cache hit.
[2024-05-29 12:04:41] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 752 sub problems to find dead transitions.
[2024-05-29 12:04:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (OVERLAPS) 1/645 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 752 unsolved
[2024-05-29 12:04:55] [INFO ] Deduced a trap composed of 307 places in 158 ms of which 3 ms to minimize.
[2024-05-29 12:04:55] [INFO ] Deduced a trap composed of 301 places in 124 ms of which 2 ms to minimize.
[2024-05-29 12:04:55] [INFO ] Deduced a trap composed of 298 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:04:55] [INFO ] Deduced a trap composed of 314 places in 137 ms of which 3 ms to minimize.
[2024-05-29 12:04:58] [INFO ] Deduced a trap composed of 306 places in 157 ms of which 4 ms to minimize.
[2024-05-29 12:04:58] [INFO ] Deduced a trap composed of 298 places in 136 ms of which 3 ms to minimize.
[2024-05-29 12:04:58] [INFO ] Deduced a trap composed of 308 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:04:59] [INFO ] Deduced a trap composed of 321 places in 166 ms of which 4 ms to minimize.
[2024-05-29 12:04:59] [INFO ] Deduced a trap composed of 300 places in 129 ms of which 3 ms to minimize.
[2024-05-29 12:05:01] [INFO ] Deduced a trap composed of 298 places in 133 ms of which 3 ms to minimize.
[2024-05-29 12:05:03] [INFO ] Deduced a trap composed of 319 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:05:04] [INFO ] Deduced a trap composed of 317 places in 132 ms of which 3 ms to minimize.
[2024-05-29 12:05:05] [INFO ] Deduced a trap composed of 323 places in 158 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/645 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/1398 variables, and 17 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/645 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 752 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 1 (OVERLAPS) 1/645 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/645 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 752 unsolved
[2024-05-29 12:05:24] [INFO ] Deduced a trap composed of 298 places in 117 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/645 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/645 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 5 (OVERLAPS) 753/1398 variables, 645/663 constraints. Problems are: Problem set: 0 solved, 752 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1398 variables, 752/1415 constraints. Problems are: Problem set: 0 solved, 752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1398/1398 variables, and 1415 constraints, problems are : Problem set: 0 solved, 752 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 752/752 constraints, Known Traps: 14/14 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 752 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 645/743 places, 753/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60903 ms. Remains : 645/743 places, 753/853 transitions.
[2024-05-29 12:05:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:05:42] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:05:42] [INFO ] Input system was already deterministic with 753 transitions.
[2024-05-29 12:05:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:05:42] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:05:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality11629408236986644513.gal : 3 ms
[2024-05-29 12:05:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality1401214134492953266.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/CTLCardinality11629408236986644513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1401214134492953266.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,7.69755e+07,3.93455,113680,2,13353,5,361415,6,0,3335,495877,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:06:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:06:12] [INFO ] Applying decomposition
[2024-05-29 12:06:12] [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/graph4180860366384183863.txt' '-o' '/tmp/graph4180860366384183863.bin' '-w' '/tmp/graph4180860366384183863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4180860366384183863.bin' '-l' '-1' '-v' '-w' '/tmp/graph4180860366384183863.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:06:12] [INFO ] Decomposing Gal with order
[2024-05-29 12:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:06:12] [INFO ] Removed a total of 392 redundant transitions.
[2024-05-29 12:06:12] [INFO ] Flatten gal took : 25 ms
[2024-05-29 12:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-29 12:06:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15300369884844829372.gal : 4 ms
[2024-05-29 12:06:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11736360837993240597.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/CTLCardinality15300369884844829372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11736360837993240597.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.69755e+07,1.94759,84600,1231,20,165231,465,946,357253,53,940,0


Converting to forward existential form...Done !
original formula: (E((EX((i18.u159.p573!=1)) + EF((((i23.u199.p685!=1)&&(!((i16.u142.p455==0)||(i7.u76.p263==1))))&&(!((i21.i0.i0.u179.p632==0)||(i5.u57.p1...549
=> equivalent forward existential formula: ([(Init * !(E((EX((i18.u159.p573!=1)) + E(TRUE U (((i23.u199.p685!=1)&&(!((i16.u142.p455==0)||(i7.u76.p263==1)))...830
Reverse transition relation is NOT exact ! Due to transitions t69, t105, t163, t219, t256, t340, t341, t394, t397, t457, t474, t532, t604, t605, t611, t614...488
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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 a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
(forward)formula 0,1,13.8461,482448,1,0,754452,465,8268,2.92782e+06,256,940,1678518
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 721 transition count 831
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 721 transition count 831
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 63 place count 702 transition count 812
Iterating global reduction 0 with 19 rules applied. Total rules applied 82 place count 702 transition count 812
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 690 transition count 800
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 690 transition count 800
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 118 place count 678 transition count 788
Iterating global reduction 0 with 12 rules applied. Total rules applied 130 place count 678 transition count 788
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 669 transition count 779
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 669 transition count 779
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 157 place count 660 transition count 770
Iterating global reduction 0 with 9 rules applied. Total rules applied 166 place count 660 transition count 770
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 175 place count 651 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 184 place count 651 transition count 761
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 190 place count 645 transition count 755
Iterating global reduction 0 with 6 rules applied. Total rules applied 196 place count 645 transition count 755
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 201 place count 640 transition count 750
Iterating global reduction 0 with 5 rules applied. Total rules applied 206 place count 640 transition count 750
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 211 place count 635 transition count 745
Iterating global reduction 0 with 5 rules applied. Total rules applied 216 place count 635 transition count 745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 217 place count 635 transition count 744
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 220 place count 632 transition count 741
Iterating global reduction 1 with 3 rules applied. Total rules applied 223 place count 632 transition count 741
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 226 place count 629 transition count 738
Iterating global reduction 1 with 3 rules applied. Total rules applied 229 place count 629 transition count 738
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 232 place count 626 transition count 735
Iterating global reduction 1 with 3 rules applied. Total rules applied 235 place count 626 transition count 735
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 238 place count 623 transition count 732
Iterating global reduction 1 with 3 rules applied. Total rules applied 241 place count 623 transition count 732
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 244 place count 620 transition count 729
Iterating global reduction 1 with 3 rules applied. Total rules applied 247 place count 620 transition count 729
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 250 place count 617 transition count 726
Iterating global reduction 1 with 3 rules applied. Total rules applied 253 place count 617 transition count 726
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 256 place count 614 transition count 723
Iterating global reduction 1 with 3 rules applied. Total rules applied 259 place count 614 transition count 723
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 262 place count 611 transition count 720
Iterating global reduction 1 with 3 rules applied. Total rules applied 265 place count 611 transition count 720
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 268 place count 608 transition count 717
Iterating global reduction 1 with 3 rules applied. Total rules applied 271 place count 608 transition count 717
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 274 place count 605 transition count 714
Iterating global reduction 1 with 3 rules applied. Total rules applied 277 place count 605 transition count 714
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 280 place count 602 transition count 711
Iterating global reduction 1 with 3 rules applied. Total rules applied 283 place count 602 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 284 place count 602 transition count 710
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 286 place count 600 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 600 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 290 place count 600 transition count 706
Applied a total of 290 rules in 301 ms. Remains 600 /743 variables (removed 143) and now considering 706/853 (removed 147) transitions.
// Phase 1: matrix 706 rows 600 cols
[2024-05-29 12:06:26] [INFO ] Computed 4 invariants in 11 ms
[2024-05-29 12:06:26] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 12:06:26] [INFO ] Invariant cache hit.
[2024-05-29 12:06:26] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2024-05-29 12:06:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/600 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 12:06:41] [INFO ] Deduced a trap composed of 290 places in 160 ms of which 3 ms to minimize.
[2024-05-29 12:06:41] [INFO ] Deduced a trap composed of 290 places in 124 ms of which 3 ms to minimize.
[2024-05-29 12:06:43] [INFO ] Deduced a trap composed of 302 places in 126 ms of which 3 ms to minimize.
[2024-05-29 12:06:44] [INFO ] Deduced a trap composed of 298 places in 123 ms of which 4 ms to minimize.
[2024-05-29 12:06:45] [INFO ] Deduced a trap composed of 302 places in 121 ms of which 3 ms to minimize.
[2024-05-29 12:06:46] [INFO ] Deduced a trap composed of 295 places in 128 ms of which 3 ms to minimize.
[2024-05-29 12:06:46] [INFO ] Deduced a trap composed of 291 places in 159 ms of which 4 ms to minimize.
[2024-05-29 12:06:47] [INFO ] Deduced a trap composed of 292 places in 151 ms of which 4 ms to minimize.
[2024-05-29 12:06:47] [INFO ] Deduced a trap composed of 301 places in 153 ms of which 3 ms to minimize.
[2024-05-29 12:06:47] [INFO ] Deduced a trap composed of 295 places in 128 ms of which 3 ms to minimize.
[2024-05-29 12:06:47] [INFO ] Deduced a trap composed of 301 places in 129 ms of which 3 ms to minimize.
[2024-05-29 12:06:47] [INFO ] Deduced a trap composed of 298 places in 115 ms of which 3 ms to minimize.
[2024-05-29 12:06:48] [INFO ] Deduced a trap composed of 296 places in 133 ms of which 3 ms to minimize.
[2024-05-29 12:06:48] [INFO ] Deduced a trap composed of 298 places in 134 ms of which 3 ms to minimize.
[2024-05-29 12:06:48] [INFO ] Deduced a trap composed of 291 places in 141 ms of which 3 ms to minimize.
[2024-05-29 12:06:48] [INFO ] Deduced a trap composed of 291 places in 140 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/1306 variables, and 20 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/600 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/600 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/600 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2024-05-29 12:07:10] [INFO ] Deduced a trap composed of 297 places in 141 ms of which 3 ms to minimize.
[2024-05-29 12:07:10] [INFO ] Deduced a trap composed of 296 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 5 (OVERLAPS) 706/1306 variables, 600/622 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1306 variables, 705/1327 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1306/1306 variables, and 1327 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 18/18 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 600/743 places, 706/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60872 ms. Remains : 600/743 places, 706/853 transitions.
[2024-05-29 12:07:27] [INFO ] Flatten gal took : 12 ms
[2024-05-29 12:07:27] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:07:27] [INFO ] Input system was already deterministic with 706 transitions.
[2024-05-29 12:07:27] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:07:27] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:07:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10011467689016376736.gal : 4 ms
[2024-05-29 12:07:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality344819182384879935.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/CTLCardinality10011467689016376736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality344819182384879935.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,6.68562e+07,3.89708,112708,2,12691,5,351611,6,0,3108,506807,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(((p357==0)&&(p179==1)))) * (p291==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(((p357==0)&&(p179==1)))))) * (p291==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t71, t86, t95, t149, t150, t151, t204, t207, t241, t244, t259, t268, t322, t323, t324, t...398
Detected timeout of ITS tools.
[2024-05-29 12:07:57] [INFO ] Flatten gal took : 19 ms
[2024-05-29 12:07:57] [INFO ] Applying decomposition
[2024-05-29 12:07:57] [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/graph14696604550800013148.txt' '-o' '/tmp/graph14696604550800013148.bin' '-w' '/tmp/graph14696604550800013148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14696604550800013148.bin' '-l' '-1' '-v' '-w' '/tmp/graph14696604550800013148.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:07:57] [INFO ] Decomposing Gal with order
[2024-05-29 12:07:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:07:57] [INFO ] Removed a total of 393 redundant transitions.
[2024-05-29 12:07:57] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-29 12:07:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14731771056904817774.gal : 3 ms
[2024-05-29 12:07:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality95545531112948229.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/CTLCardinality14731771056904817774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality95545531112948229.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.68562e+07,0.286484,15012,1053,18,21679,348,921,37230,54,596,0


Converting to forward existential form...Done !
original formula: AF((AX(EX(((i13.u98.p357==0)&&(i5.u58.p179==1)))) * (i8.u76.p291==0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EX(((i13.u98.p357==0)&&(i5.u58.p179==1)))))) * (i8.u76.p291==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t68, t151, t207, t268, t324, t380, t413, t554, t570, t571, t574, t577, t582, t585, t586, t590...501
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
(forward)formula 0,0,13.7814,497340,1,0,747514,348,6643,3.28962e+06,233,1072,1582679
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 722 transition count 832
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 722 transition count 832
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 60 place count 704 transition count 814
Iterating global reduction 0 with 18 rules applied. Total rules applied 78 place count 704 transition count 814
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 692 transition count 802
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 692 transition count 802
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 114 place count 680 transition count 790
Iterating global reduction 0 with 12 rules applied. Total rules applied 126 place count 680 transition count 790
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 670 transition count 780
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 670 transition count 780
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 155 place count 661 transition count 771
Iterating global reduction 0 with 9 rules applied. Total rules applied 164 place count 661 transition count 771
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 173 place count 652 transition count 762
Iterating global reduction 0 with 9 rules applied. Total rules applied 182 place count 652 transition count 762
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 189 place count 645 transition count 755
Iterating global reduction 0 with 7 rules applied. Total rules applied 196 place count 645 transition count 755
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 202 place count 639 transition count 749
Iterating global reduction 0 with 6 rules applied. Total rules applied 208 place count 639 transition count 749
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 214 place count 633 transition count 743
Iterating global reduction 0 with 6 rules applied. Total rules applied 220 place count 633 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 221 place count 633 transition count 742
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 224 place count 630 transition count 739
Iterating global reduction 1 with 3 rules applied. Total rules applied 227 place count 630 transition count 739
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 230 place count 627 transition count 736
Iterating global reduction 1 with 3 rules applied. Total rules applied 233 place count 627 transition count 736
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 236 place count 624 transition count 733
Iterating global reduction 1 with 3 rules applied. Total rules applied 239 place count 624 transition count 733
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 242 place count 621 transition count 730
Iterating global reduction 1 with 3 rules applied. Total rules applied 245 place count 621 transition count 730
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 248 place count 618 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 251 place count 618 transition count 727
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 254 place count 615 transition count 724
Iterating global reduction 1 with 3 rules applied. Total rules applied 257 place count 615 transition count 724
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 260 place count 612 transition count 721
Iterating global reduction 1 with 3 rules applied. Total rules applied 263 place count 612 transition count 721
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 266 place count 609 transition count 718
Iterating global reduction 1 with 3 rules applied. Total rules applied 269 place count 609 transition count 718
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 272 place count 606 transition count 715
Iterating global reduction 1 with 3 rules applied. Total rules applied 275 place count 606 transition count 715
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 278 place count 603 transition count 712
Iterating global reduction 1 with 3 rules applied. Total rules applied 281 place count 603 transition count 712
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 284 place count 600 transition count 709
Iterating global reduction 1 with 3 rules applied. Total rules applied 287 place count 600 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 288 place count 600 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 290 place count 598 transition count 706
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 598 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 294 place count 598 transition count 704
Applied a total of 294 rules in 287 ms. Remains 598 /743 variables (removed 145) and now considering 704/853 (removed 149) transitions.
// Phase 1: matrix 704 rows 598 cols
[2024-05-29 12:08:11] [INFO ] Computed 4 invariants in 9 ms
[2024-05-29 12:08:11] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 12:08:11] [INFO ] Invariant cache hit.
[2024-05-29 12:08:11] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2024-05-29 12:08:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-05-29 12:08:26] [INFO ] Deduced a trap composed of 292 places in 153 ms of which 4 ms to minimize.
[2024-05-29 12:08:28] [INFO ] Deduced a trap composed of 298 places in 126 ms of which 3 ms to minimize.
[2024-05-29 12:08:28] [INFO ] Deduced a trap composed of 298 places in 124 ms of which 3 ms to minimize.
[2024-05-29 12:08:30] [INFO ] Deduced a trap composed of 291 places in 130 ms of which 3 ms to minimize.
[2024-05-29 12:08:30] [INFO ] Deduced a trap composed of 293 places in 129 ms of which 3 ms to minimize.
[2024-05-29 12:08:31] [INFO ] Deduced a trap composed of 292 places in 160 ms of which 3 ms to minimize.
[2024-05-29 12:08:31] [INFO ] Deduced a trap composed of 292 places in 155 ms of which 3 ms to minimize.
[2024-05-29 12:08:31] [INFO ] Deduced a trap composed of 299 places in 125 ms of which 3 ms to minimize.
[2024-05-29 12:08:31] [INFO ] Deduced a trap composed of 298 places in 140 ms of which 3 ms to minimize.
[2024-05-29 12:08:32] [INFO ] Deduced a trap composed of 300 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-05-29 12:08:33] [INFO ] Deduced a trap composed of 290 places in 119 ms of which 3 ms to minimize.
[2024-05-29 12:08:34] [INFO ] Deduced a trap composed of 297 places in 151 ms of which 3 ms to minimize.
[2024-05-29 12:08:38] [INFO ] Deduced a trap composed of 292 places in 119 ms of which 3 ms to minimize.
[2024-05-29 12:08:38] [INFO ] Deduced a trap composed of 291 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1302 variables, and 18 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 704/1302 variables, 598/616 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1302 variables, 703/1319 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-05-29 12:09:00] [INFO ] Deduced a trap composed of 291 places in 113 ms of which 2 ms to minimize.
[2024-05-29 12:09:05] [INFO ] Deduced a trap composed of 291 places in 137 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1302/1302 variables, and 1321 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 598/598 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 16/16 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 598/743 places, 704/853 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60851 ms. Remains : 598/743 places, 704/853 transitions.
[2024-05-29 12:09:12] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:09:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:09:12] [INFO ] Input system was already deterministic with 704 transitions.
[2024-05-29 12:09:12] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:09:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 12:09:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality1500435935181808333.gal : 2 ms
[2024-05-29 12:09:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11942839891360337033.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/CTLCardinality1500435935181808333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11942839891360337033.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,6.62364e+07,3.62013,107412,2,12627,5,339490,6,0,3098,465442,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 12:09:42] [INFO ] Flatten gal took : 16 ms
[2024-05-29 12:09:42] [INFO ] Applying decomposition
[2024-05-29 12:09:42] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1172786299018051772.txt' '-o' '/tmp/graph1172786299018051772.bin' '-w' '/tmp/graph1172786299018051772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1172786299018051772.bin' '-l' '-1' '-v' '-w' '/tmp/graph1172786299018051772.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:09:42] [INFO ] Decomposing Gal with order
[2024-05-29 12:09:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:09:42] [INFO ] Removed a total of 386 redundant transitions.
[2024-05-29 12:09:42] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:09:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-29 12:09:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality11175607966701735664.gal : 4 ms
[2024-05-29 12:09:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8241071345768660902.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/CTLCardinality11175607966701735664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8241071345768660902.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,6.62364e+07,0.334321,17580,1124,20,25584,446,899,52086,69,917,0


Converting to forward existential form...Done !
original formula: (EF(AX(E((i0.u8.p32==1) U (i13.u100.p371==1)))) * AF((i14.u104.p389==0)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX(!(E((i0.u8.p32==1) U (i13.u100.p371==1))))))))] = FALSE * [FwdG(Init,!((i14.u104.p389=...170
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Reverse transition relation is NOT exact ! Due to transitions t95, t151, t207, t241, t322, t323, t324, t379, t382, t498, t554, t570, t571, t574, t577, t582...501
(forward)formula 0,1,1.412,60348,1,0,104812,446,7625,207673,339,917,467173
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 743/743 places, 853/853 transitions.
Graph (trivial) has 726 edges and 743 vertex of which 56 / 743 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 516 rules applied. Total rules applied 517 place count 695 transition count 283
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 525 rules applied. Total rules applied 1042 place count 179 transition count 274
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1048 place count 175 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1050 place count 173 transition count 272
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 1050 place count 173 transition count 236
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1122 place count 137 transition count 236
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1136 place count 123 transition count 222
Iterating global reduction 4 with 14 rules applied. Total rules applied 1150 place count 123 transition count 222
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1159 place count 114 transition count 197
Iterating global reduction 4 with 9 rules applied. Total rules applied 1168 place count 114 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1171 place count 114 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1174 place count 111 transition count 191
Iterating global reduction 5 with 3 rules applied. Total rules applied 1177 place count 111 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1179 place count 109 transition count 189
Iterating global reduction 5 with 2 rules applied. Total rules applied 1181 place count 109 transition count 189
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1213 place count 93 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1215 place count 93 transition count 171
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1231 place count 77 transition count 136
Iterating global reduction 6 with 16 rules applied. Total rules applied 1247 place count 77 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1253 place count 77 transition count 130
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1262 place count 68 transition count 118
Iterating global reduction 7 with 9 rules applied. Total rules applied 1271 place count 68 transition count 118
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1279 place count 60 transition count 107
Iterating global reduction 7 with 8 rules applied. Total rules applied 1287 place count 60 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1292 place count 60 transition count 102
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 8 with 2 rules applied. Total rules applied 1294 place count 59 transition count 101
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1295 place count 58 transition count 98
Iterating global reduction 8 with 1 rules applied. Total rules applied 1296 place count 58 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1297 place count 58 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1300 place count 58 transition count 94
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 1306 place count 55 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1307 place count 54 transition count 90
Applied a total of 1307 rules in 30 ms. Remains 54 /743 variables (removed 689) and now considering 90/853 (removed 763) transitions.
[2024-05-29 12:09:43] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
// Phase 1: matrix 86 rows 54 cols
[2024-05-29 12:09:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 12:09:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 12:09:43] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:09:43] [INFO ] Invariant cache hit.
[2024-05-29 12:09:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 12:09:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-29 12:09:43] [INFO ] Redundant transitions in 1 ms returned []
Running 83 sub problems to find dead transitions.
[2024-05-29 12:09:43] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
[2024-05-29 12:09:43] [INFO ] Invariant cache hit.
[2024-05-29 12:09:43] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 12:09:44] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 85/139 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-29 12:09:45] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/140 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 72 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 85/139 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/140 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/140 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 155 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 9/9 constraints]
After SMT, in 3759ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3760ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/743 places, 90/853 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3906 ms. Remains : 54/743 places, 90/853 transitions.
[2024-05-29 12:09:47] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:09:47] [INFO ] Flatten gal took : 1 ms
[2024-05-29 12:09:47] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-29 12:09:47] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:09:47] [INFO ] Flatten gal took : 2 ms
[2024-05-29 12:09:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality8731624438428346183.gal : 1 ms
[2024-05-29 12:09:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13882814153759089374.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/CTLCardinality8731624438428346183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13882814153759089374.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,7752,0.034237,4792,2,864,5,5493,6,0,300,5391,0


Converting to forward existential form...Done !
original formula: EG(E(((p834==0)||(p348==1)) U ((p410==0)||(p802==1))))
=> equivalent forward existential formula: [FwdG(Init,E(((p834==0)||(p348==1)) U ((p410==0)||(p802==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t9, t10, t11, t19, t20, t21, t26, t27, t39, t40, t54, t56, t57, t70, t71, t72, t73, t...282
(forward)formula 0,1,0.340128,18460,1,0,247,65653,201,123,2074,83997,249
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 12:09:48] [INFO ] Flatten gal took : 17 ms
[2024-05-29 12:09:48] [INFO ] Flatten gal took : 13 ms
[2024-05-29 12:09:48] [INFO ] Applying decomposition
[2024-05-29 12:09:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14817883457764929391.txt' '-o' '/tmp/graph14817883457764929391.bin' '-w' '/tmp/graph14817883457764929391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14817883457764929391.bin' '-l' '-1' '-v' '-w' '/tmp/graph14817883457764929391.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:09:48] [INFO ] Decomposing Gal with order
[2024-05-29 12:09:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:09:48] [INFO ] Removed a total of 405 redundant transitions.
[2024-05-29 12:09:48] [INFO ] Flatten gal took : 25 ms
[2024-05-29 12:09:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-29 12:09:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality4308331093917714148.gal : 5 ms
[2024-05-29 12:09:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10436538330774815074.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/CTLCardinality4308331093917714148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10436538330774815074.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 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,1.05997e+08,6.38343,201348,1729,19,428979,622,1104,737494,52,1458,0


Converting to forward existential form...Done !
original formula: (AX(E(!(E(E((i1.i1.i1.u24.p65==1) U (i2.u29.p81==1)) U (((i34.u306.p911==0)||(i16.u160.p437==1))&&(i4.u49.p128==0)))) U AX(!((((i6.i0.i0....400
=> equivalent forward existential formula: ([(FwdU((Init * !(!(EX(!(E(!(E(E((i1.i1.i1.u24.p65==1) U (i2.u29.p81==1)) U (((i34.u306.p911==0)||(i16.u160.p437...733
Reverse transition relation is NOT exact ! Due to transitions t28, t73, t180, t234, t236, t290, t387, t388, t443, t445, t446, t486, t511, t526, t609, t610,...550
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 0,0,96.1515,2207096,1,0,2.3469e+06,622,6234,1.98713e+07,170,1574,1520272
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((AF(EG(((i34.u278.p798==0)&&(i2.u28.p80==1)))) + EG(AF(EX(((i2.u30.p83==0)||(i15.u148.p407==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EG(!(EG(!(EX(((i2.u30.p83==0)||(i15.u148.p407==1))))))))),!(EG(((i34.u278.p798==0)&&(...182
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 1,0,164.316,2432816,1,0,2.49954e+06,626,2607,2.30808e+07,104,2025,214564
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((A(((EX(((i17.u237.p681==0)||(i18.u189.p536==1))) * (i2.u62.p175==1)) * EX((i17.u79.p219==1))) U (EG((i7.u67.p188==1)) * EX(((i16.u15...347
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!((E(!((EG((i7.u67.p188==1)) * EX(((i16.u153.p422==0)||(i34.u286.p833==1))))) U (!(((EX(...1082
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
(forward)formula 2,1,212.778,2432816,1,0,2.49954e+06,626,4196,2.30808e+07,145,2025,2925198
FORMULA StigmergyCommit-PT-02b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1716984801583

--------------------
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="StigmergyCommit-PT-02b"
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 StigmergyCommit-PT-02b, 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 r400-tall-171690531600097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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