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.r180-tall-171640602400009.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 FlexibleBarrier-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602400009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716415982221

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 22:13:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:13:03] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 22:13:03] [INFO ] Transformed 268 places.
[2024-05-22 22:13:03] [INFO ] Transformed 305 transitions.
[2024-05-22 22:13:03] [INFO ] Found NUPN structural information;
[2024-05-22 22:13:03] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 90 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 225 transition count 262
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 225 transition count 262
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 97 place count 214 transition count 251
Iterating global reduction 0 with 11 rules applied. Total rules applied 108 place count 214 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 211 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 211 transition count 248
Applied a total of 114 rules in 51 ms. Remains 211 /268 variables (removed 57) and now considering 248/305 (removed 57) transitions.
// Phase 1: matrix 248 rows 211 cols
[2024-05-22 22:13:03] [INFO ] Computed 6 invariants in 18 ms
[2024-05-22 22:13:04] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 22:13:04] [INFO ] Invariant cache hit.
[2024-05-22 22:13:04] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-22 22:13:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 18 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 2 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 3 ms to minimize.
[2024-05-22 22:13:06] [INFO ] Deduced a trap composed of 124 places in 60 ms of which 2 ms to minimize.
[2024-05-22 22:13:07] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:13:07] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 2 ms to minimize.
[2024-05-22 22:13:07] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 2 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:13:08] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 2 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:13:09] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:10] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:13:10] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:13:11] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:12] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:13:12] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:13:12] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:13:12] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 2 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 2 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 2 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 112 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 248/459 variables, 211/266 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 266 constraints, problems are : Problem set: 0 solved, 247 unsolved in 17186 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 133 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:13:26] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:13:26] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:27] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 248/459 variables, 211/272 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 247/519 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:29] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 2 ms to minimize.
[2024-05-22 22:13:29] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:13:30] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:13:31] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:33] [INFO ] Deduced a trap composed of 131 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:13:34] [INFO ] Deduced a trap composed of 132 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:43] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/459 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-22 22:13:48] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 527 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 63/63 constraints]
After SMT, in 47309ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 47323ms
Starting structural reductions in LTL mode, iteration 1 : 211/268 places, 248/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47816 ms. Remains : 211/268 places, 248/305 transitions.
Support contains 90 out of 211 places after structural reductions.
[2024-05-22 22:13:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 22:13:51] [INFO ] Flatten gal took : 44 ms
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:13:51] [INFO ] Flatten gal took : 29 ms
[2024-05-22 22:13:51] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 83 out of 211 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (951 resets) in 2058 ms. (19 steps per ms) remains 6/59 properties
BEST_FIRST walk for 40004 steps (177 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (170 resets) in 75 ms. (526 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (182 resets) in 84 ms. (470 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (178 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (170 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
[2024-05-22 22:13:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 131/138 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 73/211 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 248/459 variables, 211/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/459 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 217 constraints, problems are : Problem set: 0 solved, 4 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 131/138 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 73/211 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 248/459 variables, 211/217 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 3/220 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/459 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 220 constraints, problems are : Problem set: 1 solved, 3 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 494ms problems are : Problem set: 1 solved, 3 unsolved
Finished Parikh walk after 4861 steps, including 106 resets, run visited all 2 properties in 33 ms. (steps per millisecond=147 )
Parikh walk visited 3 properties in 241 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 22:13:53] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:13:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:13:53] [INFO ] Flatten gal took : 25 ms
[2024-05-22 22:13:53] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 78 out of 211 places (down from 80) after GAL structural reductions.
Computed a total of 14 stabilizing places and 14 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 168 transition count 205
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 168 transition count 205
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 105 place count 149 transition count 186
Iterating global reduction 0 with 19 rules applied. Total rules applied 124 place count 149 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 127 place count 149 transition count 183
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 136 place count 140 transition count 174
Iterating global reduction 1 with 9 rules applied. Total rules applied 145 place count 140 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 150 place count 140 transition count 169
Applied a total of 150 rules in 29 ms. Remains 140 /211 variables (removed 71) and now considering 169/248 (removed 79) transitions.
// Phase 1: matrix 169 rows 140 cols
[2024-05-22 22:13:53] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 22:13:53] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 22:13:53] [INFO ] Invariant cache hit.
[2024-05-22 22:13:53] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-22 22:13:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/309 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 146 constraints, problems are : Problem set: 0 solved, 168 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/309 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 168/314 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:13:58] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-22 22:13:59] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:13:59] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:13:59] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:13:59] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:13:59] [INFO ] Deduced a trap composed of 88 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/320 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:14:01] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-05-22 22:14:01] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 322 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8595 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
After SMT, in 12457ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 12464ms
Starting structural reductions in LTL mode, iteration 1 : 140/211 places, 169/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12691 ms. Remains : 140/211 places, 169/248 transitions.
[2024-05-22 22:14:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:14:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:14:06] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-22 22:14:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:14:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:14:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14479842251423230129.gal : 10 ms
[2024-05-22 22:14:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality7179506425653776429.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/CTLCardinality14479842251423230129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7179506425653776429.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,3.69372e+07,1.56309,55044,2,8450,5,170716,6,0,731,313847,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(AX((p110==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!(EX(!((p110==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t16, t19, t23, t28, t32, t33, t44, t45, t47, t49, t54, t58, t59, t70, t73, t7...343
Detected timeout of ITS tools.
[2024-05-22 22:14:36] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:14:36] [INFO ] Applying decomposition
[2024-05-22 22:14:36] [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/graph3673462559263011627.txt' '-o' '/tmp/graph3673462559263011627.bin' '-w' '/tmp/graph3673462559263011627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3673462559263011627.bin' '-l' '-1' '-v' '-w' '/tmp/graph3673462559263011627.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:14:36] [INFO ] Decomposing Gal with order
[2024-05-22 22:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:14:36] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-22 22:14:36] [INFO ] Flatten gal took : 38 ms
[2024-05-22 22:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-22 22:14:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9828310906392194355.gal : 5 ms
[2024-05-22 22:14:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality548503956130754594.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/CTLCardinality9828310906392194355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality548503956130754594.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.69372e+07,0.12772,9124,626,144,10138,1143,486,18666,117,3913,0


Converting to forward existential form...Done !
original formula: AG(EF(AG(AX((i5.i1.u23.p110==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!(EX(!((i5.i1.u23.p110==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t19, t44, t58, t73, t143, t144, t145, u41.t6, u41.t16, i0.t109, i0.u4.t114, i1.i0.u3.t100...548
(forward)formula 0,1,4.89796,165676,1,0,251556,19434,2562,651695,510,51350,497016
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 175 transition count 212
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 175 transition count 212
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 88 place count 159 transition count 196
Iterating global reduction 0 with 16 rules applied. Total rules applied 104 place count 159 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 159 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 113 place count 151 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 121 place count 151 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 126 place count 151 transition count 182
Applied a total of 126 rules in 11 ms. Remains 151 /211 variables (removed 60) and now considering 182/248 (removed 66) transitions.
// Phase 1: matrix 182 rows 151 cols
[2024-05-22 22:14:41] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 22:14:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 22:14:41] [INFO ] Invariant cache hit.
[2024-05-22 22:14:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 22:14:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 22:14:42] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/333 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 0/333 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 158 constraints, problems are : Problem set: 0 solved, 181 unsolved in 4807 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/333 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 181/339 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 22:14:47] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-22 22:14:48] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:14:48] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:14:48] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:14:48] [INFO ] Deduced a trap composed of 94 places in 41 ms of which 1 ms to minimize.
[2024-05-22 22:14:48] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:14:48] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:14:49] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 2 ms to minimize.
[2024-05-22 22:14:49] [INFO ] Deduced a trap composed of 111 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:14:49] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 4 ms to minimize.
[2024-05-22 22:14:49] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 1 ms to minimize.
[2024-05-22 22:14:49] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 12/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 22:14:50] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 22:14:51] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:14:53] [INFO ] Deduced a trap composed of 88 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 354 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11408 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 16/16 constraints]
After SMT, in 16242ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 16244ms
Starting structural reductions in LTL mode, iteration 1 : 151/211 places, 182/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16491 ms. Remains : 151/211 places, 182/248 transitions.
[2024-05-22 22:14:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:14:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:14:58] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 22:14:58] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:14:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:14:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality10572998220388838186.gal : 2 ms
[2024-05-22 22:14:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14534979507128971038.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/CTLCardinality10572998220388838186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14534979507128971038.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.14204e+07,2.81739,92676,2,17887,5,301265,6,0,788,513146,0


Converting to forward existential form...Done !
original formula: EF((A((E(((p192==0)||(p128==1)) U (((p48==0)||(p157==1))&&(p168==1))) + A(EX((p233==0)) U ((p222==1)&&((p241==0)||(p265==1))))) U EG((p26...191
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((E(!(EG((p261==0))) U (!((E(((p192==0)||(p128==1)) U (((p48==0)||(p157==1))&&(p168==1)))...733
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t11, t15, t18, t23, t24, t26, t30, t33, t35, t39, t40, t46, t53, t56,...398
Detected timeout of ITS tools.
[2024-05-22 22:15:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:15:28] [INFO ] Applying decomposition
[2024-05-22 22:15:28] [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/graph2039652798933821374.txt' '-o' '/tmp/graph2039652798933821374.bin' '-w' '/tmp/graph2039652798933821374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2039652798933821374.bin' '-l' '-1' '-v' '-w' '/tmp/graph2039652798933821374.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:15:28] [INFO ] Decomposing Gal with order
[2024-05-22 22:15:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:15:28] [INFO ] Removed a total of 71 redundant transitions.
[2024-05-22 22:15:28] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:15:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 22:15:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17140951474002920907.gal : 4 ms
[2024-05-22 22:15:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality15785544414785281306.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/CTLCardinality17140951474002920907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15785544414785281306.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,6.14204e+07,0.366248,17476,1021,230,24352,2657,521,49325,106,13552,0


Converting to forward existential form...Done !
original formula: EF((A((E(((i7.u39.p192==0)||(i5.i1.u26.p128==1)) U (((i1.i1.u12.p48==0)||(i5.i0.u33.p157==1))&&(i7.u41.p168==1))) + A(EX((i8.u43.p233==0)...289
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !((E(!(EG((i6.u46.p261==0))) U (!((E(((i7.u39.p192==0)||(i5.i1.u26.p128==1)) U (((i1.i1.u1...1022
Reverse transition relation is NOT exact ! Due to transitions t1, t39, t53, t63, t82, t83, t110, t155, t156, t157, i0.i1.u5.t125, i0.i1.u6.t124, i0.i2.t120...660
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 1
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,1,18.8878,613132,1,0,987183,16128,3054,2.31768e+06,544,130790,1576216
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 191 edges and 211 vertex of which 25 / 211 are part of one of the 4 SCC in 2 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 179
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 143 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 93 place count 143 transition count 168
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 115 place count 132 transition count 168
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 153 place count 94 transition count 130
Iterating global reduction 2 with 38 rules applied. Total rules applied 191 place count 94 transition count 130
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 191 place count 94 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 193 place count 93 transition count 129
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 86 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 86 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 214 place count 86 transition count 115
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 3 with 26 rules applied. Total rules applied 240 place count 73 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 241 place count 72 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 242 place count 72 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 72 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 72 transition count 96
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 72 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 70 transition count 94
Applied a total of 250 rules in 56 ms. Remains 70 /211 variables (removed 141) and now considering 94/248 (removed 154) transitions.
[2024-05-22 22:15:47] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 70 cols
[2024-05-22 22:15:47] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:15:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 22:15:47] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2024-05-22 22:15:47] [INFO ] Invariant cache hit.
[2024-05-22 22:15:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-22 22:15:47] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-22 22:15:47] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2024-05-22 22:15:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-22 22:15:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 22:15:47] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 90/160 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/161 variables, and 78 constraints, problems are : Problem set: 0 solved, 63 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 4/70 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 90/160 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 63/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/160 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/161 variables, and 141 constraints, problems are : Problem set: 0 solved, 63 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/211 places, 94/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1970 ms. Remains : 70/211 places, 94/248 transitions.
[2024-05-22 22:15:49] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:15:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:15:49] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-22 22:15:49] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:15:49] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:15:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality3484591174872740982.gal : 1 ms
[2024-05-22 22:15:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality5605040753312458479.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/CTLCardinality3484591174872740982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5605040753312458479.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,850500,0.038817,5292,2,446,5,7422,6,0,373,6859,0


Converting to forward existential form...Done !
original formula: E(AF(((p102==0)||(p226==1))) U EG((p180==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(((p102==0)||(p226==1)))))),(p180==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t25, t46, t68, t73, Intersection with reachable at each step enabled. (destroyed/reverse...183
Hit Full ! (commute/partial/dont) 92/0/2
(forward)formula 0,1,0.649318,30868,1,0,256,128225,219,151,2324,171829,357
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 171 transition count 208
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 171 transition count 208
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 97 place count 154 transition count 191
Iterating global reduction 0 with 17 rules applied. Total rules applied 114 place count 154 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 116 place count 154 transition count 189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 124 place count 146 transition count 181
Iterating global reduction 1 with 8 rules applied. Total rules applied 132 place count 146 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 137 place count 146 transition count 176
Applied a total of 137 rules in 11 ms. Remains 146 /211 variables (removed 65) and now considering 176/248 (removed 72) transitions.
// Phase 1: matrix 176 rows 146 cols
[2024-05-22 22:15:49] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:15:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 22:15:49] [INFO ] Invariant cache hit.
[2024-05-22 22:15:49] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 22:15:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/322 variables, 146/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 152 constraints, problems are : Problem set: 0 solved, 175 unsolved in 3545 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/322 variables, 146/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 175/327 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 22:15:54] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 96 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 22:15:57] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 334 constraints, problems are : Problem set: 0 solved, 175 unsolved in 8254 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 7/7 constraints]
After SMT, in 11823ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 11825ms
Starting structural reductions in LTL mode, iteration 1 : 146/211 places, 176/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11955 ms. Remains : 146/211 places, 176/248 transitions.
[2024-05-22 22:16:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:16:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:16:01] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-22 22:16:01] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:16:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:16:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality6462367386036890815.gal : 1 ms
[2024-05-22 22:16:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality18272626105544732198.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/CTLCardinality6462367386036890815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18272626105544732198.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,4.71683e+07,1.57126,60448,2,9700,5,190149,6,0,762,337421,0


Converting to forward existential form...Done !
original formula: (AF(((p245==0) * EF(!(E((p86==0) U ((p81==0)||(p246==1))))))) + EX((((p150==0)&&(p244==0))&&(p116==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EX((((p150==0)&&(p244==0))&&(p116==1))))),!(((p245==0) * E(TRUE U !(E((p86==0) U ((p81==0)||(p24...176
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t10, t20, t23, t27, t32, t36, t37, t49, t50, t52, t54, t59, t63, t64, t73, t7...348
(forward)formula 0,0,8.60242,248168,1,0,340,1.07658e+06,381,159,4715,1.29071e+06,389
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 193 edges and 211 vertex of which 25 / 211 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 189 transition count 177
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 141 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 140 transition count 176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 99 place count 140 transition count 165
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 121 place count 129 transition count 165
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 160 place count 90 transition count 126
Iterating global reduction 3 with 39 rules applied. Total rules applied 199 place count 90 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 199 place count 90 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 88 transition count 124
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 81 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 81 transition count 117
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 224 place count 81 transition count 110
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 246 place count 70 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 247 place count 69 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 248 place count 69 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 69 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 253 place count 69 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 255 place count 67 transition count 91
Applied a total of 255 rules in 29 ms. Remains 67 /211 variables (removed 144) and now considering 91/248 (removed 157) transitions.
[2024-05-22 22:16:10] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 67 cols
[2024-05-22 22:16:10] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:16:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 22:16:10] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-22 22:16:10] [INFO ] Invariant cache hit.
[2024-05-22 22:16:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-22 22:16:10] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 22:16:10] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-22 22:16:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 4/67 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 87/154 variables, 67/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/154 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/155 variables, and 73 constraints, problems are : Problem set: 0 solved, 60 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 4/67 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 87/154 variables, 67/73 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 60/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/154 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/155 variables, and 133 constraints, problems are : Problem set: 0 solved, 60 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 1482ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1486ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/211 places, 91/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1646 ms. Remains : 67/211 places, 91/248 transitions.
[2024-05-22 22:16:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:16:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:16:12] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-22 22:16:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:16:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:16:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality1443930446828312143.gal : 1 ms
[2024-05-22 22:16:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11955181555054913236.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/CTLCardinality1443930446828312143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11955181555054913236.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,713440,0.03047,4744,2,327,5,6750,6,0,358,4873,0


Converting to forward existential form...Done !
original formula: E(((p67==0)||(p137==1)) U AG((p186==0)))
=> equivalent forward existential formula: [(FwdU(Init,((p67==0)||(p137==1))) * !(E(TRUE U !((p186==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 87/0/4
(forward)formula 0,1,0.367251,19276,1,0,12,97642,22,3,1766,61657,8
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 169 transition count 206
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 169 transition count 206
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 101 place count 152 transition count 189
Iterating global reduction 0 with 17 rules applied. Total rules applied 118 place count 152 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 152 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 129 place count 144 transition count 178
Iterating global reduction 1 with 8 rules applied. Total rules applied 137 place count 144 transition count 178
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 142 place count 144 transition count 173
Applied a total of 142 rules in 11 ms. Remains 144 /211 variables (removed 67) and now considering 173/248 (removed 75) transitions.
// Phase 1: matrix 173 rows 144 cols
[2024-05-22 22:16:12] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:16:12] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 22:16:12] [INFO ] Invariant cache hit.
[2024-05-22 22:16:12] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-22 22:16:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 22:16:13] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-22 22:16:13] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/317 variables, 144/152 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/317 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 152 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4475 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/317 variables, 144/152 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 172/324 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 22:16:18] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-05-22 22:16:18] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:16:18] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 107 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 89 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 8/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 22:16:20] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-22 22:16:21] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 22:16:22] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 335 constraints, problems are : Problem set: 0 solved, 172 unsolved in 9850 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 13/13 constraints]
After SMT, in 14354ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 14357ms
Starting structural reductions in LTL mode, iteration 1 : 144/211 places, 173/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14487 ms. Remains : 144/211 places, 173/248 transitions.
[2024-05-22 22:16:27] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:16:27] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:16:27] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-22 22:16:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:16:27] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:16:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality6782595281925263974.gal : 2 ms
[2024-05-22 22:16:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality3371511843736018506.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/CTLCardinality6782595281925263974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3371511843736018506.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(E(EX(((p216==0)||(p56==1))) U !(E((EF((p92==1)) + (p50!=1)) U EF((p93==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(EX(((p216==0)||(p56==1))) U !(E((E(TRUE U (p92==1)) + (p50!=1)) U E(TRUE U (p93==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t15, t19, t22, t26, t31, t35, t36, t48, t49, t51, t53, t58, t62, t63, t75, t7...350
Detected timeout of ITS tools.
[2024-05-22 22:16:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:16:57] [INFO ] Applying decomposition
[2024-05-22 22:16:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6048529961950552038.txt' '-o' '/tmp/graph6048529961950552038.bin' '-w' '/tmp/graph6048529961950552038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6048529961950552038.bin' '-l' '-1' '-v' '-w' '/tmp/graph6048529961950552038.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:16:57] [INFO ] Decomposing Gal with order
[2024-05-22 22:16:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:16:57] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-22 22:16:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:16:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:16:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13875012004534662910.gal : 3 ms
[2024-05-22 22:16:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality1537859869789865708.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/CTLCardinality13875012004534662910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1537859869789865708.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.29451e+07,0.173716,10816,611,177,13475,2668,485,22434,115,7246,0


Converting to forward existential form...Done !
original formula: EG(E(EX(((i8.u45.p216==0)||(i3.i1.u15.p56==1))) U !(E((EF((i2.u19.p92==1)) + (i0.i0.u12.p50!=1)) U EF((i3.i2.u20.p93==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(EX(((i8.u45.p216==0)||(i3.i1.u15.p56==1))) U !(E((E(TRUE U (i2.u19.p92==1)) + (i0.i0.u12.p50!=1)) U...198
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t48, t49, t75, t102, t146, t147, t148, t149, i0.i0.t105, i0.i0.u3.t106, i0.i1.u11.t1...558
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
(forward)formula 0,0,2.61358,98464,1,0,157785,8018,2712,334459,553,41776,311133
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 193 edges and 211 vertex of which 25 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 179
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 143 transition count 179
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 93 place count 143 transition count 168
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 115 place count 132 transition count 168
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 155 place count 92 transition count 128
Iterating global reduction 2 with 40 rules applied. Total rules applied 195 place count 92 transition count 128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 195 place count 92 transition count 126
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 90 transition count 126
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 84 transition count 120
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 84 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 217 place count 84 transition count 114
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 241 place count 72 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 70 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 70 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 247 place count 70 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 251 place count 70 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 253 place count 68 transition count 92
Applied a total of 253 rules in 30 ms. Remains 68 /211 variables (removed 143) and now considering 92/248 (removed 156) transitions.
[2024-05-22 22:16:59] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 68 cols
[2024-05-22 22:16:59] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:16:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 22:16:59] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-22 22:16:59] [INFO ] Invariant cache hit.
[2024-05-22 22:16:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-22 22:16:59] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-22 22:16:59] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-22 22:16:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 88/156 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/157 variables, and 74 constraints, problems are : Problem set: 0 solved, 61 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 4/68 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 88/156 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 61/135 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/156 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/157 variables, and 135 constraints, problems are : Problem set: 0 solved, 61 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1538ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1539ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/211 places, 92/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1679 ms. Remains : 68/211 places, 92/248 transitions.
[2024-05-22 22:17:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:17:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:17:01] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-22 22:17:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:01] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality9784505517812549399.gal : 1 ms
[2024-05-22 22:17:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality14128945278862164321.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/CTLCardinality9784505517812549399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14128945278862164321.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,760500,0.030689,4744,2,272,5,6525,6,0,363,4960,0


Converting to forward existential form...Done !
original formula: E(!(AF((p12==1))) U EF((p142==1)))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(!(EG(!((p12==1)))))),TRUE) * (p142==1))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 90/0/2
(forward)formula 0,1,0.749842,34836,1,0,78,147224,26,76,1829,201191,121
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 168 transition count 205
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 168 transition count 205
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 105 place count 149 transition count 186
Iterating global reduction 0 with 19 rules applied. Total rules applied 124 place count 149 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 127 place count 149 transition count 183
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 136 place count 140 transition count 174
Iterating global reduction 1 with 9 rules applied. Total rules applied 145 place count 140 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 150 place count 140 transition count 169
Applied a total of 150 rules in 6 ms. Remains 140 /211 variables (removed 71) and now considering 169/248 (removed 79) transitions.
// Phase 1: matrix 169 rows 140 cols
[2024-05-22 22:17:02] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 22:17:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 22:17:02] [INFO ] Invariant cache hit.
[2024-05-22 22:17:02] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-22 22:17:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:17:03] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:17:03] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/309 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 148 constraints, problems are : Problem set: 0 solved, 168 unsolved in 4192 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/309 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 168/316 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:17:07] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:17:08] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:17:08] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:17:08] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 0 ms to minimize.
[2024-05-22 22:17:08] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-22 22:17:10] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:17:10] [INFO ] Deduced a trap composed of 104 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 323 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8341 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 9/9 constraints]
After SMT, in 12553ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 12554ms
Starting structural reductions in LTL mode, iteration 1 : 140/211 places, 169/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12703 ms. Remains : 140/211 places, 169/248 transitions.
[2024-05-22 22:17:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:17:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:17:15] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-22 22:17:15] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:17:15] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:17:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality18023737261146866840.gal : 1 ms
[2024-05-22 22:17:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality16106349488589149876.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/CTLCardinality18023737261146866840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16106349488589149876.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,3.66033e+07,0.760221,31524,2,6094,5,115518,6,0,731,150805,0


Converting to forward existential form...Done !
original formula: AF(EX(((p31==0)||(p19==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((p31==0)||(p19==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t16, t19, t23, t28, t32, t33, t44, t45, t47, t49, t54, t58, t59, t71, t72, t7...337
(forward)formula 0,1,3.65811,112144,1,0,316,490336,360,145,4279,480624,358
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 194 edges and 211 vertex of which 25 / 211 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 189 transition count 178
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 142 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 141 transition count 177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 97 place count 141 transition count 165
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 121 place count 129 transition count 165
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 160 place count 90 transition count 126
Iterating global reduction 3 with 39 rules applied. Total rules applied 199 place count 90 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 199 place count 90 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 88 transition count 124
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 81 transition count 117
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 81 transition count 117
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 224 place count 81 transition count 110
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 246 place count 70 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 248 place count 68 transition count 97
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 68 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 252 place count 68 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 256 place count 68 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 66 transition count 89
Applied a total of 258 rules in 25 ms. Remains 66 /211 variables (removed 145) and now considering 89/248 (removed 159) transitions.
[2024-05-22 22:17:18] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 66 cols
[2024-05-22 22:17:18] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:17:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 22:17:18] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-22 22:17:18] [INFO ] Invariant cache hit.
[2024-05-22 22:17:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-22 22:17:18] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-22 22:17:18] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-22 22:17:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 85/151 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/152 variables, and 72 constraints, problems are : Problem set: 0 solved, 59 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 4/66 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 85/151 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 59/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/151 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/152 variables, and 131 constraints, problems are : Problem set: 0 solved, 59 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1412ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1413ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/211 places, 89/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1522 ms. Remains : 66/211 places, 89/248 transitions.
[2024-05-22 22:17:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:20] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-22 22:17:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3451716814839742360.gal : 1 ms
[2024-05-22 22:17:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality15511668104298082023.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/CTLCardinality3451716814839742360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15511668104298082023.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,659100,0.020183,4204,2,250,5,3809,6,0,352,2916,0


Converting to forward existential form...Done !
original formula: AG(EF(((p229==0)||(p84==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p229==0)||(p84==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.065689,6316,1,0,9,17673,14,3,1564,9279,5
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 182 edges and 211 vertex of which 25 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 189 transition count 184
Reduce places removed 41 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 148 transition count 181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 145 transition count 181
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 89 place count 145 transition count 171
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 109 place count 135 transition count 171
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 145 place count 99 transition count 135
Iterating global reduction 3 with 36 rules applied. Total rules applied 181 place count 99 transition count 135
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 181 place count 99 transition count 133
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 97 transition count 133
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 190 place count 92 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 195 place count 92 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 200 place count 92 transition count 123
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 222 place count 81 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 80 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 80 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 80 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 80 transition count 106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 80 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 78 transition count 104
Applied a total of 232 rules in 20 ms. Remains 78 /211 variables (removed 133) and now considering 104/248 (removed 144) transitions.
[2024-05-22 22:17:20] [INFO ] Flow matrix only has 100 transitions (discarded 4 similar events)
// Phase 1: matrix 100 rows 78 cols
[2024-05-22 22:17:20] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:17:20] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 22:17:20] [INFO ] Flow matrix only has 100 transitions (discarded 4 similar events)
[2024-05-22 22:17:20] [INFO ] Invariant cache hit.
[2024-05-22 22:17:20] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-22 22:17:20] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-22 22:17:20] [INFO ] Flow matrix only has 100 transitions (discarded 4 similar events)
[2024-05-22 22:17:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 22:17:20] [INFO ] Deduced a trap composed of 30 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 99/177 variables, 78/85 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 85 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1285 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 99/177 variables, 78/85 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 82/167 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-22 22:17:22] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 168 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1502 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 78/78 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
After SMT, in 2811ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 2811ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/211 places, 104/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2929 ms. Remains : 78/211 places, 104/248 transitions.
[2024-05-22 22:17:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:17:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:17:23] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-22 22:17:23] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:23] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15437054580609456994.gal : 0 ms
[2024-05-22 22:17:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1288820742565769759.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/CTLCardinality15437054580609456994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1288820742565769759.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.368e+06,0.05887,5884,2,559,5,11876,6,0,414,9673,0


Converting to forward existential form...Done !
original formula: A(EF((EF(!((((p61==1)||(p4==0))||(p58==1)))) + (A((p164!=1) U ((p147==1)&&(p93==1))) * (p178==0)))) U AG(!((((p130==0)||(p214==1)) * !(A(...180
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((((p130==0)||(p214==1)) * !(!((E(!((p23==0)) U (!((p95==1)) * !((p23==0)))) + EG...629
Reverse transition relation is NOT exact ! Due to transitions t10, t48, t81, t82, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,25.6844,811728,1,0,888,4.52548e+06,255,553,2689,5.36091e+06,1127
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 172 edges and 211 vertex of which 19 / 211 are part of one of the 3 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 195 transition count 190
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 154 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 153 transition count 189
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 85 place count 153 transition count 180
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 103 place count 144 transition count 180
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 134 place count 113 transition count 149
Iterating global reduction 3 with 31 rules applied. Total rules applied 165 place count 113 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 165 place count 113 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 169 place count 111 transition count 147
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 105 transition count 141
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 105 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 185 place count 105 transition count 137
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 217 place count 89 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 88 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 88 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 88 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 88 transition count 116
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 88 transition count 116
Applied a total of 225 rules in 26 ms. Remains 88 /211 variables (removed 123) and now considering 116/248 (removed 132) transitions.
[2024-05-22 22:17:49] [INFO ] Flow matrix only has 113 transitions (discarded 3 similar events)
// Phase 1: matrix 113 rows 88 cols
[2024-05-22 22:17:49] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 22:17:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 22:17:49] [INFO ] Flow matrix only has 113 transitions (discarded 3 similar events)
[2024-05-22 22:17:49] [INFO ] Invariant cache hit.
[2024-05-22 22:17:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-22 22:17:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-22 22:17:49] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-22 22:17:49] [INFO ] Flow matrix only has 113 transitions (discarded 3 similar events)
[2024-05-22 22:17:49] [INFO ] Invariant cache hit.
[2024-05-22 22:17:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-22 22:17:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 21/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 117 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 88/88 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/95 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 21/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 115/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 232 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 88/88 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 1/1 constraints]
After SMT, in 5952ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 5954ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/211 places, 116/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6091 ms. Remains : 88/211 places, 116/248 transitions.
[2024-05-22 22:17:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:17:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:55] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-22 22:17:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:55] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:17:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8836088095030324651.gal : 1 ms
[2024-05-22 22:17:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality5004493605752422001.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/CTLCardinality8836088095030324651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5004493605752422001.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,2.26847e+06,0.085933,7280,2,790,5,18295,6,0,467,14530,0


Converting to forward existential form...Done !
original formula: (EF(((((EF(((p163==0)&&(p149==1))) * (p105==0)) * (p50==1)) + (AF((p1==0)) * EG((p90==0)))) * A(!(((p141==0)||(p115==1))) U !(((p31==0)||...311
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (((E(TRUE U ((p163==0)&&(p149==1))) * (p105==0)) * (p50==1)) + (!(EG(!((p1==0)))) * EG((p...723
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t14, t19, t49, t83, t87, t92, t93, t94, t97, Intersection with reachable at each st...216
(forward)formula 0,1,9.6853,309224,1,0,754,1.806e+06,272,367,2916,1.78504e+06,869
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 170 transition count 207
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 170 transition count 207
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 99 place count 153 transition count 190
Iterating global reduction 0 with 17 rules applied. Total rules applied 116 place count 153 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 153 transition count 187
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 146 transition count 180
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 146 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 137 place count 146 transition count 176
Applied a total of 137 rules in 11 ms. Remains 146 /211 variables (removed 65) and now considering 176/248 (removed 72) transitions.
// Phase 1: matrix 176 rows 146 cols
[2024-05-22 22:18:05] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 22:18:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 22:18:05] [INFO ] Invariant cache hit.
[2024-05-22 22:18:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 22:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 22:18:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:18:06] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/322 variables, 146/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 154 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4483 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/322 variables, 146/154 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 175/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:18:11] [INFO ] Deduced a trap composed of 93 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 22:18:13] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:18:13] [INFO ] Deduced a trap composed of 109 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 22:18:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:18:14] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 338 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10253 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 11/11 constraints]
After SMT, in 14756ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 14757ms
Starting structural reductions in LTL mode, iteration 1 : 146/211 places, 176/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14898 ms. Remains : 146/211 places, 176/248 transitions.
[2024-05-22 22:18:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:18:19] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:18:19] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-22 22:18:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:18:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:18:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5558921088945020873.gal : 1 ms
[2024-05-22 22:18:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality5990584739741323184.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/CTLCardinality5558921088945020873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5990584739741323184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((AG(E(!((((p220==0)||(p42==1))&&(p194==1))) U (EF((p83==1)) + EX((p217==1))))) + (p60==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(!((((p220==0)||(p42==1))&&(p194==1))) U (E(TRUE U (p83==1)) + EX((p217==1))))))) + (p...173
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t13, t15, t19, t22, t26, t31, t35, t36, t47, t48, t50, t52, t57, t61, t62, t7...354
Detected timeout of ITS tools.
[2024-05-22 22:18:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:18:50] [INFO ] Applying decomposition
[2024-05-22 22:18:50] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7504563745653410947.txt' '-o' '/tmp/graph7504563745653410947.bin' '-w' '/tmp/graph7504563745653410947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7504563745653410947.bin' '-l' '-1' '-v' '-w' '/tmp/graph7504563745653410947.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:18:50] [INFO ] Decomposing Gal with order
[2024-05-22 22:18:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:18:50] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-22 22:18:50] [INFO ] Flatten gal took : 23 ms
[2024-05-22 22:18:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 22:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality10175230870592096101.gal : 2 ms
[2024-05-22 22:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9767824894413336070.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/CTLCardinality10175230870592096101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9767824894413336070.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.55079e+07,0.162789,10844,680,149,14099,1758,523,24057,117,4271,0


Converting to forward existential form...Done !
original formula: EG((AG(E(!((((i8.u44.p220==0)||(i2.i1.u9.p42==1))&&(i7.u42.p194==1))) U (EF((i4.i1.u20.p83==1)) + EX((i8.u45.p217==1))))) + (i4.i0.u16.p6...162
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(!((((i8.u44.p220==0)||(i2.i1.u9.p42==1))&&(i7.u42.p194==1))) U (E(TRUE U (i4.i1.u20.p...223
Reverse transition relation is NOT exact ! Due to transitions t1, t22, t47, t48, t74, t105, t148, t150, t151, i0.i1.u38.t35, i0.i1.u39.t36, i0.i1.u40.t31, ...575
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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,3.90554,151028,1,0,263248,7821,2823,575361,540,20360,482244
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 174 transition count 211
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 174 transition count 211
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 156 transition count 193
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 156 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 156 transition count 190
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 149 transition count 183
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 149 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 149 transition count 180
Applied a total of 130 rules in 13 ms. Remains 149 /211 variables (removed 62) and now considering 180/248 (removed 68) transitions.
// Phase 1: matrix 180 rows 149 cols
[2024-05-22 22:18:54] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:18:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 22:18:54] [INFO ] Invariant cache hit.
[2024-05-22 22:18:54] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-22 22:18:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 22:18:55] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 5 ms to minimize.
[2024-05-22 22:18:55] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 22:18:55] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:18:55] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/329 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 22:18:57] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 1 ms to minimize.
[2024-05-22 22:18:57] [INFO ] Deduced a trap composed of 116 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:18:57] [INFO ] Deduced a trap composed of 91 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 48 places in 38 ms of which 1 ms to minimize.
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 53 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/329 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 166 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8156 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/329 variables, 149/166 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 179/345 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-22 22:19:04] [INFO ] Deduced a trap composed of 116 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:19:04] [INFO ] Deduced a trap composed of 93 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 347 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7064 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 13/13 constraints]
After SMT, in 15241ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15244ms
Starting structural reductions in LTL mode, iteration 1 : 149/211 places, 180/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15388 ms. Remains : 149/211 places, 180/248 transitions.
[2024-05-22 22:19:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:19:09] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:19:09] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-22 22:19:09] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:19:09] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:19:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality472622098657637871.gal : 0 ms
[2024-05-22 22:19:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13518767075843760287.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/CTLCardinality472622098657637871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13518767075843760287.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(A((((p194==0)&&(p144==1))&&((p25==0)||(p202==1))) U EX((((p205==0)||(p106==1))&&((!((p39==0)||(p178==1)))||((p150==0)&&((p51==0)||(p162...214
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!(EX((((p205==0)||(p106==1))&&((!((p39==0)||(p178==1)))||((p150==0)&&((p51==0)||(p162==1)))...477
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t16, t18, t21, t25, t30, t35, t44, t48, t49, t51, t53, t58, t62, t63, t75, t7...366
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.2626,888392,1,0,775,4.02479e+06,401,447,4815,5.89449e+06,872
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 248/248 transitions.
Graph (trivial) has 193 edges and 211 vertex of which 25 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 179
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 143 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 142 transition count 178
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 95 place count 142 transition count 166
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 119 place count 130 transition count 166
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 158 place count 91 transition count 127
Iterating global reduction 3 with 39 rules applied. Total rules applied 197 place count 91 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 197 place count 91 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 90 transition count 126
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 206 place count 83 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 213 place count 83 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 220 place count 83 transition count 112
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 244 place count 71 transition count 100
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 246 place count 69 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 69 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 250 place count 69 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 254 place count 69 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 67 transition count 90
Applied a total of 256 rules in 15 ms. Remains 67 /211 variables (removed 144) and now considering 90/248 (removed 158) transitions.
[2024-05-22 22:19:38] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 67 cols
[2024-05-22 22:19:38] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 22:19:39] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 22:19:39] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-22 22:19:39] [INFO ] Invariant cache hit.
[2024-05-22 22:19:39] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-22 22:19:39] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-22 22:19:39] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-22 22:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 4/67 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-22 22:19:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 86/153 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/154 variables, and 74 constraints, problems are : Problem set: 0 solved, 60 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 4/67 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 86/153 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 60/134 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/154 variables, and 134 constraints, problems are : Problem set: 0 solved, 60 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 1/1 constraints]
After SMT, in 1642ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1643ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/211 places, 90/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1766 ms. Remains : 67/211 places, 90/248 transitions.
[2024-05-22 22:19:40] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:19:40] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:19:40] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-22 22:19:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:19:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:19:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6383860435368445595.gal : 1 ms
[2024-05-22 22:19:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality1745279947860918182.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/CTLCardinality6383860435368445595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1745279947860918182.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,781040,0.040112,5268,2,538,5,8896,6,0,357,6848,0


Converting to forward existential form...Done !
original formula: E((p259!=1) U AG(EF((p193!=1))))
=> equivalent forward existential formula: [(FwdU(Init,(p259!=1)) * !(E(TRUE U !(E(TRUE U (p193!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
Hit Full ! (commute/partial/dont) 88/0/2
(forward)formula 0,1,0.512665,26488,1,0,135,134475,202,58,2253,94309,188
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 22:19:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:19:41] [INFO ] Flatten gal took : 4 ms
Total runtime 397866 ms.

BK_STOP 1716416381339

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r180-tall-171640602400009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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