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.r026-smll-171620166900081.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 AutoFlight-PT-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620166900081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716244136836

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-20 22:28:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:28:59] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-20 22:28:59] [INFO ] Transformed 206 places.
[2024-05-20 22:28:59] [INFO ] Transformed 204 transitions.
[2024-05-20 22:28:59] [INFO ] Found NUPN structural information;
[2024-05-20 22:28:59] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 113 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 195
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 197 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 195 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 195 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 194 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 194 transition count 191
Applied a total of 25 rules in 67 ms. Remains 194 /206 variables (removed 12) and now considering 191/204 (removed 13) transitions.
// Phase 1: matrix 191 rows 194 cols
[2024-05-20 22:28:59] [INFO ] Computed 16 invariants in 22 ms
[2024-05-20 22:28:59] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-20 22:28:59] [INFO ] Invariant cache hit.
[2024-05-20 22:28:59] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-20 22:28:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:02] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 36 ms to minimize.
[2024-05-20 22:29:02] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 4 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 4 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 3 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 3 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 3 ms to minimize.
[2024-05-20 22:29:03] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 3 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 3 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:29:04] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:29:06] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 3 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:29:07] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 3 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-20 22:29:08] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:29:09] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 12 ms to minimize.
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:29:10] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 2 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 2 ms to minimize.
[2024-05-20 22:29:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:13] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:14] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
[2024-05-20 22:29:14] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:15] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 3 ms to minimize.
[2024-05-20 22:29:15] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:18] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-20 22:29:18] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 191/385 variables, 194/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:22] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:29:23] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 0/385 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 287 constraints, problems are : Problem set: 0 solved, 190 unsolved in 29817 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 77/93 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:32] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 3 ms to minimize.
[2024-05-20 22:29:32] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/385 variables, 194/289 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 190/479 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-20 22:29:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-20 22:29:36] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:29:36] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:29:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-20 22:29:37] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:29:37] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:29:37] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 8/487 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 0/385 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 487 constraints, problems are : Problem set: 0 solved, 190 unsolved in 20367 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 87/87 constraints]
After SMT, in 50298ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 50325ms
Starting structural reductions in LTL mode, iteration 1 : 194/206 places, 191/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51111 ms. Remains : 194/206 places, 191/204 transitions.
Support contains 113 out of 194 places after structural reductions.
[2024-05-20 22:29:50] [INFO ] Flatten gal took : 57 ms
[2024-05-20 22:29:50] [INFO ] Flatten gal took : 23 ms
[2024-05-20 22:29:50] [INFO ] Input system was already deterministic with 191 transitions.
Support contains 108 out of 194 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (350 resets) in 2903 ms. (13 steps per ms) remains 13/73 properties
BEST_FIRST walk for 40003 steps (43 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (44 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (43 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (53 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (44 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 87 ms. (454 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (43 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (59 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
[2024-05-20 22:29:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 166/183 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 11/194 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 191/385 variables, 194/210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 210 constraints, problems are : Problem set: 0 solved, 12 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 166/183 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 11/194 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:29:53] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 28 places in 414 ms of which 3 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:29:54] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-20 22:29:55] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:55] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 191/385 variables, 194/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 12/239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:55] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 3 ms to minimize.
[2024-05-20 22:29:55] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:29:55] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 3 ms to minimize.
[2024-05-20 22:29:55] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:29:56] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:56] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/385 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:56] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:29:56] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-20 22:29:57] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/385 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/385 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/385 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 248 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4861 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 26/26 constraints]
After SMT, in 5532ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 2 properties in 5620 ms.
Support contains 12 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 191/191 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 194 transition count 127
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 74 rules applied. Total rules applied 138 place count 130 transition count 117
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 143 place count 128 transition count 114
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 148 place count 125 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 124 transition count 112
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 149 place count 124 transition count 87
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 199 place count 99 transition count 87
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 211 place count 87 transition count 75
Iterating global reduction 5 with 12 rules applied. Total rules applied 223 place count 87 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 223 place count 87 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 231 place count 83 transition count 71
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 271 place count 63 transition count 51
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 279 place count 63 transition count 43
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 287 place count 55 transition count 43
Applied a total of 287 rules in 63 ms. Remains 55 /194 variables (removed 139) and now considering 43/191 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 55/194 places, 43/191 transitions.
RANDOM walk for 153 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/10 properties
[2024-05-20 22:30:03] [INFO ] Flatten gal took : 21 ms
[2024-05-20 22:30:03] [INFO ] Flatten gal took : 15 ms
[2024-05-20 22:30:03] [INFO ] Input system was already deterministic with 191 transitions.
Computed a total of 56 stabilizing places and 56 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 177 transition count 174
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 177 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 177 transition count 171
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 171 transition count 165
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 171 transition count 165
Applied a total of 49 rules in 50 ms. Remains 171 /194 variables (removed 23) and now considering 165/191 (removed 26) transitions.
// Phase 1: matrix 165 rows 171 cols
[2024-05-20 22:30:03] [INFO ] Computed 16 invariants in 3 ms
[2024-05-20 22:30:03] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-20 22:30:03] [INFO ] Invariant cache hit.
[2024-05-20 22:30:04] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-20 22:30:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 3 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 3 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-20 22:30:06] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:08] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:30:09] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:10] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-20 22:30:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-20 22:30:10] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:30:10] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:30:10] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:30:11] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:30:11] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:30:11] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:30:11] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 3 ms to minimize.
[2024-05-20 22:30:11] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:30:11] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:12] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 2 ms to minimize.
[2024-05-20 22:30:12] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 165/336 variables, 171/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/336 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 221 constraints, problems are : Problem set: 0 solved, 164 unsolved in 14186 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:19] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-20 22:30:20] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 165/336 variables, 171/223 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 164/387 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:22] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:30:22] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:30:23] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:30:23] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 3 ms to minimize.
[2024-05-20 22:30:23] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:30:23] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:25] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-20 22:30:25] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-20 22:30:26] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:30:26] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:30:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 5/398 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:29] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-20 22:30:29] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 3 ms to minimize.
[2024-05-20 22:30:29] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 3/401 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-20 22:30:32] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 3 ms to minimize.
[2024-05-20 22:30:32] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 0/336 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 403 constraints, problems are : Problem set: 0 solved, 164 unsolved in 25663 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 52/52 constraints]
After SMT, in 39877ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 39882ms
Starting structural reductions in LTL mode, iteration 1 : 171/194 places, 165/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40417 ms. Remains : 171/194 places, 165/191 transitions.
[2024-05-20 22:30:44] [INFO ] Flatten gal took : 11 ms
[2024-05-20 22:30:44] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:30:44] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-20 22:30:44] [INFO ] Flatten gal took : 13 ms
[2024-05-20 22:30:44] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:30:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4695001129955806151.gal : 5 ms
[2024-05-20 22:30:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3858837248463905067.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4695001129955806151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3858837248463905067.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.57853e+12,1.97535,52992,2,20864,5,175396,6,0,851,308927,0


Converting to forward existential form...Done !
original formula: EX(((EG(((EG(((p68==0)||(p202==1))) + (p93==1)) + (E((p41==1) U ((p3==0)||(p57==1))) * AX(((p109==0)||(p161==1)))))) * AG(((p41==0)||((p1...264
=> equivalent forward existential formula: (([(EY((EY(Init) * (EG(((EG(((p68==0)||(p202==1))) + (p93==1)) + (E((p41==1) U ((p3==0)||(p57==1))) * !(EX(!(((p...732
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t16, t24, t35, t41, t52, t56, t58, t61, t71, t72, t74, t75, t87, t90,...343
Detected timeout of ITS tools.
[2024-05-20 22:31:14] [INFO ] Flatten gal took : 19 ms
[2024-05-20 22:31:14] [INFO ] Applying decomposition
[2024-05-20 22:31:14] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10897199515791673674.txt' '-o' '/tmp/graph10897199515791673674.bin' '-w' '/tmp/graph10897199515791673674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10897199515791673674.bin' '-l' '-1' '-v' '-w' '/tmp/graph10897199515791673674.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:31:14] [INFO ] Decomposing Gal with order
[2024-05-20 22:31:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:31:14] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-20 22:31:14] [INFO ] Flatten gal took : 65 ms
[2024-05-20 22:31:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-20 22:31:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14964249163374503601.gal : 8 ms
[2024-05-20 22:31:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4615561680483240520.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/CTLCardinality14964249163374503601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4615561680483240520.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.57853e+12,0.163869,8656,1121,21,10833,230,407,14211,38,566,0


Converting to forward existential form...Done !
original formula: EX(((EG(((EG(((i5.u19.p68==0)||(i13.i2.u72.p202==1))) + (i7.u25.p93==1)) + (E((i3.u12.p41==1) U ((i9.i0.u1.p3==0)||(i4.u17.p57==1))) * AX...403
=> equivalent forward existential formula: (([(EY((EY(Init) * (EG(((EG(((i5.u19.p68==0)||(i13.i2.u72.p202==1))) + (i7.u25.p93==1)) + (E((i3.u12.p41==1) U (...1049
Reverse transition relation is NOT exact ! Due to transitions t75, t95, t102, t118, t157, t158, t159, t160, i0.t72, i0.i1.t74, i1.u7.t0, i1.u7.t127, i2.u8....508
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 170
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 173 transition count 167
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 165 transition count 159
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 164 transition count 158
Applied a total of 63 rules in 40 ms. Remains 164 /194 variables (removed 30) and now considering 158/191 (removed 33) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-20 22:31:44] [INFO ] Computed 16 invariants in 2 ms
[2024-05-20 22:31:44] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-20 22:31:44] [INFO ] Invariant cache hit.
[2024-05-20 22:31:45] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-20 22:31:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 3 ms to minimize.
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-20 22:31:47] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 3 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 3 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 3 ms to minimize.
[2024-05-20 22:31:48] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:31:49] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:31:49] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:31:49] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:31:50] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:31:50] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 3 ms to minimize.
[2024-05-20 22:31:50] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-20 22:31:50] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 3 ms to minimize.
[2024-05-20 22:31:50] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-20 22:31:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-20 22:31:51] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 3 ms to minimize.
[2024-05-20 22:31:51] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 3 ms to minimize.
[2024-05-20 22:31:51] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-20 22:31:51] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:31:52] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:31:52] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 2 ms to minimize.
[2024-05-20 22:31:52] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:31:53] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 158/322 variables, 164/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 214 constraints, problems are : Problem set: 0 solved, 157 unsolved in 15452 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 158/322 variables, 164/214 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 157/371 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:32:03] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:32:03] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:32:04] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-20 22:32:04] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:32:06] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:32:11] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:32:15] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:32:18] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 379 constraints, problems are : Problem set: 0 solved, 157 unsolved in 29853 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 42/42 constraints]
After SMT, in 45354ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 45363ms
Starting structural reductions in LTL mode, iteration 1 : 164/194 places, 158/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45847 ms. Remains : 164/194 places, 158/191 transitions.
[2024-05-20 22:32:30] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:32:30] [INFO ] Flatten gal took : 11 ms
[2024-05-20 22:32:30] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-20 22:32:30] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:32:30] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:32:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality16268081818212776877.gal : 2 ms
[2024-05-20 22:32:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10018738032403035704.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/CTLCardinality16268081818212776877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10018738032403035704.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.14771e+12,1.39534,35908,2,13559,5,120402,6,0,816,189550,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(((p89==0)||(p100==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(((p89==0)||(p100==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t13, t21, t32, t38, t49, t53, t55, t56, t66, t68, t69, t81, t84, t85, t89, t9...316
Detected timeout of ITS tools.
[2024-05-20 22:33:00] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:33:00] [INFO ] Applying decomposition
[2024-05-20 22:33:00] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5403377624685658493.txt' '-o' '/tmp/graph5403377624685658493.bin' '-w' '/tmp/graph5403377624685658493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5403377624685658493.bin' '-l' '-1' '-v' '-w' '/tmp/graph5403377624685658493.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:33:00] [INFO ] Decomposing Gal with order
[2024-05-20 22:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:33:00] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-20 22:33:00] [INFO ] Flatten gal took : 19 ms
[2024-05-20 22:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:33:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality16031635490416399163.gal : 5 ms
[2024-05-20 22:33:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4895771695161526961.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/CTLCardinality16031635490416399163.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4895771695161526961.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.14771e+12,0.114395,6756,799,13,6955,158,365,7541,26,284,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(((i6.u25.p89==0)||(i7.u28.p100==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(((i6.u25.p89==0)||(i7.u28.p100==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t56, t69, t89, t96, t111, t151, t152, t153, i0.t53, i0.i1.t55, i1.u6.t0, i1.u6.t120, i2.u9.t1...445
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,7.11245,202644,1,0,523797,158,1908,466839,121,284,631784
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 174 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 174 transition count 171
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 174 transition count 168
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 166 transition count 160
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 164 transition count 158
Applied a total of 63 rules in 15 ms. Remains 164 /194 variables (removed 30) and now considering 158/191 (removed 33) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-20 22:33:07] [INFO ] Computed 16 invariants in 1 ms
[2024-05-20 22:33:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-20 22:33:08] [INFO ] Invariant cache hit.
[2024-05-20 22:33:08] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-20 22:33:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:10] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-20 22:33:10] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:33:10] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-20 22:33:10] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:33:11] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-20 22:33:11] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-05-20 22:33:11] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-20 22:33:11] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 3 ms to minimize.
[2024-05-20 22:33:11] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-20 22:33:11] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 3 ms to minimize.
[2024-05-20 22:33:12] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:33:12] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:13] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 3 ms to minimize.
[2024-05-20 22:33:13] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-20 22:33:13] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:33:13] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/196 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:17] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:33:18] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:19] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:23] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/322 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (OVERLAPS) 0/322 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 200 constraints, problems are : Problem set: 0 solved, 157 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:29] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-05-20 22:33:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:33:29] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:31] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:33:31] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 158/322 variables, 164/205 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 157/362 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:34] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:33:36] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:33:36] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:38] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:33:42] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/322 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 367 constraints, problems are : Problem set: 0 solved, 157 unsolved in 23058 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 30/30 constraints]
After SMT, in 43190ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 43193ms
Starting structural reductions in LTL mode, iteration 1 : 164/194 places, 158/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43523 ms. Remains : 164/194 places, 158/191 transitions.
[2024-05-20 22:33:51] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:33:51] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:33:51] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-20 22:33:51] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:33:51] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:33:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality9124660738740486930.gal : 2 ms
[2024-05-20 22:33:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality1834533706742615651.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/CTLCardinality9124660738740486930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1834533706742615651.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,3.05119e+12,0.661821,18040,2,10047,5,57437,6,0,816,76550,0


Converting to forward existential form...Done !
original formula: (AG(A(((p77==0)||(p5==1)) U !(EX((p204==0))))) + AX(AG((((p3==0)||(p8==1)) * AF(AX(((p143==0)||(p91==1))))))))
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(!(E(TRUE U !(!((E(!(!(EX((p204==0)))) U (!(((p77==0)||(p5==1))) * !(!(EX((p204==0)))))) + E...425
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t14, t22, t33, t39, t50, t54, t56, t57, t67, t69, t72, t80, t82, t85, t89, t9...316
Detected timeout of ITS tools.
[2024-05-20 22:34:21] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:34:21] [INFO ] Applying decomposition
[2024-05-20 22:34:21] [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/graph4231818866657625172.txt' '-o' '/tmp/graph4231818866657625172.bin' '-w' '/tmp/graph4231818866657625172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4231818866657625172.bin' '-l' '-1' '-v' '-w' '/tmp/graph4231818866657625172.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:34:21] [INFO ] Decomposing Gal with order
[2024-05-20 22:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:34:21] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-20 22:34:21] [INFO ] Flatten gal took : 25 ms
[2024-05-20 22:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-20 22:34:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14357794295844798524.gal : 6 ms
[2024-05-20 22:34:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16652632150909596740.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/CTLCardinality14357794295844798524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16652632150909596740.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.05119e+12,0.078153,5960,814,24,4438,183,383,4167,35,379,0


Converting to forward existential form...Done !
original formula: (AG(A(((i6.u20.p77==0)||(i0.i0.u2.p5==1)) U !(EX((i13.i1.u69.p204==0))))) + AX(AG((((i0.i0.u1.p3==0)||(i0.i1.u3.p8==1)) * AF(AX(((i11.i1....191
=> equivalent forward existential formula: ([(FwdU(EY((Init * !(!(E(TRUE U !(!((E(!(!(EX((i13.i1.u69.p204==0)))) U (!(((i6.u20.p77==0)||(i0.i0.u2.p5==1))) ...559
Reverse transition relation is NOT exact ! Due to transitions t54, t57, t67, t89, t96, t111, t151, t152, t153, i1.u5.t0, i1.u5.t120, i2.u8.t1, i2.u8.t114, ...440
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,28.8186,782176,1,0,1.7495e+06,219,2853,2.20279e+06,188,586,2078520
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 174 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 174 transition count 171
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 174 transition count 168
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 167 transition count 161
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 167 transition count 161
Applied a total of 57 rules in 18 ms. Remains 167 /194 variables (removed 27) and now considering 161/191 (removed 30) transitions.
// Phase 1: matrix 161 rows 167 cols
[2024-05-20 22:34:50] [INFO ] Computed 16 invariants in 2 ms
[2024-05-20 22:34:50] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-20 22:34:50] [INFO ] Invariant cache hit.
[2024-05-20 22:34:51] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-20 22:34:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:34:52] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 3 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 3 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 3 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:34:53] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 5 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 4 ms to minimize.
[2024-05-20 22:34:54] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-20 22:34:56] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 3 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 7 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 3 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 3 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:34:57] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:34:58] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:34:58] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:34:58] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 2 ms to minimize.
[2024-05-20 22:34:58] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 161/328 variables, 167/210 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:01] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:35:01] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 3 ms to minimize.
[2024-05-20 22:35:02] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:35:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:35:02] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 0/328 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 215 constraints, problems are : Problem set: 0 solved, 160 unsolved in 16796 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:09] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:35:09] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:35:09] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:10] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-20 22:35:10] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:35:10] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-20 22:35:10] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:35:10] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 161/328 variables, 167/223 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 160/383 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:14] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:35:14] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:17] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-20 22:35:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:24] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/328 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:35:31] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/328 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 46/46 constraints]
After SMT, in 46872ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 46875ms
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 161/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47364 ms. Remains : 167/194 places, 161/191 transitions.
[2024-05-20 22:35:38] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:35:38] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:35:38] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-20 22:35:38] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:35:38] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:35:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality16892233790610379285.gal : 3 ms
[2024-05-20 22:35:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality17822566076796205974.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/CTLCardinality16892233790610379285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17822566076796205974.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.20214e+12,0.978841,32636,2,13327,5,108831,6,0,831,167729,0


Converting to forward existential form...Done !
original formula: EF(AX((AG(((p40==0)||(p11==1))) + EF(EX((p78==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E(TRUE U !(((p40==0)||(p11==1))))) + E(TRUE U EX((p78==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t14, t22, t33, t39, t50, t54, t56, t57, t67, t69, t70, t81, t83, t90,...326
Detected timeout of ITS tools.
[2024-05-20 22:36:08] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:36:08] [INFO ] Applying decomposition
[2024-05-20 22:36:08] [INFO ] Flatten gal took : 5 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/graph15009948175579914916.txt' '-o' '/tmp/graph15009948175579914916.bin' '-w' '/tmp/graph15009948175579914916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15009948175579914916.bin' '-l' '-1' '-v' '-w' '/tmp/graph15009948175579914916.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:36:08] [INFO ] Decomposing Gal with order
[2024-05-20 22:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:36:08] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-20 22:36:08] [INFO ] Flatten gal took : 14 ms
[2024-05-20 22:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:36:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7843390294061731588.gal : 13 ms
[2024-05-20 22:36:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality9975894708265995115.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/CTLCardinality7843390294061731588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9975894708265995115.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,3.20214e+12,0.090254,6524,807,14,5864,158,372,6835,28,308,0


Converting to forward existential form...Done !
original formula: EF(AX((AG(((i2.u12.p40==0)||(i7.i0.u4.p11==1))) + EF(EX((i5.u25.p78==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E(TRUE U !(((i2.u12.p40==0)||(i7.i0.u4.p11==1))))) + E(TRUE U EX((i5.u25.p78==1)))...170
Reverse transition relation is NOT exact ! Due to transitions t57, t70, t90, t97, t114, t154, t155, t156, i0.u6.t0, i0.u6.t123, i1.u9.t1, i1.u9.t117, i2.t1...465
(forward)formula 0,1,1.71024,71468,1,0,164572,158,2007,243416,126,308,287563
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 170
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 173 transition count 167
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 164 transition count 158
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 164 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 162 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 162 transition count 156
Applied a total of 67 rules in 12 ms. Remains 162 /194 variables (removed 32) and now considering 156/191 (removed 35) transitions.
// Phase 1: matrix 156 rows 162 cols
[2024-05-20 22:36:09] [INFO ] Computed 16 invariants in 2 ms
[2024-05-20 22:36:10] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-20 22:36:10] [INFO ] Invariant cache hit.
[2024-05-20 22:36:10] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-20 22:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 3 ms to minimize.
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-20 22:36:12] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:36:13] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2024-05-20 22:36:13] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 3 ms to minimize.
[2024-05-20 22:36:13] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-20 22:36:13] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:14] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 156/318 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:17] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
[2024-05-20 22:36:17] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:36:17] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-20 22:36:17] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 194 constraints, problems are : Problem set: 0 solved, 155 unsolved in 11491 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:23] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-20 22:36:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:36:23] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:36:23] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:36:23] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:24] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:36:24] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:25] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 156/318 variables, 162/202 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 155/357 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:27] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:36:27] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 3 ms to minimize.
[2024-05-20 22:36:27] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-20 22:36:30] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 13 (OVERLAPS) 0/318 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 361 constraints, problems are : Problem set: 0 solved, 155 unsolved in 16889 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 28/28 constraints]
After SMT, in 28401ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 28403ms
Starting structural reductions in LTL mode, iteration 1 : 162/194 places, 156/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28897 ms. Remains : 162/194 places, 156/191 transitions.
[2024-05-20 22:36:38] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:36:38] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:36:38] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-20 22:36:38] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:36:38] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:36:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality867886825922211161.gal : 2 ms
[2024-05-20 22:36:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1402564394320062725.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/CTLCardinality867886825922211161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1402564394320062725.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,2.94659e+12,0.523045,17512,2,9409,5,55495,6,0,806,71990,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((p133==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p133==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t13, t21, t32, t38, t49, t53, t55, t56, t66, t68, t69, t80, t83, t87, t90, t9...311
(forward)formula 0,1,8.87738,191004,1,0,296,785261,334,164,4471,838640,349
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 179 transition count 176
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 179 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 179 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 174 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 174 transition count 169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 173 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 173 transition count 168
Applied a total of 44 rules in 9 ms. Remains 173 /194 variables (removed 21) and now considering 168/191 (removed 23) transitions.
// Phase 1: matrix 168 rows 173 cols
[2024-05-20 22:36:47] [INFO ] Computed 16 invariants in 4 ms
[2024-05-20 22:36:48] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-20 22:36:48] [INFO ] Invariant cache hit.
[2024-05-20 22:36:48] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-20 22:36:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:36:50] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-20 22:36:50] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-20 22:36:50] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-20 22:36:50] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-20 22:36:50] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 7 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 3 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 3 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-20 22:36:51] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
[2024-05-20 22:36:52] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2024-05-20 22:36:53] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:36:54] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-20 22:36:54] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:36:54] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-20 22:36:54] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:36:54] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 3 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 3 ms to minimize.
[2024-05-20 22:36:55] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-20 22:36:56] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-20 22:36:56] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-20 22:36:56] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-20 22:36:56] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 3 ms to minimize.
[2024-05-20 22:36:56] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:36:56] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-20 22:36:57] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:36:57] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-20 22:36:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:36:59] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 168/341 variables, 173/231 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:37:03] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-20 22:37:03] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-20 22:37:03] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-20 22:37:03] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:37:03] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 3 ms to minimize.
[2024-05-20 22:37:04] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:37:07] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-20 22:37:07] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 239 constraints, problems are : Problem set: 0 solved, 167 unsolved in 24830 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:37:14] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-20 22:37:15] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 3 ms to minimize.
[2024-05-20 22:37:15] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:37:16] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:37:16] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 168/341 variables, 173/244 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 167/411 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:37:19] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:37:19] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-20 22:37:19] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-20 22:37:19] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-20 22:37:20] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-20 22:37:20] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-20 22:37:20] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-20 22:37:21] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-20 22:37:22] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 3 ms to minimize.
[2024-05-20 22:37:22] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 10/421 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-20 22:37:26] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/341 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 422 constraints, problems are : Problem set: 0 solved, 167 unsolved in 25599 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 66/66 constraints]
After SMT, in 50455ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 50457ms
Starting structural reductions in LTL mode, iteration 1 : 173/194 places, 168/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50811 ms. Remains : 173/194 places, 168/191 transitions.
[2024-05-20 22:37:38] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:37:38] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:37:38] [INFO ] Input system was already deterministic with 168 transitions.
[2024-05-20 22:37:38] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:37:38] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:37:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality17357112989226849317.gal : 2 ms
[2024-05-20 22:37:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality728709189697403077.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17357112989226849317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality728709189697403077.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.973e+12,3.21693,74808,2,27881,5,255917,6,0,862,432953,0


Converting to forward existential form...Done !
original formula: (EG((((p18==0) * AF(EX(((p58==0)&&(p107==1))))) + (p130==1))) + (AX((AG((p169==1)) + (p24==1))) * ((AF(AG((p204==0))) + AF((((p3==1)||((p...287
=> equivalent forward existential formula: ([(FwdU((EY((Init * !(EG((((p18==0) * !(EG(!(EX(((p58==0)&&(p107==1))))))) + (p130==1)))))) * !((p24==1))),TRUE)...793
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t11, t18, t26, t38, t41, t44, t55, t59, t61, t63, t73, t7...355
Detected timeout of ITS tools.
[2024-05-20 22:38:08] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:38:08] [INFO ] Applying decomposition
[2024-05-20 22:38:08] [INFO ] Flatten gal took : 5 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/graph8083430328609315316.txt' '-o' '/tmp/graph8083430328609315316.bin' '-w' '/tmp/graph8083430328609315316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8083430328609315316.bin' '-l' '-1' '-v' '-w' '/tmp/graph8083430328609315316.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:38:08] [INFO ] Decomposing Gal with order
[2024-05-20 22:38:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:38:08] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-20 22:38:08] [INFO ] Flatten gal took : 31 ms
[2024-05-20 22:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:38:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality6741226115331980112.gal : 10 ms
[2024-05-20 22:38:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality9173747004156438490.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/CTLCardinality6741226115331980112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9173747004156438490.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,4.973e+12,0.253637,11060,1148,23,15488,196,419,20779,45,399,0


Converting to forward existential form...Done !
original formula: (EG((((i1.u6.p18==0) * AF(EX(((i4.u17.p58==0)&&(i9.u31.p107==1))))) + (i3.u40.p130==1))) + (AX((AG((i14.i1.u57.p169==1)) + (i2.u10.p24==1...424
=> equivalent forward existential formula: ([(FwdU((EY((Init * !(EG((((i1.u6.p18==0) * !(EG(!(EX(((i4.u17.p58==0)&&(i9.u31.p107==1))))))) + (i3.u40.p130==1...1066
Reverse transition relation is NOT exact ! Due to transitions t76, t94, t103, t120, t160, t161, t162, t163, i0.i1.t44, i0.i2.u71.t18, i1.u6.t0, i1.u6.t1, i...541
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 176 transition count 173
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 176 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 176 transition count 170
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 171 transition count 165
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 171 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 170 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 170 transition count 164
Applied a total of 51 rules in 13 ms. Remains 170 /194 variables (removed 24) and now considering 164/191 (removed 27) transitions.
// Phase 1: matrix 164 rows 170 cols
[2024-05-20 22:38:39] [INFO ] Computed 16 invariants in 2 ms
[2024-05-20 22:38:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-20 22:38:39] [INFO ] Invariant cache hit.
[2024-05-20 22:38:39] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-20 22:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:38:41] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-20 22:38:41] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-20 22:38:41] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-20 22:38:41] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 3 ms to minimize.
[2024-05-20 22:38:41] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-05-20 22:38:42] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 2 ms to minimize.
[2024-05-20 22:38:42] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-20 22:38:42] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
[2024-05-20 22:38:42] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 3 ms to minimize.
[2024-05-20 22:38:42] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2024-05-20 22:38:42] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 3 ms to minimize.
[2024-05-20 22:38:43] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:38:44] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 22:38:44] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:38:45] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-20 22:38:45] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-20 22:38:45] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:38:45] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-20 22:38:46] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:38:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-20 22:38:46] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-20 22:38:46] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:38:47] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 2 ms to minimize.
[2024-05-20 22:38:48] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-20 22:38:48] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:38:49] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 164/334 variables, 170/218 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:38:52] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:38:53] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-20 22:38:53] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-20 22:38:53] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
[2024-05-20 22:38:53] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-20 22:38:54] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/334 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 224 constraints, problems are : Problem set: 0 solved, 163 unsolved in 20187 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/334 variables, 170/224 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 163/387 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:39:02] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-20 22:39:02] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-20 22:39:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-20 22:39:03] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-20 22:39:03] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-20 22:39:03] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 3 ms to minimize.
[2024-05-20 22:39:03] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-20 22:39:03] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-20 22:39:04] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 9/396 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-20 22:39:07] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-20 22:39:07] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-20 22:39:09] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-20 22:39:09] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:39:09] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/334 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 401 constraints, problems are : Problem set: 0 solved, 163 unsolved in 22136 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 52/52 constraints]
After SMT, in 42342ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 42344ms
Starting structural reductions in LTL mode, iteration 1 : 170/194 places, 164/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42710 ms. Remains : 170/194 places, 164/191 transitions.
[2024-05-20 22:39:21] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:39:21] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:39:21] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-20 22:39:21] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:39:21] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:39:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality8956789273433586047.gal : 23 ms
[2024-05-20 22:39:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15678285968389911904.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/CTLCardinality8956789273433586047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15678285968389911904.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.06675e+12,1.36419,40480,2,17916,5,134251,6,0,846,208048,0


Converting to forward existential form...Done !
original formula: EG(E((EF(((p101==1)&&(p63==1))) * (((p91==0) + EX(((p47==0)||(p118==1)))) + ((p160==1)&&(p118==1)))) U ((AG(((p184==0)||(p136==1))) + EX(...230
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U ((p101==1)&&(p63==1))) * (((p91==0) + EX(((p47==0)||(p118==1)))) + ((p160==1)&&(p118==1))...291
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t15, t24, t27, t35, t41, t52, t56, t58, t59, t70, t72, t75, t83, t85, t87, t9...334
Detected timeout of ITS tools.
[2024-05-20 22:39:51] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:39:51] [INFO ] Applying decomposition
[2024-05-20 22:39:51] [INFO ] Flatten gal took : 5 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/graph16226069983398101588.txt' '-o' '/tmp/graph16226069983398101588.bin' '-w' '/tmp/graph16226069983398101588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16226069983398101588.bin' '-l' '-1' '-v' '-w' '/tmp/graph16226069983398101588.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:39:51] [INFO ] Decomposing Gal with order
[2024-05-20 22:39:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:39:51] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-20 22:39:51] [INFO ] Flatten gal took : 20 ms
[2024-05-20 22:39:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-20 22:39:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1752346438294870842.gal : 19 ms
[2024-05-20 22:39:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17573634623266016924.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/CTLCardinality1752346438294870842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17573634623266016924.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.06675e+12,0.215768,10500,1276,13,13587,155,384,19650,28,288,0


Converting to forward existential form...Done !
original formula: EG(E((EF(((i7.u26.p101==1)&&(i4.u19.p63==1))) * (((i7.u26.p91==0) + EX(((i2.u11.p47==0)||(i9.u32.p118==1)))) + ((i14.u52.p160==1)&&(i9.u3...349
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U ((i7.u26.p101==1)&&(i4.u19.p63==1))) * (((i7.u26.p91==0) + EX(((i2.u11.p47==0)||(i9.u32.p...410
Reverse transition relation is NOT exact ! Due to transitions t56, t59, t70, t102, t117, t157, t158, t159, i0.u6.t0, i0.u6.t126, i1.u8.t1, i1.u8.t120, i2.t...487
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 175 transition count 172
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 175 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 175 transition count 170
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 169 transition count 164
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 169 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 167 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 167 transition count 162
Applied a total of 56 rules in 16 ms. Remains 167 /194 variables (removed 27) and now considering 162/191 (removed 29) transitions.
// Phase 1: matrix 162 rows 167 cols
[2024-05-20 22:40:22] [INFO ] Computed 16 invariants in 3 ms
[2024-05-20 22:40:22] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-20 22:40:22] [INFO ] Invariant cache hit.
[2024-05-20 22:40:22] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-20 22:40:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-05-20 22:40:24] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2024-05-20 22:40:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:40:25] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-05-20 22:40:25] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:40:25] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-20 22:40:25] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:40:25] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-20 22:40:26] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:27] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:40:27] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:40:27] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 3 ms to minimize.
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 3 ms to minimize.
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:40:28] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:40:29] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:29] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-20 22:40:29] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-20 22:40:30] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-20 22:40:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:31] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:40:31] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:40:31] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:32] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 162/329 variables, 167/215 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/329 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 215 constraints, problems are : Problem set: 0 solved, 161 unsolved in 16000 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/329 variables, 167/215 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 161/376 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:42] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-20 22:40:42] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-05-20 22:40:43] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:40:43] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:40:45] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-20 22:40:46] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:40:46] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2024-05-20 22:40:47] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 384 constraints, problems are : Problem set: 0 solved, 161 unsolved in 21415 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 40/40 constraints]
After SMT, in 37455ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 37458ms
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 162/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37903 ms. Remains : 167/194 places, 162/191 transitions.
[2024-05-20 22:40:59] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:40:59] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:40:59] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-20 22:40:59] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:40:59] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:40:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality182206114614248331.gal : 7 ms
[2024-05-20 22:40:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3002126745960953729.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/CTLCardinality182206114614248331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3002126745960953729.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,4.35901e+12,0.918278,29188,2,12619,5,98713,6,0,832,146168,0


Converting to forward existential form...Done !
original formula: E(((p105==0)||(p170==1)) U (EG(((E(((p134==0)||(p180==1)) U ((p66==0)||(p98==1))) * E((p10==1) U ((p115==0)||(p105==1)))) + AX(EX((p36==1...289
=> equivalent forward existential formula: ([FwdG(FwdU(Init,((p105==0)||(p170==1))),((E(((p134==0)||(p180==1)) U ((p66==0)||(p98==1))) * E((p10==1) U ((p11...645
Hit Full ! (commute/partial/dont) 158/0/4
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t14, t22, t33, t39, t50, t54, t56, t57, t68, t70, t71, t85, t87, t91,...320
Detected timeout of ITS tools.
[2024-05-20 22:41:30] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:41:30] [INFO ] Applying decomposition
[2024-05-20 22:41:30] [INFO ] Flatten gal took : 3 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/graph6646389387706356681.txt' '-o' '/tmp/graph6646389387706356681.bin' '-w' '/tmp/graph6646389387706356681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6646389387706356681.bin' '-l' '-1' '-v' '-w' '/tmp/graph6646389387706356681.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:41:30] [INFO ] Decomposing Gal with order
[2024-05-20 22:41:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:41:30] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-20 22:41:30] [INFO ] Flatten gal took : 27 ms
[2024-05-20 22:41:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:41:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7717669286742727082.gal : 5 ms
[2024-05-20 22:41:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality18026510191039613088.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/CTLCardinality7717669286742727082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18026510191039613088.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.35901e+12,0.164464,6512,737,18,5750,187,396,6312,41,358,0


Converting to forward existential form...Done !
original formula: E(((i7.u28.p105==0)||(i0.u55.p170==1)) U (EG(((E(((i10.u40.p134==0)||(i15.i0.u59.p180==1)) U ((i4.u18.p66==0)||(i6.u27.p98==1))) * E((i12...449
=> equivalent forward existential formula: ([FwdG(FwdU(Init,((i7.u28.p105==0)||(i0.u55.p170==1))),((E(((i10.u40.p134==0)||(i15.i0.u59.p180==1)) U ((i4.u18....949
Reverse transition relation is NOT exact ! Due to transitions t54, t57, t68, t71, t91, t98, t113, t155, t156, t157, i0.u6.t0, i0.u6.t122, i1.u8.t1, i1.u8.t...444
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,9.54792,282716,1,0,718080,240,2769,660941,217,588,951122
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 193 transition count 133
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 136 transition count 122
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 135 place count 132 transition count 116
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 142 place count 126 transition count 115
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 142 place count 126 transition count 91
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 190 place count 102 transition count 91
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 202 place count 90 transition count 79
Iterating global reduction 4 with 12 rules applied. Total rules applied 214 place count 90 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 214 place count 90 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 224 place count 85 transition count 74
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 266 place count 64 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 267 place count 63 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 268 place count 62 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 268 place count 62 transition count 51
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 270 place count 61 transition count 51
Applied a total of 270 rules in 46 ms. Remains 61 /194 variables (removed 133) and now considering 51/191 (removed 140) transitions.
// Phase 1: matrix 51 rows 61 cols
[2024-05-20 22:41:39] [INFO ] Computed 15 invariants in 0 ms
[2024-05-20 22:41:39] [INFO ] Implicit Places using invariants in 114 ms returned [47, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/194 places, 51/191 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 48
Applied a total of 6 rules in 4 ms. Remains 56 /59 variables (removed 3) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-20 22:41:39] [INFO ] Computed 13 invariants in 1 ms
[2024-05-20 22:41:39] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-20 22:41:39] [INFO ] Invariant cache hit.
[2024-05-20 22:41:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-20 22:41:40] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/194 places, 48/191 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 331 ms. Remains : 56/194 places, 48/191 transitions.
[2024-05-20 22:41:40] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:41:40] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:41:40] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-20 22:41:40] [INFO ] Flatten gal took : 1 ms
[2024-05-20 22:41:40] [INFO ] Flatten gal took : 2 ms
[2024-05-20 22:41:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality8361545989652522030.gal : 1 ms
[2024-05-20 22:41:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12618771609357127795.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/CTLCardinality8361545989652522030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12618771609357127795.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,408925,0.028279,4272,2,834,5,4011,6,0,267,3370,0


Converting to forward existential form...Done !
original formula: EF(((A(!(((p162==0)||(p155==1))) U (p151==1)) * (p65==1)) * ((AF(((p148==0)&&((p194==0)||(p20==1)))) + (p153==0)) + (((p56==0)&&(p136==0)...171
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!((E(!((p151==1)) U (!(!(((p162==0)||(p155==1)))) * !((p151==1)))) + EG(!((p151==1))))) ...548
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t17, t39, t46, t47, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,2.68853,85256,1,0,591,509132,129,279,1547,496845,661
FORMULA AutoFlight-PT-02b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 176 transition count 173
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 176 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 176 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 169 transition count 163
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 169 transition count 163
Applied a total of 53 rules in 9 ms. Remains 169 /194 variables (removed 25) and now considering 163/191 (removed 28) transitions.
// Phase 1: matrix 163 rows 169 cols
[2024-05-20 22:41:42] [INFO ] Computed 16 invariants in 2 ms
[2024-05-20 22:41:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 22:41:42] [INFO ] Invariant cache hit.
[2024-05-20 22:41:43] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-20 22:41:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 4 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 3 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 3 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:41:45] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 3 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-05-20 22:41:46] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
[2024-05-20 22:41:47] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-05-20 22:41:47] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:41:47] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:41:48] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-05-20 22:41:48] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-20 22:41:48] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/332 variables, 169/208 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:41:54] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/332 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:41:55] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:41:55] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:41:58] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:42:02] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/332 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:42:07] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/332 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 16 (OVERLAPS) 0/332 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 214 constraints, problems are : Problem set: 0 solved, 162 unsolved in 29445 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:42:13] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:42:14] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-20 22:42:14] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/332 variables, 169/217 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 162/379 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:42:16] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-20 22:42:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 3 ms to minimize.
[2024-05-20 22:42:16] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-20 22:42:17] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 3 ms to minimize.
[2024-05-20 22:42:17] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 5/384 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-20 22:42:20] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:42:20] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:42:20] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 2 ms to minimize.
[2024-05-20 22:42:20] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:42:21] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 5/389 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (OVERLAPS) 0/332 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 389 constraints, problems are : Problem set: 0 solved, 162 unsolved in 20657 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 42/42 constraints]
After SMT, in 50133ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 50135ms
Starting structural reductions in LTL mode, iteration 1 : 169/194 places, 163/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50408 ms. Remains : 169/194 places, 163/191 transitions.
[2024-05-20 22:42:33] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:42:33] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:42:33] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-20 22:42:33] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:42:33] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:42:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality17573347720987610478.gal : 2 ms
[2024-05-20 22:42:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality13027235620124566264.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/CTLCardinality17573347720987610478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13027235620124566264.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,4.2258e+12,2.4601,61372,2,19913,5,207791,6,0,841,361516,0


Converting to forward existential form...Done !
original formula: (AG((p163!=1)) * AF((((((A(((p65==0)||(p160==1)) U (p92==1)) + (p191==0)) + (p88==1)) * (((p137==1)||((p133==0)&&(p189==1)))||((p112==0)&...243
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p163!=1)))] = FALSE * [FwdG(Init,!((((((!((E(!((p92==1)) U (!(((p65==0)||(p160==1))) * !...453
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t14, t22, t33, t39, t50, t54, t56, t57, t67, t69, t70, t85, t88, t89,...343
Detected timeout of ITS tools.
[2024-05-20 22:43:03] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:43:03] [INFO ] Applying decomposition
[2024-05-20 22:43:03] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2020834830209150685.txt' '-o' '/tmp/graph2020834830209150685.bin' '-w' '/tmp/graph2020834830209150685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2020834830209150685.bin' '-l' '-1' '-v' '-w' '/tmp/graph2020834830209150685.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:43:03] [INFO ] Decomposing Gal with order
[2024-05-20 22:43:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:43:03] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-20 22:43:03] [INFO ] Flatten gal took : 12 ms
[2024-05-20 22:43:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:43:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality5141264121354522554.gal : 3 ms
[2024-05-20 22:43:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1184044783660370119.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/CTLCardinality5141264121354522554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1184044783660370119.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,4.2258e+12,0.160843,8376,1050,23,10295,250,401,12435,38,673,0


Converting to forward existential form...Done !
original formula: (AG((i5.u55.p163!=1)) * AF((((((A(((i5.u19.p65==0)||(i14.u53.p160==1)) U (i7.u28.p92==1)) + (i10.u65.p191==0)) + (i6.u21.p88==1)) * (((i1...366
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((i5.u55.p163!=1)))] = FALSE * [FwdG(Init,!((((((!((E(!((i7.u28.p92==1)) U (!(((i5.u19.p65...628
Reverse transition relation is NOT exact ! Due to transitions t54, t57, t67, t70, t93, t100, t116, t155, t156, t157, t158, i1.u5.t0, i1.u5.t125, i2.u8.t1, ...492
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 174 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 174 transition count 171
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 174 transition count 168
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 165 transition count 159
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 165 transition count 159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 163 transition count 157
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 163 transition count 157
Applied a total of 65 rules in 9 ms. Remains 163 /194 variables (removed 31) and now considering 157/191 (removed 34) transitions.
// Phase 1: matrix 157 rows 163 cols
[2024-05-20 22:43:33] [INFO ] Computed 16 invariants in 1 ms
[2024-05-20 22:43:33] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-20 22:43:33] [INFO ] Invariant cache hit.
[2024-05-20 22:43:33] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-20 22:43:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:36] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
[2024-05-20 22:43:36] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 3 ms to minimize.
[2024-05-20 22:43:36] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-20 22:43:36] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-20 22:43:36] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:43:36] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-20 22:43:37] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:43:37] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-20 22:43:37] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-05-20 22:43:37] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:43:39] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/320 variables, 163/196 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 196 constraints, problems are : Problem set: 0 solved, 156 unsolved in 11982 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:47] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:43:47] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:43:47] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:48] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 3 ms to minimize.
[2024-05-20 22:43:48] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/320 variables, 163/201 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 156/357 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:50] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-20 22:43:50] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:43:51] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:43:51] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:43:51] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:43:51] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 3 ms to minimize.
[2024-05-20 22:43:51] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:43:51] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:53] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:43:53] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-20 22:43:55] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (OVERLAPS) 0/320 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 368 constraints, problems are : Problem set: 0 solved, 156 unsolved in 18021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 33/33 constraints]
After SMT, in 30050ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 30053ms
Starting structural reductions in LTL mode, iteration 1 : 163/194 places, 157/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30420 ms. Remains : 163/194 places, 157/191 transitions.
[2024-05-20 22:44:03] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:44:03] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:44:03] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-20 22:44:03] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:44:03] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:44:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality6800765516917467065.gal : 2 ms
[2024-05-20 22:44:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality16145339446020170334.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/CTLCardinality6800765516917467065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16145339446020170334.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09474e+12,0.764321,23316,2,12635,5,76515,6,0,811,107458,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(((p12==0)&&(p156==1)))) + AX(FALSE)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(EG(((p12==0)&&(p156==1)))))))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != F...160
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t14, t22, t33, t39, t50, t54, t56, t57, t67, t69, t70, t81, t84, t88, t91...321
Detected timeout of ITS tools.
[2024-05-20 22:44:33] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:44:33] [INFO ] Applying decomposition
[2024-05-20 22:44:34] [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/graph2177716574321402232.txt' '-o' '/tmp/graph2177716574321402232.bin' '-w' '/tmp/graph2177716574321402232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2177716574321402232.bin' '-l' '-1' '-v' '-w' '/tmp/graph2177716574321402232.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:44:34] [INFO ] Decomposing Gal with order
[2024-05-20 22:44:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:44:34] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-20 22:44:34] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:44:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:44:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality6258750801263992458.gal : 5 ms
[2024-05-20 22:44:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality13979044957867753280.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/CTLCardinality6258750801263992458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13979044957867753280.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09474e+12,0.088862,6220,737,24,5179,183,389,5970,36,440,0


Converting to forward existential form...Done !
original formula: EF((AF(EG(((i0.u5.p12==0)&&(i2.u46.p156==1)))) + AX(FALSE)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(EG(((i0.u5.p12==0)&&(i2.u46.p156==1)))))))] != FALSE + [(FwdU(Init,TRUE) * !(EX(!(FA...173
Reverse transition relation is NOT exact ! Due to transitions t54, t57, t67, t70, t95, t110, t150, t151, t152, i0.u5.t0, i0.u5.t1, i0.u5.t117, i0.u5.t119, ...463
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,25.9336,643024,1,0,1.47472e+06,195,2358,1.42671e+06,172,559,1458495
FORMULA AutoFlight-PT-02b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 175 transition count 172
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 175 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 175 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 169 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 169 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 168 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 168 transition count 162
Applied a total of 55 rules in 13 ms. Remains 168 /194 variables (removed 26) and now considering 162/191 (removed 29) transitions.
// Phase 1: matrix 162 rows 168 cols
[2024-05-20 22:45:00] [INFO ] Computed 16 invariants in 2 ms
[2024-05-20 22:45:00] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-20 22:45:00] [INFO ] Invariant cache hit.
[2024-05-20 22:45:00] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-20 22:45:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:02] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 4 ms to minimize.
[2024-05-20 22:45:02] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:45:02] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 3 ms to minimize.
[2024-05-20 22:45:02] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-20 22:45:02] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 3 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:45:03] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-20 22:45:04] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:45:04] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 2 ms to minimize.
[2024-05-20 22:45:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-20 22:45:04] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:45:06] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-20 22:45:07] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:45:07] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:07] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:45:07] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-20 22:45:07] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:45:07] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-05-20 22:45:08] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-05-20 22:45:08] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-20 22:45:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-20 22:45:08] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:09] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:10] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-20 22:45:10] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:45:10] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:45:10] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 3 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-20 22:45:11] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:45:12] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:45:12] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-20 22:45:12] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-20 22:45:12] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 162/330 variables, 168/240 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:15] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:19] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/330 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 14 (OVERLAPS) 0/330 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 242 constraints, problems are : Problem set: 0 solved, 161 unsolved in 23910 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 58/74 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/330 variables, 168/242 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 161/403 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:27] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 2 ms to minimize.
[2024-05-20 22:45:27] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 3 ms to minimize.
[2024-05-20 22:45:27] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-20 22:45:27] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 3 ms to minimize.
[2024-05-20 22:45:28] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-20 22:45:28] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-20 22:45:28] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 7/410 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:30] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-20 22:45:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-20 22:45:31] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:45:31] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-20 22:45:42] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/330 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 416 constraints, problems are : Problem set: 0 solved, 161 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 71/71 constraints]
After SMT, in 53955ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 53958ms
Starting structural reductions in LTL mode, iteration 1 : 168/194 places, 162/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54341 ms. Remains : 168/194 places, 162/191 transitions.
[2024-05-20 22:45:54] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:45:54] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:45:54] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-20 22:45:54] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:45:54] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:45:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality10258816014952661374.gal : 1 ms
[2024-05-20 22:45:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14254742365591029547.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/CTLCardinality10258816014952661374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14254742365591029547.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51203e+12,2.11619,53584,2,20657,5,182705,6,0,836,306024,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(EG(((p34==0)&&(p157==1)))) + (AF(((p141==0)&&((p119==0)||(p72==1)))) * EX((p84==0))))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(EG(((p34==0)&&(p157==1)))))) + (!(EG(!(((p141==0)&&((p119==0)||(p72==1)))))) * EX((p84==0)...170
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t15, t23, t34, t40, t51, t55, t57, t60, t68, t69, t71, t72, t85, t87, t93, t9...334
Detected timeout of ITS tools.
[2024-05-20 22:46:24] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:46:24] [INFO ] Applying decomposition
[2024-05-20 22:46:24] [INFO ] Flatten gal took : 3 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/graph2571039873301315405.txt' '-o' '/tmp/graph2571039873301315405.bin' '-w' '/tmp/graph2571039873301315405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2571039873301315405.bin' '-l' '-1' '-v' '-w' '/tmp/graph2571039873301315405.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:46:24] [INFO ] Decomposing Gal with order
[2024-05-20 22:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:46:24] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-20 22:46:24] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-20 22:46:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality3257986553239753512.gal : 2 ms
[2024-05-20 22:46:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9204042644166363427.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/CTLCardinality3257986553239753512.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9204042644166363427.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,3.51203e+12,0.11491,7044,828,15,7426,165,388,8832,30,365,0


Converting to forward existential form...Done !
original formula: EG(EX((AX(EG(((i1.u11.p34==0)&&(i13.u51.p157==1)))) + (AF(((i2.u43.p141==0)&&((i8.u31.p119==0)||(i4.u17.p72==1)))) * EX((i5.u22.p84==0)))...158
=> equivalent forward existential formula: [FwdG(Init,EX((!(EX(!(EG(((i1.u11.p34==0)&&(i13.u51.p157==1)))))) + (!(EG(!(((i2.u43.p141==0)&&((i8.u31.p119==0)...213
Reverse transition relation is NOT exact ! Due to transitions t55, t69, t72, t99, t115, t154, t155, t156, t157, i0.u5.t0, i0.u5.t124, i1.t111, i1.u11.t107,...476
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,25.862,607360,1,0,1.43438e+06,165,2355,1.32137e+06,140,365,1455109
FORMULA AutoFlight-PT-02b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 173 transition count 170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 173 transition count 170
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 173 transition count 167
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 165 transition count 159
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 165 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 164 transition count 158
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 164 transition count 158
Applied a total of 63 rules in 16 ms. Remains 164 /194 variables (removed 30) and now considering 158/191 (removed 33) transitions.
// Phase 1: matrix 158 rows 164 cols
[2024-05-20 22:46:50] [INFO ] Computed 16 invariants in 1 ms
[2024-05-20 22:46:50] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-20 22:46:50] [INFO ] Invariant cache hit.
[2024-05-20 22:46:50] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-20 22:46:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:46:53] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-20 22:46:53] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
[2024-05-20 22:46:53] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-05-20 22:46:53] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
[2024-05-20 22:46:53] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-20 22:46:53] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 4 ms to minimize.
[2024-05-20 22:46:54] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:46:55] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-20 22:46:55] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 3 ms to minimize.
[2024-05-20 22:46:55] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:46:55] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:46:55] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 4 ms to minimize.
[2024-05-20 22:46:56] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:46:57] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
[2024-05-20 22:46:57] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-20 22:46:58] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-20 22:46:58] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/322 variables, 164/203 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:47:02] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:47:03] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-20 22:47:03] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-20 22:47:03] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 207 constraints, problems are : Problem set: 0 solved, 157 unsolved in 18344 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 158/322 variables, 164/207 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 157/364 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:47:12] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-20 22:47:12] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-20 22:47:12] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-20 22:47:13] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:47:15] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-20 22:47:16] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-20 22:47:16] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-20 22:47:16] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-20 22:47:16] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2024-05-20 22:47:16] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-20 22:47:19] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-20 22:47:20] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:47:20] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 377 constraints, problems are : Problem set: 0 solved, 157 unsolved in 24609 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 40/40 constraints]
After SMT, in 42976ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 42979ms
Starting structural reductions in LTL mode, iteration 1 : 164/194 places, 158/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43361 ms. Remains : 164/194 places, 158/191 transitions.
[2024-05-20 22:47:33] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:47:33] [INFO ] Flatten gal took : 17 ms
[2024-05-20 22:47:33] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-20 22:47:33] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:47:33] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:47:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality14898514609581898757.gal : 1 ms
[2024-05-20 22:47:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality15470417872817842330.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/CTLCardinality14898514609581898757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15470417872817842330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.05993e+12,1.03015,27004,2,11699,5,89810,6,0,816,132322,0


Converting to forward existential form...Done !
original formula: (A((p103==1) U ((p66==0)||(p147==1))) * ((EX(EF(EX((p203==1)))) + EG((AG((p146==0)) + (p79==0)))) + AX(FALSE)))
=> equivalent forward existential formula: (([(FwdU(Init,!(((p66==0)||(p147==1)))) * (!((p103==1)) * !(((p66==0)||(p147==1)))))] = FALSE * [FwdG(Init,!(((p...302
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t13, t21, t32, t38, t49, t53, t55, t56, t66, t68, t69, t80, t82, t85, t89, t9...316
Detected timeout of ITS tools.
[2024-05-20 22:48:03] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:48:03] [INFO ] Applying decomposition
[2024-05-20 22:48:04] [INFO ] Flatten gal took : 3 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/graph5826466578081453064.txt' '-o' '/tmp/graph5826466578081453064.bin' '-w' '/tmp/graph5826466578081453064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5826466578081453064.bin' '-l' '-1' '-v' '-w' '/tmp/graph5826466578081453064.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:48:04] [INFO ] Decomposing Gal with order
[2024-05-20 22:48:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:48:04] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-20 22:48:04] [INFO ] Flatten gal took : 15 ms
[2024-05-20 22:48:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:48:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality11817130468413941590.gal : 6 ms
[2024-05-20 22:48:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality8046733081762254312.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/CTLCardinality11817130468413941590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8046733081762254312.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.05993e+12,0.121304,6764,797,13,6358,162,382,7010,28,321,0


Converting to forward existential form...Done !
original formula: (A((i6.i1.u29.p103==1) U ((i4.u18.p66==0)||(i10.i0.u47.p147==1))) * ((EX(EF(EX((i13.i2.u70.p203==1)))) + EG((AG((i10.i1.u46.p146==0)) + (...186
=> equivalent forward existential formula: (([(FwdU(Init,!(((i4.u18.p66==0)||(i10.i0.u47.p147==1)))) * (!((i6.i1.u29.p103==1)) * !(((i4.u18.p66==0)||(i10.i...395
Reverse transition relation is NOT exact ! Due to transitions t56, t69, t89, t96, t111, t151, t152, t153, i0.u5.t0, i0.u5.t120, i1.u8.t1, i1.u8.t114, i2.t1...449
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,15.0517,403848,1,0,927978,162,2340,981249,139,321,984926
FORMULA AutoFlight-PT-02b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 191/191 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 175 transition count 172
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 175 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 175 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 168 transition count 162
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 168 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 167 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 167 transition count 161
Applied a total of 57 rules in 15 ms. Remains 167 /194 variables (removed 27) and now considering 161/191 (removed 30) transitions.
// Phase 1: matrix 161 rows 167 cols
[2024-05-20 22:48:19] [INFO ] Computed 16 invariants in 7 ms
[2024-05-20 22:48:19] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-20 22:48:19] [INFO ] Invariant cache hit.
[2024-05-20 22:48:19] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-20 22:48:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:21] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
[2024-05-20 22:48:21] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 3 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-05-20 22:48:22] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 3 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 3 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-20 22:48:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-05-20 22:48:24] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:25] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:26] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 3 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 3 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-20 22:48:27] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:29] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:30] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:48:30] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 3 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-20 22:48:31] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:32] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 161/328 variables, 167/216 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:35] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-20 22:48:39] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 3 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/328 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 219 constraints, problems are : Problem set: 0 solved, 160 unsolved in 26181 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 161/328 variables, 167/219 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 160/379 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 379 constraints, problems are : Problem set: 0 solved, 160 unsolved in 11179 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 36/36 constraints]
After SMT, in 37388ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 37390ms
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 161/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37674 ms. Remains : 167/194 places, 161/191 transitions.
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:48:56] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:48:56] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:48:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality14917278796966427393.gal : 2 ms
[2024-05-20 22:48:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality47562259699586770.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/CTLCardinality14917278796966427393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality47562259699586770.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,3.70779e+12,1.98831,46520,2,18327,5,159581,6,0,831,254523,0


Converting to forward existential form...Done !
original formula: AG(E((EG(AF((p163==1))) + AX((((p185==0)||(p79==1))&&((p201==0)||(p177==1))))) U ((E(((p93==0)||(p158==1)) U E(((p30==0)||(p104==1)) U ((...274
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EG(!(EG(!((p163==1))))) + !(EX(!((((p185==0)||(p79==1))&&((p201==0)||(p177==1))))))) U ...346
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t14, t23, t26, t34, t40, t51, t55, t57, t58, t68, t70, t71, t83, t85, t88...332
Detected timeout of ITS tools.
[2024-05-20 22:49:26] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:49:26] [INFO ] Applying decomposition
[2024-05-20 22:49:26] [INFO ] Flatten gal took : 3 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/graph17341953292085756452.txt' '-o' '/tmp/graph17341953292085756452.bin' '-w' '/tmp/graph17341953292085756452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17341953292085756452.bin' '-l' '-1' '-v' '-w' '/tmp/graph17341953292085756452.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:49:26] [INFO ] Decomposing Gal with order
[2024-05-20 22:49:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:49:26] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-20 22:49:26] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 22:49:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality18150083326643277145.gal : 7 ms
[2024-05-20 22:49:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18367621314797320619.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/CTLCardinality18150083326643277145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18367621314797320619.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.70779e+12,0.163349,8896,992,21,10694,178,378,13751,36,398,0


Converting to forward existential form...Done !
original formula: AG(E((EG(AF((i1.u56.p163==1))) + AX((((i16.i1.u64.p185==0)||(i6.u24.p79==1))&&((i16.i1.u64.p201==0)||(i15.u60.p177==1))))) U ((E(((i7.u28...423
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EG(!(EG(!((i1.u56.p163==1))))) + !(EX(!((((i16.i1.u64.p185==0)||(i6.u24.p79==1))&&((i16...495
Reverse transition relation is NOT exact ! Due to transitions t55, t58, t68, t71, t92, t99, t114, t154, t155, t156, i0.t70, i1.u20.t5, i1.u20.t95, i2.u5.t0...476
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,21.8389,583596,1,0,1.25296e+06,178,2670,1.48693e+06,181,434,1442172
FORMULA AutoFlight-PT-02b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-20 22:49:48] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:49:48] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:49:48] [INFO ] Applying decomposition
[2024-05-20 22:49:48] [INFO ] Flatten gal took : 5 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/graph1831660815176597004.txt' '-o' '/tmp/graph1831660815176597004.bin' '-w' '/tmp/graph1831660815176597004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1831660815176597004.bin' '-l' '-1' '-v' '-w' '/tmp/graph1831660815176597004.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:49:48] [INFO ] Decomposing Gal with order
[2024-05-20 22:49:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:49:48] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-20 22:49:48] [INFO ] Flatten gal took : 12 ms
[2024-05-20 22:49:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-20 22:49:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12760615018143189005.gal : 3 ms
[2024-05-20 22:49:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1672724995623827376.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12760615018143189005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1672724995623827376.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23823e+13,0.571202,17084,2450,28,28066,280,472,40218,46,700,0


Converting to forward existential form...Done !
original formula: EX(((EG(((EG(((i5.i1.u20.p68==0)||(i12.i2.u76.p202==1))) + (i7.i1.u29.p93==1)) + (E((i3.u13.p41==1) U ((i1.i2.u1.p3==0)||(i4.u17.p57==1))...409
=> equivalent forward existential formula: (([(EY((EY(Init) * (EG(((EG(((i5.i1.u20.p68==0)||(i12.i2.u76.p202==1))) + (i7.i1.u29.p93==1)) + (E((i3.u13.p41==...1067
Reverse transition relation is NOT exact ! Due to transitions t68, t122, t183, t184, t185, t186, i0.t1, i0.u4.t0, i0.u4.t149, i1.t84, i1.i1.t86, i2.t148, i...666
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
ITS-tools command line returned an error code 139
[2024-05-20 22:53:47] [INFO ] Applying decomposition
[2024-05-20 22:53:47] [INFO ] Flatten gal took : 10 ms
[2024-05-20 22:53:47] [INFO ] Decomposing Gal with order
[2024-05-20 22:53:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:53:47] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-20 22:53:47] [INFO ] Flatten gal took : 14 ms
[2024-05-20 22:53:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 20 ms.
[2024-05-20 22:53:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality7783759023827322451.gal : 4 ms
[2024-05-20 22:53:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality639544499578763388.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7783759023827322451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality639544499578763388.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23823e+13,11.1444,323964,11667,585,384212,1391,404,3.19891e+06,202,7888,0


Converting to forward existential form...Done !
original formula: EX(((EG(((EG(((i0.i0.i0.i0.i0.i0.u14.p68==0)||(i1.u28.p202==1))) + (i0.i0.i0.i0.u16.p93==1)) + (E((i0.i0.i0.i0.i0.i0.i0.i0.u12.p41==1) U ...551
=> equivalent forward existential formula: (([(EY((EY(Init) * (EG(((EG(((i0.i0.i0.i0.i0.i0.u14.p68==0)||(i1.u28.p202==1))) + (i0.i0.i0.i0.u16.p93==1)) + (E...1389
Reverse transition relation is NOT exact ! Due to transitions i0.t68, i0.u19.t70, i0.i0.u18.t73, i0.i0.u18.t83, i0.i0.i0.t84, i0.i0.i0.u17.t86, i0.i0.i0.i0...1273
ITS-tools command line returned an error code 137
[2024-05-20 23:07:52] [INFO ] Flatten gal took : 25 ms
[2024-05-20 23:07:52] [INFO ] Input system was already deterministic with 191 transitions.
[2024-05-20 23:07:52] [INFO ] Transformed 194 places.
[2024-05-20 23:07:52] [INFO ] Transformed 191 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-20 23:07:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15671640083695443734.gal : 3 ms
[2024-05-20 23:07:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17268164742223022740.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/CTLCardinality15671640083695443734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17268164742223022740.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23823e+13,9.642,202336,2,108773,5,708464,6,0,969,1.15617e+06,0


Converting to forward existential form...Done !
original formula: EX(((EG(((EG(((p68==0)||(p202==1))) + (p93==1)) + (E((p41==1) U ((p3==0)||(p57==1))) * AX(((p109==0)||(p161==1)))))) * AG(((p41==0)||((p1...264
=> equivalent forward existential formula: (([(EY((EY(Init) * (EG(((EG(((p68==0)||(p202==1))) + (p93==1)) + (E((p41==1) U ((p3==0)||(p57==1))) * !(EX(!(((p...732
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t25, t34, t37, t46, t49...402
ITS-tools command line returned an error code 137
Total runtime 3426259 ms.

BK_STOP 1716247565185

--------------------
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="AutoFlight-PT-02b"
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 AutoFlight-PT-02b, 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 r026-smll-171620166900081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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