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.r092-tall-171624189700657.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 DES-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700657
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 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 DES-PT-05b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716340303127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 01:11:44] [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-22 01:11:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:11:44] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-22 01:11:44] [INFO ] Transformed 300 places.
[2024-05-22 01:11:44] [INFO ] Transformed 251 transitions.
[2024-05-22 01:11:44] [INFO ] Found NUPN structural information;
[2024-05-22 01:11:44] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA DES-PT-05b-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 251
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 290 transition count 243
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 290 transition count 243
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 288 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 288 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 288 transition count 239
Applied a total of 24 rules in 69 ms. Remains 288 /300 variables (removed 12) and now considering 239/251 (removed 12) transitions.
// Phase 1: matrix 239 rows 288 cols
[2024-05-22 01:11:44] [INFO ] Computed 63 invariants in 24 ms
[2024-05-22 01:11:44] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-22 01:11:44] [INFO ] Invariant cache hit.
[2024-05-22 01:11:45] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 669 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 239/251 transitions.
Applied a total of 0 rules in 5 ms. Remains 287 /287 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 287/300 places, 239/251 transitions.
Support contains 97 out of 287 places after structural reductions.
[2024-05-22 01:11:45] [INFO ] Flatten gal took : 41 ms
[2024-05-22 01:11:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-05b-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 01:11:45] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:11:45] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 82 out of 287 places (down from 97) after GAL structural reductions.
FORMULA DES-PT-05b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (327 resets) in 1380 ms. (28 steps per ms) remains 4/50 properties
BEST_FIRST walk for 40004 steps (46 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (48 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
// Phase 1: matrix 239 rows 287 cols
[2024-05-22 01:11:46] [INFO ] Computed 62 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/182 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 92/274 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/279 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 232/511 variables, 279/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 7/518 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/522 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/524 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/526 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/526 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 349 constraints, problems are : Problem set: 0 solved, 4 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/182 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:11:46] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 92/274 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/279 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 232/511 variables, 279/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:11:47] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:11:48] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:11:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/518 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:11:48] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:11:48] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:11:48] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 01:11:48] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 19 (OVERLAPS) 4/522 variables, 2/368 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/524 variables, 1/369 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/524 variables, 0/369 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/526 variables, 1/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/526 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/526 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 370 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 2672ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 930 ms.
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 282 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 282 transition count 213
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 262 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 262 transition count 204
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 253 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 76 place count 238 transition count 189
Iterating global reduction 2 with 15 rules applied. Total rules applied 91 place count 238 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 238 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 238 transition count 185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 237 transition count 185
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 105 place count 228 transition count 176
Iterating global reduction 3 with 9 rules applied. Total rules applied 114 place count 228 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 121 place count 228 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 121 place count 228 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 225 transition count 166
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 281 place count 148 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 147 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 147 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 146 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 146 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 287 place count 146 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 288 place count 145 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 144 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 143 transition count 85
Applied a total of 290 rules in 137 ms. Remains 143 /287 variables (removed 144) and now considering 85/239 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 143/287 places, 85/239 transitions.
RANDOM walk for 40000 steps (1652 resets) in 744 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (315 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (335 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (325 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1178166 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :0 out of 3
Probabilistic random walk after 1178166 steps, saw 161296 distinct states, run finished after 3004 ms. (steps per millisecond=392 ) properties seen :0
// Phase 1: matrix 85 rows 143 cols
[2024-05-22 01:11:53] [INFO ] Computed 62 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/99 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/226 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/228 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/64 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/99 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 25/124 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/226 variables, 10/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 01:11:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/228 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 01:11:53] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/228 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 342 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 85/85 transitions.
Graph (complete) has 432 edges and 143 vertex of which 140 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 139 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 138 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 138 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 138 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 137 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 137 transition count 83
Applied a total of 9 rules in 13 ms. Remains 137 /143 variables (removed 6) and now considering 83/85 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 137/143 places, 83/85 transitions.
RANDOM walk for 40000 steps (1889 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (354 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1933272 steps, run timeout after 3001 ms. (steps per millisecond=644 ) properties seen :0 out of 1
Probabilistic random walk after 1933272 steps, saw 281341 distinct states, run finished after 3001 ms. (steps per millisecond=644 ) properties seen :0
// Phase 1: matrix 83 rows 137 cols
[2024-05-22 01:11:57] [INFO ] Computed 60 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/88 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/113 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/120 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/194 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/207 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/209 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/216 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/220 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/220 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/220 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/88 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/113 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/120 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/194 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 01:11:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/207 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/209 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/209 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/216 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/220 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/220 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/220 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 137/137 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 83/83 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-22 01:11:57] [INFO ] Invariant cache hit.
[2024-05-22 01:11:57] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 01:11:57] [INFO ] Invariant cache hit.
[2024-05-22 01:11:57] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-22 01:11:57] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 01:11:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/219 variables, 136/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 01:11:58] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 01:11:58] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:11:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:11:58] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 01:11:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:11:59] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 01:11:59] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 204 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3964 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 2/136 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 83/219 variables, 136/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 80/283 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 01:12:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 285 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8722 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
After SMT, in 12721ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12948 ms. Remains : 137/137 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 83
Applied a total of 1 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 137 cols
[2024-05-22 01:12:10] [INFO ] Computed 60 invariants in 1 ms
[2024-05-22 01:12:10] [INFO ] [Real]Absence check using 36 positive place invariants in 181 ms returned sat
[2024-05-22 01:12:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 90 ms returned sat
[2024-05-22 01:12:10] [INFO ] After 395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:12:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:12:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-22 01:12:11] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 01:12:11] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:12:11] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 550 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-22 01:12:11] [INFO ] Flatten gal took : 26 ms
[2024-05-22 01:12:11] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:12:11] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 83 stabilizing places and 76 stable transitions
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 267 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 267 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 267 transition count 217
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 53 place count 256 transition count 206
Iterating global reduction 2 with 11 rules applied. Total rules applied 64 place count 256 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 71 place count 256 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 255 transition count 198
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 255 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 255 transition count 197
Applied a total of 74 rules in 32 ms. Remains 255 /287 variables (removed 32) and now considering 197/239 (removed 42) transitions.
// Phase 1: matrix 197 rows 255 cols
[2024-05-22 01:12:11] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 01:12:11] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 01:12:11] [INFO ] Invariant cache hit.
[2024-05-22 01:12:11] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 01:12:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/452 variables, 255/316 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:14] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-05-22 01:12:14] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-22 01:12:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:12:15] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:12:16] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:12:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:12:16] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:12:16] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 20/336 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:17] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 01:12:17] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:12:18] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:18] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-22 01:12:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:12:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:12:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:12:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 01:12:19] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 5 ms to minimize.
[2024-05-22 01:12:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:12:19] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:20] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:12:20] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:12:21] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 1 ms to minimize.
[2024-05-22 01:12:22] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 13/360 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 360 constraints, problems are : Problem set: 0 solved, 196 unsolved in 14815 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:27] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 01:12:27] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:12:27] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:12:27] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:12:28] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:12:28] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:29] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:12:29] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 01:12:29] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:12:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:12:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-22 01:12:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-22 01:12:31] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-22 01:12:31] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 197/452 variables, 255/380 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 196/576 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 01:12:35] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:12:36] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:12:39] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-22 01:12:39] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:12:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 5/581 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 581 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 69/69 constraints]
After SMT, in 44859ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 44866ms
Starting structural reductions in LTL mode, iteration 1 : 255/287 places, 197/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45335 ms. Remains : 255/287 places, 197/239 transitions.
[2024-05-22 01:12:56] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:12:56] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:12:56] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-22 01:12:56] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:12:56] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:12:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14044635185821441956.gal : 5 ms
[2024-05-22 01:12:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality785776803486732551.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/CTLCardinality14044635185821441956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality785776803486732551.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.
Detected timeout of ITS tools.
[2024-05-22 01:13:26] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:13:26] [INFO ] Applying decomposition
[2024-05-22 01:13:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8609577530988464815.txt' '-o' '/tmp/graph8609577530988464815.bin' '-w' '/tmp/graph8609577530988464815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8609577530988464815.bin' '-l' '-1' '-v' '-w' '/tmp/graph8609577530988464815.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:13:26] [INFO ] Decomposing Gal with order
[2024-05-22 01:13:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:13:26] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:13:27] [INFO ] Flatten gal took : 192 ms
[2024-05-22 01:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-22 01:13:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality7251878401036982625.gal : 6 ms
[2024-05-22 01:13:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality15510613822616131399.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/CTLCardinality7251878401036982625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15510613822616131399.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,5.18303e+18,3.67014,116816,12522,317,275232,1953,709,274696,142,4559,0


Converting to forward existential form...Done !
original formula: ((EX(TRUE) * EX(AG(AF((i2.u21.p102==1))))) + (EX(EX((i8.i1.u44.p182==1))) * EF(((A(EX((i7.i3.u64.p247==1)) U AF(((i6.u31.p139==0)||(i1.i0...339
=> equivalent forward existential formula: ([(EY((Init * EX(TRUE))) * !(E(TRUE U !(!(EG(!((i2.u21.p102==1))))))))] != FALSE + (([FwdG(((FwdU((Init * EX(EX(...1649
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t99, t119, t145, t158, t159, t191, i0.u34.t76, i1.i0.u13.t112, i1.i0.u15.t...805
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 268 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 268 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 268 transition count 218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 50 place count 258 transition count 208
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 258 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 258 transition count 201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 257 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 257 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 257 transition count 199
Applied a total of 70 rules in 32 ms. Remains 257 /287 variables (removed 30) and now considering 199/239 (removed 40) transitions.
// Phase 1: matrix 199 rows 257 cols
[2024-05-22 01:13:57] [INFO ] Computed 61 invariants in 6 ms
[2024-05-22 01:13:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 01:13:57] [INFO ] Invariant cache hit.
[2024-05-22 01:13:57] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 01:13:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/257 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/456 variables, 257/318 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-22 01:14:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-22 01:14:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:14:02] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-22 01:14:02] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-22 01:14:02] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 13/331 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:04] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:14:04] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:14:04] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:14:04] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:14:04] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 9/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:14:06] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2024-05-22 01:14:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:14:06] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:14:06] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:07] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:10] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:14:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:14:10] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:14:11] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:12] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:13] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-22 01:14:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:14:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:14:13] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 4/355 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 0/456 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 355 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20945 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/257 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:19] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:14:19] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:14:19] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-22 01:14:19] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 2 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 01:14:20] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:14:21] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:14:21] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:14:22] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:23] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:14:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:14:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 2 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:14:27] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:29] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:14:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 01:14:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 199/456 variables, 257/392 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 198/590 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:14:34] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 01:14:34] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:14:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/456 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 593 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 77/77 constraints]
After SMT, in 50980ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 50986ms
Starting structural reductions in LTL mode, iteration 1 : 257/287 places, 199/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51373 ms. Remains : 257/287 places, 199/239 transitions.
[2024-05-22 01:14:48] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:14:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:14:48] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-22 01:14:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:14:48] [INFO ] Flatten gal took : 24 ms
[2024-05-22 01:14:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality9244559326463184127.gal : 2 ms
[2024-05-22 01:14:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality17173746987549899335.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/CTLCardinality9244559326463184127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17173746987549899335.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.
Detected timeout of ITS tools.
[2024-05-22 01:15:18] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:15:18] [INFO ] Applying decomposition
[2024-05-22 01:15:18] [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/graph16432352282110830609.txt' '-o' '/tmp/graph16432352282110830609.bin' '-w' '/tmp/graph16432352282110830609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16432352282110830609.bin' '-l' '-1' '-v' '-w' '/tmp/graph16432352282110830609.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:15:18] [INFO ] Decomposing Gal with order
[2024-05-22 01:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:15:18] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:15:18] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-22 01:15:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8059719171043551089.gal : 21 ms
[2024-05-22 01:15:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality11539041451546612521.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/CTLCardinality8059719171043551089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11539041451546612521.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.35029e+18,1.90892,62272,4331,256,138973,1602,733,178482,141,3981,0


Converting to forward existential form...Done !
original formula: AF((E((i4.i0.u17.p92==1) U AG((E((i10.i1.u71.p283==1) U (i10.i0.u13.p78==0)) * (i8.i0.u49.p205!=0)))) * AG(EX((i11.u75.p294==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((E((i4.i0.u17.p92==1) U !(E(TRUE U !((E((i10.i1.u71.p283==1) U (i10.i0.u13.p78==0)) * (i8.i0.u49.p2...218
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t88, t146, t159, t160, t193, u32.t77, i0.i0.u30.t80, i1.t118, i2.i0.u11.t115, i...820
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 215
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 260 transition count 206
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 251 transition count 206
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 236 transition count 191
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 236 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 236 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 236 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 235 transition count 187
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 100 place count 225 transition count 177
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 225 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 120 place count 225 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 223 transition count 166
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 123 place count 223 transition count 163
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 220 transition count 163
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 269 place count 150 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 148 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 272 place count 147 transition count 91
Applied a total of 272 rules in 45 ms. Remains 147 /287 variables (removed 140) and now considering 91/239 (removed 148) transitions.
// Phase 1: matrix 91 rows 147 cols
[2024-05-22 01:15:49] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 01:15:49] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 01:15:49] [INFO ] Invariant cache hit.
[2024-05-22 01:15:49] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-22 01:15:49] [INFO ] Redundant transitions in 8 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-22 01:15:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 88 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/146 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 91/237 variables, 146/204 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:51] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/238 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 207 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2761 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 2/146 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 91/237 variables, 146/206 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 88/294 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-22 01:15:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/238 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 296 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9176 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints]
After SMT, in 11952ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 11955ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/287 places, 91/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12437 ms. Remains : 147/287 places, 91/239 transitions.
[2024-05-22 01:16:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:16:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:16:01] [INFO ] Input system was already deterministic with 91 transitions.
RANDOM walk for 6264 steps (194 resets) in 18 ms. (329 steps per ms) remains 0/1 properties
FORMULA DES-PT-05b-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 01:16:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:16:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:16:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6312842054087984092.gal : 2 ms
[2024-05-22 01:16:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4246979260423466444.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/ReachabilityCardinality6312842054087984092.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4246979260423466444.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 215
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 260 transition count 206
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 251 transition count 206
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 69 place count 237 transition count 192
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 237 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 237 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 237 transition count 188
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 236 transition count 188
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 97 place count 227 transition count 179
Iterating global reduction 3 with 9 rules applied. Total rules applied 106 place count 227 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 115 place count 227 transition count 170
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 225 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 118 place count 225 transition count 166
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 124 place count 222 transition count 166
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 266 place count 151 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 149 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 269 place count 148 transition count 93
Applied a total of 269 rules in 39 ms. Remains 148 /287 variables (removed 139) and now considering 93/239 (removed 146) transitions.
// Phase 1: matrix 93 rows 148 cols
[2024-05-22 01:16:01] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 01:16:01] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 01:16:01] [INFO ] Invariant cache hit.
[2024-05-22 01:16:01] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 01:16:01] [INFO ] Redundant transitions in 1 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-22 01:16:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 90 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/147 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 93/240 variables, 147/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-22 01:16:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-22 01:16:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:16:03] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-22 01:16:03] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 1/241 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 210 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2915 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 2/147 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 93/240 variables, 147/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 90/299 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-22 01:16:05] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:16:05] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 1/241 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/241 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 302 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10927 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 6/6 constraints]
After SMT, in 13857ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 13857ms
Starting structural reductions in SI_CTL mode, iteration 1 : 148/287 places, 93/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14157 ms. Remains : 148/287 places, 93/239 transitions.
[2024-05-22 01:16:15] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:16:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:16:15] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-22 01:16:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:16:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:16:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1568490940975353788.gal : 2 ms
[2024-05-22 01:16:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality7402220207747941345.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/CTLCardinality1568490940975353788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7402220207747941345.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.
Detected timeout of ITS tools.
[2024-05-22 01:16:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:16:45] [INFO ] Applying decomposition
[2024-05-22 01:16:45] [INFO ] Flatten gal took : 4 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/graph14989885249426222230.txt' '-o' '/tmp/graph14989885249426222230.bin' '-w' '/tmp/graph14989885249426222230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14989885249426222230.bin' '-l' '-1' '-v' '-w' '/tmp/graph14989885249426222230.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:16:45] [INFO ] Decomposing Gal with order
[2024-05-22 01:16:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:16:45] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-22 01:16:45] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 01:16:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality266848202167983998.gal : 2 ms
[2024-05-22 01:16:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11912897185691115427.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/CTLCardinality266848202167983998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11912897185691115427.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,4.2653e+12,0.423569,19740,2013,224,37553,581,299,54073,111,2079,0


Converting to forward existential form...Done !
original formula: AF((i3.u1.p47==1))
=> equivalent forward existential formula: [FwdG(Init,!((i3.u1.p47==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,6.9325,261036,1,0,678760,2301,1153,701414,558,10197,713707
FORMULA DES-PT-05b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 266 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 266 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 266 transition count 216
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 55 place count 255 transition count 205
Iterating global reduction 2 with 11 rules applied. Total rules applied 66 place count 255 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 73 place count 255 transition count 198
Applied a total of 73 rules in 8 ms. Remains 255 /287 variables (removed 32) and now considering 198/239 (removed 41) transitions.
// Phase 1: matrix 198 rows 255 cols
[2024-05-22 01:16:52] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 01:16:53] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 01:16:53] [INFO ] Invariant cache hit.
[2024-05-22 01:16:53] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-22 01:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/453 variables, 255/316 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:16:56] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:16:56] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:16:56] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 01:16:56] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:16:56] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:16:56] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 01:16:57] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:16:57] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:17:00] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-22 01:17:01] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-22 01:17:02] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:17:02] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/453 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:02] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:17:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 01:17:03] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:17:03] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:06] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-22 01:17:06] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:08] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-22 01:17:08] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/453 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:11] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:12] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:16] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:17:16] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/453 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 18 (OVERLAPS) 0/453 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 356 constraints, problems are : Problem set: 0 solved, 197 unsolved in 28326 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/255 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:22] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:17:22] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:17:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 01:17:22] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-22 01:17:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 198/453 variables, 255/367 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 197/564 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:27] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-22 01:17:27] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-22 01:17:28] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-22 01:17:28] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:17:28] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-22 01:17:49] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 01:17:49] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:17:49] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:17:50] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 573 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 60/60 constraints]
After SMT, in 58384ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 58386ms
Starting structural reductions in LTL mode, iteration 1 : 255/287 places, 198/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58812 ms. Remains : 255/287 places, 198/239 transitions.
[2024-05-22 01:17:51] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:17:51] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:17:51] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-22 01:17:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:17:51] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:17:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3817925835862569490.gal : 2 ms
[2024-05-22 01:17:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3312209828307775177.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/CTLCardinality3817925835862569490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3312209828307775177.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.
Detected timeout of ITS tools.
[2024-05-22 01:18:21] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:18:21] [INFO ] Applying decomposition
[2024-05-22 01:18:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3989493730711950663.txt' '-o' '/tmp/graph3989493730711950663.bin' '-w' '/tmp/graph3989493730711950663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3989493730711950663.bin' '-l' '-1' '-v' '-w' '/tmp/graph3989493730711950663.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:18:21] [INFO ] Decomposing Gal with order
[2024-05-22 01:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:18:21] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 01:18:21] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 01:18:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14842145969047749532.gal : 2 ms
[2024-05-22 01:18:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality12626591804447747967.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/CTLCardinality14842145969047749532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12626591804447747967.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,4.46395e+18,5.91694,192932,15897,252,613287,1667,721,273288,120,4740,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 278 transition count 216
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 261 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 37 place count 260 transition count 207
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 252 transition count 207
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 66 place count 239 transition count 194
Iterating global reduction 3 with 13 rules applied. Total rules applied 79 place count 239 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 239 transition count 192
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 91 place count 229 transition count 182
Iterating global reduction 4 with 10 rules applied. Total rules applied 101 place count 229 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 111 place count 229 transition count 172
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 114 place count 227 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 114 place count 227 transition count 169
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 118 place count 225 transition count 169
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 252 place count 158 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 156 transition count 100
Applied a total of 254 rules in 31 ms. Remains 156 /287 variables (removed 131) and now considering 100/239 (removed 139) transitions.
// Phase 1: matrix 100 rows 156 cols
[2024-05-22 01:18:51] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 01:18:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 01:18:52] [INFO ] Invariant cache hit.
[2024-05-22 01:18:52] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-22 01:18:52] [INFO ] Redundant transitions in 3 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 01:18:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 2/156 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 100/256 variables, 156/215 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 01:18:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:18:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 217 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2937 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/154 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 2/156 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 100/256 variables, 156/217 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 97/314 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 01:18:58] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/256 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/256 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 315 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11808 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 3/3 constraints]
After SMT, in 14768ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14769ms
Starting structural reductions in SI_CTL mode, iteration 1 : 156/287 places, 100/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15053 ms. Remains : 156/287 places, 100/239 transitions.
[2024-05-22 01:19:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:19:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:19:06] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-22 01:19:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:19:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:19:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality6924859275942500995.gal : 1 ms
[2024-05-22 01:19:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13849179459736787881.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/CTLCardinality6924859275942500995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13849179459736787881.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.
Detected timeout of ITS tools.
[2024-05-22 01:19:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:19:37] [INFO ] Applying decomposition
[2024-05-22 01:19:37] [INFO ] Flatten gal took : 4 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/graph14257622814980807160.txt' '-o' '/tmp/graph14257622814980807160.bin' '-w' '/tmp/graph14257622814980807160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14257622814980807160.bin' '-l' '-1' '-v' '-w' '/tmp/graph14257622814980807160.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:19:37] [INFO ] Decomposing Gal with order
[2024-05-22 01:19:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:19:37] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 01:19:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:19:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 01:19:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10431998791597149667.gal : 1 ms
[2024-05-22 01:19:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality1206149675488848376.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/CTLCardinality10431998791597149667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1206149675488848376.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12917e+13,0.403337,22768,4862,208,51602,840,393,47771,112,2631,0


Converting to forward existential form...Done !
original formula: AF(!(E(A(!(((u8.p85==1)||(i5.u0.p4==0))) U (EF((i3.u15.p134==1)) * (i12.i1.u21.p172==1))) U AG(EF(((i12.i1.u19.p171==0)||(i10.i0.u22.p178...165
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!((E(!((E(TRUE U (i3.u15.p134==1)) * (i12.i1.u21.p172==1))) U (!(!(((u8.p85==1)||(i5.u0.p4==0))...365
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t66, t70, t87, t90, t93, u52.t3, u52.t95, u8.t47, i1.t12, i1.u4.t19, i1.u4.t23, i3.t6...330
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 266 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 266 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 266 transition count 216
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 56 place count 254 transition count 204
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 254 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 76 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 253 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 253 transition count 194
Applied a total of 79 rules in 19 ms. Remains 253 /287 variables (removed 34) and now considering 194/239 (removed 45) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-22 01:20:07] [INFO ] Computed 61 invariants in 1 ms
[2024-05-22 01:20:07] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 01:20:07] [INFO ] Invariant cache hit.
[2024-05-22 01:20:07] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-05-22 01:20:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/447 variables, 253/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:10] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-05-22 01:20:10] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 01:20:10] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:20:10] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:20:11] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:13] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2024-05-22 01:20:13] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-22 01:20:13] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:14] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 5 ms to minimize.
[2024-05-22 01:20:15] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:20:15] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:20:15] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:20:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:20:17] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:20:17] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 19/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/447 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 343 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13914 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:22] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 01:20:22] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:20:22] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-22 01:20:22] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-22 01:20:22] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:20:22] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-22 01:20:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:20:24] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:24] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 01:20:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:26] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-22 01:20:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (OVERLAPS) 194/447 variables, 253/368 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 193/561 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:31] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-22 01:20:31] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:20:31] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 01:20:34] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 01:20:36] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:20:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 6/567 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-05-22 01:20:43] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:20:44] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:20:44] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:20:47] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 571 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 64/64 constraints]
After SMT, in 43963ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 43966ms
Starting structural reductions in LTL mode, iteration 1 : 253/287 places, 194/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44328 ms. Remains : 253/287 places, 194/239 transitions.
[2024-05-22 01:20:51] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:20:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:20:51] [INFO ] Input system was already deterministic with 194 transitions.
[2024-05-22 01:20:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:20:51] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:20:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8365676934793182899.gal : 1 ms
[2024-05-22 01:20:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16731559217967106063.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/CTLCardinality8365676934793182899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16731559217967106063.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.
Detected timeout of ITS tools.
[2024-05-22 01:21:21] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:21:21] [INFO ] Applying decomposition
[2024-05-22 01:21:21] [INFO ] Flatten gal took : 5 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/graph18324255625911008584.txt' '-o' '/tmp/graph18324255625911008584.bin' '-w' '/tmp/graph18324255625911008584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18324255625911008584.bin' '-l' '-1' '-v' '-w' '/tmp/graph18324255625911008584.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:21:21] [INFO ] Decomposing Gal with order
[2024-05-22 01:21:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:21:21] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:21:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:21:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 01:21:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality13023076193623017593.gal : 2 ms
[2024-05-22 01:21:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5801786758230130782.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/CTLCardinality13023076193623017593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5801786758230130782.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,3.47069e+18,2.64884,93928,5394,245,242253,1670,729,176824,124,4516,0


Converting to forward existential form...Done !
original formula: (EF(EX((((i1.i1.u6.p35==0)||(i3.i1.u18.p91==1)) * EG(AG((i2.u9.p24==1)))))) * AF((i3.i1.u27.p117==0)))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EX((((i1.i1.u6.p35==0)||(i3.i1.u18.p91==1)) * EG(!(E(TRUE U !((i2.u9.p24==1))))))))))] = FA...205
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 270 transition count 223
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 270 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 260 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 260 transition count 210
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 63 place count 260 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 259 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 259 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 259 transition count 201
Applied a total of 66 rules in 20 ms. Remains 259 /287 variables (removed 28) and now considering 201/239 (removed 38) transitions.
// Phase 1: matrix 201 rows 259 cols
[2024-05-22 01:21:51] [INFO ] Computed 61 invariants in 1 ms
[2024-05-22 01:21:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 01:21:51] [INFO ] Invariant cache hit.
[2024-05-22 01:21:52] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-22 01:21:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/259 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:21:54] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:21:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-22 01:21:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-22 01:21:56] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-22 01:21:56] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:21:56] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-22 01:21:56] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-22 01:21:57] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:21:57] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-22 01:21:57] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-22 01:21:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-22 01:21:57] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:21:58] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:21:58] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:21:59] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:21:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:21:59] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:21:59] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (OVERLAPS) 201/460 variables, 259/345 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:01] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 01:22:02] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:22:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:22:02] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:22:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:22:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:04] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:07] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:22:07] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:22:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:22:08] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/460 variables, 12/364 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 16 (OVERLAPS) 0/460 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 364 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21267 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/259 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:14] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:22:14] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:22:15] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-22 01:22:15] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:16] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:22:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:22:16] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-05-22 01:22:16] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:22:16] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:22:17] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-22 01:22:17] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:22:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 201/460 variables, 259/377 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 200/577 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-22 01:22:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 578 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 58/58 constraints]
After SMT, in 51308ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 51311ms
Starting structural reductions in LTL mode, iteration 1 : 259/287 places, 201/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51665 ms. Remains : 259/287 places, 201/239 transitions.
[2024-05-22 01:22:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:22:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:22:43] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-22 01:22:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:22:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:22:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3508998007662930794.gal : 2 ms
[2024-05-22 01:22:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality15148840284787207178.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/CTLCardinality3508998007662930794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15148840284787207178.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.
Detected timeout of ITS tools.
[2024-05-22 01:23:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:23:13] [INFO ] Applying decomposition
[2024-05-22 01:23:13] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17591836671276706241.txt' '-o' '/tmp/graph17591836671276706241.bin' '-w' '/tmp/graph17591836671276706241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17591836671276706241.bin' '-l' '-1' '-v' '-w' '/tmp/graph17591836671276706241.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:23:13] [INFO ] Decomposing Gal with order
[2024-05-22 01:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:23:13] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 01:23:13] [INFO ] Flatten gal took : 38 ms
[2024-05-22 01:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 01:23:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10142911483629617914.gal : 2 ms
[2024-05-22 01:23:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality12263183932808215346.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/CTLCardinality10142911483629617914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12263183932808215346.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,5.58632e+18,2.35644,76784,4652,220,172152,1264,723,250956,124,4239,0


Converting to forward existential form...Done !
original formula: (EG(A(EG(((((i3.i1.u12.p70==0)||(i4.u16.p84==1))&&(i11.i3.u62.p231==0))||(i6.i1.u31.p143==0))) U (((i12.i0.u56.p218==0)||(i5.i1.u26.p108=...239
=> equivalent forward existential formula: ([(Init * !(EG(!((E(!((((i12.i0.u56.p218==0)||(i5.i1.u26.p108==1))||((i10.u44.p183==0)||(i7.i1.u74.p273==1)))) U...524
Reverse transition relation is NOT exact ! Due to transitions t0, t51, t55, t88, t149, t162, t195, i0.i0.u32.t80, i1.t125, i1.u7.t130, i1.u7.t131, i1.u8.t1...793
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 267 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 267 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 267 transition count 217
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 53 place count 256 transition count 206
Iterating global reduction 2 with 11 rules applied. Total rules applied 64 place count 256 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 71 place count 256 transition count 199
Applied a total of 71 rules in 8 ms. Remains 256 /287 variables (removed 31) and now considering 199/239 (removed 40) transitions.
// Phase 1: matrix 199 rows 256 cols
[2024-05-22 01:23:43] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 01:23:43] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 01:23:43] [INFO ] Invariant cache hit.
[2024-05-22 01:23:43] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-22 01:23:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:46] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:23:46] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:23:46] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:23:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:23:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:47] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 01:23:47] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:23:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:48] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 01:23:50] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:23:50] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:23:51] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:23:51] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:23:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:23:51] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:51] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:23:52] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-22 01:23:52] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:23:52] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 199/455 variables, 256/338 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:23:54] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/455 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:23:57] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:23:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/455 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:58] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:23:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:23:58] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:23:58] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:23:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:23:59] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:24:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:24:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/455 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 18 (OVERLAPS) 0/455 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 351 constraints, problems are : Problem set: 0 solved, 198 unsolved in 23632 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 34/95 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:24:08] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:24:09] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:24:10] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:24:10] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 199/455 variables, 256/355 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 198/553 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:24:14] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-22 01:24:26] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:24:26] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:24:28] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:24:28] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:24:29] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-22 01:24:29] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:24:34] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-22 01:24:35] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 567 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 52/52 constraints]
After SMT, in 53675ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 53677ms
Starting structural reductions in LTL mode, iteration 1 : 256/287 places, 199/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54025 ms. Remains : 256/287 places, 199/239 transitions.
[2024-05-22 01:24:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:24:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:24:37] [INFO ] Input system was already deterministic with 199 transitions.
[2024-05-22 01:24:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:24:37] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:24:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12733615432384518702.gal : 1 ms
[2024-05-22 01:24:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5714003020383987993.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/CTLCardinality12733615432384518702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5714003020383987993.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.
Detected timeout of ITS tools.
[2024-05-22 01:25:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:25:07] [INFO ] Applying decomposition
[2024-05-22 01:25:07] [INFO ] Flatten gal took : 7 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/graph8049094171864516222.txt' '-o' '/tmp/graph8049094171864516222.bin' '-w' '/tmp/graph8049094171864516222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8049094171864516222.bin' '-l' '-1' '-v' '-w' '/tmp/graph8049094171864516222.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:25:07] [INFO ] Decomposing Gal with order
[2024-05-22 01:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:25:07] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 01:25:07] [INFO ] Flatten gal took : 24 ms
[2024-05-22 01:25:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 01:25:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14635877486596286742.gal : 15 ms
[2024-05-22 01:25:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4658368602791447445.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/CTLCardinality14635877486596286742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4658368602791447445.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,4.6425e+18,1.52255,57960,4334,310,144794,2032,673,142796,137,4969,0


Converting to forward existential form...Done !
original formula: EX((EG(EX(((i12.i1.u49.p205==0)||(i5.i1.u19.p114==1)))) + !(A(E((((i13.i0.u64.p265==0)||(i8.i0.u35.p159==1))&&(i5.i0.u17.p94==1)) U ((i4....254
=> equivalent forward existential formula: ([FwdG(EY(Init),EX(((i12.i1.u49.p205==0)||(i5.i1.u19.p114==1))))] != FALSE + ([(((FwdU(EY(Init),!(((i10.u39.p171...478
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t59, t147, t160, t161, t193, u74.t17, u74.t138, u33.t77, i1.i0.u31.t80, i2.u14.t110,...770
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 270 transition count 223
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 270 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 44 place count 262 transition count 212
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 262 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 57 place count 262 transition count 207
Applied a total of 57 rules in 13 ms. Remains 262 /287 variables (removed 25) and now considering 207/239 (removed 32) transitions.
// Phase 1: matrix 207 rows 262 cols
[2024-05-22 01:25:37] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 01:25:38] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 01:25:38] [INFO ] Invariant cache hit.
[2024-05-22 01:25:38] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-22 01:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/262 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/469 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:25:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 19/342 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:25:45] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:46] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:25:46] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:25:47] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:48] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:51] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:25:51] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:25:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-22 01:25:51] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:52] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:25:52] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/469 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:25:57] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/469 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:25:59] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:25:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 01:25:59] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/469 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:26:01] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:26:01] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:26:01] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/469 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 17 (OVERLAPS) 0/469 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 368 constraints, problems are : Problem set: 0 solved, 206 unsolved in 27747 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/262 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:26:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:26:07] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:26:07] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:26:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:26:08] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-22 01:26:08] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:26:08] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:26:08] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:26:09] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 207/469 variables, 262/377 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 206/583 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:26:13] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-22 01:26:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:26:13] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:26:13] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:26:14] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 5/588 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-22 01:26:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/469 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 589 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 60/60 constraints]
After SMT, in 57796ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 57800ms
Starting structural reductions in LTL mode, iteration 1 : 262/287 places, 207/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58151 ms. Remains : 262/287 places, 207/239 transitions.
[2024-05-22 01:26:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:26:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 01:26:36] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-22 01:26:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:26:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:26:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality12072545137372054065.gal : 2 ms
[2024-05-22 01:26:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8134947015434450881.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/CTLCardinality12072545137372054065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8134947015434450881.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.
Detected timeout of ITS tools.
[2024-05-22 01:27:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:27:06] [INFO ] Applying decomposition
[2024-05-22 01:27:06] [INFO ] Flatten gal took : 8 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/graph2113914162732390986.txt' '-o' '/tmp/graph2113914162732390986.bin' '-w' '/tmp/graph2113914162732390986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2113914162732390986.bin' '-l' '-1' '-v' '-w' '/tmp/graph2113914162732390986.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:27:06] [INFO ] Decomposing Gal with order
[2024-05-22 01:27:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:27:06] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 01:27:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 01:27:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality15525435639306767587.gal : 2 ms
[2024-05-22 01:27:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality490842539861560922.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/CTLCardinality15525435639306767587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality490842539861560922.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,8.72773e+18,6.12231,133196,6934,234,214056,1638,671,688619,124,4719,0


Converting to forward existential form...Done !
original formula: EX(EF(AG((((EX(TRUE) + (i11.u2.p5==0)) + ((i8.i1.i1.u47.p175==1)||(i2.u13.p51==0))) + ((i6.u31.p127==1) + (A(((i9.u61.p219==0)||(i3.u19.p...249
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((((EX(TRUE) + (i11.u2.p5==0)) + ((i8.i1.i1.u47.p175==1)||(i2.u13.p51==0))) ...473
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t90, t128, t152, t166, t167, t200, i0.t77, i1.u8.t130, i1.u8.t131, i1.u14.t115, i1.u...775
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 267 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 267 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 267 transition count 217
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 52 place count 257 transition count 207
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 257 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 69 place count 257 transition count 200
Applied a total of 69 rules in 7 ms. Remains 257 /287 variables (removed 30) and now considering 200/239 (removed 39) transitions.
// Phase 1: matrix 200 rows 257 cols
[2024-05-22 01:27:36] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 01:27:36] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 01:27:36] [INFO ] Invariant cache hit.
[2024-05-22 01:27:36] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-22 01:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/257 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/457 variables, 257/318 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:39] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-05-22 01:27:39] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:27:40] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:27:40] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:27:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:27:40] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:27:40] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 7/325 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:42] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-22 01:27:42] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:27:43] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:27:43] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:43] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:27:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:27:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-22 01:27:44] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 01:27:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/457 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:27:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:27:46] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:49] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 01:27:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:27:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:27:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 01:27:50] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/457 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:51] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 01:27:51] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:27:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:27:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:27:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:27:53] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:27:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/457 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 16 (OVERLAPS) 0/457 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 356 constraints, problems are : Problem set: 0 solved, 199 unsolved in 24633 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/257 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:28:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:28:03] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 01:28:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:28:05] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:28:05] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 01:28:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:28:05] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:28:06] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 01:28:06] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-22 01:28:06] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 01:28:07] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 200/457 variables, 257/391 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 199/590 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:28:11] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:28:15] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-22 01:28:26] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-22 01:28:26] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:28:26] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:28:26] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 457/457 variables, and 596 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 257/257 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 79/79 constraints]
After SMT, in 54676ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 54678ms
Starting structural reductions in LTL mode, iteration 1 : 257/287 places, 200/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55013 ms. Remains : 257/287 places, 200/239 transitions.
[2024-05-22 01:28:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:28:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:28:31] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-22 01:28:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:28:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:28:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17959986896805038684.gal : 4 ms
[2024-05-22 01:28:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality1146053480218442775.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/CTLCardinality17959986896805038684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1146053480218442775.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.
Detected timeout of ITS tools.
[2024-05-22 01:29:01] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:29:01] [INFO ] Applying decomposition
[2024-05-22 01:29:01] [INFO ] Flatten gal took : 5 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/graph9012585069459331916.txt' '-o' '/tmp/graph9012585069459331916.bin' '-w' '/tmp/graph9012585069459331916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9012585069459331916.bin' '-l' '-1' '-v' '-w' '/tmp/graph9012585069459331916.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:29:01] [INFO ] Decomposing Gal with order
[2024-05-22 01:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:29:01] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:29:01] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:29:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 01:29:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality2374932136027369964.gal : 2 ms
[2024-05-22 01:29:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality5352791188462640545.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/CTLCardinality2374932136027369964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5352791188462640545.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,5.78095e+18,6.36585,174948,6999,274,450844,2509,693,326349,140,5887,0


Converting to forward existential form...Done !
original formula: EG((((i6.i0.u20.p94==0)&&(i9.i0.u58.p250==1)) + (EG((AG((i6.i1.u25.p105==0)) + (i12.u75.p284==1))) * AX(((i3.i1.u12.p53==0)||(i3.i0.u10.p...166
=> equivalent forward existential formula: [FwdG(Init,(((i6.i0.u20.p94==0)&&(i9.i0.u58.p250==1)) + (EG((!(E(TRUE U !((i6.i1.u25.p105==0)))) + (i12.u75.p284...227
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t147, t160, t161, t172, t194, u34.t76, i1.u15.t109, i2.t123, i2.u6.t128, i2.u6....782
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 215
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 260 transition count 206
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 251 transition count 206
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 236 transition count 191
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 236 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 236 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 236 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 235 transition count 187
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 100 place count 225 transition count 177
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 225 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 120 place count 225 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 223 transition count 166
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 123 place count 223 transition count 163
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 220 transition count 163
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 271 place count 149 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 147 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 146 transition count 90
Applied a total of 274 rules in 35 ms. Remains 146 /287 variables (removed 141) and now considering 90/239 (removed 149) transitions.
// Phase 1: matrix 90 rows 146 cols
[2024-05-22 01:29:31] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 01:29:31] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 01:29:31] [INFO ] Invariant cache hit.
[2024-05-22 01:29:31] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-22 01:29:31] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-22 01:29:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 2/145 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 90/235 variables, 145/203 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-22 01:29:32] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-22 01:29:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:29:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/236 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 207 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3142 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 2/145 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 90/235 variables, 145/206 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 87/293 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-22 01:29:36] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 1/236 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 13 (OVERLAPS) 0/236 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 295 constraints, problems are : Problem set: 0 solved, 87 unsolved in 11952 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 4/4 constraints]
After SMT, in 15104ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 15105ms
Starting structural reductions in SI_CTL mode, iteration 1 : 146/287 places, 90/239 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15359 ms. Remains : 146/287 places, 90/239 transitions.
[2024-05-22 01:29:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:29:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:29:46] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-22 01:29:46] [INFO ] Flatten gal took : 2 ms
[2024-05-22 01:29:46] [INFO ] Flatten gal took : 3 ms
[2024-05-22 01:29:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2605172870919500841.gal : 1 ms
[2024-05-22 01:29:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality14389612884355171301.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/CTLCardinality2605172870919500841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14389612884355171301.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.
Detected timeout of ITS tools.
[2024-05-22 01:30:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:30:16] [INFO ] Applying decomposition
[2024-05-22 01:30:16] [INFO ] Flatten gal took : 3 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/graph10298636320233224920.txt' '-o' '/tmp/graph10298636320233224920.bin' '-w' '/tmp/graph10298636320233224920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10298636320233224920.bin' '-l' '-1' '-v' '-w' '/tmp/graph10298636320233224920.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:30:16] [INFO ] Decomposing Gal with order
[2024-05-22 01:30:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:30:16] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 01:30:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 0 ms.
[2024-05-22 01:30:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2623238406100517667.gal : 1 ms
[2024-05-22 01:30:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13275888493651836434.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/CTLCardinality2623238406100517667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13275888493651836434.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,2.60125e+12,0.490816,27412,6166,182,73481,516,340,49557,109,1683,0


Converting to forward existential form...Done !
original formula: AF(AG((i5.u17.p7==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((i5.u17.p7==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t61, t77, t80, t83, u1.t12, u15.t23, u52.t2, u52.t85, i1.t9, i1.u2.t14, i1.u2.t18, i2...326
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 273 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 273 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 273 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 265 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 265 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 265 transition count 210
Applied a total of 51 rules in 13 ms. Remains 265 /287 variables (removed 22) and now considering 210/239 (removed 29) transitions.
// Phase 1: matrix 210 rows 265 cols
[2024-05-22 01:30:47] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 01:30:47] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 01:30:47] [INFO ] Invariant cache hit.
[2024-05-22 01:30:47] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-22 01:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 2/265 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/475 variables, 265/327 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:30:50] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-22 01:30:50] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 01:30:51] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:30:53] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:30:54] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:30:54] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:30:54] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:30:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:30:54] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:30:54] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:30:57] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-22 01:30:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 01:30:57] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 01:30:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:00] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 01:31:00] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-22 01:31:01] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/475 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 01:31:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-22 01:31:02] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 01:31:02] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 01:31:02] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:04] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:31:05] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:31:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 11/362 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:11] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/475 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:12] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/475 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 365 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/263 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 2/265 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:18] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 01:31:18] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:31:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-22 01:31:18] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-22 01:31:19] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:21] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 01:31:21] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:31:21] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-22 01:31:21] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:23] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 01:31:23] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/475 variables, 265/383 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 209/592 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 01:31:28] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-22 01:31:28] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 01:31:28] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 01:31:31] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 5/597 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 01:31:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 598 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 62/62 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 265/287 places, 210/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60379 ms. Remains : 265/287 places, 210/239 transitions.
[2024-05-22 01:31:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:31:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 01:31:47] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-22 01:31:47] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:31:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 01:31:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality6289783557177810109.gal : 2 ms
[2024-05-22 01:31:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality6836502559681162868.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/CTLCardinality6289783557177810109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6836502559681162868.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.
Detected timeout of ITS tools.
[2024-05-22 01:32:17] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:32:17] [INFO ] Applying decomposition
[2024-05-22 01:32:17] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1564870329789827398.txt' '-o' '/tmp/graph1564870329789827398.bin' '-w' '/tmp/graph1564870329789827398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1564870329789827398.bin' '-l' '-1' '-v' '-w' '/tmp/graph1564870329789827398.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:32:17] [INFO ] Decomposing Gal with order
[2024-05-22 01:32:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:32:17] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-22 01:32:17] [INFO ] Flatten gal took : 12 ms
[2024-05-22 01:32:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-22 01:32:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8963004903133499330.gal : 2 ms
[2024-05-22 01:32:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality11078389761868309152.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/CTLCardinality8963004903133499330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11078389761868309152.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27023e+19,3.56487,85292,6499,223,161699,1402,746,264144,123,3413,0


Converting to forward existential form...Done !
original formula: EG(((AG(AX(((i4.i0.u76.p278==0)&&(i11.u44.p170==1)))) + (EF(((i3.u13.p60==0)&&(i1.i0.u6.p36==1))) * ((i9.i1.u73.p267==1)||((i6.i0.u21.p10...346
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!(EX(!(((i4.i0.u76.p278==0)&&(i11.u44.p170==1)))))))) + (E(TRUE U ((i3.u13.p60==0)&&(i...413
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t127, t154, t170, t171, t203, i0.t17, i0.u81.t145, i1.i0.u6.t135, i1.i0.u6.t136, i1....845
Detected timeout of ITS tools.
[2024-05-22 01:32:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:32:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 01:32:47] [INFO ] Applying decomposition
[2024-05-22 01:32:47] [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/graph8739096813695512648.txt' '-o' '/tmp/graph8739096813695512648.bin' '-w' '/tmp/graph8739096813695512648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8739096813695512648.bin' '-l' '-1' '-v' '-w' '/tmp/graph8739096813695512648.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:32:47] [INFO ] Decomposing Gal with order
[2024-05-22 01:32:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:32:47] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-22 01:32:47] [INFO ] Flatten gal took : 14 ms
[2024-05-22 01:32:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2024-05-22 01:32:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13990662126415463108.gal : 2 ms
[2024-05-22 01:32:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11443459195034805034.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/CTLCardinality13990662126415463108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11443459195034805034.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 11 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.05263e+20,2.85444,86396,6424,293,169774,1966,690,335300,144,6183,0


Converting to forward existential form...Done !
original formula: ((EX(TRUE) * EX(AG(AF((i4.u24.p102==1))))) + (EX(EX((i11.i0.i0.u53.p182==1))) * EF(((A(EX((i10.u68.p247==1)) U AF(((i6.u37.p139==0)||(i12...353
=> equivalent forward existential formula: ([(EY((Init * EX(TRUE))) * !(E(TRUE U !(!(EG(!((i4.u24.p102==1))))))))] != FALSE + (([FwdG(((FwdU((Init * EX(EX(...1723
Reverse transition relation is NOT exact ! Due to transitions t0, t55, t94, t145, t195, t229, u85.t17, u85.t165, i1.u39.t82, i2.t115, i2.u17.t121, i2.u17.t...869
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 01:37:13] [INFO ] Applying decomposition
[2024-05-22 01:37:13] [INFO ] Flatten gal took : 7 ms
[2024-05-22 01:37:13] [INFO ] Decomposing Gal with order
[2024-05-22 01:37:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:37:13] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 01:37:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 01:37:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 164 labels/synchronizations in 7 ms.
[2024-05-22 01:37:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality4874469446244089797.gal : 4 ms
[2024-05-22 01:37:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10931199132357733279.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/CTLCardinality4874469446244089797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10931199132357733279.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 11 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.05263e+20,773.82,9677616,68305,357,1.47806e+07,1998,670,7.49804e+07,178,11545,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-22 02:03:49] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:03:49] [INFO ] Input system was already deterministic with 239 transitions.
[2024-05-22 02:03:49] [INFO ] Transformed 287 places.
[2024-05-22 02:03:49] [INFO ] Transformed 239 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 02:03:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality6679108098110980354.gal : 3 ms
[2024-05-22 02:03:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality6382803667942577292.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/CTLCardinality6679108098110980354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6382803667942577292.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 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.05263e+20,47.5839,1098192,2,247949,5,4.53423e+06,6,0,1385,5.17706e+06,0


Converting to forward existential form...Done !
original formula: ((EX(TRUE) * EX(AG(AF((p102==1))))) + (EX(EX((p182==1))) * EF(((A(EX((p247==1)) U AF(((p139==0)||(p74==1)))) * EF((p120==1))) * (A((p186=...232
=> equivalent forward existential formula: ([(EY((Init * EX(TRUE))) * !(E(TRUE U !(!(EG(!((p102==1))))))))] != FALSE + (([FwdG(((FwdU((Init * EX(EX((p182==...1172
Reverse transition relation is NOT exact ! Due to transitions t0, t17, t24, t26, t32, t35, t37, t40, t51, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62,...489

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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="DES-PT-05b"
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 DES-PT-05b, 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 r092-tall-171624189700657"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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