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.r576-smll-171734920100153.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 MedleyA-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 130K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717385787003

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-03 03:36:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 03:36:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 03:36:29] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2024-06-03 03:36:30] [INFO ] Transformed 273 places.
[2024-06-03 03:36:30] [INFO ] Transformed 518 transitions.
[2024-06-03 03:36:30] [INFO ] Found NUPN structural information;
[2024-06-03 03:36:30] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 684 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 64 ms.
FORMULA MedleyA-PT-20-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 196 transition count 441
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 196 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 156 place count 196 transition count 439
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 175 place count 177 transition count 384
Iterating global reduction 1 with 19 rules applied. Total rules applied 194 place count 177 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 198 place count 173 transition count 376
Iterating global reduction 1 with 4 rules applied. Total rules applied 202 place count 173 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 203 place count 173 transition count 375
Applied a total of 203 rules in 117 ms. Remains 173 /273 variables (removed 100) and now considering 375/518 (removed 143) transitions.
// Phase 1: matrix 375 rows 173 cols
[2024-06-03 03:36:30] [INFO ] Computed 11 invariants in 34 ms
[2024-06-03 03:36:30] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-03 03:36:30] [INFO ] Invariant cache hit.
[2024-06-03 03:36:31] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-06-03 03:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:36:37] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 30 ms to minimize.
[2024-06-03 03:36:37] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-06-03 03:36:37] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-06-03 03:36:38] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 3 ms to minimize.
[2024-06-03 03:36:38] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:36:38] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-06-03 03:36:38] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-06-03 03:36:38] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-06-03 03:36:39] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 3 ms to minimize.
[2024-06-03 03:36:39] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
[2024-06-03 03:36:39] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 3 ms to minimize.
[2024-06-03 03:36:39] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:36:39] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-06-03 03:36:39] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-03 03:36:40] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:36:40] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:36:40] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:36:45] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-06-03 03:36:45] [INFO ] Deduced a trap composed of 110 places in 180 ms of which 3 ms to minimize.
[2024-06-03 03:36:45] [INFO ] Deduced a trap composed of 108 places in 182 ms of which 3 ms to minimize.
[2024-06-03 03:36:46] [INFO ] Deduced a trap composed of 116 places in 192 ms of which 3 ms to minimize.
[2024-06-03 03:36:46] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 4 ms to minimize.
[2024-06-03 03:36:46] [INFO ] Deduced a trap composed of 103 places in 204 ms of which 3 ms to minimize.
[2024-06-03 03:36:46] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-06-03 03:36:46] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 3 ms to minimize.
[2024-06-03 03:36:47] [INFO ] Deduced a trap composed of 105 places in 170 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:36:50] [INFO ] Deduced a trap composed of 97 places in 221 ms of which 3 ms to minimize.
[2024-06-03 03:36:50] [INFO ] Deduced a trap composed of 96 places in 208 ms of which 3 ms to minimize.
[2024-06-03 03:36:50] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 3 ms to minimize.
[2024-06-03 03:36:50] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 3 ms to minimize.
[2024-06-03 03:36:51] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-03 03:36:54] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (OVERLAPS) 375/548 variables, 173/217 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/548 variables, and 217 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:37:06] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-06-03 03:37:06] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 375/548 variables, 173/219 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 374/593 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:37:15] [INFO ] Deduced a trap composed of 130 places in 173 ms of which 3 ms to minimize.
[2024-06-03 03:37:16] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 374 unsolved
[2024-06-03 03:37:29] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 596 constraints, problems are : Problem set: 0 solved, 374 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 38/38 constraints]
After SMT, in 60814ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 60873ms
Starting structural reductions in LTL mode, iteration 1 : 173/273 places, 375/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61901 ms. Remains : 173/273 places, 375/518 transitions.
Support contains 59 out of 173 places after structural reductions.
[2024-06-03 03:37:32] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-03 03:37:32] [INFO ] Flatten gal took : 130 ms
FORMULA MedleyA-PT-20-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 03:37:32] [INFO ] Flatten gal took : 64 ms
[2024-06-03 03:37:32] [INFO ] Input system was already deterministic with 375 transitions.
Support contains 46 out of 173 places (down from 59) after GAL structural reductions.
RANDOM walk for 40000 steps (32 resets) in 3504 ms. (11 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40003 steps (29 resets) in 124 ms. (320 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (50 resets) in 187 ms. (212 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (14 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 273 ms. (146 steps per ms) remains 1/2 properties
[2024-06-03 03:37:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/129 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 375/548 variables, 173/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/129 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/173 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 375/548 variables, 173/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 12 ms.
[2024-06-03 03:37:35] [INFO ] Flatten gal took : 43 ms
[2024-06-03 03:37:35] [INFO ] Flatten gal took : 48 ms
[2024-06-03 03:37:35] [INFO ] Input system was already deterministic with 375 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 134 transition count 306
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 134 transition count 300
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 120 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 120 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 120 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 116 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 116 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 116 transition count 249
Applied a total of 127 rules in 21 ms. Remains 116 /173 variables (removed 57) and now considering 249/375 (removed 126) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-03 03:37:35] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:37:35] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-03 03:37:35] [INFO ] Invariant cache hit.
[2024-06-03 03:37:35] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-03 03:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:37:37] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-06-03 03:37:37] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 4 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-06-03 03:37:38] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:37:41] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 3 ms to minimize.
[2024-06-03 03:37:41] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 4 ms to minimize.
[2024-06-03 03:37:41] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-06-03 03:37:41] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:37:42] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-06-03 03:37:43] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 2 ms to minimize.
[2024-06-03 03:37:43] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:37:43] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 3 ms to minimize.
[2024-06-03 03:37:43] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 3 ms to minimize.
[2024-06-03 03:37:43] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:37:45] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:37:45] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:37:49] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:37:55] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/365 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 248 unsolved in 25584 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/365 variables, 116/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 248/400 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:38:07] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 3 ms to minimize.
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 3 ms to minimize.
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:38:08] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 406 constraints, problems are : Problem set: 0 solved, 248 unsolved in 25105 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 31/31 constraints]
After SMT, in 50829ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 50834ms
Starting structural reductions in LTL mode, iteration 1 : 116/173 places, 249/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51271 ms. Remains : 116/173 places, 249/375 transitions.
[2024-06-03 03:38:26] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:38:26] [INFO ] Flatten gal took : 17 ms
[2024-06-03 03:38:26] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-03 03:38:26] [INFO ] Flatten gal took : 15 ms
[2024-06-03 03:38:26] [INFO ] Flatten gal took : 15 ms
[2024-06-03 03:38:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality10077614036273403784.gal : 10 ms
[2024-06-03 03:38:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality17419424218623815245.ctl : 4 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/CTLCardinality10077614036273403784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17419424218623815245.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,20.6933,391324,2,17357,5,1.19708e+06,6,0,715,1.74293e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,0.764328,22320,616,61,36730,963,451,60624,84,2558,0


Converting to forward existential form...Done !
original formula: AG(EX(AF((i6.u19.p229==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((i6.u19.p229==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t91, t93, t165, t166, t167, t169, t170, t171, t191, t192, t193, t194, t195, t19...567
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,4.85257,111024,1,0,183608,6272,2625,424020,473,24051,484659
FORMULA MedleyA-PT-20-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 142 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 4 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 155 transition count 344
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 152 transition count 342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 152 transition count 338
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 148 transition count 338
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 51 place count 114 transition count 275
Iterating global reduction 2 with 34 rules applied. Total rules applied 85 place count 114 transition count 275
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 95 place count 114 transition count 265
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 101 place count 111 transition count 262
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 101 place count 111 transition count 256
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 113 place count 105 transition count 256
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 103 transition count 250
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 103 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 103 transition count 248
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 145 place count 90 transition count 235
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 153 place count 82 transition count 211
Iterating global reduction 5 with 8 rules applied. Total rules applied 161 place count 82 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 166 place count 82 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 169 place count 82 transition count 203
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 175 place count 79 transition count 200
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 178 place count 76 transition count 191
Iterating global reduction 6 with 3 rules applied. Total rules applied 181 place count 76 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 184 place count 76 transition count 188
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 74 transition count 186
Applied a total of 186 rules in 118 ms. Remains 74 /173 variables (removed 99) and now considering 186/375 (removed 189) transitions.
[2024-06-03 03:39:02] [INFO ] Flow matrix only has 176 transitions (discarded 10 similar events)
// Phase 1: matrix 176 rows 74 cols
[2024-06-03 03:39:02] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:39:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-03 03:39:02] [INFO ] Flow matrix only has 176 transitions (discarded 10 similar events)
[2024-06-03 03:39:02] [INFO ] Invariant cache hit.
[2024-06-03 03:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 03:39:02] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-03 03:39:02] [INFO ] Redundant transitions in 8 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-03 03:39:02] [INFO ] Flow matrix only has 176 transitions (discarded 10 similar events)
[2024-06-03 03:39:02] [INFO ] Invariant cache hit.
[2024-06-03 03:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-03 03:39:04] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-03 03:39:05] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-03 03:39:06] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 175/249 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/250 variables, and 89 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7096 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 175/249 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 168/257 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/250 variables, and 257 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6695 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 3/3 constraints]
After SMT, in 13883ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 13885ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/173 places, 186/375 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14263 ms. Remains : 74/173 places, 186/375 transitions.
[2024-06-03 03:39:16] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:39:16] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:39:16] [INFO ] Input system was already deterministic with 186 transitions.
[2024-06-03 03:39:16] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:39:16] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:39:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality1523684860619876139.gal : 2 ms
[2024-06-03 03:39:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality4087807259620189918.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/CTLCardinality1523684860619876139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4087807259620189918.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.16052e+06,9.51822,190044,2,7119,5,540210,6,0,480,721464,0


Converting to forward existential form...Done !
original formula: EG(EF(AG((p95==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((p95==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t17, t18, t24, t27, t29, t32, t33, t39, t71, t72, t73, t74, t75, t76, t...464
(forward)formula 0,0,15.6728,220348,1,0,404,1.2368e+06,394,174,4108,917131,381
FORMULA MedleyA-PT-20-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 134 transition count 306
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 134 transition count 300
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 120 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 120 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 120 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 116 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 116 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 116 transition count 249
Applied a total of 127 rules in 10 ms. Remains 116 /173 variables (removed 57) and now considering 249/375 (removed 126) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-03 03:39:32] [INFO ] Computed 11 invariants in 4 ms
[2024-06-03 03:39:32] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-03 03:39:32] [INFO ] Invariant cache hit.
[2024-06-03 03:39:32] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-03 03:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:39:35] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-03 03:39:35] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 3 ms to minimize.
[2024-06-03 03:39:35] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 2 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 2 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 3 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-06-03 03:39:36] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-06-03 03:39:37] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:39:39] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:39:39] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-06-03 03:39:40] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-06-03 03:39:40] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:39:41] [INFO ] Deduced a trap composed of 71 places in 143 ms of which 2 ms to minimize.
[2024-06-03 03:39:41] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-06-03 03:39:42] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:39:42] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:39:42] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:39:42] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:39:44] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-06-03 03:39:44] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:39:48] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:39:55] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/365 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30004 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/365 variables, 116/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 248/400 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:40:08] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-06-03 03:40:09] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:40:09] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-06-03 03:40:09] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:40:09] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
[2024-06-03 03:40:09] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 406 constraints, problems are : Problem set: 0 solved, 248 unsolved in 22504 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 31/31 constraints]
After SMT, in 52681ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 52688ms
Starting structural reductions in LTL mode, iteration 1 : 116/173 places, 249/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53149 ms. Remains : 116/173 places, 249/375 transitions.
[2024-06-03 03:40:25] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:40:25] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:40:25] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-03 03:40:25] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:40:25] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:40:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality1748409166405530020.gal : 3 ms
[2024-06-03 03:40:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17229105272578603156.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/CTLCardinality1748409166405530020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17229105272578603156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,21.5807,391104,2,17357,5,1.19708e+06,6,0,715,1.74293e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:40:55] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:40:55] [INFO ] Applying decomposition
[2024-06-03 03:40:55] [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/graph6376994209712767502.txt' '-o' '/tmp/graph6376994209712767502.bin' '-w' '/tmp/graph6376994209712767502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6376994209712767502.bin' '-l' '-1' '-v' '-w' '/tmp/graph6376994209712767502.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:40:55] [INFO ] Decomposing Gal with order
[2024-06-03 03:40:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:40:55] [INFO ] Removed a total of 364 redundant transitions.
[2024-06-03 03:40:55] [INFO ] Flatten gal took : 26 ms
[2024-06-03 03:40:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2024-06-03 03:40:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality14861470916868436283.gal : 5 ms
[2024-06-03 03:40:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7838103912126947346.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/CTLCardinality14861470916868436283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7838103912126947346.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.17259e+08,0.685706,20264,697,50,32271,546,448,53495,69,1477,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t91, t93, t162, t163, t164, t165, t166, t167, t169, t170, t171, t172, t173, t17...600
(forward)formula 0,1,0.976019,20264,1,0,32271,579,2108,53495,330,1640,88445
FORMULA MedleyA-PT-20-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 136 transition count 311
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 136 transition count 311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 80 place count 136 transition count 305
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 94 place count 122 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 108 place count 122 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 112 place count 122 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 118 transition count 257
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 118 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 118 transition count 255
Applied a total of 122 rules in 28 ms. Remains 118 /173 variables (removed 55) and now considering 255/375 (removed 120) transitions.
// Phase 1: matrix 255 rows 118 cols
[2024-06-03 03:40:56] [INFO ] Computed 11 invariants in 3 ms
[2024-06-03 03:40:56] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-03 03:40:56] [INFO ] Invariant cache hit.
[2024-06-03 03:40:56] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-06-03 03:40:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:40:59] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-06-03 03:40:59] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-06-03 03:40:59] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-06-03 03:40:59] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:41:00] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 3 ms to minimize.
[2024-06-03 03:41:00] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2024-06-03 03:41:00] [INFO ] Deduced a trap composed of 73 places in 154 ms of which 2 ms to minimize.
[2024-06-03 03:41:00] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:41:00] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2024-06-03 03:41:01] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-06-03 03:41:01] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:02] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:04] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:05] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-03 03:41:06] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 255/373 variables, 118/144 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:11] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 11 (OVERLAPS) 0/373 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 145 constraints, problems are : Problem set: 0 solved, 254 unsolved in 22850 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 255/373 variables, 118/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 254/399 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:24] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 3 ms to minimize.
[2024-06-03 03:41:25] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 2 ms to minimize.
[2024-06-03 03:41:26] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-06-03 03:41:32] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 7/409 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-03 03:41:38] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 410 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 27/27 constraints]
After SMT, in 52957ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 52960ms
Starting structural reductions in LTL mode, iteration 1 : 118/173 places, 255/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53372 ms. Remains : 118/173 places, 255/375 transitions.
[2024-06-03 03:41:49] [INFO ] Flatten gal took : 14 ms
[2024-06-03 03:41:49] [INFO ] Flatten gal took : 14 ms
[2024-06-03 03:41:50] [INFO ] Input system was already deterministic with 255 transitions.
[2024-06-03 03:41:50] [INFO ] Flatten gal took : 14 ms
[2024-06-03 03:41:50] [INFO ] Flatten gal took : 14 ms
[2024-06-03 03:41:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6346182213839529829.gal : 4 ms
[2024-06-03 03:41:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality10671299532430247636.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/CTLCardinality6346182213839529829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10671299532430247636.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.7567e+08,25.7203,424044,2,18384,5,1.3106e+06,6,0,729,1.96887e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:42:20] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:42:20] [INFO ] Applying decomposition
[2024-06-03 03:42:20] [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/graph13027290617991492544.txt' '-o' '/tmp/graph13027290617991492544.bin' '-w' '/tmp/graph13027290617991492544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13027290617991492544.bin' '-l' '-1' '-v' '-w' '/tmp/graph13027290617991492544.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:42:20] [INFO ] Decomposing Gal with order
[2024-06-03 03:42:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:42:20] [INFO ] Removed a total of 321 redundant transitions.
[2024-06-03 03:42:20] [INFO ] Flatten gal took : 24 ms
[2024-06-03 03:42:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 8 ms.
[2024-06-03 03:42:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality15686142578646280742.gal : 4 ms
[2024-06-03 03:42:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality9168941717797024230.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/CTLCardinality15686142578646280742.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9168941717797024230.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.7567e+08,0.471407,15712,637,188,23144,3173,446,34839,148,8480,0


Converting to forward existential form...Done !
original formula: (EX(AF(((i6.u16.p217==0)&&(i3.u11.p100==1)))) + AG((EX((i1.u3.p17==0)) * EF((i0.u2.p13==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(EX(!(EG(!(((i6.u16.p217==0)&&(i3.u11.p100==1)))))))),TRUE) * !(EX((i1.u3.p17==0))))] = FALSE *...272
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t94, t96, t114, t134, t156, t168, t169, t170, t171, t172, t173, t174, t197, t19...640
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 143 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 155 transition count 343
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 151 transition count 341
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 151 transition count 337
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 147 transition count 337
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 53 place count 113 transition count 276
Iterating global reduction 2 with 34 rules applied. Total rules applied 87 place count 113 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 113 transition count 268
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 111 transition count 266
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 99 place count 111 transition count 260
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 111 place count 105 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 103 transition count 254
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 103 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 103 transition count 252
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 143 place count 90 transition count 239
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 151 place count 82 transition count 215
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 82 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 164 place count 82 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 168 place count 82 transition count 206
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 174 place count 79 transition count 203
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 177 place count 76 transition count 194
Iterating global reduction 6 with 3 rules applied. Total rules applied 180 place count 76 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 183 place count 76 transition count 191
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 76 transition count 191
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 186 place count 74 transition count 189
Applied a total of 186 rules in 161 ms. Remains 74 /173 variables (removed 99) and now considering 189/375 (removed 186) transitions.
[2024-06-03 03:42:50] [INFO ] Flow matrix only has 179 transitions (discarded 10 similar events)
// Phase 1: matrix 179 rows 74 cols
[2024-06-03 03:42:50] [INFO ] Computed 11 invariants in 3 ms
[2024-06-03 03:42:50] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-03 03:42:50] [INFO ] Flow matrix only has 179 transitions (discarded 10 similar events)
[2024-06-03 03:42:50] [INFO ] Invariant cache hit.
[2024-06-03 03:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 03:42:50] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-03 03:42:50] [INFO ] Redundant transitions in 12 ms returned []
Running 163 sub problems to find dead transitions.
[2024-06-03 03:42:50] [INFO ] Flow matrix only has 179 transitions (discarded 10 similar events)
[2024-06-03 03:42:50] [INFO ] Invariant cache hit.
[2024-06-03 03:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-06-03 03:42:54] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
[2024-06-03 03:42:54] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 178/252 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/253 variables, and 88 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 178/252 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 163/251 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (OVERLAPS) 0/252 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/253 variables, and 251 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8153 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 2/2 constraints]
After SMT, in 16433ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 16437ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/173 places, 189/375 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16989 ms. Remains : 74/173 places, 189/375 transitions.
[2024-06-03 03:43:07] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:43:07] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:43:07] [INFO ] Input system was already deterministic with 189 transitions.
[2024-06-03 03:43:07] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:43:07] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:43:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality14076546033204063143.gal : 4 ms
[2024-06-03 03:43:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality17419586792927538895.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/CTLCardinality14076546033204063143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17419586792927538895.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.18746e+06,4.89425,89260,2,7699,5,258537,6,0,484,329818,0


Converting to forward existential form...Done !
original formula: EF(AG((p184==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p184==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t15, t18, t19, t25, t28, t31, t32, t38, t70, t71, t72, t73, t74, t75, t82, t83, t...460
Detected timeout of ITS tools.
[2024-06-03 03:43:37] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:43:37] [INFO ] Applying decomposition
[2024-06-03 03:43:37] [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/graph6949470044041373956.txt' '-o' '/tmp/graph6949470044041373956.bin' '-w' '/tmp/graph6949470044041373956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6949470044041373956.bin' '-l' '-1' '-v' '-w' '/tmp/graph6949470044041373956.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:43:37] [INFO ] Decomposing Gal with order
[2024-06-03 03:43:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:43:37] [INFO ] Removed a total of 301 redundant transitions.
[2024-06-03 03:43:37] [INFO ] Flatten gal took : 15 ms
[2024-06-03 03:43:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 5 ms.
[2024-06-03 03:43:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17487530378892464715.gal : 2 ms
[2024-06-03 03:43:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16686410473928654194.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/CTLCardinality17487530378892464715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16686410473928654194.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.18746e+06,0.139437,7636,231,145,7100,994,369,12441,104,4708,0


Converting to forward existential form...Done !
original formula: EF(AG((i5.u9.p184==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i5.u9.p184==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t70, t71, t72, t85, t86, t87, t100, t101, t102, t128, t129, t130, t132, t134, t136, t138, t13...463
(forward)formula 0,1,3.20081,79972,1,0,105805,11261,1852,345942,504,67912,299703
FORMULA MedleyA-PT-20-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 138 transition count 314
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 138 transition count 314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 75 place count 138 transition count 309
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 87 place count 126 transition count 278
Iterating global reduction 1 with 12 rules applied. Total rules applied 99 place count 126 transition count 278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 103 place count 126 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 123 transition count 267
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 123 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 123 transition count 265
Applied a total of 111 rules in 10 ms. Remains 123 /173 variables (removed 50) and now considering 265/375 (removed 110) transitions.
// Phase 1: matrix 265 rows 123 cols
[2024-06-03 03:43:40] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:43:40] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-03 03:43:40] [INFO ] Invariant cache hit.
[2024-06-03 03:43:41] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-03 03:43:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-03 03:43:42] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-06-03 03:43:42] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-03 03:43:42] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-06-03 03:43:42] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-06-03 03:43:42] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 2 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 3 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:43:43] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-06-03 03:43:44] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-03 03:43:44] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-06-03 03:43:44] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 2 ms to minimize.
[2024-06-03 03:43:44] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
[2024-06-03 03:43:44] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-06-03 03:43:44] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 3 ms to minimize.
[2024-06-03 03:43:45] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-03 03:43:45] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-06-03 03:43:45] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:43:45] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-03 03:43:46] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-03 03:43:47] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-06-03 03:43:47] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:43:47] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-03 03:43:48] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-06-03 03:43:48] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 265/388 variables, 123/163 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-03 03:43:52] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-06-03 03:43:52] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 165 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16368 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 265/388 variables, 123/165 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 264/429 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 429 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16837 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 31/31 constraints]
After SMT, in 33306ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 33309ms
Starting structural reductions in LTL mode, iteration 1 : 123/173 places, 265/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33622 ms. Remains : 123/173 places, 265/375 transitions.
[2024-06-03 03:44:14] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:44:14] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:44:14] [INFO ] Input system was already deterministic with 265 transitions.
[2024-06-03 03:44:14] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:44:14] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:44:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14612613561875421336.gal : 3 ms
[2024-06-03 03:44:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10311348063776938765.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/CTLCardinality14612613561875421336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10311348063776938765.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.31064e+08,27.7657,533428,2,19604,5,1.56334e+06,6,0,759,2.34601e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.31064e+08,1.30814,28780,641,71,47827,1079,492,87001,98,2463,0


Converting to forward existential form...Done !
original formula: EF(EX((AX(((i5.u14.p124==0)&&(i5.u16.p120==1))) * ((i3.u10.p68==0)||(i5.u19.p144==1)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * ((i3.u10.p68==0)||(i5.u19.p144==1))) * !(EX(!(((i5.u14.p124==0)&&(i5.u16.p120==1))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t98, t100, t117, t137, t159, t175, t176, t177, t198, t199, t200, t204, t205, t2...608
(forward)formula 0,1,1.6977,28780,1,0,47827,1567,2505,87001,500,6576,99547
FORMULA MedleyA-PT-20-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 135 transition count 309
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 135 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 81 place count 135 transition count 304
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 95 place count 121 transition count 270
Iterating global reduction 1 with 14 rules applied. Total rules applied 109 place count 121 transition count 270
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 113 place count 121 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 117 transition count 256
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 117 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 117 transition count 253
Applied a total of 124 rules in 10 ms. Remains 117 /173 variables (removed 56) and now considering 253/375 (removed 122) transitions.
// Phase 1: matrix 253 rows 117 cols
[2024-06-03 03:44:46] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:44:46] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-03 03:44:46] [INFO ] Invariant cache hit.
[2024-06-03 03:44:46] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-03 03:44:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-03 03:44:49] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 3 ms to minimize.
[2024-06-03 03:44:49] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-03 03:44:49] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:44:50] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 3 ms to minimize.
[2024-06-03 03:44:50] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2024-06-03 03:44:50] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 3 ms to minimize.
[2024-06-03 03:44:50] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 2 ms to minimize.
[2024-06-03 03:44:50] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 3 ms to minimize.
[2024-06-03 03:44:50] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-06-03 03:44:51] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:44:51] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-06-03 03:44:51] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 2 ms to minimize.
[2024-06-03 03:44:51] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-03 03:44:54] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 3 ms to minimize.
[2024-06-03 03:44:54] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 3 ms to minimize.
[2024-06-03 03:44:54] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 3 ms to minimize.
[2024-06-03 03:44:54] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:44:54] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-06-03 03:44:55] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 2 ms to minimize.
[2024-06-03 03:44:55] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:44:55] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-06-03 03:44:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-03 03:44:56] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-06-03 03:44:57] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 253/370 variables, 117/152 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-03 03:45:04] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/370 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 252 unsolved in 26013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 253/370 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 252/405 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-03 03:45:18] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 406 constraints, problems are : Problem set: 0 solved, 252 unsolved in 23564 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 26/26 constraints]
After SMT, in 49729ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 49735ms
Starting structural reductions in LTL mode, iteration 1 : 117/173 places, 253/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50180 ms. Remains : 117/173 places, 253/375 transitions.
[2024-06-03 03:45:36] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:45:36] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:45:36] [INFO ] Input system was already deterministic with 253 transitions.
[2024-06-03 03:45:36] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:45:36] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:45:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality169535983363320563.gal : 6 ms
[2024-06-03 03:45:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5810136788755238578.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/CTLCardinality169535983363320563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5810136788755238578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45417e+08,23.3532,423196,2,17552,5,1.31759e+06,6,0,723,1.92161e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-03 03:46:06] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:46:06] [INFO ] Applying decomposition
[2024-06-03 03:46: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/graph8626313059110425300.txt' '-o' '/tmp/graph8626313059110425300.bin' '-w' '/tmp/graph8626313059110425300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8626313059110425300.bin' '-l' '-1' '-v' '-w' '/tmp/graph8626313059110425300.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:46:06] [INFO ] Decomposing Gal with order
[2024-06-03 03:46:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:46:06] [INFO ] Removed a total of 356 redundant transitions.
[2024-06-03 03:46:06] [INFO ] Flatten gal took : 18 ms
[2024-06-03 03:46:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2024-06-03 03:46:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14350157962900259704.gal : 3 ms
[2024-06-03 03:46:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9614544211391232443.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/CTLCardinality14350157962900259704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9614544211391232443.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.45417e+08,1.42637,36616,992,108,61415,1204,461,105733,125,3506,0


Converting to forward existential form...Done !
original formula: AF(AX(AG(((EF((i5.u16.p208==1)) + (i4.u11.p140==1)) + EX((i1.u8.p91==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(E(TRUE U !(((E(TRUE U (i5.u16.p208==1)) + (i4.u11.p140==1)) + EX((i1.u8.p91==1)))))))))))]...163
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t92, t94, t169, t170, t171, t173, t174, t175, t195, t196, t197, t198, t199, t20...561
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 136 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 156 transition count 344
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 152 transition count 342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 152 transition count 338
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 148 transition count 338
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 46 place count 121 transition count 288
Iterating global reduction 2 with 27 rules applied. Total rules applied 73 place count 121 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 82 place count 121 transition count 279
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 88 place count 118 transition count 276
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 88 place count 118 transition count 272
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 96 place count 114 transition count 272
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 113 transition count 269
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 113 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 113 transition count 268
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 129 place count 98 transition count 253
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 135 place count 92 transition count 235
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 92 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 146 place count 92 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 149 place count 92 transition count 227
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 155 place count 89 transition count 224
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 158 place count 86 transition count 215
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 86 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 164 place count 86 transition count 212
Applied a total of 164 rules in 63 ms. Remains 86 /173 variables (removed 87) and now considering 212/375 (removed 163) transitions.
[2024-06-03 03:46:36] [INFO ] Flow matrix only has 202 transitions (discarded 10 similar events)
// Phase 1: matrix 202 rows 86 cols
[2024-06-03 03:46:36] [INFO ] Computed 11 invariants in 1 ms
[2024-06-03 03:46:37] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-03 03:46:37] [INFO ] Flow matrix only has 202 transitions (discarded 10 similar events)
[2024-06-03 03:46:37] [INFO ] Invariant cache hit.
[2024-06-03 03:46:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-03 03:46:37] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-06-03 03:46:37] [INFO ] Redundant transitions in 4 ms returned []
Running 211 sub problems to find dead transitions.
[2024-06-03 03:46:37] [INFO ] Flow matrix only has 202 transitions (discarded 10 similar events)
[2024-06-03 03:46:37] [INFO ] Invariant cache hit.
[2024-06-03 03:46:37] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 2 ms to minimize.
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-06-03 03:46:39] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-03 03:46:40] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-06-03 03:46:40] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-03 03:46:40] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-06-03 03:46:41] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-06-03 03:46:41] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-03 03:46:42] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-06-03 03:46:43] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-03 03:46:43] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 201/287 variables, 86/115 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 40/155 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/288 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/288 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 156 constraints, problems are : Problem set: 0 solved, 211 unsolved in 17517 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 201/287 variables, 86/115 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 40/155 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 211/366 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/288 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-03 03:47:06] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 12 (OVERLAPS) 0/288 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 368 constraints, problems are : Problem set: 0 solved, 211 unsolved in 22309 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 19/19 constraints]
After SMT, in 40021ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 40029ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/173 places, 212/375 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40514 ms. Remains : 86/173 places, 212/375 transitions.
[2024-06-03 03:47:17] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:47:17] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:47:17] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-03 03:47:17] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:47:17] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:47:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16473054879302378160.gal : 3 ms
[2024-06-03 03:47:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality6426227092582848738.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/CTLCardinality16473054879302378160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6426227092582848738.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51057e+07,6.61763,132368,2,12462,5,420013,6,0,555,524718,0


Converting to forward existential form...Done !
original formula: EG((AG(((p257==1) + AG((p253==0)))) + (E(AF(((p58==0)||(p147==1))) U E((((p191==0)||(p232==1))&&((p35==0)||(p106==1))) U ((p249==1)&&(p1=...175
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((p257==1) + !(E(TRUE U !((p253==0)))))))) + (E(!(EG(!(((p58==0)||(p147==1))))) U E((((...248
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t8, t9, t14, t16, t19, t22, t30, t34, t37, t42, t93, t94, t95, t96, t97, t98, t105, t...524
Detected timeout of ITS tools.
[2024-06-03 03:47:47] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:47:47] [INFO ] Applying decomposition
[2024-06-03 03:47:47] [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/graph8388873064648716638.txt' '-o' '/tmp/graph8388873064648716638.bin' '-w' '/tmp/graph8388873064648716638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8388873064648716638.bin' '-l' '-1' '-v' '-w' '/tmp/graph8388873064648716638.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:47:47] [INFO ] Decomposing Gal with order
[2024-06-03 03:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:47:47] [INFO ] Removed a total of 363 redundant transitions.
[2024-06-03 03:47:47] [INFO ] Flatten gal took : 13 ms
[2024-06-03 03:47:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2024-06-03 03:47:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality14882792074246098858.gal : 19 ms
[2024-06-03 03:47:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality3930266712629654373.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/CTLCardinality14882792074246098858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3930266712629654373.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.51057e+07,0.192002,9060,322,142,9408,746,385,17943,108,3184,0


Converting to forward existential form...Done !
original formula: EG((AG(((i7.u17.p257==1) + AG((i7.u16.p253==0)))) + (E(AF(((i1.u7.p58==0)||(i3.u8.p147==1))) U E((((i4.u13.p191==0)||(i8.u0.p232==1))&&((...246
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(((i7.u17.p257==1) + !(E(TRUE U !((i7.u16.p253==0)))))))) + (E(!(EG(!(((i1.u7.p58==0)||(...319
Reverse transition relation is NOT exact ! Due to transitions t96, t97, t98, t105, t106, t107, t123, t124, t125, t145, t146, t156, t161, t167, t173, t178, ...454
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,15.8941,333996,1,0,416010,27763,2123,1.52757e+06,591,302167,846764
FORMULA MedleyA-PT-20-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 141 edges and 173 vertex of which 18 / 173 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 157 transition count 346
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 153 transition count 344
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 153 transition count 340
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 149 transition count 340
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 54 place count 114 transition count 276
Iterating global reduction 2 with 35 rules applied. Total rules applied 89 place count 114 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 99 place count 114 transition count 266
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 104 place count 111 transition count 264
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 104 place count 111 transition count 258
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 116 place count 105 transition count 258
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 103 transition count 252
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 103 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 103 transition count 250
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 148 place count 90 transition count 237
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 156 place count 82 transition count 213
Iterating global reduction 5 with 8 rules applied. Total rules applied 164 place count 82 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 169 place count 82 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 173 place count 82 transition count 204
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 179 place count 79 transition count 201
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 182 place count 76 transition count 192
Iterating global reduction 6 with 3 rules applied. Total rules applied 185 place count 76 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 188 place count 76 transition count 189
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 76 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 74 transition count 187
Applied a total of 191 rules in 68 ms. Remains 74 /173 variables (removed 99) and now considering 187/375 (removed 188) transitions.
[2024-06-03 03:48:03] [INFO ] Flow matrix only has 177 transitions (discarded 10 similar events)
// Phase 1: matrix 177 rows 74 cols
[2024-06-03 03:48:03] [INFO ] Computed 11 invariants in 1 ms
[2024-06-03 03:48:03] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-03 03:48:03] [INFO ] Flow matrix only has 177 transitions (discarded 10 similar events)
[2024-06-03 03:48:03] [INFO ] Invariant cache hit.
[2024-06-03 03:48:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 03:48:03] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-06-03 03:48:03] [INFO ] Redundant transitions in 4 ms returned []
Running 161 sub problems to find dead transitions.
[2024-06-03 03:48:03] [INFO ] Flow matrix only has 177 transitions (discarded 10 similar events)
[2024-06-03 03:48:03] [INFO ] Invariant cache hit.
[2024-06-03 03:48:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-03 03:48:07] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-03 03:48:08] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-06-03 03:48:08] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 176/250 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/251 variables, and 89 constraints, problems are : Problem set: 0 solved, 161 unsolved in 9770 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 1/74 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 176/250 variables, 74/88 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 161/250 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/251 variables, and 250 constraints, problems are : Problem set: 0 solved, 161 unsolved in 7570 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 3/3 constraints]
After SMT, in 17441ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 17446ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/173 places, 187/375 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17805 ms. Remains : 74/173 places, 187/375 transitions.
[2024-06-03 03:48:21] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:48:21] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:48:21] [INFO ] Input system was already deterministic with 187 transitions.
[2024-06-03 03:48:21] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:48:21] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:48:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11376672911448340013.gal : 3 ms
[2024-06-03 03:48:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality9757744464567324655.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/CTLCardinality11376672911448340013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9757744464567324655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.18746e+06,3.40626,62916,2,7427,5,210519,6,0,482,241440,0


Converting to forward existential form...Done !
original formula: EF((AG((p180!=1)) * (p87==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p87==1)) * !(E(TRUE U !((p180!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t16, t19, t20, t26, t29, t32, t33, t39, t71, t72, t73, t74, t75, t76, t83, t84, t...460
Detected timeout of ITS tools.
[2024-06-03 03:48:51] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:48:51] [INFO ] Applying decomposition
[2024-06-03 03:48:51] [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/graph4900772253649178782.txt' '-o' '/tmp/graph4900772253649178782.bin' '-w' '/tmp/graph4900772253649178782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4900772253649178782.bin' '-l' '-1' '-v' '-w' '/tmp/graph4900772253649178782.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:48:51] [INFO ] Decomposing Gal with order
[2024-06-03 03:48:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:48:51] [INFO ] Removed a total of 303 redundant transitions.
[2024-06-03 03:48:51] [INFO ] Flatten gal took : 20 ms
[2024-06-03 03:48:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2024-06-03 03:48:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6634418724237539259.gal : 3 ms
[2024-06-03 03:48:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13253874420157402010.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/CTLCardinality6634418724237539259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13253874420157402010.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.18746e+06,0.125827,7108,221,95,6049,727,366,10771,84,3332,0


Converting to forward existential form...Done !
original formula: EF((AG((i5.u11.p180!=1)) * (i2.u5.p87==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i2.u5.p87==1)) * !(E(TRUE U !((i5.u11.p180!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t74, t75, t76, t83, t84, t85, t104, t105, t106, t130, t134, t135, t137, t138, t141, t143, t14...427
(forward)formula 0,1,2.80458,68884,1,0,93481,8920,1860,290282,407,54474,262290
FORMULA MedleyA-PT-20-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 137 transition count 309
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 137 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 137 transition count 304
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 89 place count 125 transition count 273
Iterating global reduction 1 with 12 rules applied. Total rules applied 101 place count 125 transition count 273
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 105 place count 125 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 122 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 122 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 122 transition count 260
Applied a total of 113 rules in 5 ms. Remains 122 /173 variables (removed 51) and now considering 260/375 (removed 115) transitions.
// Phase 1: matrix 260 rows 122 cols
[2024-06-03 03:48:54] [INFO ] Computed 11 invariants in 5 ms
[2024-06-03 03:48:54] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-03 03:48:54] [INFO ] Invariant cache hit.
[2024-06-03 03:48:54] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-06-03 03:48:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:48:58] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-03 03:48:58] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 2 ms to minimize.
[2024-06-03 03:48:58] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-06-03 03:48:58] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 3 ms to minimize.
[2024-06-03 03:48:58] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 1 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 1 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 1 ms to minimize.
[2024-06-03 03:48:59] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-03 03:49:00] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-06-03 03:49:00] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-06-03 03:49:00] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:01] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 3 ms to minimize.
[2024-06-03 03:49:01] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:49:01] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 4 ms to minimize.
[2024-06-03 03:49:01] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-03 03:49:02] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-03 03:49:02] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2024-06-03 03:49:02] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/382 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:05] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:07] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:11] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:15] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 13 (OVERLAPS) 0/382 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 160 constraints, problems are : Problem set: 0 solved, 259 unsolved in 28681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:25] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-06-03 03:49:25] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/382 variables, 122/162 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 259/421 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-03 03:49:31] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-06-03 03:49:31] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-03 03:49:31] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 3 ms to minimize.
[2024-06-03 03:49:32] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/382 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 425 constraints, problems are : Problem set: 0 solved, 259 unsolved in 24633 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 33/33 constraints]
After SMT, in 53457ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 53462ms
Starting structural reductions in LTL mode, iteration 1 : 122/173 places, 260/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53862 ms. Remains : 122/173 places, 260/375 transitions.
[2024-06-03 03:49:48] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:49:48] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:49:48] [INFO ] Input system was already deterministic with 260 transitions.
[2024-06-03 03:49:48] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:49:48] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:49:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2821614289957094335.gal : 3 ms
[2024-06-03 03:49:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3731443242682423869.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/CTLCardinality2821614289957094335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3731443242682423869.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-06-03 03:50:18] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:50:18] [INFO ] Applying decomposition
[2024-06-03 03:50:18] [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/graph7160353284962275302.txt' '-o' '/tmp/graph7160353284962275302.bin' '-w' '/tmp/graph7160353284962275302.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7160353284962275302.bin' '-l' '-1' '-v' '-w' '/tmp/graph7160353284962275302.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:50:18] [INFO ] Decomposing Gal with order
[2024-06-03 03:50:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:50:18] [INFO ] Removed a total of 376 redundant transitions.
[2024-06-03 03:50:18] [INFO ] Flatten gal took : 21 ms
[2024-06-03 03:50:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2024-06-03 03:50:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14397954032893497997.gal : 3 ms
[2024-06-03 03:50:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17912304036345767840.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/CTLCardinality14397954032893497997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17912304036345767840.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,9.58067e+08,2.33626,49896,1020,54,83622,512,490,151263,79,1271,0


Converting to forward existential form...Done !
original formula: EX(E(!(((i5.u22.p202==0)||(i5.u25.p229==1))) U !(EF(((((i8.u2.p7==0)||(i5.u19.p208==1))&&((i7.u28.p249==0)||(i6.u27.p243==1)))&&(i2.u9.p5...165
=> equivalent forward existential formula: [(FwdU(EY(Init),!(((i5.u22.p202==0)||(i5.u25.p229==1)))) * !(E(TRUE U ((((i8.u2.p7==0)||(i5.u19.p208==1))&&((i7....217
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t16, t45, t98, t100, t173, t174, t175, t177, t178, t179, t187, t188, t189, t190, t191...718
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 134 transition count 306
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 134 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 134 transition count 300
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 98 place count 120 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 112 place count 120 transition count 266
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 120 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 116 transition count 252
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 116 transition count 252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 116 transition count 249
Applied a total of 127 rules in 8 ms. Remains 116 /173 variables (removed 57) and now considering 249/375 (removed 126) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-03 03:50:48] [INFO ] Computed 11 invariants in 8 ms
[2024-06-03 03:50:48] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-03 03:50:48] [INFO ] Invariant cache hit.
[2024-06-03 03:50:49] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-03 03:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 3 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 1 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 3 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-06-03 03:50:52] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 3 ms to minimize.
[2024-06-03 03:50:53] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-06-03 03:50:53] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:50:53] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:50:55] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 6 ms to minimize.
[2024-06-03 03:50:55] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-06-03 03:50:55] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-06-03 03:50:55] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:50:57] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:50:57] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:50:57] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-06-03 03:50:57] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2024-06-03 03:50:58] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-06-03 03:50:58] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
[2024-06-03 03:50:59] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:03] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/365 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/365 variables, 116/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 248/400 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-03 03:51:24] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-06-03 03:51:25] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:51:25] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2024-06-03 03:51:25] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-06-03 03:51:25] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-06-03 03:51:26] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 406 constraints, problems are : Problem set: 0 solved, 248 unsolved in 21993 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 31/31 constraints]
After SMT, in 52132ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 52136ms
Starting structural reductions in LTL mode, iteration 1 : 116/173 places, 249/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52807 ms. Remains : 116/173 places, 249/375 transitions.
[2024-06-03 03:51:41] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:51:41] [INFO ] Flatten gal took : 10 ms
[2024-06-03 03:51:41] [INFO ] Input system was already deterministic with 249 transitions.
[2024-06-03 03:51:41] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:51:41] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:51:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality622827557802691104.gal : 3 ms
[2024-06-03 03:51:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7467112926564851891.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/CTLCardinality622827557802691104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7467112926564851891.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,24.1364,392388,2,17357,5,1.19708e+06,6,0,715,1.74293e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.17259e+08,0.499661,15976,470,108,24393,1764,431,36716,121,4284,0


Converting to forward existential form...Done !
original formula: EF(AX((i5.u10.p150==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((i5.u10.p150==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t91, t93, t165, t166, t167, t169, t170, t171, t194, t195, t196, t198, t199, t20...569
(forward)formula 0,1,0.764943,16504,1,0,24393,2399,2088,43952,622,9470,71738
FORMULA MedleyA-PT-20-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 138 transition count 312
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 138 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 138 transition count 306
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 89 place count 125 transition count 275
Iterating global reduction 1 with 13 rules applied. Total rules applied 102 place count 125 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 125 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 121 transition count 261
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 121 transition count 261
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 121 transition count 258
Applied a total of 117 rules in 8 ms. Remains 121 /173 variables (removed 52) and now considering 258/375 (removed 117) transitions.
// Phase 1: matrix 258 rows 121 cols
[2024-06-03 03:52:12] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:52:12] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 03:52:12] [INFO ] Invariant cache hit.
[2024-06-03 03:52:13] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-03 03:52:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 3 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 3 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-06-03 03:52:16] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-06-03 03:52:17] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-06-03 03:52:17] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-06-03 03:52:17] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-03 03:52:20] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2024-06-03 03:52:20] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 3 ms to minimize.
[2024-06-03 03:52:20] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-03 03:52:22] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:52:22] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-06-03 03:52:22] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 3 ms to minimize.
[2024-06-03 03:52:22] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-03 03:52:24] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2024-06-03 03:52:24] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-06-03 03:52:24] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-06-03 03:52:24] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 258/379 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 155 constraints, problems are : Problem set: 0 solved, 257 unsolved in 22862 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-03 03:52:38] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 3 ms to minimize.
[2024-06-03 03:52:38] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 258/379 variables, 121/157 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 257/414 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-06-03 03:52:43] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 3 ms to minimize.
[2024-06-03 03:52:44] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-03 03:52:44] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 2 ms to minimize.
[2024-06-03 03:52:44] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-06-03 03:52:44] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 2 ms to minimize.
[2024-06-03 03:52:45] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 7/421 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 421 constraints, problems are : Problem set: 0 solved, 257 unsolved in 27894 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 32/32 constraints]
After SMT, in 50910ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 50915ms
Starting structural reductions in LTL mode, iteration 1 : 121/173 places, 258/375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51507 ms. Remains : 121/173 places, 258/375 transitions.
[2024-06-03 03:53:03] [INFO ] Flatten gal took : 11 ms
[2024-06-03 03:53:03] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:53:03] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-03 03:53:03] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:53:03] [INFO ] Flatten gal took : 5 ms
[2024-06-03 03:53:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality4399993970421063165.gal : 1 ms
[2024-06-03 03:53:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality3631000323853865110.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/CTLCardinality4399993970421063165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3631000323853865110.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-06-03 03:53:34] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:53:34] [INFO ] Applying decomposition
[2024-06-03 03:53:34] [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/graph8808621475451458174.txt' '-o' '/tmp/graph8808621475451458174.bin' '-w' '/tmp/graph8808621475451458174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8808621475451458174.bin' '-l' '-1' '-v' '-w' '/tmp/graph8808621475451458174.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:53:34] [INFO ] Decomposing Gal with order
[2024-06-03 03:53:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:53:34] [INFO ] Removed a total of 385 redundant transitions.
[2024-06-03 03:53:34] [INFO ] Flatten gal took : 19 ms
[2024-06-03 03:53:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 1 ms.
[2024-06-03 03:53:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3575927089175990538.gal : 3 ms
[2024-06-03 03:53:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality8845772528840165807.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/CTLCardinality3575927089175990538.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8845772528840165807.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02592e+09,2.10941,40080,818,53,66246,615,495,128017,102,1177,0


Converting to forward existential form...Done !
original formula: AG(AX(AF((EX(((u6.p22==0)&&(i8.u30.p248==1))) + ((i2.u13.p42==0)&&(i2.u13.p74==0))))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!((EX(((u6.p22==0)&&(i8.u30.p248==1))) + ((i2.u13.p42==0)&&(i2.u13.p74==0)))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t42, t96, t171, t172, t173, t174, t175, t176, t177, t178, t179, t180, t181, t207, t2...613
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,2.87989,40080,1,0,66246,1265,2544,128017,512,5526,167759
FORMULA MedleyA-PT-20-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 375/375 transitions.
Graph (trivial) has 131 edges and 173 vertex of which 20 / 173 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 155 transition count 343
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 151 transition count 341
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 11 place count 151 transition count 337
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 147 transition count 337
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 49 place count 117 transition count 284
Iterating global reduction 2 with 30 rules applied. Total rules applied 79 place count 117 transition count 284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 117 transition count 279
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 116 transition count 278
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 86 place count 116 transition count 274
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 94 place count 112 transition count 274
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 110 transition count 268
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 110 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 110 transition count 266
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 126 place count 97 transition count 253
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 133 place count 90 transition count 232
Iterating global reduction 5 with 7 rules applied. Total rules applied 140 place count 90 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 144 place count 90 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 149 place count 90 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 155 place count 87 transition count 220
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 157 place count 85 transition count 214
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 85 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 161 place count 85 transition count 212
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 163 place count 85 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 165 place count 83 transition count 210
Applied a total of 165 rules in 104 ms. Remains 83 /173 variables (removed 90) and now considering 210/375 (removed 165) transitions.
[2024-06-03 03:53:37] [INFO ] Flow matrix only has 202 transitions (discarded 8 similar events)
// Phase 1: matrix 202 rows 83 cols
[2024-06-03 03:53:37] [INFO ] Computed 11 invariants in 2 ms
[2024-06-03 03:53:37] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-03 03:53:37] [INFO ] Flow matrix only has 202 transitions (discarded 8 similar events)
[2024-06-03 03:53:37] [INFO ] Invariant cache hit.
[2024-06-03 03:53:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 03:53:37] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-06-03 03:53:37] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2024-06-03 03:53:37] [INFO ] Flow matrix only has 202 transitions (discarded 8 similar events)
[2024-06-03 03:53:37] [INFO ] Invariant cache hit.
[2024-06-03 03:53:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 2/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-03 03:53:41] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-03 03:53:42] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-03 03:53:42] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 201/284 variables, 83/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/284 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/285 variables, and 98 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11350 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 2/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 201/284 variables, 83/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 181/279 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-03 03:53:56] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/284 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (OVERLAPS) 0/284 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/285 variables, and 280 constraints, problems are : Problem set: 0 solved, 181 unsolved in 13769 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 4/4 constraints]
After SMT, in 25242ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 25245ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/173 places, 210/375 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25761 ms. Remains : 83/173 places, 210/375 transitions.
[2024-06-03 03:54:02] [INFO ] Flatten gal took : 12 ms
[2024-06-03 03:54:02] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:54:02] [INFO ] Input system was already deterministic with 210 transitions.
[2024-06-03 03:54:02] [INFO ] Flatten gal took : 7 ms
[2024-06-03 03:54:02] [INFO ] Flatten gal took : 6 ms
[2024-06-03 03:54:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5045539199305208117.gal : 5 ms
[2024-06-03 03:54:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality12677213393099442392.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/CTLCardinality5045539199305208117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12677213393099442392.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.46547e+07,4.93193,101576,2,9910,5,308386,6,0,541,389689,0


Converting to forward existential form...Done !
original formula: EF((((((p241==0)&&(p252==1))&&((p206==0)||(p48==1))) + (AF((p145==1)) * (((p226==0)&&(p92==1))||((p114==0)&&(p31==1))))) + (AF((p15==0)) ...168
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (((p241==0)&&(p252==1))&&((p206==0)||(p48==1))))] != FALSE + [((FwdU(Init,TRUE) * (((p226=...294
(forward)formula 0,1,4.9466,101576,1,0,7,308386,8,1,553,389689,1
FORMULA MedleyA-PT-20-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 03:54:07] [INFO ] Flatten gal took : 9 ms
[2024-06-03 03:54:07] [INFO ] Flatten gal took : 8 ms
[2024-06-03 03:54:07] [INFO ] Applying decomposition
[2024-06-03 03:54:07] [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/graph7251946024958226643.txt' '-o' '/tmp/graph7251946024958226643.bin' '-w' '/tmp/graph7251946024958226643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7251946024958226643.bin' '-l' '-1' '-v' '-w' '/tmp/graph7251946024958226643.weights' '-q' '0' '-e' '0.001'
[2024-06-03 03:54:07] [INFO ] Decomposing Gal with order
[2024-06-03 03:54:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:54:07] [INFO ] Removed a total of 567 redundant transitions.
[2024-06-03 03:54:07] [INFO ] Flatten gal took : 24 ms
[2024-06-03 03:54:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2024-06-03 03:54:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3860840436880148999.gal : 4 ms
[2024-06-03 03:54:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2869417218894974336.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/CTLCardinality3860840436880148999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2869417218894974336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1623e+10,51.061,942152,7271,411,1.60785e+06,7375,787,2.82122e+06,141,28434,0


Converting to forward existential form...Done !
original formula: (EX(AF(((i7.u35.p217==0)&&(i5.u21.p100==1)))) + AG((EX((u4.p17==0)) * EF((i0.u3.p13==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(EX(!(EG(!(((i7.u35.p217==0)&&(i5.u21.p100==1)))))))),TRUE) * !(EX((u4.p17==0))))] = FALSE * [(...269
Reverse transition relation is NOT exact ! Due to transitions t1, t21, t141, t145, t158, t160, t169, t171, t172, t173, t174, t193, t195, t196, t197, t198, ...1364
ITS-tools command line returned an error code 139
[2024-06-03 03:57:45] [INFO ] Applying decomposition
[2024-06-03 03:57:45] [INFO ] Flatten gal took : 12 ms
[2024-06-03 03:57:45] [INFO ] Decomposing Gal with order
[2024-06-03 03:57:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 03:57:45] [INFO ] Removed a total of 400 redundant transitions.
[2024-06-03 03:57:45] [INFO ] Flatten gal took : 21 ms
[2024-06-03 03:57:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 6 ms.
[2024-06-03 03:57:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality14520577804205366297.gal : 2 ms
[2024-06-03 03:57:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1789169299994787261.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/CTLCardinality14520577804205366297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1789169299994787261.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1623e+10,190.812,3985540,4977,4132,5.95814e+06,123889,331,2.83621e+07,402,5.18054e+06,0


Converting to forward existential form...Done !
original formula: (EX(AF(((i0.i1.u13.p217==0)&&(i0.i1.i0.u12.p100==1)))) + AG((EX((i0.i0.i1.i0.u6.p17==0)) * EF((i0.i0.i1.i0.u19.p13==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(EX(!(EG(!(((i0.i1.u13.p217==0)&&(i0.i1.i0.u12.p100==1)))))))),TRUE) * !(EX((i0.i0.i1.i0.u6.p17...309
Reverse transition relation is NOT exact ! Due to transitions t160, t170, t225, t239, i0.t364, i0.t363, i0.t324, i0.t311, i0.i0.t141, i0.i0.u3.t151, i0.i0....1045
ITS-tools command line returned an error code 137
[2024-06-03 04:17:49] [INFO ] Flatten gal took : 11 ms
[2024-06-03 04:17:49] [INFO ] Input system was already deterministic with 375 transitions.
[2024-06-03 04:17:49] [INFO ] Transformed 173 places.
[2024-06-03 04:17:49] [INFO ] Transformed 375 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-06-03 04:17:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality15214401901426882924.gal : 3 ms
[2024-06-03 04:17:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7458913971365006424.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/CTLCardinality15214401901426882924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7458913971365006424.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1623e+10,1003.92,13427260,2,269417,5,3.81983e+07,6,0,1069,5.42038e+07,0


Converting to forward existential form...Done !

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="MedleyA-PT-20"
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 MedleyA-PT-20, 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 r576-smll-171734920100153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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