Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717370380541

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 23:19:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:19:43] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-02 23:19:43] [INFO ] Transformed 196 places.
[2024-06-02 23:19:43] [INFO ] Transformed 392 transitions.
[2024-06-02 23:19:43] [INFO ] Found NUPN structural information;
[2024-06-02 23:19:43] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 362
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 362
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 50 place count 177 transition count 350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 176 transition count 349
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 176 transition count 349
Applied a total of 52 rules in 84 ms. Remains 176 /196 variables (removed 20) and now considering 349/390 (removed 41) transitions.
// Phase 1: matrix 349 rows 176 cols
[2024-06-02 23:19:44] [INFO ] Computed 7 invariants in 42 ms
[2024-06-02 23:19:44] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-06-02 23:19:44] [INFO ] Invariant cache hit.
[2024-06-02 23:19:45] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-02 23:19:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:19:50] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 49 ms to minimize.
[2024-06-02 23:19:51] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 8 ms to minimize.
[2024-06-02 23:19:51] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 4 ms to minimize.
[2024-06-02 23:19:51] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 3 ms to minimize.
[2024-06-02 23:19:51] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 4 ms to minimize.
[2024-06-02 23:19:52] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:19:52] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:19:52] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:19:52] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:19:52] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:19:52] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:19:53] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:19:53] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:19:53] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:19:53] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 3 ms to minimize.
[2024-06-02 23:19:53] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:19:54] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:19:54] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:19:54] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:19:54] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:19:54] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:19:55] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:19:55] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 2 ms to minimize.
[2024-06-02 23:19:55] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 5 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 61 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:19:56] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:19:57] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:19:57] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-06-02 23:19:57] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:19:57] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-06-02 23:19:57] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 3 ms to minimize.
[2024-06-02 23:19:58] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:19:58] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:19:58] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:20:03] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:20:03] [INFO ] Deduced a trap composed of 121 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:20:05] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 4 ms to minimize.
[2024-06-02 23:20:05] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 4 ms to minimize.
[2024-06-02 23:20:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:20:06] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:20:09] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (OVERLAPS) 349/525 variables, 176/226 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 226 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 3 ms to minimize.
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:20:20] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 349/525 variables, 176/229 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 348/577 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 23:20:33] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:20:35] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 579 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 48/48 constraints]
After SMT, in 60500ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 60542ms
Starting structural reductions in LTL mode, iteration 1 : 176/196 places, 349/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61683 ms. Remains : 176/196 places, 349/390 transitions.
Support contains 68 out of 176 places after structural reductions.
[2024-06-02 23:20:46] [INFO ] Flatten gal took : 111 ms
[2024-06-02 23:20:46] [INFO ] Flatten gal took : 51 ms
[2024-06-02 23:20:46] [INFO ] Input system was already deterministic with 349 transitions.
Support contains 64 out of 176 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4326 ms. (9 steps per ms) remains 34/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 78 ms. (50 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
[2024-06-02 23:20:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 121/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 14/176 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 349/525 variables, 176/183 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 183 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 121/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 3 ms to minimize.
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 5 ms to minimize.
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:20:50] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:20:51] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 14/176 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 23:20:51] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:20:51] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 3 ms to minimize.
[2024-06-02 23:20:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 349/525 variables, 176/192 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 30/222 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 23:20:52] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:20:53] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 23:20:54] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 225 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 12/12 constraints]
After SMT, in 6680ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 349/349 transitions.
Graph (trivial) has 116 edges and 176 vertex of which 5 / 176 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 172 transition count 328
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 156 transition count 325
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 153 transition count 325
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 39 place count 153 transition count 319
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 51 place count 147 transition count 319
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 141 transition count 310
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 141 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 141 transition count 309
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 64 place count 141 transition count 306
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 70 place count 138 transition count 306
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 108 place count 119 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 119 transition count 286
Performed 14 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 137 place count 105 transition count 362
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 140 place count 105 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 161 place count 105 transition count 338
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 104 transition count 337
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 104 transition count 337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 165 place count 103 transition count 346
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 174 place count 103 transition count 337
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 183 place count 94 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 194 place count 94 transition count 326
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 196 place count 94 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 198 place count 94 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 199 place count 93 transition count 323
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 23 edges and 92 vertex of which 4 / 92 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 201 place count 90 transition count 323
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 209 place count 90 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 9 with 33 rules applied. Total rules applied 242 place count 90 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 244 place count 89 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 250 place count 89 transition count 287
Applied a total of 250 rules in 285 ms. Remains 89 /176 variables (removed 87) and now considering 287/349 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 89/176 places, 287/349 transitions.
RANDOM walk for 32220 steps (1143 resets) in 964 ms. (33 steps per ms) remains 0/30 properties
[2024-06-02 23:20:55] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:20:55] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:20:55] [INFO ] Input system was already deterministic with 349 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 156 transition count 316
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 156 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 156 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 155 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 155 transition count 312
Applied a total of 45 rules in 21 ms. Remains 155 /176 variables (removed 21) and now considering 312/349 (removed 37) transitions.
// Phase 1: matrix 312 rows 155 cols
[2024-06-02 23:20:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:20:55] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 23:20:55] [INFO ] Invariant cache hit.
[2024-06-02 23:20:56] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 23:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 3 ms to minimize.
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:20:59] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 3 ms to minimize.
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 3 ms to minimize.
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2024-06-02 23:21:00] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 100 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:21:01] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:21:02] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:21:03] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-06-02 23:21:04] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:21:07] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:21:07] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:21:08] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:21:10] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:21:11] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:21:13] [INFO ] Deduced a trap composed of 117 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:21:16] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 312/467 variables, 155/192 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/467 variables, and 192 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/467 variables, 155/192 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 311/503 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:21:48] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/467 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 504 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 31/31 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 155/176 places, 312/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60775 ms. Remains : 155/176 places, 312/349 transitions.
[2024-06-02 23:21:56] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:21:56] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:21:56] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 23:21:56] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:21:56] [INFO ] Flatten gal took : 28 ms
[2024-06-02 23:21:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality4652031152770918632.gal : 24 ms
[2024-06-02 23:21:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality14124739733277939723.ctl : 5 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/CTLCardinality4652031152770918632.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14124739733277939723.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,5.82834e+06,1.6196,31540,2,7677,5,93229,6,0,934,120730,0


Converting to forward existential form...Done !
original formula: !(E(A(((p138==1)||(p106==1)) U !(((p12==0)||(p36==1)))) U EG(EX(EG(((p96==0)||(p19==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!(!(((p12==0)||(p36==1)))) U (!(((p138==1)||(p106==1))) * !(!(((p12==0)||(p36==1)))))) + EG...225
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...553
(forward)formula 0,0,8.09233,174340,1,0,620,834004,661,305,7209,755130,694
FORMULA MedleyA-PT-16-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 10 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 23:22:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:22:04] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 23:22:04] [INFO ] Invariant cache hit.
[2024-06-02 23:22:05] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:22:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:22:09] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:22:09] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:22:09] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:22:09] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 4 ms to minimize.
[2024-06-02 23:22:09] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:22:10] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:22:10] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-06-02 23:22:10] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:22:10] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:22:10] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:22:11] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-06-02 23:22:11] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:22:12] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:22:13] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:22:14] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:22:18] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
[2024-06-02 23:22:18] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:22:21] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/181 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:22:27] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:22:27] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:22:28] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:22:28] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:22:29] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:22:31] [INFO ] Deduced a trap composed of 89 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:22:31] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-06-02 23:22:32] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 3 ms to minimize.
[2024-06-02 23:22:32] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 191 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 500 constraints, problems are : Problem set: 0 solved, 309 unsolved in 25816 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 30/30 constraints]
After SMT, in 55984ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 55988ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 310/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56372 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 23:23:01] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:23:01] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:23:01] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 23:23:01] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:23:01] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:23:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15835182256464595406.gal : 8 ms
[2024-06-02 23:23:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10321068986674587668.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/CTLCardinality15835182256464595406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10321068986674587668.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((p159==1) + AX(EX(AF((p40==0))))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((p159==1)))) * !(EX(!(EG(!((p40==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...547
(forward)formula 0,1,7.46544,160392,1,0,593,839822,643,289,6901,654167,656
FORMULA MedleyA-PT-16-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Graph (trivial) has 192 edges and 176 vertex of which 13 / 176 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 165 transition count 306
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 133 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 131 transition count 302
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 71 place count 131 transition count 297
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 81 place count 126 transition count 297
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 99 place count 108 transition count 264
Iterating global reduction 3 with 18 rules applied. Total rules applied 117 place count 108 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 108 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 107 transition count 262
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 120 place count 107 transition count 259
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 104 transition count 259
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 128 place count 102 transition count 253
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 102 transition count 253
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 160 place count 87 transition count 238
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 164 place count 83 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 168 place count 83 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 181 place count 83 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 181 place count 83 transition count 214
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 185 place count 81 transition count 214
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 193 place count 77 transition count 210
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 75 transition count 208
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 73 vertex of which 26 / 73 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 198 place count 57 transition count 208
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 238 place count 57 transition count 168
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 239 place count 56 transition count 158
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 56 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 7 with 51 rules applied. Total rules applied 291 place count 56 transition count 107
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 296 place count 56 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 301 place count 51 transition count 102
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 9 with 4 rules applied. Total rules applied 305 place count 49 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 307 place count 49 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 309 place count 49 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 311 place count 47 transition count 96
Applied a total of 311 rules in 97 ms. Remains 47 /176 variables (removed 129) and now considering 96/349 (removed 253) transitions.
// Phase 1: matrix 96 rows 47 cols
[2024-06-02 23:23:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:23:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:23:08] [INFO ] Invariant cache hit.
[2024-06-02 23:23:09] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:23:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-02 23:23:09] [INFO ] Redundant transitions in 19 ms returned [87, 89, 94, 95]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 88 sub problems to find dead transitions.
// Phase 1: matrix 92 rows 47 cols
[2024-06-02 23:23:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:23:09] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 23:23:09] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 91/138 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/139 variables, and 75 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 91/138 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 88/163 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-02 23:23:13] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/138 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/139 variables, and 164 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3659 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 8/8 constraints]
After SMT, in 6105ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6107ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/176 places, 92/349 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 44 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 44 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 44 transition count 86
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 43 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 42 transition count 85
Applied a total of 12 rules in 21 ms. Remains 42 /47 variables (removed 5) and now considering 85/92 (removed 7) transitions.
// Phase 1: matrix 85 rows 42 cols
[2024-06-02 23:23:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:23:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:23:15] [INFO ] Invariant cache hit.
[2024-06-02 23:23:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:23:15] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/176 places, 85/349 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6600 ms. Remains : 42/176 places, 85/349 transitions.
[2024-06-02 23:23:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:23:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:23:15] [INFO ] Input system was already deterministic with 85 transitions.
[2024-06-02 23:23:15] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:23:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:23:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11032872311241480247.gal : 2 ms
[2024-06-02 23:23:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6440483857615882093.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/CTLCardinality11032872311241480247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6440483857615882093.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,5236,0.162868,7716,2,1700,5,14610,5,0,254,12726,0


Converting to forward existential form...Done !
original formula: (EF((EG(AG((p65==0))) + EG(((p47==0)&&(p191==1))))) * EF((p155==0)))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (EG(!(E(TRUE U !((p65==0))))) + EG(((p47==0)&&(p191==1)))))),TRUE) * (p155==0))] != FALS...156
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t9, t11, t13, t16, t17, t19, t21, t23, t26, t27, t28, t62, t63, t66, t67, t78, t8...256
Fast SCC detection found an SCC at level 0
(forward)formula 0,1,1.45193,39248,1,0,216,187671,203,109,2111,128576,230
FORMULA MedleyA-PT-16-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 308
Applied a total of 49 rules in 12 ms. Remains 153 /176 variables (removed 23) and now considering 308/349 (removed 41) transitions.
// Phase 1: matrix 308 rows 153 cols
[2024-06-02 23:23:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:23:17] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:23:17] [INFO ] Invariant cache hit.
[2024-06-02 23:23:17] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 23:23:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:23:21] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:23:22] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 2 ms to minimize.
[2024-06-02 23:23:23] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:23:24] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 4 ms to minimize.
[2024-06-02 23:23:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:23:25] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:23:26] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:23:26] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 3 ms to minimize.
[2024-06-02 23:23:26] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:23:27] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:23:27] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:23:27] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-06-02 23:23:27] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:23:31] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:23:33] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:23:33] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:23:36] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/461 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:23:42] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 188 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 495 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 153/176 places, 308/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 153/176 places, 308/349 transitions.
[2024-06-02 23:24:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:24:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:24:17] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 23:24:17] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:24:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:24:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8403040584156112247.gal : 3 ms
[2024-06-02 23:24:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality14547006117189622218.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/CTLCardinality8403040584156112247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14547006117189622218.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,5.44045e+06,1.26097,32812,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: EF(EX(EF(((p67==1)||(p66==1)))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * ((p67==1)||(p66==1)))] != FALSE
(forward)formula 0,1,1.51663,33076,1,0,8,98462,9,1,1880,124395,4
FORMULA MedleyA-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 313
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 309
Applied a total of 47 rules in 8 ms. Remains 154 /176 variables (removed 22) and now considering 309/349 (removed 40) transitions.
// Phase 1: matrix 309 rows 154 cols
[2024-06-02 23:24:19] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:24:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:24:19] [INFO ] Invariant cache hit.
[2024-06-02 23:24:19] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 23:24:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:24:23] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:24:24] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-06-02 23:24:25] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 3 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:24:26] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 4 ms to minimize.
[2024-06-02 23:24:27] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:24:27] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:24:27] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-06-02 23:24:27] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:24:28] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:24:28] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-06-02 23:24:28] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:24:32] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:24:32] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 309/463 variables, 154/189 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:24:39] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 23:24:44] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 191 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 499 constraints, problems are : Problem set: 0 solved, 308 unsolved in 27013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
After SMT, in 57123ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 57128ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 309/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57548 ms. Remains : 154/176 places, 309/349 transitions.
[2024-06-02 23:25:16] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:25:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:25:16] [INFO ] Input system was already deterministic with 309 transitions.
[2024-06-02 23:25:16] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:25:16] [INFO ] Flatten gal took : 9 ms
[2024-06-02 23:25:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality4533258196338683597.gal : 4 ms
[2024-06-02 23:25:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality3407338314298152178.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/CTLCardinality4533258196338683597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3407338314298152178.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,5.53227e+06,1.31101,31656,2,7816,5,95302,6,0,927,120296,0


Converting to forward existential form...Done !
original formula: (EF(((p145==1) * EX((p18!=1)))) * EF((EX((p153!=0)) + AF((p132!=0)))))
=> equivalent forward existential formula: ([(EY(FwdU((Init * E(TRUE U ((p145==1) * EX((p18!=1))))),TRUE)) * (p153!=0))] != FALSE + [(FwdU((Init * E(TRUE U...224
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t44, t47, t51, t54, t56, t58, t59, t65, t66,...541
(forward)formula 0,1,17.7268,407156,1,0,607,2.47868e+06,642,312,7339,1.77181e+06,695
FORMULA MedleyA-PT-16-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 156 transition count 316
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 156 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 156 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 155 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 155 transition count 312
Applied a total of 45 rules in 8 ms. Remains 155 /176 variables (removed 21) and now considering 312/349 (removed 37) transitions.
// Phase 1: matrix 312 rows 155 cols
[2024-06-02 23:25:34] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:25:34] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 23:25:34] [INFO ] Invariant cache hit.
[2024-06-02 23:25:35] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 23:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 4 ms to minimize.
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:25:43] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:25:44] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/467 variables, 155/185 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:25:50] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:25:51] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-06-02 23:25:51] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:25:51] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:25:52] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:25:52] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:25:52] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 7/192 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/467 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 192 constraints, problems are : Problem set: 0 solved, 311 unsolved in 28210 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:26:06] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 312/467 variables, 155/193 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 311/504 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 23:26:24] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/467 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 505 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 32/32 constraints]
After SMT, in 58361ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 58367ms
Starting structural reductions in LTL mode, iteration 1 : 155/176 places, 312/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58853 ms. Remains : 155/176 places, 312/349 transitions.
[2024-06-02 23:26:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:26:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:26:33] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 23:26:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:26:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:26:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7459987418023155752.gal : 4 ms
[2024-06-02 23:26:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2244318284611679056.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/CTLCardinality7459987418023155752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2244318284611679056.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,5.53244e+06,1.20464,32444,2,8204,5,95338,6,0,934,120410,0


Converting to forward existential form...Done !
original formula: EG(EF((((p49==0) * AX((p173==1))) * AF((p155==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p49==0) * !(EX(!((p173==1))))) * !(EG(!((p155==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t24, t27, t28, t29, t31, t32, t35, t36, t41, t45, t48, t52, t55, t57, t59, t60,...563
(forward)formula 0,0,5.6893,136352,1,0,598,651665,657,290,6963,555364,660
FORMULA MedleyA-PT-16-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 5 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 23:26:39] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:26:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:26:39] [INFO ] Invariant cache hit.
[2024-06-02 23:26:39] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:26:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:26:42] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 3 ms to minimize.
[2024-06-02 23:26:42] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:26:42] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-06-02 23:26:42] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-06-02 23:26:42] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:26:42] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:26:43] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-06-02 23:26:43] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:26:43] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:26:43] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:26:43] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:26:44] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:26:44] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 4 ms to minimize.
[2024-06-02 23:26:44] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:26:45] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 3 ms to minimize.
[2024-06-02 23:26:45] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:26:45] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:26:45] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:26:46] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:26:46] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:26:47] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:26:48] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-06-02 23:26:48] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:26:50] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-06-02 23:26:51] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:26:51] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 310/464 variables, 154/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:26:59] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:27:05] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/464 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 189 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:27:13] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/190 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 309/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/464 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 499 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 29/29 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 310/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60376 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 23:27:39] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:27:39] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:27:39] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 23:27:39] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:27:39] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:27:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5460024528837234546.gal : 32 ms
[2024-06-02 23:27:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5436077286381404391.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/CTLCardinality5460024528837234546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5436077286381404391.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,5.44045e+06,1.3553,31444,2,8083,5,92063,6,0,928,118319,0


Converting to forward existential form...Done !
original formula: AG(A(((p14==0)||(p23==1)) U EX(AX((p164!=1)))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(EX(!(EX(!((p164!=1))))))) * !(((p14==0)||(p23==1)))) * !(EX(!(EX(!((p164!=1)))))))] =...223
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...553
(forward)formula 0,1,6.53019,132800,1,0,592,639020,643,288,6908,544552,653
FORMULA MedleyA-PT-16-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 308
Applied a total of 49 rules in 9 ms. Remains 153 /176 variables (removed 23) and now considering 308/349 (removed 41) transitions.
// Phase 1: matrix 308 rows 153 cols
[2024-06-02 23:27:46] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:27:46] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 23:27:46] [INFO ] Invariant cache hit.
[2024-06-02 23:27:46] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 23:27:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:27:50] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-06-02 23:27:50] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:27:51] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:27:51] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:27:51] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:27:51] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:27:51] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:27:51] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 3 ms to minimize.
[2024-06-02 23:27:52] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:27:52] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 4 ms to minimize.
[2024-06-02 23:27:53] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:27:53] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:27:53] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-06-02 23:27:53] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:27:54] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:27:55] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 2 ms to minimize.
[2024-06-02 23:27:55] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:27:56] [INFO ] Deduced a trap composed of 100 places in 174 ms of which 2 ms to minimize.
[2024-06-02 23:27:56] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:27:56] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:27:56] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:27:56] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:27:57] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:28:01] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:28:02] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:28:03] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:28:05] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/461 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:28:11] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
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 Real declared 461/461 variables, and 188 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 495 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 153/176 places, 308/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60654 ms. Remains : 153/176 places, 308/349 transitions.
[2024-06-02 23:28:47] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:28:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:28:47] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 23:28:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:28:47] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:28:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality1681700639912727782.gal : 2 ms
[2024-06-02 23:28:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality18436947256581482813.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/CTLCardinality1681700639912727782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18436947256581482813.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,5.44045e+06,1.17918,32700,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: AX(EF(((p45==1) * AX(FALSE))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((p45==1) * !(EX(!(FALSE)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...541
(forward)formula 0,0,5.4562,123100,1,0,563,591187,635,284,6823,461898,623
FORMULA MedleyA-PT-16-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 157 transition count 316
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 157 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 157 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 156 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 156 transition count 314
Applied a total of 41 rules in 6 ms. Remains 156 /176 variables (removed 20) and now considering 314/349 (removed 35) transitions.
// Phase 1: matrix 314 rows 156 cols
[2024-06-02 23:28:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:28:52] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 23:28:52] [INFO ] Invariant cache hit.
[2024-06-02 23:28:53] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 23:28:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 3 ms to minimize.
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-06-02 23:28:56] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 2 ms to minimize.
[2024-06-02 23:28:57] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:28:58] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:28:58] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:28:58] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:28:58] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:28:59] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:28:59] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:28:59] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:28:59] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:28:59] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:29:00] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:29:00] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:29:00] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:29:01] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:29:01] [INFO ] Deduced a trap composed of 106 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:29:01] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:29:01] [INFO ] Deduced a trap composed of 109 places in 177 ms of which 3 ms to minimize.
[2024-06-02 23:29:01] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 2 ms to minimize.
[2024-06-02 23:29:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:29:05] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:29:06] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:29:07] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/470 variables, 156/196 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:29:15] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 199 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 23:29:26] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/470 variables, 156/200 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 313/513 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 513 constraints, problems are : Problem set: 0 solved, 313 unsolved in 29824 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 37/37 constraints]
After SMT, in 59932ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 59936ms
Starting structural reductions in LTL mode, iteration 1 : 156/176 places, 314/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60349 ms. Remains : 156/176 places, 314/349 transitions.
[2024-06-02 23:29:53] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:29:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:29:53] [INFO ] Input system was already deterministic with 314 transitions.
[2024-06-02 23:29:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:29:53] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:29:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8340401187016953095.gal : 4 ms
[2024-06-02 23:29:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality771969272048111075.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/CTLCardinality8340401187016953095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality771969272048111075.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,9.87126e+06,3.62874,73992,2,16712,5,220698,6,0,940,309419,0


Converting to forward existential form...Done !
original formula: AX(EF(((((p55==1) + (((p121!=0)&&(p28!=1)) * AF(((p192==0)||(p84==1))))) + (EG((p73==1)) * EG((p163==1)))) * (AG(((p32!=0)&&(p59!=1))) + ...188
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((p55==1) + (((p121!=0)&&(p28!=1)) * !(EG(!(((p192==0)||(p84==1))))))) + (EG((p73==1))...265
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64,...591
Detected timeout of ITS tools.
[2024-06-02 23:30:23] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:30:23] [INFO ] Applying decomposition
[2024-06-02 23:30:23] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph416493064389338868.txt' '-o' '/tmp/graph416493064389338868.bin' '-w' '/tmp/graph416493064389338868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph416493064389338868.bin' '-l' '-1' '-v' '-w' '/tmp/graph416493064389338868.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:30:23] [INFO ] Decomposing Gal with order
[2024-06-02 23:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:30:23] [INFO ] Removed a total of 387 redundant transitions.
[2024-06-02 23:30:23] [INFO ] Flatten gal took : 80 ms
[2024-06-02 23:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 22 ms.
[2024-06-02 23:30:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4109341841704111982.gal : 7 ms
[2024-06-02 23:30:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2407511423728613086.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/CTLCardinality4109341841704111982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2407511423728613086.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.87126e+06,0.173104,8500,583,28,8709,342,657,15896,46,1174,0


Converting to forward existential form...Done !
original formula: AX(EF(((((i2.u19.p55==1) + (((i3.u41.p121!=0)&&(i0.i1.u9.p28!=1)) * AF(((i0.i1.u65.p192==0)||(i6.i0.u29.p84==1))))) + (EG((i4.u24.p73==1)...278
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((i2.u19.p55==1) + (((i3.u41.p121!=0)&&(i0.i1.u9.p28!=1)) * !(EG(!(((i0.i1.u65.p192==0...355
Reverse transition relation is NOT exact ! Due to transitions t25, t39, t83, t91, t97, t115, t116, t161, t163, t169, t171, t178, t181, t182, t183, t184, t1...822
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,2.60086,72124,1,0,121495,342,3991,288405,208,1174,289897
FORMULA MedleyA-PT-16-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 163 transition count 328
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 163 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 163 transition count 325
Applied a total of 29 rules in 5 ms. Remains 163 /176 variables (removed 13) and now considering 325/349 (removed 24) transitions.
// Phase 1: matrix 325 rows 163 cols
[2024-06-02 23:30:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:30:26] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-02 23:30:26] [INFO ] Invariant cache hit.
[2024-06-02 23:30:26] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-06-02 23:30:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-06-02 23:30:30] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:30:30] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:30:31] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 13 ms to minimize.
[2024-06-02 23:30:31] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:30:31] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2024-06-02 23:30:31] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:30:31] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
[2024-06-02 23:30:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
[2024-06-02 23:30:33] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 2 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2024-06-02 23:30:34] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:30:35] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:30:35] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 3 ms to minimize.
[2024-06-02 23:30:35] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:30:36] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-06-02 23:30:40] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:30:40] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 325/488 variables, 163/199 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-06-02 23:30:48] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:30:48] [INFO ] Deduced a trap composed of 116 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 201 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 324 unsolved
[2024-06-02 23:31:00] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (OVERLAPS) 325/488 variables, 163/202 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 324/526 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 526 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 32/32 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 325/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60679 ms. Remains : 163/176 places, 325/349 transitions.
[2024-06-02 23:31:26] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:31:26] [INFO ] Flatten gal took : 8 ms
[2024-06-02 23:31:26] [INFO ] Input system was already deterministic with 325 transitions.
[2024-06-02 23:31:26] [INFO ] Flatten gal took : 24 ms
[2024-06-02 23:31:26] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:31:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality6415050891305609009.gal : 3 ms
[2024-06-02 23:31:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1002168467596763474.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/CTLCardinality6415050891305609009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1002168467596763474.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,6.95769e+06,1.35762,30168,2,6778,5,86535,6,0,979,114914,0


Converting to forward existential form...Done !
original formula: E(((p11==1) * (!(((p140!=1) * AG((((p16==1)||(p119==0))||(p152==1))))) + (EF(((((p80==0)||(p8==1))&&(p85==1))&&(p82!=1))) * ((p5==0) + ((...265
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,((p11==1) * (!(((p140!=1) * !(E(TRUE U !((((p16==1)||(p119==0))||(p152==1))))))) + (E(TRUE ...342
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t54, t55, t57, t59,...626
(forward)formula 0,1,19.5621,443584,1,0,695,2.73262e+06,693,342,7670,1.89442e+06,771
FORMULA MedleyA-PT-16-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 4 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 23:31:46] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:31:46] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 23:31:46] [INFO ] Invariant cache hit.
[2024-06-02 23:31:46] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:31:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:31:50] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 3 ms to minimize.
[2024-06-02 23:31:50] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-06-02 23:31:50] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:31:50] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:31:51] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:31:51] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 2 ms to minimize.
[2024-06-02 23:31:51] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:31:51] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 2 ms to minimize.
[2024-06-02 23:31:52] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2024-06-02 23:31:52] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 3 ms to minimize.
[2024-06-02 23:31:52] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:31:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:31:53] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:31:53] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:31:54] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:31:54] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-06-02 23:31:54] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-06-02 23:31:55] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:31:55] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-06-02 23:31:55] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-06-02 23:31:55] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:31:56] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-06-02 23:31:56] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 24 places in 179 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 2 ms to minimize.
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 2 ms to minimize.
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:04] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:09] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-06-02 23:32:09] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 310/464 variables, 154/194 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 194 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:19] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 310/464 variables, 154/195 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 309/504 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/464 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 504 constraints, problems are : Problem set: 0 solved, 309 unsolved in 25301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 34/34 constraints]
After SMT, in 55390ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 55394ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 310/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55709 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 23:32:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:32:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:32:42] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 23:32:42] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:32:42] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:32:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8044946469583068971.gal : 2 ms
[2024-06-02 23:32:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14986979960989516877.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/CTLCardinality8044946469583068971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14986979960989516877.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,5.53244e+06,1.1281,32192,2,8251,5,96746,6,0,928,121571,0


Converting to forward existential form...Done !
original formula: EG(AX(AF((((p8==0)&&(p100==1))||(((p90==0)&&(p55==0))&&(p54==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!((((p8==0)&&(p100==1))||(((p90==0)&&(p55==0))&&(p54==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t14, t18, t25, t26, t27, t29, t33, t34, t39, t43, t46, t50, t53, t55, t57, t58, t64, t65,...551
(forward)formula 0,0,5.7383,140384,1,0,610,688328,647,295,6955,572148,681
FORMULA MedleyA-PT-16-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 4 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 23:32:48] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:32:48] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 23:32:48] [INFO ] Invariant cache hit.
[2024-06-02 23:32:48] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 23:32:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:51] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-06-02 23:32:51] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:32:52] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:32:52] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 3 ms to minimize.
[2024-06-02 23:32:52] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-06-02 23:32:52] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-06-02 23:32:52] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:32:53] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-06-02 23:32:53] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-06-02 23:32:53] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 1 ms to minimize.
[2024-06-02 23:32:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:32:54] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-02 23:32:54] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:32:54] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:32:55] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-06-02 23:32:56] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:32:56] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:33:00] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:33:00] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:33:03] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/181 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:33:08] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 2 ms to minimize.
[2024-06-02 23:33:09] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-06-02 23:33:10] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-06-02 23:33:10] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 23:33:13] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-06-02 23:33:14] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-06-02 23:33:14] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-06-02 23:33:15] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 191 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 500 constraints, problems are : Problem set: 0 solved, 309 unsolved in 26102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 30/30 constraints]
After SMT, in 56252ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 56258ms
Starting structural reductions in LTL mode, iteration 1 : 154/176 places, 310/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56640 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 23:33:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:33:44] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:33:44] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 23:33:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:33:44] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:33:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7020484740621076689.gal : 2 ms
[2024-06-02 23:33:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1783928356458365519.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/CTLCardinality7020484740621076689.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1783928356458365519.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,6.01248e+06,1.11014,31928,2,8174,5,95459,6,0,928,120308,0


Converting to forward existential form...Done !
original formula: EF(EX(EF((EF(((p30==0)&&(p154==1))) + EX(((p160==0)&&(p20==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY(FwdU(Init,TRUE)),TRUE),TRUE) * ((p30==0)&&(p154==1)))] != FALSE + [(EY(FwdU(EY(FwdU(Init,TRUE)),...197
(forward)formula 0,1,1.38041,31928,1,0,8,95459,9,1,1882,120308,4
FORMULA MedleyA-PT-16-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 308
Applied a total of 49 rules in 4 ms. Remains 153 /176 variables (removed 23) and now considering 308/349 (removed 41) transitions.
// Phase 1: matrix 308 rows 153 cols
[2024-06-02 23:33:46] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:33:46] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 23:33:46] [INFO ] Invariant cache hit.
[2024-06-02 23:33:46] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 307 sub problems to find dead transitions.
[2024-06-02 23:33:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:33:50] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 3 ms to minimize.
[2024-06-02 23:33:50] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:33:50] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-06-02 23:33:50] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 3 ms to minimize.
[2024-06-02 23:33:51] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:33:51] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2024-06-02 23:33:51] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-06-02 23:33:51] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 2 ms to minimize.
[2024-06-02 23:33:51] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-06-02 23:33:52] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 3 ms to minimize.
[2024-06-02 23:33:52] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2024-06-02 23:33:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:33:53] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-06-02 23:33:53] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:33:54] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:33:54] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-06-02 23:33:55] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-02 23:33:55] [INFO ] Deduced a trap composed of 100 places in 173 ms of which 3 ms to minimize.
[2024-06-02 23:33:56] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:33:56] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-02 23:33:56] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:33:56] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 2 ms to minimize.
[2024-06-02 23:33:56] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:33:59] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:34:00] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-02 23:34:01] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:34:02] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (OVERLAPS) 308/461 variables, 153/187 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:34:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 461/461 variables, and 188 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 308/461 variables, 153/188 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 307/495 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-02 23:34:35] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-06-02 23:34:35] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 497 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 30/30 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 153/176 places, 308/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 153/176 places, 308/349 transitions.
[2024-06-02 23:34:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:34:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:34:46] [INFO ] Input system was already deterministic with 308 transitions.
[2024-06-02 23:34:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:34:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 23:34:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality12822066498109681722.gal : 5 ms
[2024-06-02 23:34:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4358108971037129220.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/CTLCardinality12822066498109681722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4358108971037129220.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,5.44045e+06,1.53587,32880,2,8255,5,98462,6,0,922,124395,0


Converting to forward existential form...Done !
original formula: EF(((p178==1) + EX((p63==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p178==1))] != FALSE + [(EY(FwdU(Init,TRUE)) * (p63==1))] != FALSE)
(forward)formula 0,1,1.53817,32880,1,0,7,98462,8,1,925,124395,1
FORMULA MedleyA-PT-16-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Graph (trivial) has 191 edges and 176 vertex of which 13 / 176 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 165 transition count 309
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 136 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 134 transition count 305
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 65 place count 134 transition count 298
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 79 place count 127 transition count 298
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 98 place count 108 transition count 263
Iterating global reduction 3 with 19 rules applied. Total rules applied 117 place count 108 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 122 place count 108 transition count 258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 106 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 124 place count 106 transition count 255
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 103 transition count 255
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 133 place count 100 transition count 247
Iterating global reduction 5 with 3 rules applied. Total rules applied 136 place count 100 transition count 247
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 166 place count 85 transition count 232
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 82 transition count 225
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 82 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 185 place count 82 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 82 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 81 transition count 211
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 197 place count 76 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 75 transition count 205
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 73 vertex of which 26 / 73 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 201 place count 57 transition count 205
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 243 place count 57 transition count 163
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 55 transition count 146
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 288 place count 55 transition count 105
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 293 place count 55 transition count 100
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 299 place count 50 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 300 place count 49 transition count 99
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 302 place count 47 transition count 94
Iterating global reduction 10 with 2 rules applied. Total rules applied 304 place count 47 transition count 94
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 10 with 4 rules applied. Total rules applied 308 place count 45 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 312 place count 45 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 313 place count 45 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 315 place count 44 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 316 place count 43 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 316 place count 43 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 318 place count 42 transition count 85
Applied a total of 318 rules in 65 ms. Remains 42 /176 variables (removed 134) and now considering 85/349 (removed 264) transitions.
// Phase 1: matrix 85 rows 42 cols
[2024-06-02 23:34:48] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 23:34:48] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:34:48] [INFO ] Invariant cache hit.
[2024-06-02 23:34:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:34:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 23:34:48] [INFO ] Redundant transitions in 18 ms returned [84]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 79 sub problems to find dead transitions.
// Phase 1: matrix 84 rows 42 cols
[2024-06-02 23:34:48] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:34:48] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 23:34:49] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:34:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:34:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
[2024-06-02 23:34:49] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-02 23:34:49] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 83/125 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 68 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3268 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 83/125 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 79/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2682 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints]
After SMT, in 5991ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5993ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/176 places, 84/349 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 82
Applied a total of 4 rules in 13 ms. Remains 40 /42 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 40 cols
[2024-06-02 23:34:54] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 23:34:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:34:54] [INFO ] Invariant cache hit.
[2024-06-02 23:34:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:34:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/176 places, 82/349 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6457 ms. Remains : 40/176 places, 82/349 transitions.
[2024-06-02 23:34:54] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:34:54] [INFO ] Flatten gal took : 3 ms
[2024-06-02 23:34:54] [INFO ] Input system was already deterministic with 82 transitions.
[2024-06-02 23:34:54] [INFO ] Flatten gal took : 4 ms
[2024-06-02 23:34:54] [INFO ] Flatten gal took : 5 ms
[2024-06-02 23:34:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6333644447407581267.gal : 1 ms
[2024-06-02 23:34:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality1506992936485169955.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/CTLCardinality6333644447407581267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1506992936485169955.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,3567,0.071141,4836,2,691,5,5156,5,0,242,4225,0


Converting to forward existential form...Done !
original formula: E((p42==0) U AG(EF(AG(!(((p117==0)||(p174==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,(p42==0)) * !(E(TRUE U !(E(TRUE U !(E(TRUE U !(!(((p117==0)||(p174==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t9, t11, t14, t15, t17, t19, t21, t56, t58, t59, t61, t67, t71, t80, t81, In...250
(forward)formula 0,0,0.416797,12756,1,0,180,41720,182,84,1982,30319,176
FORMULA MedleyA-PT-16-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 23:34:55] [INFO ] Flatten gal took : 7 ms
[2024-06-02 23:34:55] [INFO ] Flatten gal took : 7 ms
Total runtime 912067 ms.

BK_STOP 1717371295460

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-16, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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