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.r004-smll-171620118300329.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 Anderson-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118300329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 302K 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 Anderson-PT-06-CTLCardinality-2024-00
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-01
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-02
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-03
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-04
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-05
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-06
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-07
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-08
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-09
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-10
FORMULA_NAME Anderson-PT-06-CTLCardinality-2024-11
FORMULA_NAME Anderson-PT-06-CTLCardinality-2023-12
FORMULA_NAME Anderson-PT-06-CTLCardinality-2023-13
FORMULA_NAME Anderson-PT-06-CTLCardinality-2023-14
FORMULA_NAME Anderson-PT-06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716424168722

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-23 00:29:30] [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-23 00:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:29:30] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-05-23 00:29:31] [INFO ] Transformed 229 places.
[2024-05-23 00:29:31] [INFO ] Transformed 600 transitions.
[2024-05-23 00:29:31] [INFO ] Found NUPN structural information;
[2024-05-23 00:29:31] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
FORMULA Anderson-PT-06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 191 transition count 382
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 191 transition count 382
Applied a total of 76 rules in 88 ms. Remains 191 /229 variables (removed 38) and now considering 382/600 (removed 218) transitions.
// Phase 1: matrix 382 rows 191 cols
[2024-05-23 00:29:31] [INFO ] Computed 15 invariants in 49 ms
[2024-05-23 00:29:32] [INFO ] Implicit Places using invariants in 704 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 888 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 190/229 places, 382/600 transitions.
Applied a total of 0 rules in 20 ms. Remains 190 /190 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1033 ms. Remains : 190/229 places, 382/600 transitions.
Support contains 60 out of 190 places after structural reductions.
[2024-05-23 00:29:32] [INFO ] Flatten gal took : 129 ms
[2024-05-23 00:29:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Anderson-PT-06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 00:29:32] [INFO ] Flatten gal took : 69 ms
[2024-05-23 00:29:33] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 52 out of 190 places (down from 60) after GAL structural reductions.
FORMULA Anderson-PT-06-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2618 ms. (15 steps per ms) remains 3/40 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 566 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 3/3 properties
// Phase 1: matrix 382 rows 190 cols
[2024-05-23 00:29:34] [INFO ] Computed 14 invariants in 10 ms
[2024-05-23 00:29:34] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 80/84 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 94/178 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/190 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 382/572 variables, 190/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 30/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/572 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 572/572 variables, and 234 constraints, problems are : Problem set: 1 solved, 2 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/62 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 116/178 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/190 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/572 variables, 190/204 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 30/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 2/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/572 variables, 0/236 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 572/572 variables, and 236 constraints, problems are : Problem set: 1 solved, 2 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 190/190 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1077ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 382/382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 190 transition count 347
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 155 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 154 transition count 346
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 72 place count 154 transition count 317
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 130 place count 125 transition count 317
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 151 place count 104 transition count 176
Iterating global reduction 3 with 21 rules applied. Total rules applied 172 place count 104 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 103 transition count 175
Applied a total of 174 rules in 93 ms. Remains 103 /190 variables (removed 87) and now considering 175/382 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 103/190 places, 175/382 transitions.
RANDOM walk for 22558 steps (4 resets) in 226 ms. (99 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-23 00:29:36] [INFO ] Flatten gal took : 46 ms
[2024-05-23 00:29:36] [INFO ] Flatten gal took : 52 ms
[2024-05-23 00:29:36] [INFO ] Input system was already deterministic with 382 transitions.
Support contains 50 out of 190 places (down from 51) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 190 transition count 347
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 155 transition count 347
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 155 transition count 317
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 125 transition count 317
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 104 transition count 186
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 104 transition count 186
Applied a total of 172 rules in 51 ms. Remains 104 /190 variables (removed 86) and now considering 186/382 (removed 196) transitions.
// Phase 1: matrix 186 rows 104 cols
[2024-05-23 00:29:36] [INFO ] Computed 14 invariants in 4 ms
[2024-05-23 00:29:36] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-23 00:29:36] [INFO ] Invariant cache hit.
[2024-05-23 00:29:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:29:36] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2024-05-23 00:29:36] [INFO ] Redundant transitions in 7 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-23 00:29:36] [INFO ] Invariant cache hit.
[2024-05-23 00:29:36] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:29:38] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 21 ms to minimize.
[2024-05-23 00:29:38] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 4 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 4 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:29:45] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:29:46] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 186/290 variables, 104/153 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 30/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/290 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 183 constraints, problems are : Problem set: 0 solved, 180 unsolved in 20293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:30:01] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:30:04] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 3 ms to minimize.
[2024-05-23 00:30:04] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:30:08] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:30:12] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:30:13] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:30:13] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 186/290 variables, 104/160 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 30/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 180/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 370 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 42/42 constraints]
After SMT, in 50617ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 50624ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/190 places, 186/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51148 ms. Remains : 104/190 places, 186/382 transitions.
[2024-05-23 00:30:27] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:30:27] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:30:27] [INFO ] Input system was already deterministic with 186 transitions.
[2024-05-23 00:30:27] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:30:27] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:30:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10705439167246423856.gal : 23 ms
[2024-05-23 00:30:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality13956325754993701096.ctl : 3 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/CTLCardinality10705439167246423856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13956325754993701096.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,47611,1.09221,27044,2,11701,5,81675,6,0,605,53665,0


Converting to forward existential form...Done !
original formula: EF(EG(AG(EF((ncs_0_5==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !(E(TRUE U (ncs_0_5==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t119, t120, t121, t122, t123, t125, t126, t127, t128, t129, t130, t131, t132, t133, t134, t13...378
(forward)formula 0,1,9.06778,203736,1,0,433,1.07942e+06,397,212,5196,432909,445
FORMULA Anderson-PT-06-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 263
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 263
Applied a total of 38 rules in 7 ms. Remains 171 /190 variables (removed 19) and now considering 263/382 (removed 119) transitions.
// Phase 1: matrix 263 rows 171 cols
[2024-05-23 00:30:36] [INFO ] Computed 14 invariants in 4 ms
[2024-05-23 00:30:36] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-23 00:30:37] [INFO ] Invariant cache hit.
[2024-05-23 00:30:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:30:37] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-23 00:30:37] [INFO ] Invariant cache hit.
[2024-05-23 00:30:37] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:30:39] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:30:40] [INFO ] Deduced a trap composed of 120 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:30:40] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:30:40] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:30:40] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:30:40] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:30:40] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:30:41] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:30:41] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:30:41] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:30:42] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:30:42] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:30:42] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 4 ms to minimize.
[2024-05-23 00:30:42] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 5 ms to minimize.
[2024-05-23 00:30:42] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:30:43] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:30:43] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 4 ms to minimize.
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:30:44] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 1 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:30:46] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:30:46] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:30:46] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:30:46] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 7 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 95 places in 269 ms of which 8 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 79 places in 281 ms of which 8 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 2 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:30:51] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:30:51] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:30:51] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:30:51] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:30:51] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:30:52] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:30:52] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 263/434 variables, 171/234 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 30/264 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 264 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 171/171 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:31:09] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 3 ms to minimize.
[2024-05-23 00:31:10] [INFO ] Deduced a trap composed of 95 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:31:10] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 3 ms to minimize.
[2024-05-23 00:31:10] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:31:11] [INFO ] Deduced a trap composed of 96 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:31:11] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:31:11] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:31:12] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:31:12] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:31:12] [INFO ] Deduced a trap composed of 92 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:31:12] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-23 00:31:12] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:31:13] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:31:13] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:31:13] [INFO ] Deduced a trap composed of 107 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:31:13] [INFO ] Deduced a trap composed of 95 places in 188 ms of which 4 ms to minimize.
[2024-05-23 00:31:13] [INFO ] Deduced a trap composed of 92 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 7 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:31:18] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:31:18] [INFO ] Deduced a trap composed of 60 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:31:18] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:31:18] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:31:18] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:31:18] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:31:19] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-23 00:31:22] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:31:23] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:31:23] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 4 ms to minimize.
[2024-05-23 00:31:23] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:31:23] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:31:23] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/434 variables, and 99 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/171 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/257 constraints, Known Traps: 85/85 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 171/190 places, 263/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61049 ms. Remains : 171/190 places, 263/382 transitions.
[2024-05-23 00:31:37] [INFO ] Flatten gal took : 22 ms
[2024-05-23 00:31:37] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:31:37] [INFO ] Input system was already deterministic with 263 transitions.
[2024-05-23 00:31:37] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:31:37] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:31:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality16923054869300885901.gal : 5 ms
[2024-05-23 00:31:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality14802918325691943606.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/CTLCardinality16923054869300885901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14802918325691943606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(A(!(EX(TRUE)) U ((p3_3_4==0) * !(EG(EX(((p3_2_3==0)||(p1_0_0==1))))))) U ((!((ncs_3_3==0)||(p2_1_5==1)))&&((p3_0_5==0)||(ncs_1_1==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((!((ncs_3_3==0)||(p2_1_5==1)))&&((p3_0_5==0)||(ncs_1_1==1))))))) * !(E(!(((!((ncs_3_3==0)||(p2...489
Reverse transition relation is NOT exact ! Due to transitions t95, t96, t97, t98, t99, t101, t102, t103, t104, t105, t107, t108, t109, t110, t111, t113, t1...529
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:32:07] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:32:07] [INFO ] Applying decomposition
[2024-05-23 00:32:07] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17023250751663500109.txt' '-o' '/tmp/graph17023250751663500109.bin' '-w' '/tmp/graph17023250751663500109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17023250751663500109.bin' '-l' '-1' '-v' '-w' '/tmp/graph17023250751663500109.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:32:08] [INFO ] Decomposing Gal with order
[2024-05-23 00:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:32:08] [INFO ] Removed a total of 418 redundant transitions.
[2024-05-23 00:32:08] [INFO ] Flatten gal took : 121 ms
[2024-05-23 00:32:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-23 00:32:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality17309356109434553600.gal : 9 ms
[2024-05-23 00:32:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality3272107699907164712.ctl : 11 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/CTLCardinality17309356109434553600.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3272107699907164712.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11582e+06,1.17658,32224,4051,27,62463,173,737,43562,39,341,0


Converting to forward existential form...Done !
original formula: A(A(!(EX(TRUE)) U ((i6.u17.p3_3_4==0) * !(EG(EX(((i2.i0.u34.p3_2_3==0)||(i8.u26.p1_0_0==1))))))) U ((!((i6.u53.ncs_3_3==0)||(i0.u32.p2_1_...210
=> equivalent forward existential formula: [((Init * !(EG(!(((!((i6.u53.ncs_3_3==0)||(i0.u32.p2_1_5==1)))&&((i3.i0.u45.p3_0_5==0)||(i4.u46.ncs_1_1==1))))))...654
Reverse transition relation is NOT exact ! Due to transitions t227, t228, t229, t230, t231, t232, t233, t234, t235, t236, t237, t238, t239, t240, t243, t24...617
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,10.3571,272468,1,0,548261,264,4047,459232,200,1069,2159723
FORMULA Anderson-PT-06-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 172 transition count 264
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 172 transition count 264
Applied a total of 36 rules in 14 ms. Remains 172 /190 variables (removed 18) and now considering 264/382 (removed 118) transitions.
// Phase 1: matrix 264 rows 172 cols
[2024-05-23 00:32:18] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:32:19] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-23 00:32:19] [INFO ] Invariant cache hit.
[2024-05-23 00:32:19] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:32:20] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-23 00:32:20] [INFO ] Invariant cache hit.
[2024-05-23 00:32:20] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:22] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 4 ms to minimize.
[2024-05-23 00:32:22] [INFO ] Deduced a trap composed of 68 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:32:23] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:32:23] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:32:23] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:32:23] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:32:23] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:32:23] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:32:25] [INFO ] Deduced a trap composed of 90 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:32:25] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:32:25] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:32:25] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:32:25] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:26] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:32:26] [INFO ] Deduced a trap composed of 119 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:32:26] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 4 ms to minimize.
[2024-05-23 00:32:26] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:32:27] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:32:27] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:32:27] [INFO ] Deduced a trap composed of 103 places in 187 ms of which 4 ms to minimize.
[2024-05-23 00:32:27] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 3 ms to minimize.
[2024-05-23 00:32:28] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:32:28] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:32:28] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:32:29] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:32:29] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:32:29] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:32:29] [INFO ] Deduced a trap composed of 98 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:32:29] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:32:30] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:32:30] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 4 ms to minimize.
[2024-05-23 00:32:30] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:32:30] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:33] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Deduced a trap composed of 104 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Deduced a trap composed of 81 places in 202 ms of which 3 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Deduced a trap composed of 81 places in 198 ms of which 4 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:32:35] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:37] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:32:37] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:32:38] [INFO ] Deduced a trap composed of 116 places in 150 ms of which 2 ms to minimize.
[2024-05-23 00:32:38] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:32:39] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:32:39] [INFO ] Deduced a trap composed of 106 places in 191 ms of which 4 ms to minimize.
[2024-05-23 00:32:39] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:32:40] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 4 ms to minimize.
[2024-05-23 00:32:40] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:32:40] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:42] [INFO ] Deduced a trap composed of 112 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:32:42] [INFO ] Deduced a trap composed of 104 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:32:42] [INFO ] Deduced a trap composed of 115 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:32:43] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:32:43] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:32:43] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:32:43] [INFO ] Deduced a trap composed of 112 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:32:43] [INFO ] Deduced a trap composed of 108 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:32:44] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:32:45] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 3 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 172/436 variables, and 83 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/172 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:52] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
[2024-05-23 00:32:52] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:32:53] [INFO ] Deduced a trap composed of 117 places in 176 ms of which 4 ms to minimize.
[2024-05-23 00:32:53] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:32:53] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:32:53] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:32:54] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:32:54] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 4 ms to minimize.
[2024-05-23 00:32:54] [INFO ] Deduced a trap composed of 90 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:32:54] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:32:55] [INFO ] Deduced a trap composed of 89 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:32:55] [INFO ] Deduced a trap composed of 88 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:32:55] [INFO ] Deduced a trap composed of 87 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:32:55] [INFO ] Deduced a trap composed of 84 places in 210 ms of which 3 ms to minimize.
[2024-05-23 00:32:55] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:32:56] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:32:56] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2024-05-23 00:32:57] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:32:57] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:32:57] [INFO ] Deduced a trap composed of 122 places in 179 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:32:59] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:33:01] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:33:02] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-05-23 00:33:02] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:33:02] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:33:03] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:33:05] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:33:06] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:33:07] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:33:07] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:33:12] [INFO ] Deduced a trap composed of 118 places in 199 ms of which 5 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 91 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-23 00:33:17] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:33:17] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:33:18] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:33:18] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:33:18] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:33:18] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:33:19] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:33:19] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/436 variables, and 131 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/172 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/258 constraints, Known Traps: 117/117 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in LTL mode, iteration 1 : 172/190 places, 264/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61397 ms. Remains : 172/190 places, 264/382 transitions.
[2024-05-23 00:33:20] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:33:20] [INFO ] Flatten gal took : 19 ms
[2024-05-23 00:33:20] [INFO ] Input system was already deterministic with 264 transitions.
[2024-05-23 00:33:20] [INFO ] Flatten gal took : 18 ms
[2024-05-23 00:33:20] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:33:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8496846809516899999.gal : 5 ms
[2024-05-23 00:33:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1072256594120293613.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/CTLCardinality8496846809516899999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1072256594120293613.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(E(!(EG((p3_1_5==1))) U (((AG((ncs_1_4==0)) * (p3_0_4==1)) * ((p2_0_1==0) * ((AX(FALSE) + (ncs_5_1==0)) + (p3_4_3==1)))) * ((p1_3_4==0)...172
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG((p3_1_5==1))) U (((!(E(TRUE U !((ncs_1_4==0)))) * (p3_0_4==1)) * ((p2_0_1==0) * ((!...244
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t25, t27, t28, t29, t30, t31, t77, t82, t83, t91, t92, t93, t97, t98, t99, t10...546
Detected timeout of ITS tools.
[2024-05-23 00:33:50] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:33:50] [INFO ] Applying decomposition
[2024-05-23 00:33:50] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4058092017941377707.txt' '-o' '/tmp/graph4058092017941377707.bin' '-w' '/tmp/graph4058092017941377707.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4058092017941377707.bin' '-l' '-1' '-v' '-w' '/tmp/graph4058092017941377707.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:33:50] [INFO ] Decomposing Gal with order
[2024-05-23 00:33:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:33:50] [INFO ] Removed a total of 417 redundant transitions.
[2024-05-23 00:33:50] [INFO ] Flatten gal took : 45 ms
[2024-05-23 00:33:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 18 ms.
[2024-05-23 00:33:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality11962007867938695468.gal : 9 ms
[2024-05-23 00:33:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality6980240774223467174.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/CTLCardinality11962007867938695468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6980240774223467174.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19625e+06,1.623,37812,4674,27,64538,180,768,76352,39,335,0


Converting to forward existential form...Done !
original formula: AG(E(!(EG((i5.u51.p3_1_5==1))) U (((AG((i1.u66.ncs_1_4==0)) * (i8.i2.u48.p3_0_4==1)) * ((i3.u25.p2_0_1==0) * ((AX(FALSE) + (i4.u5.ncs_5_1...236
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG((i5.u51.p3_1_5==1))) U (((!(E(TRUE U !((i1.u66.ncs_1_4==0)))) * (i8.i2.u48.p3_0_4==...308
Reverse transition relation is NOT exact ! Due to transitions t22, t23, t24, t27, t28, t29, t30, t31, t77, t82, t83, t228, t229, t230, t231, t232, t233, t2...655
Using saturation style SCC detection
Using 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 8
(forward)formula 0,0,8.9888,214424,1,0,377447,305,4182,517765,199,1109,1890262
FORMULA Anderson-PT-06-CTLCardinality-2024-02 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 : 190/190 places, 382/382 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 241
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 241
Applied a total of 42 rules in 7 ms. Remains 169 /190 variables (removed 21) and now considering 241/382 (removed 141) transitions.
// Phase 1: matrix 241 rows 169 cols
[2024-05-23 00:33:59] [INFO ] Computed 14 invariants in 4 ms
[2024-05-23 00:33:59] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-23 00:34:00] [INFO ] Invariant cache hit.
[2024-05-23 00:34:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:34:00] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-23 00:34:00] [INFO ] Invariant cache hit.
[2024-05-23 00:34:00] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 4 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 5 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 89 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 111 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 3 ms to minimize.
[2024-05-23 00:34:05] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 4 ms to minimize.
[2024-05-23 00:34:05] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 6 ms to minimize.
[2024-05-23 00:34:05] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:34:05] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:34:05] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 118 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:34:06] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:34:07] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:34:07] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:34:08] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:34:08] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:34:08] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:34:09] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:34:09] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 4 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 3 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:34:10] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 241/410 variables, 169/214 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 30/244 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 0/410 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 244 constraints, problems are : Problem set: 0 solved, 235 unsolved in 29136 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 169/169 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:34:31] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:34:31] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-05-23 00:34:32] [INFO ] Deduced a trap composed of 101 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:34:32] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:34:32] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:34:33] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 1 ms to minimize.
[2024-05-23 00:34:33] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:34:33] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:34:33] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:34:34] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:34:36] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:34:36] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:34:36] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:34:37] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 99 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 127 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 168/410 variables, and 81 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/169 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/235 constraints, Known Traps: 68/68 constraints]
After SMT, in 59298ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 59308ms
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 241/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60179 ms. Remains : 169/190 places, 241/382 transitions.
[2024-05-23 00:34:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:34:59] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:35:00] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-23 00:35:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:35:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:35:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality14353396098014327171.gal : 3 ms
[2024-05-23 00:35:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality5711571543454543883.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/CTLCardinality14353396098014327171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5711571543454543883.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,955981,1.6962,49088,2,23342,5,153384,6,0,920,115006,0


Converting to forward existential form...Done !
original formula: EG(((AF(((p2_4_5==0) + EX((cs_4_5==1)))) + EX(AX((p2_4_2==0)))) + ((AG((((cs_3_0==0)&&(p3_4_0==0))&&(cs_0_2==1))) * (p2_3_4==1)) * !(E((c...183
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(((p2_4_5==0) + EX((cs_4_5==1)))))) + EX(!(EX(!((p2_4_2==0)))))) + ((!(E(TRUE U !((((cs_3_0==...250
Reverse transition relation is NOT exact ! Due to transitions t68, t69, t70, t71, t74, t75, t76, t77, t80, t81, t82, t83, t86, t87, t88, t89, t92, t93, t94...484
Using saturation style SCC detection
(forward)formula 0,1,29.184,721456,1,0,665,4.15058e+06,518,351,6941,1.82106e+06,673
FORMULA Anderson-PT-06-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 262
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 262
Applied a total of 40 rules in 8 ms. Remains 170 /190 variables (removed 20) and now considering 262/382 (removed 120) transitions.
// Phase 1: matrix 262 rows 170 cols
[2024-05-23 00:35:29] [INFO ] Computed 14 invariants in 3 ms
[2024-05-23 00:35:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-23 00:35:29] [INFO ] Invariant cache hit.
[2024-05-23 00:35:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:35:30] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-23 00:35:30] [INFO ] Invariant cache hit.
[2024-05-23 00:35:30] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:35:32] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:35:33] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:35:33] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:35:34] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:35:34] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 4 ms to minimize.
[2024-05-23 00:35:34] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:35:35] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 3 ms to minimize.
[2024-05-23 00:35:35] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 4 ms to minimize.
[2024-05-23 00:35:35] [INFO ] Deduced a trap composed of 108 places in 191 ms of which 4 ms to minimize.
[2024-05-23 00:35:36] [INFO ] Deduced a trap composed of 108 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:35:36] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:35:36] [INFO ] Deduced a trap composed of 90 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:35:36] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:35:36] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:35:37] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:35:37] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-23 00:35:37] [INFO ] Deduced a trap composed of 97 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:35:37] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 3 ms to minimize.
[2024-05-23 00:35:37] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:35:38] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:35:38] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 86 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 87 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 102 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 5 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 4 ms to minimize.
[2024-05-23 00:35:50] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 4 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:35:52] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:35:53] [INFO ] Deduced a trap composed of 103 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:35:53] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:35:54] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 98 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:35:56] [INFO ] Deduced a trap composed of 96 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:35:56] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:35:56] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:35:56] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:35:56] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:35:56] [INFO ] Deduced a trap composed of 80 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:35:57] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:35:57] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:35:57] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 4 ms to minimize.
[2024-05-23 00:35:58] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/432 variables, and 87 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/170 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 73/87 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:36:03] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 4 ms to minimize.
[2024-05-23 00:36:03] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:36:03] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 110 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:36:07] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:36:07] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-23 00:36:09] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:36:10] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:36:10] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:36:10] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:36:10] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/432 variables, and 99 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/170 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/256 constraints, Known Traps: 85/85 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 170/190 places, 262/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61064 ms. Remains : 170/190 places, 262/382 transitions.
[2024-05-23 00:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:36:30] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:36:30] [INFO ] Input system was already deterministic with 262 transitions.
[2024-05-23 00:36:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:36:30] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:36:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality8367222510993065175.gal : 4 ms
[2024-05-23 00:36:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality18106360261805937705.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/CTLCardinality8367222510993065175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18106360261805937705.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.07119e+06,2.70757,75740,2,24922,5,224165,6,0,945,169450,0


Converting to forward existential form...Done !
original formula: AG(A((ncs_0_4==1) U !(AG(!(EX((ncs_3_1==0)))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(!(!(E(TRUE U !(!(EX((ncs_3_1==0))))))))) * !((ncs_0_4==1))) * !(E(TRUE U !(!(EX((ncs_...254
Reverse transition relation is NOT exact ! Due to transitions t226, t227, t228, t229, t230, t231, t232, t233, t234, t235, t236, t237, t238, t239, t240, t24...378
(forward)formula 0,1,20.6931,538988,1,0,510,2.43361e+06,551,268,6935,1.07482e+06,543
FORMULA Anderson-PT-06-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 241
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 241
Applied a total of 42 rules in 8 ms. Remains 169 /190 variables (removed 21) and now considering 241/382 (removed 141) transitions.
// Phase 1: matrix 241 rows 169 cols
[2024-05-23 00:36:51] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:36:51] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-23 00:36:51] [INFO ] Invariant cache hit.
[2024-05-23 00:36:51] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:36:52] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-23 00:36:52] [INFO ] Invariant cache hit.
[2024-05-23 00:36:52] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:36:57] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 4 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:36:58] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 97 places in 197 ms of which 3 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:36:59] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:37:00] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 58 places in 208 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:37:02] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 88 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 4 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:37:03] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:37:04] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:37:04] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:37:04] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 4 ms to minimize.
[2024-05-23 00:37:04] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:37:05] [INFO ] Deduced a trap composed of 107 places in 192 ms of which 3 ms to minimize.
[2024-05-23 00:37:05] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:37:06] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:37:06] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:37:09] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:37:09] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:37:12] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:37:13] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:37:13] [INFO ] Deduced a trap composed of 91 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:37:13] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:37:14] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:37:14] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 10 (OVERLAPS) 241/410 variables, 169/228 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 30/258 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/410 variables, and 258 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 169/169 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 95 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:37:24] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 3 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:37:25] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 3 ms to minimize.
[2024-05-23 00:37:26] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:37:26] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:37:26] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 1/169 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:37:30] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 3 ms to minimize.
[2024-05-23 00:37:31] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 2 ms to minimize.
[2024-05-23 00:37:31] [INFO ] Deduced a trap composed of 103 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 2 ms to minimize.
[2024-05-23 00:37:32] [INFO ] Deduced a trap composed of 36 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:37:33] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:37:35] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:37:36] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:37:37] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:37:37] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/410 variables, and 87 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/169 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/235 constraints, Known Traps: 73/73 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 241/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60917 ms. Remains : 169/190 places, 241/382 transitions.
[2024-05-23 00:37:52] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:37:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:37:52] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-23 00:37:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:37:52] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:37:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15481383520714956025.gal : 2 ms
[2024-05-23 00:37:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3780058572342234564.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/CTLCardinality15481383520714956025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3780058572342234564.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,962261,1.68352,48048,2,22647,5,151635,6,0,920,108440,0


Converting to forward existential form...Done !
original formula: AX(EX(AG(EX((p1_3_2==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(EX((p1_3_2==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t69, t70, t71, t75, t76, t77, t81, t82, t83, t93, t94, t95, t99, t100, t101, t119, t205, t206...461
(forward)formula 0,1,16.552,421712,1,0,505,1.83758e+06,501,246,6363,893456,493
FORMULA Anderson-PT-06-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 252
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 252
Applied a total of 40 rules in 4 ms. Remains 170 /190 variables (removed 20) and now considering 252/382 (removed 130) transitions.
// Phase 1: matrix 252 rows 170 cols
[2024-05-23 00:38:09] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:38:09] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 00:38:09] [INFO ] Invariant cache hit.
[2024-05-23 00:38:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:38:09] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-05-23 00:38:09] [INFO ] Invariant cache hit.
[2024-05-23 00:38:09] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:38:11] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:38:12] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:38:12] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:38:13] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:38:13] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:38:13] [INFO ] Deduced a trap composed of 101 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:38:13] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:38:13] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:38:13] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:38:14] [INFO ] Deduced a trap composed of 103 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:38:14] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:38:14] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:38:14] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:38:14] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:38:15] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 4 ms to minimize.
[2024-05-23 00:38:15] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:38:15] [INFO ] Deduced a trap composed of 95 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:38:15] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:38:15] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:38:16] [INFO ] Deduced a trap composed of 101 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:38:17] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:38:18] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:38:18] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:38:18] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:38:22] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:38:22] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:38:24] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:38:25] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:38:25] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 252/422 variables, 170/213 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 30/243 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/422 variables, and 243 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:38:42] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:38:42] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:38:43] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:38:43] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:38:43] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:38:43] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:38:43] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:38:44] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:38:44] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-05-23 00:38:44] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 4 ms to minimize.
[2024-05-23 00:38:44] [INFO ] Deduced a trap composed of 112 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:38:46] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2024-05-23 00:38:47] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-23 00:39:06] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:39:06] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/422 variables, and 58 constraints, problems are : Problem set: 0 solved, 246 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/170 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/246 constraints, Known Traps: 44/44 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 170/190 places, 252/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60858 ms. Remains : 170/190 places, 252/382 transitions.
[2024-05-23 00:39:10] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:39:10] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:39:10] [INFO ] Input system was already deterministic with 252 transitions.
[2024-05-23 00:39:10] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:39:10] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:39:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7480913116371253756.gal : 2 ms
[2024-05-23 00:39:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality15932348336847171665.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/CTLCardinality7480913116371253756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15932348336847171665.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.04262e+06,2.4733,65640,2,25329,5,203971,6,0,935,157091,0


Converting to forward existential form...Done !
original formula: AG((((EG((EF(((next_6==0)&&(ncs_0_0==1))) * (p1_4_2==1))) + EX(EG((p2_1_1==1)))) + (AG(A(((p3_1_4==1)&&(p1_0_5==0)) U (p2_3_4==1))) + (cs...181
=> equivalent forward existential formula: ([(FwdU(FwdU((((FwdU(Init,TRUE) * !((p2_1_4==1))) * !((EG((E(TRUE U ((next_6==0)&&(ncs_0_0==1))) * (p1_4_2==1)))...469
Reverse transition relation is NOT exact ! Due to transitions t80, t81, t82, t86, t87, t88, t92, t93, t94, t98, t99, t100, t110, t111, t112, t135, t216, t2...463
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:39:40] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:39:40] [INFO ] Applying decomposition
[2024-05-23 00:39:40] [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/graph11665031775095220049.txt' '-o' '/tmp/graph11665031775095220049.bin' '-w' '/tmp/graph11665031775095220049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11665031775095220049.bin' '-l' '-1' '-v' '-w' '/tmp/graph11665031775095220049.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:39:40] [INFO ] Decomposing Gal with order
[2024-05-23 00:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:39:40] [INFO ] Removed a total of 381 redundant transitions.
[2024-05-23 00:39:40] [INFO ] Flatten gal took : 37 ms
[2024-05-23 00:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 21 ms.
[2024-05-23 00:39:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality645354992287275510.gal : 4 ms
[2024-05-23 00:39:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5987174249916034040.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/CTLCardinality645354992287275510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5987174249916034040.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,1.04262e+06,1.10683,27628,3026,26,47547,173,663,34904,39,332,0


Converting to forward existential form...Done !
original formula: AG((((EG((EF(((i0.i0.u2.next_6==0)&&(i1.u18.ncs_0_0==1))) * (i7.u10.p1_4_2==1))) + EX(EG((i4.u24.p2_1_1==1)))) + (AG(A(((i8.u47.p3_1_4==1...248
=> equivalent forward existential formula: ([(FwdU(FwdU((((FwdU(Init,TRUE) * !((i4.u26.p2_1_4==1))) * !((EG((E(TRUE U ((i0.i0.u2.next_6==0)&&(i1.u18.ncs_0_...594
Reverse transition relation is NOT exact ! Due to transitions t216, t217, t218, t219, t220, t221, t222, t223, t224, t225, t226, t227, t228, t229, t230, t23...446
(forward)formula 0,0,11.6727,308300,1,0,637206,279,4496,466050,205,979,2653687
FORMULA Anderson-PT-06-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 190 transition count 347
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 155 transition count 347
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 155 transition count 317
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 125 transition count 317
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 104 transition count 186
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 104 transition count 186
Applied a total of 172 rules in 24 ms. Remains 104 /190 variables (removed 86) and now considering 186/382 (removed 196) transitions.
// Phase 1: matrix 186 rows 104 cols
[2024-05-23 00:39:52] [INFO ] Computed 14 invariants in 1 ms
[2024-05-23 00:39:52] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-23 00:39:52] [INFO ] Invariant cache hit.
[2024-05-23 00:39:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:39:52] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-23 00:39:52] [INFO ] Redundant transitions in 7 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-23 00:39:52] [INFO ] Invariant cache hit.
[2024-05-23 00:39:52] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:39:53] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:39:53] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:39:53] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:39:53] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:39:53] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:39:54] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:39:55] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:39:56] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:39:57] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2024-05-23 00:39:57] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:39:57] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:39:57] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 186/290 variables, 104/158 constraints. Problems are: Problem set: 0 solved, 180 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 30/188 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/290 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 188 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12803 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:40:15] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:40:16] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:40:22] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:40:24] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:40:24] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:40:25] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:40:31] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:40:31] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:40:32] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:40:32] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:40:32] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/290 variables, and 65 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/180 constraints, Known Traps: 51/51 constraints]
After SMT, in 42903ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 42905ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/190 places, 186/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43347 ms. Remains : 104/190 places, 186/382 transitions.
[2024-05-23 00:40:35] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:40:35] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:40:35] [INFO ] Input system was already deterministic with 186 transitions.
RANDOM walk for 780 steps (0 resets) in 5 ms. (130 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:40:35] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:40:35] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:40:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2539991057673017622.gal : 2 ms
[2024-05-23 00:40:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2762631197891398128.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2539991057673017622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2762631197891398128.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 190 transition count 347
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 155 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 154 transition count 346
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 72 place count 154 transition count 316
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 132 place count 124 transition count 316
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 154 place count 102 transition count 174
Iterating global reduction 3 with 22 rules applied. Total rules applied 176 place count 102 transition count 174
Applied a total of 176 rules in 19 ms. Remains 102 /190 variables (removed 88) and now considering 174/382 (removed 208) transitions.
// Phase 1: matrix 174 rows 102 cols
[2024-05-23 00:40:35] [INFO ] Computed 14 invariants in 1 ms
[2024-05-23 00:40:35] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-23 00:40:35] [INFO ] Invariant cache hit.
[2024-05-23 00:40:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:40:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-23 00:40:35] [INFO ] Redundant transitions in 5 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-23 00:40:35] [INFO ] Invariant cache hit.
[2024-05-23 00:40:35] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:40:37] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:40:37] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:40:37] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:40:37] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:40:37] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:38] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:40:39] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:40:42] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:40:42] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 3 ms to minimize.
[2024-05-23 00:40:43] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 174/276 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 30/169 constraints. Problems are: Problem set: 0 solved, 168 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 169 constraints, problems are : Problem set: 0 solved, 168 unsolved in 15672 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:40:53] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:40:53] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:53] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:40:53] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:40:54] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:55] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:55] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:40:56] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:40:56] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:40:58] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:41:02] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:41:02] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:41:04] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:41:05] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:41:05] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:41:05] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:41:08] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:41:09] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:41:12] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:41:12] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:41:14] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:41:14] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:41:14] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:41:14] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-23 00:41:17] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 168 unsolved
SMT process timed out in 45801ms, After SMT, problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 45805ms
Starting structural reductions in SI_CTL mode, iteration 1 : 102/190 places, 174/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46236 ms. Remains : 102/190 places, 174/382 transitions.
[2024-05-23 00:41:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:41:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:41:21] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-23 00:41:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:41:21] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:41:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8959282577553833088.gal : 2 ms
[2024-05-23 00:41:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality3456146725622901233.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/CTLCardinality8959282577553833088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3456146725622901233.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,41094,0.527314,21912,2,11003,5,61286,6,0,585,37782,0


Converting to forward existential form...Done !
original formula: AF(AG((p3_4_4==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p3_4_4==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t108, t109, t110, t111, t112, t113, t114, t115, t116, t117, t118, t119, t120, t121, t122, t12...378
(forward)formula 0,0,5.64475,154120,1,0,389,677933,374,180,4935,301445,366
FORMULA Anderson-PT-06-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 174 transition count 256
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 174 transition count 256
Applied a total of 32 rules in 6 ms. Remains 174 /190 variables (removed 16) and now considering 256/382 (removed 126) transitions.
// Phase 1: matrix 256 rows 174 cols
[2024-05-23 00:41:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:41:27] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-23 00:41:27] [INFO ] Invariant cache hit.
[2024-05-23 00:41:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:41:28] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 250 sub problems to find dead transitions.
[2024-05-23 00:41:28] [INFO ] Invariant cache hit.
[2024-05-23 00:41:28] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:29] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:41:30] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:41:31] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:31] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:41:31] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:41:32] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:41:32] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-05-23 00:41:32] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:41:32] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:41:32] [INFO ] Deduced a trap composed of 116 places in 162 ms of which 3 ms to minimize.
[2024-05-23 00:41:32] [INFO ] Deduced a trap composed of 123 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 4 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 3 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:41:33] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:41:34] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
[2024-05-23 00:41:34] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:41:34] [INFO ] Deduced a trap composed of 123 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:41:34] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:41:34] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:36] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:41:37] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:41:37] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:41:37] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:41:37] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:41:38] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:39] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:41:39] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:41:40] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:41:40] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:41:41] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:41:41] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:41:41] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:42] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 111 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:41:43] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:41:44] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:41:44] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:41:45] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:41:45] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:47] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:49] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:41:50] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 256/430 variables, 174/252 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 30/282 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/430 variables, and 282 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 174/174 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:41:59] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:42:00] [INFO ] Deduced a trap composed of 104 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:42:00] [INFO ] Deduced a trap composed of 89 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:42:00] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:42:00] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-05-23 00:42:00] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 1 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:42:01] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:42:02] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:42:02] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:42:02] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:42:02] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:42:02] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:42:03] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:42:04] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2024-05-23 00:42:05] [INFO ] Deduced a trap composed of 111 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:42:05] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 1 ms to minimize.
[2024-05-23 00:42:05] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:42:07] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:42:07] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:42:08] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 2 ms to minimize.
[2024-05-23 00:42:08] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:42:08] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:42:08] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-23 00:42:10] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:42:10] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:42:11] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:42:11] [INFO ] Deduced a trap composed of 89 places in 199 ms of which 3 ms to minimize.
[2024-05-23 00:42:11] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:42:11] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:42:11] [INFO ] Deduced a trap composed of 62 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:42:12] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:42:12] [INFO ] Deduced a trap composed of 103 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:42:12] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:42:12] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:42:13] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:42:14] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:42:14] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:42:14] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:42:14] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 16/124 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 174/430 variables, and 124 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/174 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/250 constraints, Known Traps: 110/110 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 174/190 places, 256/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60945 ms. Remains : 174/190 places, 256/382 transitions.
[2024-05-23 00:42:28] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:42:28] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:42:28] [INFO ] Input system was already deterministic with 256 transitions.
[2024-05-23 00:42:28] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:42:28] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:42:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7288885059666122162.gal : 1 ms
[2024-05-23 00:42:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3298262919842801972.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/CTLCardinality7288885059666122162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3298262919842801972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(((cs_2_2==0)||(ncs_2_4==1)) U (AF(EG(EX((cs_1_2==1)))) * !(((((p1_3_1==0)&&(p2_3_3!=0)) + !(E((p1_2_2==1) U (cs_5_0==1)))) * !((E(((p1_...211
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(EG(EX((cs_1_2==1)))))) * !(((((p1_3_1==0)&&(p2_3_3!=0)) + !(E((p1_2_2==1) U (cs_5_0==1)...626
Reverse transition relation is NOT exact ! Due to transitions t79, t80, t81, t82, t85, t86, t87, t88, t91, t92, t93, t94, t97, t98, t99, t100, t103, t104, ...555
Detected timeout of ITS tools.
[2024-05-23 00:42:58] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:42:58] [INFO ] Applying decomposition
[2024-05-23 00:42:58] [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/graph10825636666704820358.txt' '-o' '/tmp/graph10825636666704820358.bin' '-w' '/tmp/graph10825636666704820358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10825636666704820358.bin' '-l' '-1' '-v' '-w' '/tmp/graph10825636666704820358.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:42:58] [INFO ] Decomposing Gal with order
[2024-05-23 00:42:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:42:58] [INFO ] Removed a total of 380 redundant transitions.
[2024-05-23 00:42:58] [INFO ] Flatten gal took : 20 ms
[2024-05-23 00:42:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 6 ms.
[2024-05-23 00:42:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality11933362727739587699.gal : 3 ms
[2024-05-23 00:42:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality853011834544048667.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/CTLCardinality11933362727739587699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality853011834544048667.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24536e+06,1.2403,32704,5928,25,59078,161,690,41120,38,303,0


Converting to forward existential form...Done !
original formula: A(((i8.u63.cs_2_2==0)||(i2.u64.ncs_2_4==1)) U (AF(EG(EX((i8.u24.cs_1_2==1)))) * !(((((i5.u32.p1_3_1==0)&&(i7.u15.p2_3_3!=0)) + !(E((i2.u2...288
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!(EG(EX((i8.u24.cs_1_2==1)))))) * !(((((i5.u32.p1_3_1==0)&&(i7.u15.p2_3_3!=0)) + !(E((i2....829
Reverse transition relation is NOT exact ! Due to transitions t220, t221, t222, t223, t224, t225, t226, t227, t228, t229, t230, t231, t232, t233, t234, t23...601
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,9.7442,284520,1,0,548737,260,4103,502730,199,929,2768342
FORMULA Anderson-PT-06-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 241
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 241
Applied a total of 42 rules in 4 ms. Remains 169 /190 variables (removed 21) and now considering 241/382 (removed 141) transitions.
// Phase 1: matrix 241 rows 169 cols
[2024-05-23 00:43:08] [INFO ] Computed 14 invariants in 2 ms
[2024-05-23 00:43:08] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-23 00:43:08] [INFO ] Invariant cache hit.
[2024-05-23 00:43:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:43:09] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-23 00:43:09] [INFO ] Invariant cache hit.
[2024-05-23 00:43:09] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 1/169 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:15] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 4 ms to minimize.
[2024-05-23 00:43:15] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 4 ms to minimize.
[2024-05-23 00:43:15] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:43:16] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:43:16] [INFO ] Deduced a trap composed of 73 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:43:16] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:16] [INFO ] Deduced a trap composed of 96 places in 204 ms of which 3 ms to minimize.
[2024-05-23 00:43:16] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 3 ms to minimize.
[2024-05-23 00:43:17] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:43:17] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:43:17] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 102 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 4 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 4 ms to minimize.
[2024-05-23 00:43:19] [INFO ] Deduced a trap composed of 102 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 96 places in 183 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 102 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:43:20] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 115 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 105 places in 175 ms of which 3 ms to minimize.
[2024-05-23 00:43:21] [INFO ] Deduced a trap composed of 108 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 88 places in 201 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:43:22] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:43:23] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:25] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 3 ms to minimize.
[2024-05-23 00:43:25] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:43:26] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 119 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:27] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 4 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:43:28] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:43:29] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-05-23 00:43:29] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:43:29] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:30] [INFO ] Deduced a trap composed of 99 places in 180 ms of which 4 ms to minimize.
[2024-05-23 00:43:31] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:43:31] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:43:31] [INFO ] Deduced a trap composed of 108 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:43:31] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 63 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:43:32] [INFO ] Deduced a trap composed of 101 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:43:33] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:43:33] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 3 ms to minimize.
[2024-05-23 00:43:34] [INFO ] Deduced a trap composed of 36 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:43:34] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:36] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 3 ms to minimize.
[2024-05-23 00:43:36] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:36] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:43:36] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:43:37] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:43:38] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 169/410 variables, and 80 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/169 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 1/169 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:44] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:43:44] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:43:44] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:43:45] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:43:45] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-05-23 00:43:45] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:43:45] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:43:46] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 3 ms to minimize.
[2024-05-23 00:43:47] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:43:49] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:43:50] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:43:50] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:43:50] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 3 ms to minimize.
[2024-05-23 00:43:50] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-05-23 00:43:50] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 2 ms to minimize.
[2024-05-23 00:43:52] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:43:52] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:43:52] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:43:53] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/410 variables, and 100 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/169 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/235 constraints, Known Traps: 86/86 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 241/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60942 ms. Remains : 169/190 places, 241/382 transitions.
[2024-05-23 00:44:09] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:44:09] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:44:09] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-23 00:44:09] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:44:09] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:44:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2268086229944246488.gal : 2 ms
[2024-05-23 00:44:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6917795518571750289.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/CTLCardinality2268086229944246488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6917795518571750289.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,962261,1.83729,48220,2,22622,5,151234,6,0,920,108209,0


Converting to forward existential form...Done !
original formula: AG(EX((p1_2_8==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p1_2_8==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t69, t70, t71, t75, t76, t77, t87, t88, t89, t93, t94, t95, t99, t100, t101, t114, t205, t206...461
(forward)formula 0,1,17.6091,431248,1,0,503,1.87894e+06,498,244,6346,864269,489
FORMULA Anderson-PT-06-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 251
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 251
Applied a total of 42 rules in 3 ms. Remains 169 /190 variables (removed 21) and now considering 251/382 (removed 131) transitions.
// Phase 1: matrix 251 rows 169 cols
[2024-05-23 00:44:27] [INFO ] Computed 14 invariants in 5 ms
[2024-05-23 00:44:27] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-23 00:44:27] [INFO ] Invariant cache hit.
[2024-05-23 00:44:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:44:27] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-23 00:44:27] [INFO ] Invariant cache hit.
[2024-05-23 00:44:27] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 00:44:29] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 4 ms to minimize.
[2024-05-23 00:44:29] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:44:30] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:44:30] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 3 ms to minimize.
[2024-05-23 00:44:30] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:44:31] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 00:44:32] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:44:32] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:44:33] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:44:33] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 3 ms to minimize.
[2024-05-23 00:44:33] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 3 ms to minimize.
[2024-05-23 00:44:33] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 3 ms to minimize.
[2024-05-23 00:44:33] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:44:34] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 3 ms to minimize.
[2024-05-23 00:44:34] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:44:35] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:44:35] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:44:35] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:44:35] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 00:44:38] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 3 ms to minimize.
[2024-05-23 00:44:38] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:44:39] [INFO ] Deduced a trap composed of 91 places in 181 ms of which 3 ms to minimize.
[2024-05-23 00:44:40] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 3 ms to minimize.
[2024-05-23 00:44:40] [INFO ] Deduced a trap composed of 84 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:44:40] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-05-23 00:44:40] [INFO ] Deduced a trap composed of 78 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:44:41] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 3 ms to minimize.
[2024-05-23 00:44:41] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 3 ms to minimize.
[2024-05-23 00:44:41] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:44:41] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:44:41] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 00:44:42] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 3 ms to minimize.
[2024-05-23 00:44:43] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 3 ms to minimize.
[2024-05-23 00:44:43] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 3 ms to minimize.
[2024-05-23 00:44:43] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 3 ms to minimize.
[2024-05-23 00:44:43] [INFO ] Deduced a trap composed of 107 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:44:43] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 3 ms to minimize.
[2024-05-23 00:44:44] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 3 ms to minimize.
[2024-05-23 00:44:44] [INFO ] Deduced a trap composed of 69 places in 185 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 251/420 variables, 169/222 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 30/252 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 252 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 169/169 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 39/53 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 00:45:00] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:45:00] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 3 ms to minimize.
[2024-05-23 00:45:00] [INFO ] Deduced a trap composed of 104 places in 193 ms of which 3 ms to minimize.
[2024-05-23 00:45:00] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 3 ms to minimize.
[2024-05-23 00:45:01] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:45:01] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:45:02] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-23 00:45:05] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 169/420 variables, and 61 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/169 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 0/245 constraints, Known Traps: 47/47 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 169/190 places, 251/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60808 ms. Remains : 169/190 places, 251/382 transitions.
[2024-05-23 00:45:27] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:45:28] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:45:28] [INFO ] Input system was already deterministic with 251 transitions.
[2024-05-23 00:45:28] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:45:28] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality14755671332841025656.gal : 1 ms
[2024-05-23 00:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8577236742708288812.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/CTLCardinality14755671332841025656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8577236742708288812.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,987636,2.09378,51720,2,23192,5,161766,6,0,930,119007,0


Converting to forward existential form...Done !
original formula: AG((AF(((p3_4_2!=1) + EX((ncs_2_4!=0)))) * EF((p2_1_2!=0))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((p3_4_2!=1) + EX((ncs_2_4!=0)))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U (p2_1_2!=0...169
Reverse transition relation is NOT exact ! Due to transitions t215, t216, t217, t218, t219, t220, t221, t222, t223, t224, t225, t226, t227, t228, t229, t23...378
(forward)formula 0,1,27.823,633032,1,0,520,3.34987e+06,531,272,6819,1.34964e+06,552
FORMULA Anderson-PT-06-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 382/382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 346
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 154 transition count 346
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 72 place count 154 transition count 317
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 130 place count 125 transition count 317
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 104 transition count 176
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 104 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 103 transition count 175
Applied a total of 174 rules in 23 ms. Remains 103 /190 variables (removed 87) and now considering 175/382 (removed 207) transitions.
// Phase 1: matrix 175 rows 103 cols
[2024-05-23 00:45:56] [INFO ] Computed 14 invariants in 1 ms
[2024-05-23 00:45:56] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-23 00:45:56] [INFO ] Invariant cache hit.
[2024-05-23 00:45:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-23 00:45:56] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-23 00:45:56] [INFO ] Redundant transitions in 2 ms returned []
Running 169 sub problems to find dead transitions.
[2024-05-23 00:45:56] [INFO ] Invariant cache hit.
[2024-05-23 00:45:56] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:45:58] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:45:58] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:45:58] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:45:58] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:45:58] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:45:59] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:46:00] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:01] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:46:01] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 3 ms to minimize.
[2024-05-23 00:46:02] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:46:02] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:46:02] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 5 ms to minimize.
[2024-05-23 00:46:02] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:46:02] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:05] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:46:05] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 175/278 variables, 103/146 constraints. Problems are: Problem set: 0 solved, 169 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 30/176 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (OVERLAPS) 0/278 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 176 constraints, problems are : Problem set: 0 solved, 169 unsolved in 16933 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 103/103 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:17] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:21] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:46:21] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:46:21] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:46:21] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:46:21] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:46:21] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:46:22] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:46:22] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:46:22] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:46:22] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:46:22] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:46:22] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:46:23] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:26] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:46:26] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 3 ms to minimize.
[2024-05-23 00:46:26] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:46:27] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:46:27] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:46:27] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:46:27] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:46:27] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:31] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:46:31] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-23 00:46:36] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 169 unsolved
SMT process timed out in 47066ms, After SMT, problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 47070ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/190 places, 175/382 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47652 ms. Remains : 103/190 places, 175/382 transitions.
[2024-05-23 00:46:43] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:46:43] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:46:43] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-23 00:46:43] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:46:43] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:46:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality741053741200636658.gal : 2 ms
[2024-05-23 00:46:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2047320915224272584.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/CTLCardinality741053741200636658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2047320915224272584.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,46070,0.736161,23848,2,11419,5,71047,6,0,590,45408,0


Converting to forward existential form...Done !
original formula: EG((p1_4_8==0))
=> equivalent forward existential formula: [FwdG(Init,(p1_4_8==0))] != FALSE
Hit Full ! (commute/partial/dont) 173/0/2
(forward)formula 0,1,4.43565,119920,1,0,8,541821,19,2,3480,143053,8
FORMULA Anderson-PT-06-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-23 00:46:48] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:46:48] [INFO ] Flatten gal took : 11 ms
Total runtime 1037795 ms.

BK_STOP 1716425208393

--------------------
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="Anderson-PT-06"
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 Anderson-PT-06, 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 r004-smll-171620118300329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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