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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 15:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 15:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 15:35 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 185K 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-05-CTLCardinality-2024-00
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-01
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-02
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-03
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-04
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-05
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-06
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-07
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-08
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-09
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-10
FORMULA_NAME Anderson-PT-05-CTLCardinality-2024-11
FORMULA_NAME Anderson-PT-05-CTLCardinality-2023-12
FORMULA_NAME Anderson-PT-05-CTLCardinality-2023-13
FORMULA_NAME Anderson-PT-05-CTLCardinality-2023-14
FORMULA_NAME Anderson-PT-05-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716422962986

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-23 00:09:25] [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:09:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:09:26] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-23 00:09:26] [INFO ] Transformed 161 places.
[2024-05-23 00:09:26] [INFO ] Transformed 365 transitions.
[2024-05-23 00:09:26] [INFO ] Found NUPN structural information;
[2024-05-23 00:09:26] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
FORMULA Anderson-PT-05-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 73 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 365/365 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 148 transition count 296
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 148 transition count 296
Applied a total of 26 rules in 67 ms. Remains 148 /161 variables (removed 13) and now considering 296/365 (removed 69) transitions.
// Phase 1: matrix 296 rows 148 cols
[2024-05-23 00:09:26] [INFO ] Computed 13 invariants in 51 ms
[2024-05-23 00:09:27] [INFO ] Implicit Places using invariants in 646 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 715 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/161 places, 296/365 transitions.
Applied a total of 0 rules in 12 ms. Remains 147 /147 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 833 ms. Remains : 147/161 places, 296/365 transitions.
Support contains 73 out of 147 places after structural reductions.
[2024-05-23 00:09:27] [INFO ] Flatten gal took : 121 ms
[2024-05-23 00:09:27] [INFO ] Flatten gal took : 59 ms
[2024-05-23 00:09:27] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 68 out of 147 places (down from 73) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2480 ms. (16 steps per ms) remains 1/48 properties
BEST_FIRST walk for 40002 steps (8 resets) in 358 ms. (111 steps per ms) remains 1/1 properties
// Phase 1: matrix 296 rows 147 cols
[2024-05-23 00:09:28] [INFO ] Computed 12 invariants in 12 ms
[2024-05-23 00:09:28] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/137 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/147 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 296/443 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/443 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 147/147 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 64/137 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Int declared 147/443 variables, and 12 constraints, problems are : Problem set: 1 solved, 0 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/147 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-23 00:09:29] [INFO ] Flatten gal took : 34 ms
[2024-05-23 00:09:29] [INFO ] Flatten gal took : 40 ms
[2024-05-23 00:09:29] [INFO ] Input system was already deterministic with 296 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 124 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 124 transition count 193
Applied a total of 46 rules in 27 ms. Remains 124 /147 variables (removed 23) and now considering 193/296 (removed 103) transitions.
// Phase 1: matrix 193 rows 124 cols
[2024-05-23 00:09:29] [INFO ] Computed 12 invariants in 12 ms
[2024-05-23 00:09:29] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-23 00:09:29] [INFO ] Invariant cache hit.
[2024-05-23 00:09:30] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:09:30] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2024-05-23 00:09:30] [INFO ] Invariant cache hit.
[2024-05-23 00:09:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:32] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 30 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 4 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:09:33] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:09:34] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-23 00:09:35] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:36] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 3 ms to minimize.
[2024-05-23 00:09:36] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 4 ms to minimize.
[2024-05-23 00:09:36] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:09:37] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:09:37] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:09:37] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:09:37] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:09:37] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:09:37] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:09:38] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:40] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:09:40] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:09:40] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:09:41] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:42] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:09:42] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-23 00:09:42] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:43] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:09:44] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 4 ms to minimize.
[2024-05-23 00:09:44] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:09:44] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 3 ms to minimize.
[2024-05-23 00:09:45] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:09:45] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-23 00:09:45] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:09:45] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:09:45] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:09:45] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:09:46] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:48] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:09:49] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:09:49] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:09:49] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:09:49] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:09:49] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:09:50] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:09:50] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:09:50] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-05-23 00:09:50] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:09:52] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 193/317 variables, 124/202 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/317 variables, and 222 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 188 unsolved
[2024-05-23 00:10:02] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:10:02] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:10:02] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:10:02] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:10:03] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:10:03] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:10:03] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:10:03] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/317 variables, and 86 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/188 constraints, Known Traps: 74/74 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Starting structural reductions in LTL mode, iteration 1 : 124/147 places, 193/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61152 ms. Remains : 124/147 places, 193/296 transitions.
[2024-05-23 00:10:30] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:10:30] [INFO ] Flatten gal took : 13 ms
[2024-05-23 00:10:30] [INFO ] Input system was already deterministic with 193 transitions.
[2024-05-23 00:10:30] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:10:30] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:10:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality18357351943636255332.gal : 9 ms
[2024-05-23 00:10:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality5076911744771613516.ctl : 6 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/CTLCardinality18357351943636255332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5076911744771613516.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,90616,0.960818,30980,2,11578,5,87907,6,0,692,75200,0


Converting to forward existential form...Done !
original formula: (EF((((p2_0_1==0) + (EG((ncs_3_0==1)) * (cs_2_2==1))) * AX(AX(FALSE)))) + AF(AX((A(!(((cs_1_2==0)||(p1_1_7==1))) U AG(((ncs_4_4==0)||(ncs...196
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((p2_0_1==0) + (EG((ncs_3_0==1)) * (cs_2_2==1))) * !(EX(!(!(EX(!(FALSE)))))))))),!(!(E...397
Reverse transition relation is NOT exact ! Due to transitions t21, t30, t39, t48, t57, t66, t75, t76, t85, t86, t90, t91, t95, t96, t103, t105, t168, t169,...394
(forward)formula 0,0,8.25935,214604,1,0,427,995413,417,220,5201,497890,471
FORMULA Anderson-PT-05-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 147 transition count 277
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 128 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 126 transition count 275
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 42 place count 126 transition count 258
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 76 place count 109 transition count 258
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 98 place count 87 transition count 156
Iterating global reduction 3 with 22 rules applied. Total rules applied 120 place count 87 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 85 transition count 154
Applied a total of 124 rules in 55 ms. Remains 85 /147 variables (removed 62) and now considering 154/296 (removed 142) transitions.
// Phase 1: matrix 154 rows 85 cols
[2024-05-23 00:10:39] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 00:10:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 00:10:39] [INFO ] Invariant cache hit.
[2024-05-23 00:10:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:10:39] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-23 00:10:39] [INFO ] Redundant transitions in 10 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-23 00:10:39] [INFO ] Invariant cache hit.
[2024-05-23 00:10:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:10:41] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:10:42] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:10:43] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:10:43] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:10:43] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:10:43] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:10:43] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:10:43] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:10:44] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 3 ms to minimize.
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:10:46] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:10:47] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:10:48] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:10:48] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:10:48] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:10:48] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:10:49] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:10:49] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 154/239 variables, 85/146 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 166 constraints, problems are : Problem set: 0 solved, 149 unsolved in 16325 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:10:59] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:11:01] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:11:04] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:11:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:11:05] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:11:09] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:11:09] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:11:09] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:11:10] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:11:11] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:11:11] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:11:12] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:11:15] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2024-05-23 00:11:16] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:11:16] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:11:16] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 3 ms to minimize.
[2024-05-23 00:11:16] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:11:16] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:11:19] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-23 00:11:23] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 85/239 variables, and 85 constraints, problems are : Problem set: 0 solved, 149 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/85 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/149 constraints, Known Traps: 73/73 constraints]
After SMT, in 46515ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 46523ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/147 places, 154/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47046 ms. Remains : 85/147 places, 154/296 transitions.
[2024-05-23 00:11:26] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:11:26] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:11:26] [INFO ] Input system was already deterministic with 154 transitions.
[2024-05-23 00:11:26] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:11:26] [INFO ] Flatten gal took : 16 ms
[2024-05-23 00:11:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality5815498379334305091.gal : 5 ms
[2024-05-23 00:11:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15470205458013050823.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/CTLCardinality5815498379334305091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15470205458013050823.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,12917,0.9215,22400,2,7162,5,53155,6,0,497,39983,0


Converting to forward existential form...Done !
original formula: AG((((p3_3_3==0)||(ncs_3_2==1)) + ((A((ncs_2_1==1) U ((p2_2_3==0)||(p1_1_6==1))) * (p1_0_0==1)) * ((((next_5==0)||(p3_3_1==1))||((p2_0_4=...206
=> equivalent forward existential formula: ((([(FwdU((FwdU(Init,TRUE) * !(((p3_3_3==0)||(ncs_3_2==1)))),!(((p2_2_3==0)||(p1_1_6==1)))) * (!((ncs_2_1==1)) *...538
(forward)formula 0,0,0.939345,22400,1,0,11,53155,11,4,534,39983,2
FORMULA Anderson-PT-05-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 122 transition count 167
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 122 transition count 167
Applied a total of 50 rules in 25 ms. Remains 122 /147 variables (removed 25) and now considering 167/296 (removed 129) transitions.
// Phase 1: matrix 167 rows 122 cols
[2024-05-23 00:11:27] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:11:27] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-23 00:11:27] [INFO ] Invariant cache hit.
[2024-05-23 00:11:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:11:28] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-23 00:11:28] [INFO ] Invariant cache hit.
[2024-05-23 00:11:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:29] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
[2024-05-23 00:11:29] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:11:30] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:11:30] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:11:30] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 3 ms to minimize.
[2024-05-23 00:11:30] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:11:30] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:11:30] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:11:31] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:11:34] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 1 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:11:35] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:11:36] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:37] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 3 ms to minimize.
[2024-05-23 00:11:37] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:11:38] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 3 ms to minimize.
[2024-05-23 00:11:38] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:40] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:41] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:11:41] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:11:41] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 2 ms to minimize.
[2024-05-23 00:11:42] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:42] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:11:43] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:11:44] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:46] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:11:46] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:11:46] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 3 ms to minimize.
[2024-05-23 00:11:46] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (OVERLAPS) 167/289 variables, 122/181 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 15 (OVERLAPS) 0/289 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 201 constraints, problems are : Problem set: 0 solved, 162 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:11:59] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:11:59] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:11:59] [INFO ] Deduced a trap composed of 74 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:11:59] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:12:00] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:12:00] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:12:00] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:12:00] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:12:01] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 3 ms to minimize.
[2024-05-23 00:12:01] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 3 ms to minimize.
[2024-05-23 00:12:02] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:12:02] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:12:03] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:12:03] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:12:03] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:12:04] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:12:04] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:12:04] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:12:05] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:12:05] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-23 00:12:06] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:12:07] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:12:07] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:12:08] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 122/289 variables, and 83 constraints, problems are : Problem set: 0 solved, 162 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/122 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/162 constraints, Known Traps: 71/71 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 122/147 places, 167/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 122/147 places, 167/296 transitions.
[2024-05-23 00:12:28] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:12:28] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:12:28] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-23 00:12:28] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:12:28] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:12:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16517039843480017433.gal : 3 ms
[2024-05-23 00:12:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7648653380936774955.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/CTLCardinality16517039843480017433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7648653380936774955.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,70287,0.917758,24300,2,10141,5,65788,6,0,658,57236,0


Converting to forward existential form...Done !
original formula: AF((EF((p1_4_5!=0)) + EG((AX((p1_0_6==0)) + ((p2_0_3==0)&&(p3_1_3==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (p1_4_5!=0)) + EG((!(EX(!((p1_0_6==0)))) + ((p2_0_3==0)&&(p3_1_3==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t47, t48, t49, t51, t52, t53, t54, t56, t57, t58, t59, t61, t62, t63, t64, t67, t68, t69...422
Using saturation style SCC detection
(forward)formula 0,1,14.8903,346908,1,0,397,2.13528e+06,370,193,4860,851544,396
FORMULA Anderson-PT-05-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 122 transition count 175
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 122 transition count 175
Applied a total of 50 rules in 7 ms. Remains 122 /147 variables (removed 25) and now considering 175/296 (removed 121) transitions.
// Phase 1: matrix 175 rows 122 cols
[2024-05-23 00:12:43] [INFO ] Computed 12 invariants in 11 ms
[2024-05-23 00:12:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-23 00:12:43] [INFO ] Invariant cache hit.
[2024-05-23 00:12:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:12:43] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-23 00:12:43] [INFO ] Invariant cache hit.
[2024-05-23 00:12:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-23 00:12:45] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:12:45] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:12:46] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:12:46] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:12:46] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:12:46] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:12:46] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:12:46] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:12:47] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:12:48] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:12:48] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:12:48] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:12:48] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-23 00:12:49] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:12:49] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:12:49] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:12:49] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:12:49] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:12:49] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:12:50] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
[2024-05-23 00:12:50] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-23 00:12:50] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:12:50] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-23 00:12:50] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-23 00:12:50] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 175/297 variables, 122/166 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 186 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-23 00:13:01] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:13:01] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:13:01] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:13:01] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:13:01] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-23 00:13:01] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:13:02] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:13:02] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:13:02] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:13:02] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-23 00:13:03] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:13:03] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:13:03] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:13:03] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 175/297 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 170/370 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 370 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 122/122 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 46/46 constraints]
After SMT, in 46310ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 46314ms
Starting structural reductions in LTL mode, iteration 1 : 122/147 places, 175/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46824 ms. Remains : 122/147 places, 175/296 transitions.
[2024-05-23 00:13:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:13:30] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:13:30] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-23 00:13:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:13:30] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:13:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15639349701337457463.gal : 2 ms
[2024-05-23 00:13:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality16802952840400240919.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/CTLCardinality15639349701337457463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16802952840400240919.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,73111,1.07029,24292,2,10968,5,66166,6,0,666,54247,0


Converting to forward existential form...Done !
original formula: (EX((EF(((p1_1_4==0)&&(ncs_3_4==1))) * ((AG(((next_1==0)||(p3_4_3==1))) + (cs_0_2==0)) + (p1_2_0==0)))) * EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * EX((E(TRUE U ((p1_1_4==0)&&(ncs_3_4==1))) * ((!(E(TRUE U !(((next_1==0)||(p3_4_3==1))))) + (cs_0_2=...196
Reverse transition relation is NOT exact ! Due to transitions t55, t56, t57, t58, t60, t61, t62, t63, t70, t71, t72, t73, t75, t76, t77, t78, t87, t150, t1...397
(forward)formula 0,1,8.82308,194852,1,0,414,1.00991e+06,375,213,4825,459390,446
FORMULA Anderson-PT-05-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 123 transition count 176
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 123 transition count 176
Applied a total of 48 rules in 5 ms. Remains 123 /147 variables (removed 24) and now considering 176/296 (removed 120) transitions.
// Phase 1: matrix 176 rows 123 cols
[2024-05-23 00:13:39] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 00:13:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-23 00:13:39] [INFO ] Invariant cache hit.
[2024-05-23 00:13:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:13:39] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-23 00:13:39] [INFO ] Invariant cache hit.
[2024-05-23 00:13:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:40] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:13:40] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:13:40] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:13:40] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:13:41] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 3 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:13:42] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:43] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:13:43] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:13:43] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:13:43] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:13:43] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 5 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 3 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:13:44] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:46] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:13:46] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:47] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:13:47] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:13:47] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:13:47] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:13:47] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:13:48] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:13:49] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:50] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:13:50] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:13:50] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:13:50] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:13:51] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:13:51] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:13:51] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:13:51] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:53] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:13:53] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:54] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:13:54] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:13:54] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:13:54] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:13:54] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
[2024-05-23 00:13:55] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-23 00:13:55] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2024-05-23 00:13:55] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-23 00:13:55] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-23 00:13:55] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:13:56] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:13:56] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:13:56] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:13:56] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:13:57] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:13:58] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:14:00] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (OVERLAPS) 176/299 variables, 123/218 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 15 (OVERLAPS) 0/299 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 238 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:14:10] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:14:11] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:14:12] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:14:13] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:14:13] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:14:13] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 3 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 3 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 3 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-23 00:14:14] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 3 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:14:15] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-05-23 00:14:16] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:14:18] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-23 00:14:21] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 123/299 variables, and 122 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/171 constraints, Known Traps: 110/110 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 123/147 places, 176/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 123/147 places, 176/296 transitions.
[2024-05-23 00:14:39] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:14:39] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:14:39] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-23 00:14:39] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:14:39] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:14:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality36293852580764199.gal : 3 ms
[2024-05-23 00:14:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality16581346115587337460.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/CTLCardinality36293852580764199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16581346115587337460.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,79066,0.998258,25968,2,11313,5,72966,6,0,671,65788,0


Converting to forward existential form...Done !
original formula: E(AG(!(AF((p2_1_1==1)))) U A(AX((p2_4_2==1)) U AX(A(((slot_F.F.F.F.T==0)||(p1_2_3==1)) U !(((ncs_4_0==0)||(p1_2_6==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !(!(!(EG(!((p2_1_1==1))))))))) * !(EG(!(!(EX(!(!((E(!(!(((ncs_4_0==0)||(p1_2_6==1)))) U ...676
Reverse transition relation is NOT exact ! Due to transitions t40, t56, t57, t58, t61, t62, t63, t71, t72, t73, t76, t77, t78, t88, t90, t92, t151, t152, t...392
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-23 00:15:09] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:15:09] [INFO ] Applying decomposition
[2024-05-23 00:15:09] [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/graph7607351904127071175.txt' '-o' '/tmp/graph7607351904127071175.bin' '-w' '/tmp/graph7607351904127071175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7607351904127071175.bin' '-l' '-1' '-v' '-w' '/tmp/graph7607351904127071175.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:15:09] [INFO ] Decomposing Gal with order
[2024-05-23 00:15:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:15:10] [INFO ] Removed a total of 253 redundant transitions.
[2024-05-23 00:15:10] [INFO ] Flatten gal took : 70 ms
[2024-05-23 00:15:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2024-05-23 00:15:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality13269500628149574907.gal : 8 ms
[2024-05-23 00:15:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality18424148686064899887.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/CTLCardinality13269500628149574907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18424148686064899887.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,79066,0.360694,12792,1682,25,20200,167,471,14259,38,308,0


Converting to forward existential form...Done !
original formula: E(AG(!(AF((i3.u17.p2_1_1==1)))) U A(AX((i2.u28.p2_4_2==1)) U AX(A(((i5.u42.slot_F.F.F.F.T==0)||(i1.u22.p1_2_3==1)) U !(((i2.u51.ncs_4_0==...183
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !(!(!(EG(!((i3.u17.p2_1_1==1))))))))) * !(EG(!(!(EX(!(!((E(!(!(((i2.u51.ncs_4_0==0)||(i3...858
Reverse transition relation is NOT exact ! Due to transitions t40, t151, t152, t153, t154, t155, t156, t157, t158, t159, t160, t161, t162, t163, t164, t165...449
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,1,4.34436,125676,1,0,252534,273,2865,210953,198,876,928186
FORMULA Anderson-PT-05-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 123 transition count 176
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 123 transition count 176
Applied a total of 48 rules in 5 ms. Remains 123 /147 variables (removed 24) and now considering 176/296 (removed 120) transitions.
// Phase 1: matrix 176 rows 123 cols
[2024-05-23 00:15:14] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:15:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-23 00:15:14] [INFO ] Invariant cache hit.
[2024-05-23 00:15:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:15:14] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-23 00:15:14] [INFO ] Invariant cache hit.
[2024-05-23 00:15:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:16] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:15:16] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:15:16] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:15:16] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:15:16] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 3 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:15:17] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:15:18] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:19] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:15:19] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 3 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:15:20] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:22] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:15:22] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:15:22] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-23 00:15:22] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:15:22] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:23] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 3 ms to minimize.
[2024-05-23 00:15:23] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:24] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:15:24] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 3 ms to minimize.
[2024-05-23 00:15:24] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 3 ms to minimize.
[2024-05-23 00:15:24] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:26] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 3 ms to minimize.
[2024-05-23 00:15:26] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:15:26] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:15:26] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:15:26] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:15:26] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:15:27] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
[2024-05-23 00:15:27] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:15:27] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:15:27] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:15:27] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:28] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 3 ms to minimize.
[2024-05-23 00:15:28] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:29] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:30] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:15:31] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 3 ms to minimize.
[2024-05-23 00:15:31] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:32] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:33] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:15:33] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 3 ms to minimize.
[2024-05-23 00:15:33] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:35] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:15:35] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:15:35] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:15:35] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:15:35] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:15:35] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:15:36] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:37] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:15:37] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:38] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:15:38] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:15:38] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/123 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-23 00:15:41] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/123 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (OVERLAPS) 176/299 variables, 123/212 constraints. Problems are: Problem set: 0 solved, 171 unsolved
SMT process timed out in 30086ms, After SMT, problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 30089ms
Starting structural reductions in LTL mode, iteration 1 : 123/147 places, 176/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30605 ms. Remains : 123/147 places, 176/296 transitions.
[2024-05-23 00:15:45] [INFO ] Flatten gal took : 14 ms
[2024-05-23 00:15:45] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:15:45] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-23 00:15:45] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:15:45] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:15:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13365333362985994044.gal : 3 ms
[2024-05-23 00:15:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality364474868696662462.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/CTLCardinality13365333362985994044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality364474868696662462.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,77607,1.08954,24152,2,10456,5,67420,6,0,671,55330,0


Converting to forward existential form...Done !
original formula: !(A(AX(EX(((next_5==0)||(cs_4_3==1)))) U ((!(((E((p3_4_0==1) U (ncs_2_1==1)) + (p1_2_1==1)) + (next_8!=1))) + !(AF(!(((p1_3_6==0)||(p3_2_...197
=> equivalent forward existential formula: ((([(FwdU((((FwdU(Init,!(((!(((E((p3_4_0==1) U (ncs_2_1==1)) + (p1_2_1==1)) + (next_8!=1))) + !(!(EG(!(!(((p1_3_...1189
Reverse transition relation is NOT exact ! Due to transitions t56, t57, t58, t61, t62, t63, t66, t67, t68, t71, t72, t73, t76, t77, t78, t88, t93, t151, t1...397
(forward)formula 0,0,7.29451,170740,1,0,393,806601,397,197,4764,454593,387
FORMULA Anderson-PT-05-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 124 transition count 185
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 124 transition count 185
Applied a total of 46 rules in 6 ms. Remains 124 /147 variables (removed 23) and now considering 185/296 (removed 111) transitions.
// Phase 1: matrix 185 rows 124 cols
[2024-05-23 00:15:52] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:15:52] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-23 00:15:52] [INFO ] Invariant cache hit.
[2024-05-23 00:15:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:15:53] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-23 00:15:53] [INFO ] Invariant cache hit.
[2024-05-23 00:15:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:15:55] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 2 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:15:56] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 3 ms to minimize.
[2024-05-23 00:15:57] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:15:58] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:15:58] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:15:58] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-05-23 00:15:58] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:15:59] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:15:59] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 3 ms to minimize.
[2024-05-23 00:15:59] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:15:59] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 3 ms to minimize.
[2024-05-23 00:16:00] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:16:00] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:02] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2024-05-23 00:16:02] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:16:02] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:16:02] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:16:02] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 3 ms to minimize.
[2024-05-23 00:16:03] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:03] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:16:04] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-05-23 00:16:04] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 3 ms to minimize.
[2024-05-23 00:16:04] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:16:04] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:05] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:16:06] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-23 00:16:06] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:16:06] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:16:06] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 2 ms to minimize.
[2024-05-23 00:16:06] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
[2024-05-23 00:16:07] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 3 ms to minimize.
[2024-05-23 00:16:07] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 3 ms to minimize.
[2024-05-23 00:16:07] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:16:07] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 4 ms to minimize.
[2024-05-23 00:16:07] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 3 ms to minimize.
[2024-05-23 00:16:08] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:10] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-23 00:16:10] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:16:10] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:16:10] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:16:11] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 3 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:16:12] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:16:13] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:15] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 6 ms to minimize.
[2024-05-23 00:16:15] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:16:15] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-23 00:16:16] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-05-23 00:16:16] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 3 ms to minimize.
[2024-05-23 00:16:18] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 185/309 variables, 124/205 constraints. Problems are: Problem set: 0 solved, 180 unsolved
SMT process timed out in 30114ms, After SMT, problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Starting structural reductions in LTL mode, iteration 1 : 124/147 places, 185/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30941 ms. Remains : 124/147 places, 185/296 transitions.
[2024-05-23 00:16:23] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:16:23] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:16:23] [INFO ] Input system was already deterministic with 185 transitions.
[2024-05-23 00:16:23] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:16:23] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:16:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4296088665895215994.gal : 3 ms
[2024-05-23 00:16:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3479550327981222383.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/CTLCardinality4296088665895215994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3479550327981222383.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,86545,1.04288,27524,2,11417,5,82997,6,0,684,73073,0


Converting to forward existential form...Done !
original formula: EF((EX(((ncs_3_4==0)||(p1_0_7==1))) * EF(((ncs_3_1!=0)&&(p1_4_2!=1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(((ncs_3_4==0)||(p1_0_7==1)))),TRUE) * ((ncs_3_1!=0)&&(p1_4_2!=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t66, t67, t71, t72, t76, t77, t81, t82, t86, t87, t90, t107, t160, t161, t162, t163, t164, t1...373
(forward)formula 0,1,5.95736,150572,1,0,373,630744,388,190,4964,313223,380
FORMULA Anderson-PT-05-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 147 transition count 272
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 123 transition count 272
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 48 place count 123 transition count 252
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 88 place count 103 transition count 252
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 115 place count 76 transition count 121
Iterating global reduction 2 with 27 rules applied. Total rules applied 142 place count 76 transition count 121
Applied a total of 142 rules in 23 ms. Remains 76 /147 variables (removed 71) and now considering 121/296 (removed 175) transitions.
// Phase 1: matrix 121 rows 76 cols
[2024-05-23 00:16:29] [INFO ] Computed 12 invariants in 7 ms
[2024-05-23 00:16:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-23 00:16:29] [INFO ] Invariant cache hit.
[2024-05-23 00:16:29] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:16:29] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-23 00:16:29] [INFO ] Redundant transitions in 5 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-23 00:16:29] [INFO ] Invariant cache hit.
[2024-05-23 00:16:29] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-23 00:16:31] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:16:31] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-23 00:16:31] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:16:32] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:16:33] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:16:34] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-23 00:16:34] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 121/197 variables, 76/114 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 116 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/197 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 134 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9681 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-23 00:16:41] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:16:41] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 121/197 variables, 76/116 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-23 00:16:52] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:16:52] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/197 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 254 constraints, problems are : Problem set: 0 solved, 116 unsolved in 21234 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 76/76 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 30/30 constraints]
After SMT, in 30987ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 30990ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/147 places, 121/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31345 ms. Remains : 76/147 places, 121/296 transitions.
[2024-05-23 00:17:00] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:17:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:17:00] [INFO ] Input system was already deterministic with 121 transitions.
RANDOM walk for 633 steps (0 resets) in 8 ms. (70 steps per ms) remains 0/1 properties
FORMULA Anderson-PT-05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 00:17:00] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:17:00] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:17:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10891090851646705644.gal : 2 ms
[2024-05-23 00:17:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7869382557363883549.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10891090851646705644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7869382557363883549.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 LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 121 transition count 166
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 121 transition count 166
Applied a total of 52 rules in 7 ms. Remains 121 /147 variables (removed 26) and now considering 166/296 (removed 130) transitions.
// Phase 1: matrix 166 rows 121 cols
[2024-05-23 00:17:01] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:17:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:17:01] [INFO ] Invariant cache hit.
[2024-05-23 00:17:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:17:01] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-23 00:17:01] [INFO ] Invariant cache hit.
[2024-05-23 00:17:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 3 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 2 ms to minimize.
[2024-05-23 00:17:03] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 2 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 3 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 3 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
[2024-05-23 00:17:04] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 2 ms to minimize.
[2024-05-23 00:17:05] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:06] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 3 ms to minimize.
[2024-05-23 00:17:07] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:09] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:10] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:14] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:17:14] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:17:14] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:17:14] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 166/287 variables, 121/164 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 184 constraints, problems are : Problem set: 0 solved, 161 unsolved in 23744 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 121/121 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:26] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 3 ms to minimize.
[2024-05-23 00:17:26] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:17:27] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:17:27] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:28] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-05-23 00:17:28] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-23 00:17:29] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:30] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:17:31] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:32] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:34] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 3 ms to minimize.
[2024-05-23 00:17:34] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-23 00:17:52] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:17:52] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:17:52] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:17:54] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/287 variables, and 59 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/121 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/161 constraints, Known Traps: 47/47 constraints]
After SMT, in 53838ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 53842ms
Starting structural reductions in LTL mode, iteration 1 : 121/147 places, 166/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54413 ms. Remains : 121/147 places, 166/296 transitions.
[2024-05-23 00:17:55] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:17:55] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:17:55] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-23 00:17:55] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:17:55] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:17:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4523901447495467348.gal : 2 ms
[2024-05-23 00:17:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality566962252726729605.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/CTLCardinality4523901447495467348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality566962252726729605.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,66470,0.734014,20036,2,10379,5,58862,6,0,653,51681,0


Converting to forward existential form...Done !
original formula: EX(AX(AG(((p2_0_4==0)||(p1_2_5==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !(((p2_0_4==0)||(p1_2_5==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t47, t48, t49, t51, t52, t53, t54, t61, t62, t63, t64, t66, t67, t68, t69, t78, t141, t1...397
(forward)formula 0,0,7.73368,165780,1,0,372,869802,354,181,4558,366853,372
FORMULA Anderson-PT-05-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 147 transition count 276
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 127 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 126 transition count 275
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 42 place count 126 transition count 257
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 78 place count 108 transition count 257
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 102 place count 84 transition count 145
Iterating global reduction 3 with 24 rules applied. Total rules applied 126 place count 84 transition count 145
Applied a total of 126 rules in 33 ms. Remains 84 /147 variables (removed 63) and now considering 145/296 (removed 151) transitions.
// Phase 1: matrix 145 rows 84 cols
[2024-05-23 00:18:03] [INFO ] Computed 12 invariants in 1 ms
[2024-05-23 00:18:03] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-23 00:18:03] [INFO ] Invariant cache hit.
[2024-05-23 00:18:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:18:03] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-05-23 00:18:03] [INFO ] Redundant transitions in 7 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-23 00:18:03] [INFO ] Invariant cache hit.
[2024-05-23 00:18:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:04] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:18:04] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
[2024-05-23 00:18:04] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:18:05] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:06] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-23 00:18:07] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:18:07] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:08] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:09] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:09] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:18:10] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:18:10] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:18:10] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:18:10] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:11] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
[2024-05-23 00:18:11] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:12] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:18:12] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-23 00:18:12] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:18:12] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 145/229 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (OVERLAPS) 0/229 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 152 constraints, problems are : Problem set: 0 solved, 140 unsolved in 14617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:19] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:22] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 145/229 variables, 84/134 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 140/294 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:28] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-23 00:18:33] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/229 variables, and 296 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 40/40 constraints]
After SMT, in 44724ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 44727ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/147 places, 145/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45261 ms. Remains : 84/147 places, 145/296 transitions.
[2024-05-23 00:18:48] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:18:48] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:18:48] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-23 00:18:48] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:18:48] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:18:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13024601284196785882.gal : 2 ms
[2024-05-23 00:18:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6028695749162425859.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/CTLCardinality13024601284196785882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6028695749162425859.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,11104,0.674124,18660,2,7188,5,46623,6,0,484,32671,0


Converting to forward existential form...Done !
original formula: AF(AG((((p3_1_4==0) + A(AF((p1_0_2==0)) U ((p2_2_2==1)||(cs_4_2==1)))) + (AF(((next_4==0)&&(cs_1_1==1))) + (A(((ncs_0_3==0)||(ncs_1_1==1)...190
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p3_1_4==0) + !((E(!(((p2_2_2==1)||(cs_4_2==1))) U (!(!(EG(!((p1_0_2==0))))) * !(((p...391
Reverse transition relation is NOT exact ! Due to transitions t71, t72, t76, t77, t81, t82, t86, t87, t88, t98, t99, t100, t102, t103, t105, t107, t108, t1...355
(forward)formula 0,0,13.0133,332156,1,0,763,2.028e+06,344,372,4092,852125,895
FORMULA Anderson-PT-05-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 120 transition count 165
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 120 transition count 165
Applied a total of 54 rules in 5 ms. Remains 120 /147 variables (removed 27) and now considering 165/296 (removed 131) transitions.
// Phase 1: matrix 165 rows 120 cols
[2024-05-23 00:19:01] [INFO ] Computed 12 invariants in 3 ms
[2024-05-23 00:19:01] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-23 00:19:01] [INFO ] Invariant cache hit.
[2024-05-23 00:19:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:19:02] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-23 00:19:02] [INFO ] Invariant cache hit.
[2024-05-23 00:19:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 3 ms to minimize.
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:19:04] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 3 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
[2024-05-23 00:19:05] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 2 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:19:06] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 165/285 variables, 120/149 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 169 constraints, problems are : Problem set: 0 solved, 160 unsolved in 15109 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:19:18] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-23 00:19:18] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-23 00:19:19] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:19:20] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:19:20] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-23 00:19:20] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-23 00:19:20] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-23 00:19:20] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:19:21] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-05-23 00:19:22] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:19:23] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:19:23] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2024-05-23 00:19:23] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-23 00:19:23] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-05-23 00:19:24] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 165/285 variables, 120/164 constraints. Problems are: Problem set: 0 solved, 160 unsolved
SMT process timed out in 45200ms, After SMT, problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 45203ms
Starting structural reductions in LTL mode, iteration 1 : 120/147 places, 165/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45918 ms. Remains : 120/147 places, 165/296 transitions.
[2024-05-23 00:19:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:19:47] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:19:47] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-23 00:19:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:19:47] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:19:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality17666265531939446080.gal : 2 ms
[2024-05-23 00:19:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality1517779097416050298.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/CTLCardinality17666265531939446080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1517779097416050298.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,63305,0.650239,17128,2,9124,5,48452,6,0,648,35894,0


Converting to forward existential form...Done !
original formula: AX(((p2_0_4==0)&&(p3_1_3==1)))
=> equivalent forward existential formula: [(EY(Init) * !(((p2_0_4==0)&&(p3_1_3==1))))] = FALSE
(forward)formula 0,0,0.658806,17128,1,0,9,48452,9,2,943,35894,2
FORMULA Anderson-PT-05-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 147 transition count 275
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 126 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 125 transition count 274
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 44 place count 125 transition count 257
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 78 place count 108 transition count 257
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 102 place count 84 transition count 145
Iterating global reduction 3 with 24 rules applied. Total rules applied 126 place count 84 transition count 145
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 128 place count 83 transition count 144
Applied a total of 128 rules in 21 ms. Remains 83 /147 variables (removed 64) and now considering 144/296 (removed 152) transitions.
// Phase 1: matrix 144 rows 83 cols
[2024-05-23 00:19:48] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:19:48] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 00:19:48] [INFO ] Invariant cache hit.
[2024-05-23 00:19:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:19:48] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-23 00:19:48] [INFO ] Redundant transitions in 8 ms returned []
Running 139 sub problems to find dead transitions.
[2024-05-23 00:19:48] [INFO ] Invariant cache hit.
[2024-05-23 00:19:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:19:49] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:19:50] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-23 00:19:51] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:19:51] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-23 00:19:51] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:19:51] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:19:51] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:19:51] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:19:52] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2024-05-23 00:19:52] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:19:52] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:19:52] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:19:52] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:19:52] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:19:53] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:19:53] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:19:53] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:19:53] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:19:53] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 144/227 variables, 83/124 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 144 constraints, problems are : Problem set: 0 solved, 139 unsolved in 13208 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:02] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:03] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:20:03] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:06] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:20:06] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:20:06] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:07] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:20:07] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-23 00:20:08] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:20:08] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:20:08] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:20:08] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-23 00:20:08] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:20:09] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:20:09] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:11] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:20:11] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:20:11] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:13] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:20:13] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-23 00:20:14] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-23 00:20:14] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:17] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:20] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:20:20] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-23 00:20:20] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/83 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 12 (OVERLAPS) 144/227 variables, 83/150 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 139/309 constraints. Problems are: Problem set: 0 solved, 139 unsolved
[2024-05-23 00:20:30] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 310 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 56/56 constraints]
After SMT, in 43328ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 43333ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/147 places, 144/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43793 ms. Remains : 83/147 places, 144/296 transitions.
[2024-05-23 00:20:32] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:20:32] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:20:32] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-23 00:20:32] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:20:32] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:20:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality9664623561679574331.gal : 2 ms
[2024-05-23 00:20:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16920725345319583920.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/CTLCardinality9664623561679574331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16920725345319583920.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,11822,0.691515,15760,2,5834,5,39665,6,0,479,28793,0


Converting to forward existential form...Done !
original formula: AG((EG(AF((cs_4_1==1))) + (E((p2_1_0==1) U ((ncs_2_1==0)||(p1_1_3==1))) * EF((((p2_0_1==1)||(ncs_4_3==0))||(p3_0_1==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E((p2_1_0==1) U ((ncs_2_1==0)||(p1_1_3==1))) * E(TRUE U (((p2_0_1==1)||(ncs_4_3==0))||(p...210
Reverse transition relation is NOT exact ! Due to transitions t66, t76, t81, t86, t89, t98, t99, t100, t101, t102, t103, t104, t105, t106, t107, t109, t110...335
Using saturation style SCC detection
(forward)formula 0,0,7.75598,172156,1,0,490,988476,328,247,4062,445199,526
FORMULA Anderson-PT-05-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 147 transition count 272
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 123 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 122 transition count 271
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 50 place count 122 transition count 251
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 90 place count 102 transition count 251
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 117 place count 75 transition count 120
Iterating global reduction 3 with 27 rules applied. Total rules applied 144 place count 75 transition count 120
Applied a total of 144 rules in 31 ms. Remains 75 /147 variables (removed 72) and now considering 120/296 (removed 176) transitions.
// Phase 1: matrix 120 rows 75 cols
[2024-05-23 00:20:40] [INFO ] Computed 12 invariants in 1 ms
[2024-05-23 00:20:40] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-23 00:20:40] [INFO ] Invariant cache hit.
[2024-05-23 00:20:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:20:40] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2024-05-23 00:20:40] [INFO ] Redundant transitions in 1 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-23 00:20:40] [INFO ] Invariant cache hit.
[2024-05-23 00:20:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-23 00:20:41] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:20:41] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:20:41] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:20:41] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-23 00:20:43] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-23 00:20:44] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:20:44] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-23 00:20:44] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:20:45] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-23 00:20:45] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-23 00:20:45] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-23 00:20:45] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:20:45] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:20:45] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:20:46] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 120/195 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (OVERLAPS) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 129 constraints, problems are : Problem set: 0 solved, 115 unsolved in 10703 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 120/195 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/195 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 244 constraints, problems are : Problem set: 0 solved, 115 unsolved in 12583 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 75/75 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 22/22 constraints]
After SMT, in 23363ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 23365ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/147 places, 120/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23872 ms. Remains : 75/147 places, 120/296 transitions.
[2024-05-23 00:21:03] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:21:03] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:21:03] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-23 00:21:03] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:21:03] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:21:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality933973435022087975.gal : 2 ms
[2024-05-23 00:21:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6318376294086486605.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/CTLCardinality933973435022087975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6318376294086486605.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,5540,0.214348,10548,2,5125,5,23830,6,0,423,16141,0


Converting to forward existential form...Done !
original formula: EF(AG((p3_4_3==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p3_4_3==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93...286
(forward)formula 0,0,2.00009,53336,1,0,271,230757,262,124,3430,98249,253
FORMULA Anderson-PT-05-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 120 transition count 165
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 120 transition count 165
Applied a total of 54 rules in 4 ms. Remains 120 /147 variables (removed 27) and now considering 165/296 (removed 131) transitions.
// Phase 1: matrix 165 rows 120 cols
[2024-05-23 00:21:05] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:21:06] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-23 00:21:06] [INFO ] Invariant cache hit.
[2024-05-23 00:21:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:21:06] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-23 00:21:06] [INFO ] Invariant cache hit.
[2024-05-23 00:21:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:21:08] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 2 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-23 00:21:09] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:21:10] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 165/285 variables, 120/149 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 169 constraints, problems are : Problem set: 0 solved, 160 unsolved in 12171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:21:19] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:21:19] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-23 00:21:19] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:21:20] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:21:20] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-23 00:21:21] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-05-23 00:21:21] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 2 ms to minimize.
[2024-05-23 00:21:21] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:21:22] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
[2024-05-23 00:21:22] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-23 00:21:23] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-05-23 00:21:23] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:21:23] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 3 ms to minimize.
[2024-05-23 00:21:23] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:21:24] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 1/120 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 165/285 variables, 120/164 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 344 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 120/120 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 32/32 constraints]
After SMT, in 42273ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 42277ms
Starting structural reductions in LTL mode, iteration 1 : 120/147 places, 165/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42865 ms. Remains : 120/147 places, 165/296 transitions.
[2024-05-23 00:21:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:21:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:21:48] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-23 00:21:48] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:21:48] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:21:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality18065226767895786501.gal : 1 ms
[2024-05-23 00:21:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14758642858640639040.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/CTLCardinality18065226767895786501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14758642858640639040.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,63305,0.44559,16860,2,9124,5,48452,6,0,648,35894,0


Converting to forward existential form...Done !
original formula: AF(AX(AF(EG(((cs_3_0!=0)&&(cs_4_2!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(EG(((cs_3_0!=0)&&(cs_4_2!=1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t140, t141, t142, t143, t144, t145, t146, t147, t148, t149, t150, t151, t152, t153, t154, t15...312
(forward)formula 0,0,4.50438,134668,1,0,352,561575,358,170,4663,283871,398
FORMULA Anderson-PT-05-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 147/147 places, 296/296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 147 transition count 272
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 123 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 122 transition count 271
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 50 place count 122 transition count 255
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 82 place count 106 transition count 255
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 106 place count 82 transition count 127
Iterating global reduction 3 with 24 rules applied. Total rules applied 130 place count 82 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 79 transition count 124
Applied a total of 136 rules in 12 ms. Remains 79 /147 variables (removed 68) and now considering 124/296 (removed 172) transitions.
// Phase 1: matrix 124 rows 79 cols
[2024-05-23 00:21:53] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 00:21:53] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-23 00:21:53] [INFO ] Invariant cache hit.
[2024-05-23 00:21:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-23 00:21:53] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-23 00:21:53] [INFO ] Redundant transitions in 1 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-23 00:21:53] [INFO ] Invariant cache hit.
[2024-05-23 00:21:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:21:54] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:21:54] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:21:54] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:21:55] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:21:56] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-23 00:21:56] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:21:56] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-23 00:21:56] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:21:56] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 1/79 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:21:57] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:21:57] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:21:57] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:21:58] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 124/203 variables, 79/110 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 130 constraints, problems are : Problem set: 0 solved, 119 unsolved in 9652 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:04] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-23 00:22:04] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-23 00:22:04] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:22:04] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:05] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:22:05] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-23 00:22:05] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-23 00:22:05] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-23 00:22:05] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:22:05] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:22:06] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:22:06] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-23 00:22:06] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:09] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:22:09] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 2 ms to minimize.
[2024-05-23 00:22:10] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-23 00:22:10] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:14] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-23 00:22:14] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-23 00:22:15] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-23 00:22:15] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:17] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:19] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-23 00:22:20] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-23 00:22:20] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:22] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:22:23] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 1/79 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:31] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-23 00:22:31] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-23 00:22:33] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 79/203 variables, and 61 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/79 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/119 constraints, Known Traps: 49/49 constraints]
After SMT, in 39742ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 39744ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/147 places, 124/296 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40087 ms. Remains : 79/147 places, 124/296 transitions.
[2024-05-23 00:22:33] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:22:33] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:22:33] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-23 00:22:33] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:22:33] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:22:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3628406491906734717.gal : 2 ms
[2024-05-23 00:22:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15325856044530753028.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/CTLCardinality3628406491906734717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15325856044530753028.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,9139,0.477524,13240,2,6292,5,30827,6,0,443,22398,0


Converting to forward existential form...Done !
original formula: AG(((!(A(EG((p1_1_7==1)) U (next_1==0))) + !(A((p1_2_8==1) U !(((p1_3_2==0)||(p3_0_0==1)))))) + AG(AF((p2_0_0==0)))))
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,TRUE) * !((!(!((E(!((next_1==0)) U (!(EG((p1_1_7==1))) * !((next_1==0)))) + EG(!((next_1==...335
Reverse transition relation is NOT exact ! Due to transitions t45, t46, t50, t51, t55, t56, t65, t66, t69, t70, t80, t81, t82, t83, t84, t85, t86, t87, t88...341
Hit Full ! (commute/partial/dont) 122/0/2
(forward)formula 0,1,4.1981,125456,1,0,442,591389,295,199,3701,301999,477
FORMULA Anderson-PT-05-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-23 00:22:37] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:22:37] [INFO ] Flatten gal took : 7 ms
Total runtime 792268 ms.

BK_STOP 1716423757858

--------------------
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-05"
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-05, 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-171620118300321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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